{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YXNXPD5XR4PIRYY67R4SBOF5DF","short_pith_number":"pith:YXNXPD5X","canonical_record":{"source":{"id":"1409.1842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-05T15:44:34Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"4055279e6d91c9deb6f5f854fb487277bb43160b772bb9fcfc4e5990a4c421c5","abstract_canon_sha256":"6e11cf169c65a6d498ab22d2627c15b75f7b2de6a173203b571bdeda9e90dc50"},"schema_version":"1.0"},"canonical_sha256":"c5db778fb78f1e88e31efc7920b8bd195a3bdd0f41953fa5e04565eaa680899b","source":{"kind":"arxiv","id":"1409.1842","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1842","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1842v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1842","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"YXNXPD5XR4PI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXNXPD5XR4PIRYY6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXNXPD5X","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YXNXPD5XR4PIRYY67R4SBOF5DF","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-05T15:44:34Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"4055279e6d91c9deb6f5f854fb487277bb43160b772bb9fcfc4e5990a4c421c5","abstract_canon_sha256":"6e11cf169c65a6d498ab22d2627c15b75f7b2de6a173203b571bdeda9e90dc50"},"schema_version":"1.0"},"canonical_sha256":"c5db778fb78f1e88e31efc7920b8bd195a3bdd0f41953fa5e04565eaa680899b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.088183Z","signature_b64":"ppoDPv9RJ3MRoGvax8HJnzcW2ruVkwx+NxYADURCqvkoJC8kW1OXotqnBnPQdAQxsR9vecZzrl+EHyODgWosCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5db778fb78f1e88e31efc7920b8bd195a3bdd0f41953fa5e04565eaa680899b","last_reissued_at":"2026-05-18T02:43:25.087436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.087436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1842","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5BxmLH46ciZy4heDenyf00tOAQoSidZ34J/i5142Li70CZJEYYq1QnyVG7akSg7rcJ2RWEWtf0IF+NCdtEIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:12:24.549763Z"},"content_sha256":"dd3fc0c983161a7909afa2380724d763e120fea898f0b22779286d86e799032b","schema_version":"1.0","event_id":"sha256:dd3fc0c983161a7909afa2380724d763e120fea898f0b22779286d86e799032b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YXNXPD5XR4PIRYY67R4SBOF5DF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Multiple Changepoint Algorithms for Large Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Guillem Rigaill, Paul Fearnhead, Robert Maidstone, Toby Hocking","submitted_at":"2014-09-05T15:44:34Z","abstract_excerpt":"There is an increasing need for algorithms that can accurately detect changepoints in long time-series, or equivalent, data. Many common approaches to detecting changepoints, for example based on penalised likelihood or minimum description length, can be formulated in terms of minimising a cost over segmentations. Dynamic programming methods exist to solve this minimisation problem exactly, but these tend to scale at least quadratically in the length of the time-series. Algorithms, such as Binary Segmentation, exist that have a computational cost that is close to linear in the length of the ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1842","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bM71PHO0oAakc1WbXdMlMV7hnUQl44zMOXUcsrk2C85ht//C9j2o+msUClD9BKhsyiiIntysMaI09Tlwtj0GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:12:24.550112Z"},"content_sha256":"ac3681079e114826b148d74c14bc5109d247a558a13306aabd2e3c15c0f2b02f","schema_version":"1.0","event_id":"sha256:ac3681079e114826b148d74c14bc5109d247a558a13306aabd2e3c15c0f2b02f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXNXPD5XR4PIRYY67R4SBOF5DF/bundle.json","state_url":"https://pith.science/pith/YXNXPD5XR4PIRYY67R4SBOF5DF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXNXPD5XR4PIRYY67R4SBOF5DF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T01:12:24Z","links":{"resolver":"https://pith.science/pith/YXNXPD5XR4PIRYY67R4SBOF5DF","bundle":"https://pith.science/pith/YXNXPD5XR4PIRYY67R4SBOF5DF/bundle.json","state":"https://pith.science/pith/YXNXPD5XR4PIRYY67R4SBOF5DF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXNXPD5XR4PIRYY67R4SBOF5DF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YXNXPD5XR4PIRYY67R4SBOF5DF","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":"6e11cf169c65a6d498ab22d2627c15b75f7b2de6a173203b571bdeda9e90dc50","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-05T15:44:34Z","title_canon_sha256":"4055279e6d91c9deb6f5f854fb487277bb43160b772bb9fcfc4e5990a4c421c5"},"schema_version":"1.0","source":{"id":"1409.1842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1842","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1842v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1842","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"YXNXPD5XR4PI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXNXPD5XR4PIRYY6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXNXPD5X","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ac3681079e114826b148d74c14bc5109d247a558a13306aabd2e3c15c0f2b02f","target":"graph","created_at":"2026-05-18T02:43:25Z","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":"There is an increasing need for algorithms that can accurately detect changepoints in long time-series, or equivalent, data. Many common approaches to detecting changepoints, for example based on penalised likelihood or minimum description length, can be formulated in terms of minimising a cost over segmentations. Dynamic programming methods exist to solve this minimisation problem exactly, but these tend to scale at least quadratically in the length of the time-series. Algorithms, such as Binary Segmentation, exist that have a computational cost that is close to linear in the length of the ti","authors_text":"Guillem Rigaill, Paul Fearnhead, Robert Maidstone, Toby Hocking","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-05T15:44:34Z","title":"On Optimal Multiple Changepoint Algorithms for Large Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1842","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:dd3fc0c983161a7909afa2380724d763e120fea898f0b22779286d86e799032b","target":"record","created_at":"2026-05-18T02:43:25Z","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":"6e11cf169c65a6d498ab22d2627c15b75f7b2de6a173203b571bdeda9e90dc50","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-09-05T15:44:34Z","title_canon_sha256":"4055279e6d91c9deb6f5f854fb487277bb43160b772bb9fcfc4e5990a4c421c5"},"schema_version":"1.0","source":{"id":"1409.1842","kind":"arxiv","version":1}},"canonical_sha256":"c5db778fb78f1e88e31efc7920b8bd195a3bdd0f41953fa5e04565eaa680899b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5db778fb78f1e88e31efc7920b8bd195a3bdd0f41953fa5e04565eaa680899b","first_computed_at":"2026-05-18T02:43:25.087436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:25.087436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ppoDPv9RJ3MRoGvax8HJnzcW2ruVkwx+NxYADURCqvkoJC8kW1OXotqnBnPQdAQxsR9vecZzrl+EHyODgWosCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:25.088183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd3fc0c983161a7909afa2380724d763e120fea898f0b22779286d86e799032b","sha256:ac3681079e114826b148d74c14bc5109d247a558a13306aabd2e3c15c0f2b02f"],"state_sha256":"adc37b399c3ba14b1d1d6ce08232400a01343f730b04ca198ad83adbe8870b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xws75ksrZmdP2o0KlGZKWHqyCPjZiv/I7Ye3Am36YF7bQmvztgngwHFfYusfLv6hJI2Yigj8kX5vX9ypecXWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:12:24.552083Z","bundle_sha256":"09c00d203c86cebe230e8edd84e820674d683df9f767df7451a1f9ffe1189dd9"}}