{"entities":{"Q6944045":{"pageid":21167856,"ns":120,"title":"Item:Q6944045","lastrevid":75948312,"modified":"2026-04-21T15:53:23Z","type":"item","id":"Q6944045","labels":{"en":{"language":"en","value":"Tree-depth and the formula complexity of subgraph isomorphism"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078944"}},"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":"Q6944045$335C2150-6C25-42AD-B8A4-D98A38F6EEEB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1f07d5a0ebaaccfb2fbc92867e6ab78a49c667c4","datavalue":{"value":{"text":"Tree-depth and the formula complexity of subgraph isomorphism","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944045$64588F09-E8D3-4A0E-AB49-DAB5A186723F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"007928fae66e273f906d38dd199287e5a71fa6ef","datavalue":{"value":"10.1109/FOCS46700.2020.00012","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944045$9AFC32BB-2108-451F-850A-3233ADB00A0D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"23e97eaa08b13e1bd8cce4634bd30e888245cab0","datavalue":{"value":{"entity-type":"item","numeric-id":648967,"id":"Q648967"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944045$48E193DC-263C-457D-A2C2-0FC88DD2BAF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"55e874ac9bb94f248f2932e672964c908ed73d10","datavalue":{"value":{"entity-type":"item","numeric-id":2034077,"id":"Q2034077"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944045$70118422-A9D3-4D94-A343-905C20C05D07","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":"Q6944045$011B53C3-503E-48F3-897F-0DF52EBC8E6B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944045$D06B2C72-013D-4B71-8379-E9E638B89204","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"050284c3e7a34d7719c7ae6352cba645819b0581","datavalue":{"value":"8078944","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944045$F15BB18A-CCD8-4731-BC54-4BD18F980686","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":"Q6944045$A4D0D9E3-5BA9-421A-8E4C-BEFE5F881F28","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Tree-depth and the formula complexity of subgraph isomorphism","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Tree-depth_and_the_formula_complexity_of_subgraph_isomorphism"}}}}}