{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2GV4Z3SGW5QEXYFCHJGECJ4OBF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"71ccb9709eb6e04faff4c546657fcad7bce1d8ee69ad0a021ecfcaca2f2ec4a8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-11T11:49:47Z","title_canon_sha256":"0c1fcb2dfa3fb1e8ef2672b988f6a4e46fde4b6ea4cae5e5166c4641bbb9b658"},"schema_version":"1.0","source":{"id":"1412.3617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3617","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3617v1","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3617","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"2GV4Z3SGW5QE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2GV4Z3SGW5QEXYFC","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2GV4Z3SG","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:45819782b3ed948542ec3f1ed20f328a537589e8792c8576c2223a461a6fec3f","target":"graph","created_at":"2026-05-18T02:31:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In the multiple changepoint setting, various search methods have been proposed which involve optimising either a constrained or penalised cost function over possible numbers and locations of changepoints using dynamic programming. Such methods are typically computationally intensive. Recent work in the penalised optimisation setting has focussed on developing a pruning-based approach which gives an improved computational cost that, under certain conditions, is linear in the number of data points. Such an approach naturally requires the specification of a penalty to avoid under/over-fitting. Wo","authors_text":"Idris A. Eckley, Kaylea Haynes, Paul Fearnhead","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-11T11:49:47Z","title":"Efficient penalty search for multiple changepoint problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3617","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e7420e466d4de689b1c9fed6b778d9a6052b29393c798bfa23054efed177cea8","target":"record","created_at":"2026-05-18T02:31:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"71ccb9709eb6e04faff4c546657fcad7bce1d8ee69ad0a021ecfcaca2f2ec4a8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-11T11:49:47Z","title_canon_sha256":"0c1fcb2dfa3fb1e8ef2672b988f6a4e46fde4b6ea4cae5e5166c4641bbb9b658"},"schema_version":"1.0","source":{"id":"1412.3617","kind":"arxiv","version":1}},"canonical_sha256":"d1abccee46b7604be0a23a4c41278e097ac2deeb899e4d6521a65d2c04390131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1abccee46b7604be0a23a4c41278e097ac2deeb899e4d6521a65d2c04390131","first_computed_at":"2026-05-18T02:31:30.732077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:30.732077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f5f4cYOLNmo7sJeChR9ohUKoYEq0NgBsZVdnt0YcFYNQ5lYZeRLtyz3JK38nKnfr7VFagt1ya2BTNkQat2HcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:30.732522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7420e466d4de689b1c9fed6b778d9a6052b29393c798bfa23054efed177cea8","sha256:45819782b3ed948542ec3f1ed20f328a537589e8792c8576c2223a461a6fec3f"],"state_sha256":"303d491d3db39631d0f16613ec7a63a045bb4ff7291c0fc279d4ad9671234eb0"}