{"entities":{"Q6944360":{"pageid":21169746,"ns":120,"title":"Item:Q6944360","lastrevid":75951147,"modified":"2026-04-21T16:07:20Z","type":"item","id":"Q6944360","labels":{"en":{"language":"en","value":"Testing graph clusterability: algorithms and lower bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078646"}},"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":"Q6944360$D287B30E-AF8B-42E1-A971-E87B74C1F2C0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7a2da038309d30e0f5dda687d21b17159d745f54","datavalue":{"value":{"text":"Testing graph clusterability: algorithms and lower bounds","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944360$5314EA5B-3A1A-4A5F-9FBE-A38EA30E3759","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e147d5cf1edb9e3150ad5af2c1617ade43c06480","datavalue":{"value":"10.1109/FOCS.2018.00054","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944360$B41E33C0-3D29-4943-A656-18505C8836B2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b6715b2f6aeb36edadffea3268170b08382698c5","datavalue":{"value":{"entity-type":"item","numeric-id":2258083,"id":"Q2258083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944360$35E061AE-AEC6-4E55-90E7-2605012764F0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a07f716863c00615d5da4f3a822db3919c0f9fe9","datavalue":{"value":{"entity-type":"item","numeric-id":5146892,"id":"Q5146892"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944360$54B6ABB8-C1C6-4D5D-8EB7-F0B748F131A0","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":"Q6944360$03E3F112-058E-4D8E-A39B-9F8AECC3ADF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1cd61dc54a904d4e6718a447d2843eceb30bc3aa","datavalue":{"value":{"entity-type":"item","numeric-id":178479,"id":"Q178479"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944360$58A174B3-0DD0-4D7A-BB1B-CC5A78AB59ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9024582b6f18c41996d656ab2683c902fa1e29f8","datavalue":{"value":{"entity-type":"item","numeric-id":187941,"id":"Q187941"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944360$7403AA3D-2FBE-4369-B043-7583BDE47C63","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":"Q6944360$02D00E3C-8FE5-414B-99DF-B7F0F15E0487","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944360$A1214E54-CDFC-4887-9B23-9947497A0C42","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944360$33C78A06-BC8F-4BD6-AD50-F1EB94DF3048","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944360$6DAAEF2E-465B-410C-80EF-F0D84B8062E5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a0bf0e2247a8cc9f91ccb7dc14aea79b21dd8432","datavalue":{"value":"8078646","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944360$044A1918-024A-4492-A97F-4BBE3C8635AA","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":"Q6944360$4A9CE5F3-E804-42D6-B630-EB838A05CC51","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Testing graph clusterability: algorithms and lower bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Testing_graph_clusterability:_algorithms_and_lower_bounds"}}}}}