{"entities":{"Q6944355":{"pageid":21169716,"ns":120,"title":"Item:Q6944355","lastrevid":75951102,"modified":"2026-04-21T16:07:09Z","type":"item","id":"Q6944355","labels":{"en":{"language":"en","value":"The sketching complexity of graph and hypergraph counting"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078651"}},"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":"Q6944355$AB38295B-E168-4407-A97F-C1163FB4571B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f354822a2ea9d9cb0dee93ab9720bbe2c97c0641","datavalue":{"value":{"text":"The sketching complexity of graph and hypergraph counting","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944355$98CF20DD-44A9-426D-9996-1D310A59A01C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"327ae384de8ee1b4049881716162ca3cea9b48c1","datavalue":{"value":"10.1109/FOCS.2018.00059","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944355$80815A0A-4B94-4BA0-8CA6-F0ADFA56C724","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"60ef93790f2e877e26d253c49f4a4ed916c35a0d","datavalue":{"value":{"entity-type":"item","numeric-id":970607,"id":"Q970607"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944355$AE776A10-A7B7-4F1A-9D9A-FD1E412903B3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2b73c25b46672a091fd91853c36fadb76baa9706","datavalue":{"value":{"entity-type":"item","numeric-id":4575861,"id":"Q4575861"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944355$0FD925A2-787E-4315-8B9F-6381361C6079","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"915bde74cc4e5b0408c273b688f478d2959ed27f","datavalue":{"value":{"entity-type":"item","numeric-id":2322504,"id":"Q2322504"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944355$8D6206E9-B035-4883-B070-4A88E64F6F2B","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":"Q6944355$F91F9F8B-FFA5-42E3-8BA1-649B50003C92","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944355$A7A19BE0-A416-4A02-8690-180EDB00721A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944355$EFA60791-8B41-4372-83BD-D0870E3D7E17","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944355$D5B859A2-51AB-4DBF-9656-5A0404907FF8","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8ad202589e110bfec3de514acbcf433a420815d5","datavalue":{"value":"8078651","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944355$85207D6D-06C7-49EA-9142-8F0F81B200CC","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":"Q6944355$228C2170-53C4-436A-9229-5CD97B8C493D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The sketching complexity of graph and hypergraph counting","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_sketching_complexity_of_graph_and_hypergraph_counting"}}}}}