{"entities":{"Q6090913":{"pageid":13225220,"ns":120,"title":"Item:Q6090913","lastrevid":58681671,"modified":"2026-04-06T07:34:26Z","type":"item","id":"Q6090913","labels":{"en":{"language":"en","value":"Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7768400"}},"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":"Q6090913$3FCCF1DE-F044-4806-9079-767801FF9593","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"95b85c3a22e17d202c52b09a5fb7b06b9dc6fdc3","datavalue":{"value":{"entity-type":"item","numeric-id":1709589,"id":"Q1709589"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6090913$94B9B474-FAB4-4BFF-8F0E-E1764B782136","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8abc316d40c31d508a510da44fd087e548f80c44","datavalue":{"value":{"entity-type":"item","numeric-id":2146869,"id":"Q2146869"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6090913$2C3D37A7-701D-438A-BB31-983581A9E66F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a682d6abaa45d7a843d1f10c4aecdb53dfef36b5","datavalue":{"value":{"entity-type":"item","numeric-id":315531,"id":"Q315531"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6090913$F92D0320-3A8A-4A7F-BD66-F06673A3AF3A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"03724781d02efd5943b8c2e4c17071bbe751313e","datavalue":{"value":{"time":"+2023-11-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6090913$906C2106-02EA-4B35-829A-C12DF59DE071","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"45213712fcbc2469ba085c34ec247e52ff2fe889","datavalue":{"value":"https://arxiv.org/abs/2107.06582","type":"string"},"datatype":"url"},"type":"statement","id":"Q6090913$A91E7D54-09AA-47F5-BC78-575A69AD2271","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e01671c873d801b913451010c0981a684c101d40","datavalue":{"value":"68W20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6090913$ED01D034-14D6-4365-A466-836BC4363995","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6090913$D73307D6-97E3-4D1C-A876-994D3C25ED2B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6090913$44B7B1C1-88FA-4E70-9480-5B4790EC88AF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"24e0b1afdb8960fcb4120ff07950837530bc4825","datavalue":{"value":"7768400","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6090913$ECB2E8F6-5E94-4EB4-AAB4-5A928CB86FA2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"da16e87a727ad5a67888b5448599c08db53df9b1","datavalue":{"value":"sublinear time algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6090913$7C2641B9-C9A3-43AF-A446-376BD1E00A74","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ed3b495ba8c3c3bf5babb1d3213a6c0bf58078e5","datavalue":{"value":"graph algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6090913$7482B778-392E-46BF-B65D-0BEA6AB48925","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1739d1de55f021416a3a0f6c3b80f3ec0cab429e","datavalue":{"value":"sampling subgraphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6090913$F9F9FA35-FF11-4D69-8002-28645ACD9F8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"90b8a09be57ae85ca4701e8363941e782083b4db","datavalue":{"value":"approximate counting","type":"string"},"datatype":"string"},"type":"statement","id":"Q6090913$3DF9E0E2-E5D7-495A-B2EB-1A8F2DF91EF6","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":"Q6090913$EA911FBE-E509-4F2A-8F2F-5C176C6A6F47","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4b210da62524bf8b13fa7a44de62d47e37a11683","datavalue":{"value":"W3202472937","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6090913$BA36C33A-9E65-449D-A324-DBD234607580","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1a891481267d1982fbc346cce6c9d0e9a8e3a583","datavalue":{"value":{"text":"Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6090913$D5924E68-DB53-49D7-B109-A8901537232F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f4a2bb0fedb94730ae954662ba1ff050479065ea","datavalue":{"value":"10.4230/LIPICS.APPROX/RANDOM.2021.55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6090913$BB76D966-5C55-40BC-9272-5A3748BF9EF8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6090913","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6090913"}}}}}