{"entities":{"Q112585":{"pageid":114060,"ns":120,"title":"Item:Q112585","lastrevid":59700024,"modified":"2026-04-10T13:36:57Z","type":"item","id":"Q112585","labels":{"en":{"language":"en","value":"A Dynamic Programming Algorithm for the Fused Lasso andL0-Segmentation"}},"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":"Q112585$94FE1688-4786-440B-894C-A47CEAC21E53","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"abb121818295c23b0e94fcc86de69307c7dcbd7c","datavalue":{"value":"10.1080/10618600.2012.681238","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q112585$8E536DA9-B43F-491B-A7D5-671968EB1C80","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2e0e620dba6bca743dc817b96175ee5d416da568","datavalue":{"value":{"entity-type":"item","numeric-id":58500,"id":"Q58500"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q112585$963453F9-C46B-4CB9-AC20-942B850A9914","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"e100c42aabcc61927fe825fe2c11ef4564da0349","datavalue":{"value":"22","type":"string"},"datatype":"string"},"type":"statement","id":"Q112585$2769DF20-FD28-4B3B-969B-24A5D062914F","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"b8f23e21c54d542f784defaef10454ba7971b38a","datavalue":{"value":"2","type":"string"},"datatype":"string"},"type":"statement","id":"Q112585$815B07E4-C0A8-438A-9F56-B0651DF6C96E","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"1712a58c2e191c925209097409695477a45f9a62","datavalue":{"value":"246-260","type":"string"},"datatype":"string"},"type":"statement","id":"Q112585$22DBF82E-91FC-485C-8EDE-B180BE430F42","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7be7aaf74ecfdb6ed4bdee0922aad81cd8926244","datavalue":{"value":{"time":"+2013-04-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":10,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q112585$EFDA90C0-7447-47F3-85AC-AEA78FF237B8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"61a957da9fcdfaddac8afdc32201d929faf2e1bf","datavalue":{"value":{"entity-type":"item","numeric-id":112584,"id":"Q112584"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q112585$E148A6D4-8F67-49D2-AE98-E3124F33D426","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":"Q112585$226DCEE2-B715-4565-B1C3-04DB375B1B4F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Dynamic Programming Algorithm for the Fused Lasso andL0-Segmentation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Dynamic_Programming_Algorithm_for_the_Fused_Lasso_andL0-Segmentation"}}}}}