{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5ZOYMVTT7R2VPA3EUYGFV2CVQJ","short_pith_number":"pith:5ZOYMVTT","schema_version":"1.0","canonical_sha256":"ee5d865673fc75578364a60c5ae85582418ade236fcecdbe2dac243d703a024d","source":{"kind":"arxiv","id":"1602.01254","version":1},"attestation_state":"computed","paper":{"title":"A computationally efficient nonparametric approach for changepoint detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Idris A. Eckley, Kaylea Haynes, Paul Fearnhead","submitted_at":"2016-02-03T10:41:40Z","abstract_excerpt":"In this paper we build on an approach proposed by Zou et al. (2014) for nonpara- metric changepoint detection. This approach defines the best segmentation for a data set as the one which minimises a penalised cost function, with the cost function defined in term of minus a non-parametric log-likelihood for data within each segment. Min- imising this cost function is possible using dynamic programming, but their algorithm had a computational cost that is cubic in the length of the data set. To speed up computation, Zou et al. (2014) resorted to a screening procedure which means that the estimat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.01254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-02-03T10:41:40Z","cross_cats_sorted":[],"title_canon_sha256":"6908363b42f01c62253941baf867df3a8e61ff75964ede94e0d38d9f69595ce2","abstract_canon_sha256":"279fe782a39166717a9a2dc403ef3ef3472e86fbc69ac0af3054dfd8bd4e5188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:20.687972Z","signature_b64":"1v07ha159gmlwbOCSThpYKH8I8rhTwa19AWb7CIEuyiBIeEkbgwg+wVyrfAe+SK+hrLZMaphTzZ3Hc5So6TkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5d865673fc75578364a60c5ae85582418ade236fcecdbe2dac243d703a024d","last_reissued_at":"2026-05-18T01:21:20.687409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:20.687409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A computationally efficient nonparametric approach for changepoint detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Idris A. Eckley, Kaylea Haynes, Paul Fearnhead","submitted_at":"2016-02-03T10:41:40Z","abstract_excerpt":"In this paper we build on an approach proposed by Zou et al. (2014) for nonpara- metric changepoint detection. This approach defines the best segmentation for a data set as the one which minimises a penalised cost function, with the cost function defined in term of minus a non-parametric log-likelihood for data within each segment. Min- imising this cost function is possible using dynamic programming, but their algorithm had a computational cost that is cubic in the length of the data set. To speed up computation, Zou et al. (2014) resorted to a screening procedure which means that the estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01254","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.01254","created_at":"2026-05-18T01:21:20.687497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.01254v1","created_at":"2026-05-18T01:21:20.687497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01254","created_at":"2026-05-18T01:21:20.687497+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZOYMVTT7R2V","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZOYMVTT7R2VPA3E","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZOYMVTT","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ","json":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ.json","graph_json":"https://pith.science/api/pith-number/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/graph.json","events_json":"https://pith.science/api/pith-number/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/events.json","paper":"https://pith.science/paper/5ZOYMVTT"},"agent_actions":{"view_html":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ","download_json":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ.json","view_paper":"https://pith.science/paper/5ZOYMVTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.01254&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/action/storage_attestation","attest_author":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/action/author_attestation","sign_citation":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/action/citation_signature","submit_replication":"https://pith.science/pith/5ZOYMVTT7R2VPA3EUYGFV2CVQJ/action/replication_record"}},"created_at":"2026-05-18T01:21:20.687497+00:00","updated_at":"2026-05-18T01:21:20.687497+00:00"}