{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2YY5O3YB7UG5TCZD55P353U5FS","short_pith_number":"pith:2YY5O3YB","canonical_record":{"source":{"id":"1004.0887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-04-06T16:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"889f2299c39969b318d506e4d87b7f6ae57f6fdc72f75fb348f506b371b74810","abstract_canon_sha256":"fe2c40e2be03e913ca3f6a43ffdb8d028a737fe95bac941aa3b13122ce838f3f"},"schema_version":"1.0"},"canonical_sha256":"d631d76f01fd0dd98b23ef5fbeee9d2cba6bd9f72e8b7e3b7741198324ad8f3a","source":{"kind":"arxiv","id":"1004.0887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0887","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0887v2","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0887","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"2YY5O3YB7UG5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2YY5O3YB7UG5TCZD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2YY5O3YB","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2YY5O3YB7UG5TCZD55P353U5FS","target":"record","payload":{"canonical_record":{"source":{"id":"1004.0887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-04-06T16:37:45Z","cross_cats_sorted":[],"title_canon_sha256":"889f2299c39969b318d506e4d87b7f6ae57f6fdc72f75fb348f506b371b74810","abstract_canon_sha256":"fe2c40e2be03e913ca3f6a43ffdb8d028a737fe95bac941aa3b13122ce838f3f"},"schema_version":"1.0"},"canonical_sha256":"d631d76f01fd0dd98b23ef5fbeee9d2cba6bd9f72e8b7e3b7741198324ad8f3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:36.497097Z","signature_b64":"LFZBcHkoslQTMdaRCYiyxp0hXWI5+HdnZYeW8p7VdbWUc5IlXMoQi6g4uiscaxRTLyuMfvfZfRW+R8aP4AjKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d631d76f01fd0dd98b23ef5fbeee9d2cba6bd9f72e8b7e3b7741198324ad8f3a","last_reissued_at":"2026-05-18T01:14:36.496303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:36.496303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.0887","source_version":2,"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-18T01:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8f7W06O+VQOEa38gVmBcNTzw9T6Qnzj+gDudYGYrs7g1qv7Z680A8SbA+UDswNSzwypggOVCtRVmmdGo4yoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:03:43.884733Z"},"content_sha256":"9d0af28e1d6d38a0c7cbc7c3e7621eb10b7355c5db2a8e57efc9f4ed46b1f1f3","schema_version":"1.0","event_id":"sha256:9d0af28e1d6d38a0c7cbc7c3e7621eb10b7355c5db2a8e57efc9f4ed46b1f1f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2YY5O3YB7UG5TCZD55P353U5FS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Guillem Rigaill","submitted_at":"2010-04-06T16:37:45Z","abstract_excerpt":"A common computational problem in multiple change-point models is to recover the segmentations with $1$ to $K_{max}$ change-points of minimal cost with respect to some loss function. Here we present an algorithm to prune the set of candidate change-points which is based on a functional representation of the cost of segmentations. We study the worst case complexity of the algorithm when there is a unidimensional parameter per segment and demonstrate that it is at worst equivalent to the complexity of the segment neighbourhood algorithm: $\\mathcal{O}(K_{max} n^2)$. For a particular loss function"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0887","kind":"arxiv","version":2},"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-18T01:14:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E/w9nwtqdIumoIG+kR2b5u6ki2Erql3O0m1GGWkFCnOt0l1D1ra8BwUmyzheHOoPX2416MW2Bv0O/iMn9ttnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:03:43.885377Z"},"content_sha256":"4b816a59513ae93f25311241bf4c35a4715714df90839b44e605e4aff4e6ddd0","schema_version":"1.0","event_id":"sha256:4b816a59513ae93f25311241bf4c35a4715714df90839b44e605e4aff4e6ddd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YY5O3YB7UG5TCZD55P353U5FS/bundle.json","state_url":"https://pith.science/pith/2YY5O3YB7UG5TCZD55P353U5FS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YY5O3YB7UG5TCZD55P353U5FS/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-04T05:03:43Z","links":{"resolver":"https://pith.science/pith/2YY5O3YB7UG5TCZD55P353U5FS","bundle":"https://pith.science/pith/2YY5O3YB7UG5TCZD55P353U5FS/bundle.json","state":"https://pith.science/pith/2YY5O3YB7UG5TCZD55P353U5FS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YY5O3YB7UG5TCZD55P353U5FS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2YY5O3YB7UG5TCZD55P353U5FS","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":"fe2c40e2be03e913ca3f6a43ffdb8d028a737fe95bac941aa3b13122ce838f3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-04-06T16:37:45Z","title_canon_sha256":"889f2299c39969b318d506e4d87b7f6ae57f6fdc72f75fb348f506b371b74810"},"schema_version":"1.0","source":{"id":"1004.0887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0887","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0887v2","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0887","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"2YY5O3YB7UG5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2YY5O3YB7UG5TCZD","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2YY5O3YB","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:4b816a59513ae93f25311241bf4c35a4715714df90839b44e605e4aff4e6ddd0","target":"graph","created_at":"2026-05-18T01:14:36Z","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":"A common computational problem in multiple change-point models is to recover the segmentations with $1$ to $K_{max}$ change-points of minimal cost with respect to some loss function. Here we present an algorithm to prune the set of candidate change-points which is based on a functional representation of the cost of segmentations. We study the worst case complexity of the algorithm when there is a unidimensional parameter per segment and demonstrate that it is at worst equivalent to the complexity of the segment neighbourhood algorithm: $\\mathcal{O}(K_{max} n^2)$. For a particular loss function","authors_text":"Guillem Rigaill","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-04-06T16:37:45Z","title":"A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0887","kind":"arxiv","version":2},"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:9d0af28e1d6d38a0c7cbc7c3e7621eb10b7355c5db2a8e57efc9f4ed46b1f1f3","target":"record","created_at":"2026-05-18T01:14:36Z","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":"fe2c40e2be03e913ca3f6a43ffdb8d028a737fe95bac941aa3b13122ce838f3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-04-06T16:37:45Z","title_canon_sha256":"889f2299c39969b318d506e4d87b7f6ae57f6fdc72f75fb348f506b371b74810"},"schema_version":"1.0","source":{"id":"1004.0887","kind":"arxiv","version":2}},"canonical_sha256":"d631d76f01fd0dd98b23ef5fbeee9d2cba6bd9f72e8b7e3b7741198324ad8f3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d631d76f01fd0dd98b23ef5fbeee9d2cba6bd9f72e8b7e3b7741198324ad8f3a","first_computed_at":"2026-05-18T01:14:36.496303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:36.496303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFZBcHkoslQTMdaRCYiyxp0hXWI5+HdnZYeW8p7VdbWUc5IlXMoQi6g4uiscaxRTLyuMfvfZfRW+R8aP4AjKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:36.497097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d0af28e1d6d38a0c7cbc7c3e7621eb10b7355c5db2a8e57efc9f4ed46b1f1f3","sha256:4b816a59513ae93f25311241bf4c35a4715714df90839b44e605e4aff4e6ddd0"],"state_sha256":"7856f890dbc232ed028cc2989bf34c7ecb8831f77d3d2f2bbd725365ad35aa77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBPB+fM/OzmQrLUTeicqHwX+ceCRnaudaPjHUkaf/7WrRU6LXTWukcJRzJB9hOIPdLjB46eLUFI7WSxxbPpDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:03:43.888438Z","bundle_sha256":"85e0e9ed25fbe057f4bb1e9605bc036b972a51e7fc5d79107c8013641cd9fc19"}}