{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WK55I6SBBR5C3YRJITHOUHC34F","short_pith_number":"pith:WK55I6SB","canonical_record":{"source":{"id":"1101.1438","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-01-07T14:13:12Z","cross_cats_sorted":["q-bio.GN","q-bio.QM"],"title_canon_sha256":"d773cf289fa0f34e2e5432238dc6491881b40f52316f752145446bf8faef8a22","abstract_canon_sha256":"c5af51bd9a62e0c70eaac0bea27eb7f205997aa9832774c84d2d7bf5d8e4f5a1"},"schema_version":"1.0"},"canonical_sha256":"b2bbd47a410c7a2de22944ceea1c5be142b4c3778927ad9fe079f1b2b01f2ce1","source":{"kind":"arxiv","id":"1101.1438","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1438","created_at":"2026-05-18T02:23:00Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1438v3","created_at":"2026-05-18T02:23:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1438","created_at":"2026-05-18T02:23:00Z"},{"alias_kind":"pith_short_12","alias_value":"WK55I6SBBR5C","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WK55I6SBBR5C3YRJ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WK55I6SB","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WK55I6SBBR5C3YRJITHOUHC34F","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1438","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-01-07T14:13:12Z","cross_cats_sorted":["q-bio.GN","q-bio.QM"],"title_canon_sha256":"d773cf289fa0f34e2e5432238dc6491881b40f52316f752145446bf8faef8a22","abstract_canon_sha256":"c5af51bd9a62e0c70eaac0bea27eb7f205997aa9832774c84d2d7bf5d8e4f5a1"},"schema_version":"1.0"},"canonical_sha256":"b2bbd47a410c7a2de22944ceea1c5be142b4c3778927ad9fe079f1b2b01f2ce1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:00.153134Z","signature_b64":"P3I2F/zunfcDRpmamx9+B3RhVWUJeuw6EszjJEWtLgR08F/3bt1RQ6daaKlxFGAxeAykKyWhn8Vpsl7KJAK5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2bbd47a410c7a2de22944ceea1c5be142b4c3778927ad9fe079f1b2b01f2ce1","last_reissued_at":"2026-05-18T02:23:00.152391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:00.152391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1438","source_version":3,"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:23:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QmFIdIV6dAYWMQ63oUKAknaLN/lq8eKg1rXYnrGfbZa+DRACgwrkdHsKh9Ngg2zve58ePfGWj1z0VKiUdn8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:41:55.115970Z"},"content_sha256":"7cf80ba721d9e29f1f2b86f0abc651b7a5ac09f4a5eaf46d2956c83a730808d5","schema_version":"1.0","event_id":"sha256:7cf80ba721d9e29f1f2b86f0abc651b7a5ac09f4a5eaf46d2956c83a730808d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WK55I6SBBR5C3YRJITHOUHC34F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal detection of changepoints with a linear computational cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN","q-bio.QM"],"primary_cat":"stat.ME","authors_text":"I. A. Eckley, P. Fearnhead, R. Killick","submitted_at":"2011-01-07T14:13:12Z","abstract_excerpt":"We consider the problem of detecting multiple changepoints in large data sets. Our focus is on applications where the number of changepoints will increase as we collect more data: for example in genetics as we analyse larger regions of the genome, or in finance as we observe time-series over longer periods. We consider the common approach of detecting changepoints through minimising a cost function over possible numbers and locations of changepoints. This includes several established procedures for detecting changing points, such as penalised likelihood and minimum description length. We intro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1438","kind":"arxiv","version":3},"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:23:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blV6b7dzw37HQG+JAYOqGF8AwiL+d18m4n7ioORtvFJxXxdY11jK9V9mhbBZ5i36Sxq/rlie2bUkh7/J3RsJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:41:55.116346Z"},"content_sha256":"0afc19a0f406f2e2a631c96f58938d899cd1950481839b254bd8a6f9d3a5b74e","schema_version":"1.0","event_id":"sha256:0afc19a0f406f2e2a631c96f58938d899cd1950481839b254bd8a6f9d3a5b74e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WK55I6SBBR5C3YRJITHOUHC34F/bundle.json","state_url":"https://pith.science/pith/WK55I6SBBR5C3YRJITHOUHC34F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WK55I6SBBR5C3YRJITHOUHC34F/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-11T09:41:55Z","links":{"resolver":"https://pith.science/pith/WK55I6SBBR5C3YRJITHOUHC34F","bundle":"https://pith.science/pith/WK55I6SBBR5C3YRJITHOUHC34F/bundle.json","state":"https://pith.science/pith/WK55I6SBBR5C3YRJITHOUHC34F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WK55I6SBBR5C3YRJITHOUHC34F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WK55I6SBBR5C3YRJITHOUHC34F","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":"c5af51bd9a62e0c70eaac0bea27eb7f205997aa9832774c84d2d7bf5d8e4f5a1","cross_cats_sorted":["q-bio.GN","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-01-07T14:13:12Z","title_canon_sha256":"d773cf289fa0f34e2e5432238dc6491881b40f52316f752145446bf8faef8a22"},"schema_version":"1.0","source":{"id":"1101.1438","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1438","created_at":"2026-05-18T02:23:00Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1438v3","created_at":"2026-05-18T02:23:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1438","created_at":"2026-05-18T02:23:00Z"},{"alias_kind":"pith_short_12","alias_value":"WK55I6SBBR5C","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WK55I6SBBR5C3YRJ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WK55I6SB","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:0afc19a0f406f2e2a631c96f58938d899cd1950481839b254bd8a6f9d3a5b74e","target":"graph","created_at":"2026-05-18T02:23:00Z","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":"We consider the problem of detecting multiple changepoints in large data sets. Our focus is on applications where the number of changepoints will increase as we collect more data: for example in genetics as we analyse larger regions of the genome, or in finance as we observe time-series over longer periods. We consider the common approach of detecting changepoints through minimising a cost function over possible numbers and locations of changepoints. This includes several established procedures for detecting changing points, such as penalised likelihood and minimum description length. We intro","authors_text":"I. A. Eckley, P. Fearnhead, R. Killick","cross_cats":["q-bio.GN","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-01-07T14:13:12Z","title":"Optimal detection of changepoints with a linear computational cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1438","kind":"arxiv","version":3},"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:7cf80ba721d9e29f1f2b86f0abc651b7a5ac09f4a5eaf46d2956c83a730808d5","target":"record","created_at":"2026-05-18T02:23:00Z","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":"c5af51bd9a62e0c70eaac0bea27eb7f205997aa9832774c84d2d7bf5d8e4f5a1","cross_cats_sorted":["q-bio.GN","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-01-07T14:13:12Z","title_canon_sha256":"d773cf289fa0f34e2e5432238dc6491881b40f52316f752145446bf8faef8a22"},"schema_version":"1.0","source":{"id":"1101.1438","kind":"arxiv","version":3}},"canonical_sha256":"b2bbd47a410c7a2de22944ceea1c5be142b4c3778927ad9fe079f1b2b01f2ce1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2bbd47a410c7a2de22944ceea1c5be142b4c3778927ad9fe079f1b2b01f2ce1","first_computed_at":"2026-05-18T02:23:00.152391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:00.152391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3I2F/zunfcDRpmamx9+B3RhVWUJeuw6EszjJEWtLgR08F/3bt1RQ6daaKlxFGAxeAykKyWhn8Vpsl7KJAK5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:00.153134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1438","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf80ba721d9e29f1f2b86f0abc651b7a5ac09f4a5eaf46d2956c83a730808d5","sha256:0afc19a0f406f2e2a631c96f58938d899cd1950481839b254bd8a6f9d3a5b74e"],"state_sha256":"dbcced616fab0ebc66d0bec654e2f2bd6fe9f302ab87263a46a14b20091a842b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u41MIevY06V5dfzKFPIJeuI+n5r949tM9HUTR5YemqhpGjBup4bRkuQnoBSsx99K+p1lW2dsQthJYx7c4w5OAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:41:55.118287Z","bundle_sha256":"2c727dc926a2aee1ef9886bb0403afc2343528f28858beb2bc521c2395071229"}}