{"entities":{"Q6942974":{"pageid":21161451,"ns":120,"title":"Item:Q6942974","lastrevid":75938637,"modified":"2026-04-21T14:57:55Z","type":"item","id":"Q6942974","labels":{"en":{"language":"en","value":"Nearly optimal communication and query complexity of bipartite matching"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8080003"}},"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":"Q6942974$951E0E66-7298-4980-B20B-9A1D349CD202","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8da3068cf8e6d97b1bc73ca8df0e8199eb9cd748","datavalue":{"value":{"text":"Nearly optimal communication and query complexity of bipartite matching","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6942974$C13F061C-FB4D-40F6-A1D2-0A2AF7CB9484","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9eb170b13f5670f153dbf24098440f2eab5c5ae4","datavalue":{"value":"10.1109/FOCS54457.2022.00113","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942974$99B2B982-FAF8-4BAE-A53E-782EB3E00CD4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a3b8b3ae49f4a83653d67f230de7a96f1760a4b","datavalue":{"value":{"entity-type":"item","numeric-id":487010,"id":"Q487010"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942974$5C1254ED-658C-4CA5-AB39-919E8F3BA29A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4e342cce2e3c7a719d61b2598a3f0faa2f1e687b","datavalue":{"value":{"entity-type":"item","numeric-id":2203605,"id":"Q2203605"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942974$8150856A-80F8-4D63-87D8-5F01F428156E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"cde424bf7143ba4327b6e23c0ce9dde9a5a785c4","datavalue":{"value":{"entity-type":"item","numeric-id":5144962,"id":"Q5144962"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942974$26294D90-BD5F-44FC-8788-BBC836539681","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"272fdeb62097a0625fd668d046e7880adaa46294","datavalue":{"value":{"entity-type":"item","numeric-id":2164679,"id":"Q2164679"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942974$5C53E206-E668-47C5-9FDD-6F207D58ADB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6d3cfac898ef175f1e7f821250c8102a1f20c5e8","datavalue":{"value":{"entity-type":"item","numeric-id":5124419,"id":"Q5124419"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6942974$29EF8431-2F36-463D-A993-A81B9941EDBA","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":"Q6942974$A835C786-2FCE-4CCB-918E-C62652667CEB","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"99f6887874e892b1889f14036165603b81953680","datavalue":{"value":"https://eprints.whiterose.ac.uk/200970/1/2208.02526.pdf","type":"string"},"datatype":"url"},"type":"statement","id":"Q6942974$76BE1E31-06B1-4002-BD08-CAF48EF698A4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942974$6C64358A-05F5-4FB7-9F76-7E336DA75EA6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5cd21fe1c010b811b0fe25abc36cc8b5f59132c7","datavalue":{"value":"8080003","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6942974$389F06EE-8A0F-4204-AAA6-E8D2A699C2B1","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":"Q6942974$0A80794C-81F4-4C69-BE33-651923BFC7C8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Nearly optimal communication and query complexity of bipartite matching","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Nearly_optimal_communication_and_query_complexity_of_bipartite_matching"}}}}}