{"entities":{"Q117538":{"pageid":119009,"ns":120,"title":"Item:Q117538","lastrevid":59801331,"modified":"2026-04-10T14:00:25Z","type":"item","id":"Q117538","labels":{"en":{"language":"en","value":"On the strengths of the self-updating process clustering algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"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":"Q117538$004D6E4C-3E83-4F74-8A67-F2EFE9987FB0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9b373170dada3b70de25001de31512dbfb08568f","datavalue":{"value":"10.1080/00949655.2015.1049605","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q117538$C699C277-B406-4CBD-99F9-3B2C1687DA8B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8c35a289781f207572adde91d64091acba110281","datavalue":{"value":{"entity-type":"item","numeric-id":61730,"id":"Q61730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q117538$98EE30AD-8CA6-491C-9B34-66C8C7793E16","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"4b20efde8a3c9e58c310702eb126bd18c949971c","datavalue":{"value":"86","type":"string"},"datatype":"string"},"type":"statement","id":"Q117538$C9F3DD61-32F3-4BE0-B86B-D601173C3DCA","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"4cfc1ff2648e880f577ecc1376f9730143f038a5","datavalue":{"value":"5","type":"string"},"datatype":"string"},"type":"statement","id":"Q117538$BA43D4F7-7053-491D-B785-1CEDEA33BD6A","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"6e6c93e6a5eb8624453ea9951601ff22c9bc6438","datavalue":{"value":"1010-1031","type":"string"},"datatype":"string"},"type":"statement","id":"Q117538$4C57FD7C-74D1-44AF-98BB-F3C0C38BAC02","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"65537b12bedf9b03d4f9ec58bd9dd0e00a689a6c","datavalue":{"value":{"time":"+2015-05-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q117538$00DC60CD-F48D-48D8-A08A-1DC42AAF67F0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fb8f45bb2b19e0a3596df561c94cd12e55464ead","datavalue":{"value":{"entity-type":"item","numeric-id":117536,"id":"Q117536"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q117538$AC2FE14A-096A-495E-8FBC-E8BE09E4EF0F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b0856006ea80e44f6d60c8746fb94ce8917c1f6c","datavalue":{"value":{"entity-type":"item","numeric-id":117537,"id":"Q117537"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q117538$62B87E30-5D0C-4453-986A-A76B6124F3D7","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":"Q117538$1C042E8B-0A9C-4C26-A311-D9CD050FF1D7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the strengths of the self-updating process clustering algorithm","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_strengths_of_the_self-updating_process_clustering_algorithm"}}}}}