{"entities":{"Q6943516":{"pageid":21164682,"ns":120,"title":"Item:Q6943516","lastrevid":75943518,"modified":"2026-04-21T15:25:36Z","type":"item","id":"Q6943516","labels":{"en":{"language":"en","value":"Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8079481"}},"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":"Q6943516$72D1043D-8CA9-45DF-B721-6B5EB034991D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d342716cac17eb5c9e5bd12364fc21e18c641312","datavalue":{"value":{"text":"Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6943516$2BEC8932-3A39-4BCB-9199-1A82E6D793B5","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"84b3c082b22d3dcadb9c2108af7a769ca6c97e87","datavalue":{"value":"10.1109/FOCS52979.2021.00036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943516$53FC575D-959F-4254-A961-EED8A6F71453","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8e0a90aa45910db1bbb8aabc876dc755590f4069","datavalue":{"value":{"entity-type":"item","numeric-id":972361,"id":"Q972361"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943516$2B4DD08E-63B2-4906-A75A-3F1876719459","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0705bcdb05c29343394e5984ad81434268018b3a","datavalue":{"value":{"entity-type":"item","numeric-id":786038,"id":"Q786038"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6943516$A91FC36E-0F9E-40A5-A8FD-A29D60E51E24","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aa9a3404048ba5ab60c02125ac90886eb8d57c31","datavalue":{"value":{"time":"+2025-08-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6943516$11390BE3-9E08-445D-897F-182E7CE873D5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943516$8FE19538-E806-4529-AB54-326C0CC2CFCC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8dc5d8f03fcaaa9e07fb2b90c65b675a74eb1ab2","datavalue":{"value":"94-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943516$DF8B7B22-850E-4155-939A-B9B3FA1ED7A3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3d16adb7c5791612b25a1665ad08e812709c2ed6","datavalue":{"value":"8079481","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6943516$783F6B6D-2557-4980-82AA-4F70C32D5667","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":"Q6943516$41E6046A-C8A9-4BAC-95C1-EC6C5281242D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Exact_and_approximate_pattern_counting_in_degenerate_graphs:_new_algorithms,_hardness_results,_and_complexity_dichotomies"}}}}}