{"entities":{"Q6944016":{"pageid":21167682,"ns":120,"title":"Item:Q6944016","lastrevid":75948051,"modified":"2026-04-21T15:52:39Z","type":"item","id":"Q6944016","labels":{"en":{"language":"en","value":"Near-quadratic lower bounds for two-pass graph streaming algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078972"}},"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":"Q6944016$B6B88AD9-EBC1-4F61-BE02-943B61406E56","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c4939754a4a03fc27f4adf68691896da5874e1d1","datavalue":{"value":{"text":"Near-quadratic lower bounds for two-pass graph streaming algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944016$76A40D9F-1AC4-4061-A38E-0AA986CB3874","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"49d5d731558698ac7cba3f16acd79052d9ec8f1f","datavalue":{"value":"10.1109/FOCS46700.2020.00040","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944016$2E2D6379-E544-4A44-A62B-4E69D74478B1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9ff74abf884fd84f821d942e1b3ab58bcc02ee3f","datavalue":{"value":{"entity-type":"item","numeric-id":487028,"id":"Q487028"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944016$5A7ADB2B-9E21-4ADF-95AD-A73D4629EDAE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b481d9d1e1fd6339de38d10a65dabc0f21090cc0","datavalue":{"value":{"entity-type":"item","numeric-id":168589,"id":"Q168589"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944016$6641CB75-9A1A-4D5F-A236-50E48616F5DB","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":"Q6944016$98219736-B18C-4019-AF60-6213F9A7A32C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944016$ED16C082-ED16-4F10-8013-3CE6A3D22296","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"deaa015e49a51b2171d3d6ed6a4425bf65385798","datavalue":{"value":"8078972","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944016$860EBB32-EF6D-4D19-ACFA-97F4BB2C8380","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":"Q6944016$52DBEBBA-01D5-4ACF-8E5B-DE5449B0751D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Near-quadratic lower bounds for two-pass graph streaming algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Near-quadratic_lower_bounds_for_two-pass_graph_streaming_algorithms"}}}}}