{"entities":{"Q6944189":{"pageid":21168720,"ns":120,"title":"Item:Q6944189","lastrevid":75949608,"modified":"2026-04-21T16:00:16Z","type":"item","id":"Q6944189","labels":{"en":{"language":"en","value":"Distributed local approximation algorithms for maximum matching in graphs and hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078802"}},"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":"Q6944189$32973D41-B50F-41E7-B40E-CE019DCFF869","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cbe873c86a7c7e1b1130eaf7f98e3313d381f832","datavalue":{"value":{"text":"Distributed local approximation algorithms for maximum matching in graphs and hypergraphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944189$FF60A244-1CF3-4A76-9682-540BF0C7617E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"002b975e97dddcf2f19f47e843047df1292323e6","datavalue":{"value":"10.1109/FOCS.2019.00048","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944189$BAAEE350-C5E0-44E3-8ACB-BF8FF5CEF940","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"713605a893dcd5b7b7a364752ee074a0e9521f35","datavalue":{"value":{"entity-type":"item","numeric-id":666680,"id":"Q666680"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944189$407F84E0-9BBE-4A86-968B-4A759E00C855","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6944189$F6F26813-04F9-4D47-B2C3-B37207B0BDFA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944189$77AB04BD-97FE-4D14-8750-3508A59E9325","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1481d5da4e4627b3a69e97af0298035232728e41","datavalue":{"value":"8078802","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944189$B52DC607-25D5-4D76-842D-D958DAC0B1D4","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":"Q6944189$C10CE96B-1A2F-4097-A016-8ADE41EEA138","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Distributed local approximation algorithms for maximum matching in graphs and hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Distributed_local_approximation_algorithms_for_maximum_matching_in_graphs_and_hypergraphs"}}}}}