{"entities":{"Q6944178":{"pageid":21168654,"ns":120,"title":"Item:Q6944178","lastrevid":75949509,"modified":"2026-04-21T15:59:59Z","type":"item","id":"Q6944178","labels":{"en":{"language":"en","value":"New notions and constructions of sparsification for graphs and hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078813"}},"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":"Q6944178$9AB1EB75-8D36-4483-A219-BA1584C1B352","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ade02ca6bcc465b408925904d27ef32965905b3d","datavalue":{"value":{"text":"New notions and constructions of sparsification for graphs and hypergraphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944178$CD207D1F-8595-44AA-8027-D697D94AA423","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"719f42f8f1489839a259c9d53f8167ce1b0231d7","datavalue":{"value":"10.1109/FOCS.2019.00059","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944178$CA74F794-0D7A-4229-9601-2C8E239A59A2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"22b7956f6220228fa87c479909ab9136b211e3bc","datavalue":{"value":{"entity-type":"item","numeric-id":613332,"id":"Q613332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944178$98C0C088-986E-45D9-BA3D-539C3B893F8F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1983f394fcb7d4ca5dc4eeb99171e529ab181fb4","datavalue":{"value":{"entity-type":"item","numeric-id":190553,"id":"Q190553"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944178$3428041D-4394-4489-83EA-45E955D665DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4fe1c6f020b678800367378c36a0f401c9dc6425","datavalue":{"value":{"entity-type":"item","numeric-id":313449,"id":"Q313449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944178$D8CCC7AE-1151-42A9-8D3F-0FC62CED7ED8","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":"Q6944178$17CF2008-BC19-40CF-90BA-C77AB2D4FED2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944178$80E8BF43-4571-4A6E-8491-12795E97E625","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"17d3d1cbc6dfdfbfee2cd28bc2d1519b2cb7d174","datavalue":{"value":"8078813","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944178$4CCFE4A5-8728-4235-9B91-F742BB5FDF57","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":"Q6944178$53B79571-39A7-47EA-8B8B-34F3F7DC33D5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"New notions and constructions of sparsification for graphs and hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/New_notions_and_constructions_of_sparsification_for_graphs_and_hypergraphs"}}}}}