{"entities":{"Q101295":{"pageid":102615,"ns":120,"title":"Item:Q101295","lastrevid":84659453,"modified":"2026-05-28T15:23:43Z","type":"item","id":"Q101295","labels":{"en":{"language":"en","value":"Computationally Efficient Changepoint Detection for a Range of Penalties"}},"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":"Q101295$9B209076-4A74-42BF-A3E2-D5EAAC0FD589","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1a4bcf2db0413851101968ea0934befb37c9e489","datavalue":{"value":"10.1080/10618600.2015.1116445","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q101295$22012198-3752-4632-A9CD-0B4931379497","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":"Q101295$6951ED54-592E-49B5-992B-651005AF9AB6","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"0184eba55670fab55486d00448fff632eb906021","datavalue":{"value":"26","type":"string"},"datatype":"string"},"type":"statement","id":"Q101295$467C2692-8BB4-4224-ACA3-F2B28BC9D170","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"68b47585e633a4a2b067e511536f1dd047cbde8f","datavalue":{"value":"1","type":"string"},"datatype":"string"},"type":"statement","id":"Q101295$5512CD23-83D0-4022-B6ED-E17D447AD13B","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"e06f22f860c420018dc96b12ad072e2d43efc961","datavalue":{"value":"134-143","type":"string"},"datatype":"string"},"type":"statement","id":"Q101295$0B6D9F9F-B887-4B29-89F4-AFF82791A54B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6fe52b3e95804fe9a7f9b6695313e7fe86a94707","datavalue":{"value":{"time":"+2017-01-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q101295$D363149F-D790-4620-AB11-33E8F04F6830","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":"Q101295$AF1062B1-BFF1-42F8-93BA-B0B2BA9F554C","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"a539cb5bc8e80d283570e36e7cbc488d48b9385e","datavalue":{"value":"Paul Fearnhead","type":"string"},"datatype":"string"},"type":"statement","id":"Q101295$8D9212D7-141F-431E-BAF2-5467251ABC75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"7feff1bbbb8dc958b9584ecfbeae8d032bcb1718","datavalue":{"value":"Kaylea Haynes","type":"string"},"datatype":"string"},"type":"statement","id":"Q101295$103A1364-C85C-400F-A004-CBC4428763D9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"be88ee8b4090c698ab39e4c42f4a20c8e0a73570","datavalue":{"value":"Idris A. Eckley","type":"string"},"datatype":"string"},"type":"statement","id":"Q101295$DAA3A7BD-4EC7-4790-8A65-99B74A123DB5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computationally Efficient Changepoint Detection for a Range of Penalties","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computationally_Efficient_Changepoint_Detection_for_a_Range_of_Penalties"}}}}}