{"entities":{"Q6885259":{"pageid":20808097,"ns":120,"title":"Item:Q6885259","lastrevid":75375754,"modified":"2026-04-18T21:17:12Z","type":"item","id":"Q6885259","labels":{"en":{"language":"en","value":"Descriptive complexity of controllable graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8135822"}},"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":"Q6885259$B2EDCD9C-E0CD-49C3-897F-CC287689E0D2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9d415881d5a149316e5edff3b39fcb2040094e10","datavalue":{"value":{"text":"Descriptive complexity of controllable graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6885259$A89B8B0D-D98F-425A-A37E-922679F8F3E3","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"65099afb61fde4a34302fdefa3dfc5aebd8a15ee","datavalue":{"value":"10.1016/J.PROCS.2023.08.209","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6885259$377611ED-7D75-465A-B9A3-A51C2E74CFD0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e88be73193246459dc26ddc958f5825ba74130c0","datavalue":{"value":{"entity-type":"item","numeric-id":254883,"id":"Q254883"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6885259$4D2145A3-66F8-40A7-BE48-06E1168ABE0E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"62efbcbd1c8bb6c04192b7f9cb4bbfc724af012a","datavalue":{"value":{"entity-type":"item","numeric-id":309796,"id":"Q309796"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6885259$3E5A4E21-4659-4FBB-B5B3-7396E89D0CF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"998ccce64853a1370058e3c165d94e0e2b102389","datavalue":{"value":{"entity-type":"item","numeric-id":1689932,"id":"Q1689932"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6885259$D011AB41-C20B-41C5-A176-91E2E136D270","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"77e56a2a9fff2ceca7feb6cb0179eb74e3b0a198","datavalue":{"value":{"entity-type":"item","numeric-id":137251,"id":"Q137251"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6885259$3367294D-BB93-4F67-9F5A-9E6EA721D210","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f32bfe4ba7afb873ef35f92b92900c6d69592a81","datavalue":{"value":{"time":"+2025-12-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6885259$E978B4A6-24A0-4E47-A1AE-F3013A94C879","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8b0f166240d9dc937c89dbc2241079deae14191f","datavalue":{"value":"68Q19","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6885259$D79A0597-3C3E-4C15-8880-ACDA91DF4CE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b58df756e27df0e7b4d6d54dbbfd9015b563e63d","datavalue":{"value":"03C13","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6885259$4CD31C86-90A2-46F0-8EE1-A1654E23326E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"898109ac7e401de8fce76101fe27418b7afd5158","datavalue":{"value":"05C50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6885259$FF52157A-112A-4268-8F32-93A8BC721314","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"2e742a171e2cc4a4f154f55124e2a34e0da3eb3e","datavalue":{"value":"05C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6885259$422DBF7C-FF7E-4E64-A142-FD63DEA71A7A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e2c9ec2c0ed06da368d6c445820a376b51610e37","datavalue":{"value":"8135822","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6885259$025AF60F-AA08-4101-99A1-5D3D91CD3499","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"420132b0a86bb9bedd0eeeab0b7b74055a6e96fb","datavalue":{"value":"descriptive complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6885259$5D04F54B-B88B-4759-82C7-9D60A1D2F8D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0421a88d9599388a9af4b0e2102ab403f6c36e7f","datavalue":{"value":"finite model theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q6885259$0421F17B-F9E0-4ADE-B345-54612A982CED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"05be6754d4964f25be10115147d1ff0acee655b9","datavalue":{"value":"spectral graph theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q6885259$CE3D030D-1457-4C0A-89E1-A517ED8D808F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f07f27347b8ba0cc8ab8c2610eb20b34785b86f5","datavalue":{"value":"counting logics","type":"string"},"datatype":"string"},"type":"statement","id":"Q6885259$7FD26791-280C-4D4B-9608-D710F0C8700D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"257c977ba107e8aa633b9abd39b916f035ef87e4","datavalue":{"value":"isomorphism problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q6885259$15C3ECCF-78BA-4201-8C31-D398B6DD66F8","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":"Q6885259$8BFAA5CB-4B45-4CC9-AC14-D13A13300791","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Descriptive complexity of controllable graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Descriptive_complexity_of_controllable_graphs"}}}}}