{"entities":{"Q4516029":{"pageid":6545622,"ns":120,"title":"Item:Q4516029","lastrevid":108663500,"modified":"2026-11-09T17:05:35Z","type":"item","id":"Q4516029","labels":{"en":{"language":"en","value":"Maximal predictive clustering with order constraint: A linear and optimal algorithm."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1535753"}},"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":"Q4516029$4E6EB5B1-8163-4AC3-9372-ACD4BDCB22CE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"83f2863db36ca75315cb24579fc441e16ff3b61f","datavalue":{"value":"1051.91526","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4516029$71516C12-E52C-4B12-BBF4-138D75E3633F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"afdda48aef7904e68cbb5432c2d0dc48b504d3f6","datavalue":{"value":{"entity-type":"item","numeric-id":3532137,"id":"Q3532137"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4516029$E63C5020-DB94-415F-B400-ABF16489220B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ddb44aa4db2bbc08d07cb4bb158046c31fa1198f","datavalue":{"value":{"entity-type":"item","numeric-id":4395485,"id":"Q4395485"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4516029$EAADB27D-FE87-4785-AF07-5E7046B2173F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f6dd1cf30ac652347d7e7cdbfb68815239b28969","datavalue":{"value":{"entity-type":"item","numeric-id":4395484,"id":"Q4395484"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4516029$AFFAC3BC-C329-4372-9288-34767C2C2C09","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eacd2e3d947d1706227d737946fa10c2f7b5f8eb","datavalue":{"value":{"time":"+2000-11-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":"Q4516029$CFA7DC14-8C6C-4B75-9477-C0BE2D748269","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"7530ae852489b120b1b979fe5df373da24dc8e97","datavalue":{"value":"91C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4516029$710A8472-F4B8-4956-A149-B7C6B92A020C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"dc8087822e581f95b5b291a23a92fb9d1f5530d8","datavalue":{"value":"1535753","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4516029$CCA506F0-5505-4CCF-AFB0-D8705C4E636E","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":"Q4516029$FF1C61EB-A3CC-4A87-AA7E-DACF3F496F5E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fc80b5c77dc1254cb9f92c0be7f5af2ce0cb20ab","datavalue":{"value":{"text":"Maximal predictive clustering with order constraint: A linear and optimal algorithm.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4516029$072000AB-0786-4FBF-89A9-41E53651B634","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Maximal predictive clustering with order constraint: A linear and optimal algorithm.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Maximal_predictive_clustering_with_order_constraint:_A_linear_and_optimal_algorithm."}}}}}