{"entities":{"Q6121425":{"pageid":13255732,"ns":120,"title":"Item:Q6121425","lastrevid":93858296,"modified":"2026-06-05T05:17:50Z","type":"item","id":"Q6121425","labels":{"en":{"language":"en","value":"The computational complexity of some explainable clustering problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7824704"}},"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":"Q6121425$4CC93D21-92ED-4529-A3EB-3EC7A4B58AAA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fca4e46e390e1a26d707c193b62481932a0dc484","datavalue":{"value":{"text":"The computational complexity of some explainable clustering problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6121425$1F7FDDD9-6717-4EED-83AE-8A9E3C1B96E4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"96c336c47481eefdf3bf8537c9af3521411ea42d","datavalue":{"value":{"entity-type":"item","numeric-id":935153,"id":"Q935153"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6121425$BE6ED14E-47DB-4018-9DD5-35FFD8488D2C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6121425$940F6988-0ECF-4C5B-AB16-A19AC2821350","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e7022ae53c448f75d91b8223b5d0f2519da4678b","datavalue":{"value":{"time":"+2024-03-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6121425$03C6E89E-5A4B-4849-93FD-044010932532","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"306fd5cccde4ef053f3f9b6d786b15165d487d0c","datavalue":{"value":"https://arxiv.org/abs/2208.09643","type":"string"},"datatype":"url"},"type":"statement","id":"Q6121425$8C6F07AD-7425-46AF-A2F9-BB38FC7DA96F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6121425$C2940561-720A-451F-9659-AEF653AD7E1B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"cb20d503ccc2870a64365db152ceae3fb248b54a","datavalue":{"value":"7824704","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6121425$9BA29441-0640-4B91-9A4A-F6A79390A75F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e9c4e650abc856b5f51d0b5123c5930fad01c53f","datavalue":{"value":"clustering","type":"string"},"datatype":"string"},"type":"statement","id":"Q6121425$2DC046A7-6469-4182-BB0C-18E127B55E89","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"50e4e06d9e28eb2b5161a8b77486cae9897ae53d","datavalue":{"value":"decision trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6121425$D95F0E6B-CD3A-4C35-A38E-D7FF28C9D040","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"925a8d89d661377587d86412ea89cad5cf30a0cf","datavalue":{"value":"explainability","type":"string"},"datatype":"string"},"type":"statement","id":"Q6121425$F306886A-413B-4FD3-9D57-3C3C9157283C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba0cc3f7aaac8445724ef309c9eecb57f5a563d","datavalue":{"value":"computational complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6121425$3989B530-40B2-496D-A701-E786CDC3B7B0","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":"Q6121425$5D54FB8F-74EE-413B-873B-599BDDA4162A","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"9470e42ecbd1df6ae5571079f2331e39cdb1e4e3","datavalue":{"value":{"entity-type":"item","numeric-id":354178,"id":"Q354178"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6121425$00F0FB34-85FC-4EA9-91F0-8A57298DE3BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ecaa1fb983cc23b295a0bfab18be0ac778dd0235","datavalue":{"value":{"entity-type":"item","numeric-id":5368726,"id":"Q5368726"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6121425$2599BD88-54E3-4846-B216-7F555BB04AE1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7b5fce56a1cf2cf9bfdbb0b61811c85b60fbe667","datavalue":{"value":{"entity-type":"item","numeric-id":5151733,"id":"Q5151733"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6121425$733CE5A7-C03E-4D02-96C9-B0F15F93B305","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"efcb73c35b686a2fe28a7de0e7830277df312d5f","datavalue":{"value":"10.1016/J.IPL.2023.106437","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6121425$43EFD5E3-B259-41CB-B5EF-139C728B0269","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The computational complexity of some explainable clustering problems","badges":[]}}}}}