{"entities":{"Q6944015":{"pageid":21167676,"ns":120,"title":"Item:Q6944015","lastrevid":75948042,"modified":"2026-04-21T15:52:37Z","type":"item","id":"Q6944015","labels":{"en":{"language":"en","value":"Multi-pass graph streaming lower bounds for cycle counting, MAX-CUT, matching size, and other problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078973"}},"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":"Q6944015$093C6925-CBA9-4EC3-A697-0A9CD719AB5A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"34dcfacd350c446f1a46b787b4153705485e2046","datavalue":{"value":{"text":"Multi-pass graph streaming lower bounds for cycle counting, MAX-CUT, matching size, and other problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944015$75D30789-50FC-4C17-A7E9-3B91886D2007","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8b350861489765fd11c2fef6ebdba1c4e0b7e73d","datavalue":{"value":"10.1109/FOCS46700.2020.00041","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944015$F409526E-3FA6-419A-A5FA-A6900E57B401","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":"Q6944015$48169A26-C045-42FE-A9EC-13E9D8BFB52B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"12e7c81bf3064be2cadf75953cd885bed52bb55d","datavalue":{"value":{"entity-type":"item","numeric-id":280941,"id":"Q280941"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944015$95819D98-37E4-497C-87A5-A19FA9B6FE43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6d12643ebb3cf2a3eea8d090c32ad3d87722aa36","datavalue":{"value":{"entity-type":"item","numeric-id":4608023,"id":"Q4608023"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944015$CEB597A3-C97A-44FA-8258-605C0E014605","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4b7202446dc7533be89a665e4184ba18729ea814","datavalue":{"value":{"entity-type":"item","numeric-id":369428,"id":"Q369428"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944015$04FD7C43-8370-416C-871D-A98DFC6A7760","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":"Q6944015$D917F4F6-08E0-4D66-83C5-385E20BA188B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944015$04E3215F-45BA-45AA-94B1-F371FFA132C7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f6d8906349d4c7fab9022936357b824fa301cd07","datavalue":{"value":"8078973","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944015$848AE846-2A94-4ED1-B7CF-B07A94C18B53","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":"Q6944015$6312B71A-044C-4B16-BCD2-C580D31F9D00","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Multi-pass graph streaming lower bounds for cycle counting, MAX-CUT, matching size, and other problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Multi-pass_graph_streaming_lower_bounds_for_cycle_counting,_MAX-CUT,_matching_size,_and_other_problems"}}}}}