{"entities":{"Q6942820":{"pageid":21160527,"ns":120,"title":"Item:Q6942820","lastrevid":75937251,"modified":"2026-04-21T14:49:10Z","type":"item","id":"Q6942820","labels":{"en":{"language":"en","value":"Local computation algorithms for maximum matching: new lower bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8080159"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942820$2288BBC8-E02A-477F-9955-D3C40F84E974","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"85fa6773f021d87a1d01180b6537bf8b5ae10d9e","datavalue":{"value":{"text":"Local computation algorithms for maximum matching: new lower bounds","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6942820$1D49368C-0911-42FA-A148-6B10DD4AA097","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"02900af3d23e4eb061ce47513be788bcc3884739","datavalue":{"value":"10.1109/FOCS57990.2023.00143","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942820$8BB84095-AF8E-4EC6-BA52-995A4D880BCB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f2a2518a30dab95bb7298e1e50f487fec12e67ec","datavalue":{"value":{"entity-type":"item","numeric-id":1698393,"id":"Q1698393"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942820$213EC1F4-3152-4432-9A28-9BF1A2EE94D1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"33cbba19871240d9f55847af100f27752746c98a","datavalue":{"value":{"entity-type":"item","numeric-id":6103988,"id":"Q6103988"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942820$D495DE7A-B5E6-4CA2-992C-9EB908118AA2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"dda50f9fa48e44de4ea368b00c2f861070ab2ba0","datavalue":{"value":{"entity-type":"item","numeric-id":2292632,"id":"Q2292632"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942820$6ADA86A7-D97B-41E7-A13D-A78EE8DCF0A8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c353c511b4dc13ecee102b336a2664d881fe8b6f","datavalue":{"value":{"time":"+2025-08-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6942820$2BD4C11B-EEE1-4AE9-B1FF-7558BD85F9C4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942820$DA544697-BE8D-417E-ACC9-951C61FACFFD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"00e4d386b4eb04240d5df24bee220d5ece7a4663","datavalue":{"value":"8080159","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942820$0AA37162-16DC-4A44-85B5-4743150319DA","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942820$3AEF9D4F-DB88-49BB-922E-2B9C178EA13E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Local computation algorithms for maximum matching: new lower bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Local_computation_algorithms_for_maximum_matching:_new_lower_bounds"}}}}}