{"entities":{"Q87007":{"pageid":88287,"ns":120,"title":"Item:Q87007","lastrevid":59392440,"modified":"2026-04-10T12:23:36Z","type":"item","id":"Q87007","labels":{"en":{"language":"en","value":"Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming"}},"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":"Q87007$A7CBFF6F-188E-4212-A264-44FBC69D3E26","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"66e395e7c3a5e2cb713de114f817f6c5fea1e3e5","datavalue":{"value":{"entity-type":"item","numeric-id":59049,"id":"Q59049"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q87007$097F67B4-0D3B-4517-82F1-2645B0FC14ED","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"5eea52d8d2f38ccc689bba2db928e82f38de5f2f","datavalue":{"value":"3","type":"string"},"datatype":"string"},"type":"statement","id":"Q87007$07E56986-1837-4A63-B534-C8D6C6E1337C","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"b8f23e21c54d542f784defaef10454ba7971b38a","datavalue":{"value":"2","type":"string"},"datatype":"string"},"type":"statement","id":"Q87007$203887C7-8D54-4E46-90F2-805EF22B9637","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"28e168d5364ca07cfb8169b3fd7a1499eb339266","datavalue":{"value":"29","type":"string"},"datatype":"string"},"type":"statement","id":"Q87007$0EA4D082-1991-4644-937F-1F46C0ABA73B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"15f056dfbeef6be4470c40b6dd6de9b3b17b014a","datavalue":{"value":{"time":"+2011-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q87007$05640F75-F256-4A3D-8548-26B5A2345DE8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0c63a87087b0f66bdae79b1a08d7fb5f7eb7f345","datavalue":{"value":{"entity-type":"item","numeric-id":87006,"id":"Q87006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q87007$DCED8062-D279-4ED1-91B6-24B3F2D4EE3E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7c445930d9e8f55955e0b9dad1a4dfd459dd317b","datavalue":{"value":{"entity-type":"item","numeric-id":87003,"id":"Q87003"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q87007$D1B14EEF-35AE-409B-8358-7DBBE67F8721","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":"Q87007$CA77F9EA-A9F5-478D-88A2-5A87D155863F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"302785606bff3ed12438ee954710850b31a8b554","datavalue":{"value":"10.32614/RJ-2011-015","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q87007$E588386F-D69F-4E3A-AB25-0DFF7E56B096","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Ckmeans.1d.dp:_Optimal_k-means_Clustering_in_One_Dimension_by_Dynamic_Programming"}}}}}