{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RUFSHSFBEQLSOFFBMBETJQLZIQ","short_pith_number":"pith:RUFSHSFB","canonical_record":{"source":{"id":"2507.02467","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-03T09:25:44Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"c8a3262dc3d209568dca75a12c9dbf73a1cace8fbd5cee98b8ef299441dddabb","abstract_canon_sha256":"2fe4092593b2870ef8f875630ae6948f52fafe53da80ad627c44c216be4000b9"},"schema_version":"1.0"},"canonical_sha256":"8d0b23c8a124172714a1604934c179442c059126772cd14d3ccab8d2677700ab","source":{"kind":"arxiv","id":"2507.02467","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.02467","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"2507.02467v2","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02467","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"RUFSHSFBEQLS","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"pith_short_16","alias_value":"RUFSHSFBEQLSOFFB","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"pith_short_8","alias_value":"RUFSHSFB","created_at":"2026-07-05T11:35:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RUFSHSFBEQLSOFFBMBETJQLZIQ","target":"record","payload":{"canonical_record":{"source":{"id":"2507.02467","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-03T09:25:44Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"c8a3262dc3d209568dca75a12c9dbf73a1cace8fbd5cee98b8ef299441dddabb","abstract_canon_sha256":"2fe4092593b2870ef8f875630ae6948f52fafe53da80ad627c44c216be4000b9"},"schema_version":"1.0"},"canonical_sha256":"8d0b23c8a124172714a1604934c179442c059126772cd14d3ccab8d2677700ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:14.828803Z","signature_b64":"c8nRYk6jWwpePx64s5G02q5ZAsSaxLt0/dvo/1ySMxKdXiureAjp1WscN8rhksyG/rRMj6zuc6/0I81QdlKsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d0b23c8a124172714a1604934c179442c059126772cd14d3ccab8d2677700ab","last_reissued_at":"2026-07-05T11:35:14.828328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:14.828328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.02467","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-07-05T11:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8lZRE9Zwva9/W6crWr7iN6SiuE1H9r6OSRmRRq7jDbwnYCcFmfWHovPRWx2oW//mY9UVVbEWSGe88FJlCrvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:00:14.979637Z"},"content_sha256":"57d422599e821e04abc20208d314d5b7d55c7cc2502c28bab09e18c7d8ff755d","schema_version":"1.0","event_id":"sha256:57d422599e821e04abc20208d314d5b7d55c7cc2502c28bab09e18c7d8ff755d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RUFSHSFBEQLSOFFBMBETJQLZIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DUST: A Duality-Based Pruning Method For Exact Multiple Change-Point Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Charles Truong, Simon Quern\\'e, Vincent Runge","submitted_at":"2025-07-03T09:25:44Z","abstract_excerpt":"We tackle the challenge of detecting multiple change points in large time series by optimising a penalised likelihood derived from exponential family models. Dynamic programming algorithms can solve this task exactly with at most quadratic time complexity. In recent years, the development of pruning strategies has drastically improved their computational efficiency. However, the two existing approaches have notable limitations: PELT struggles with pruning efficiency in sparse-change scenarios, while FPOP's structure is not adapted to multi-parametric settings. To address these issues, we intro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02467","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.02467/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TofetyYZWwhVceunP36p3ljuIY/dBMSj/l3Op6BzZYRRCy4p0tJvsh+Kz/UYNC0q0v2jRsfPi5R4TfNhC5NwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:00:14.980019Z"},"content_sha256":"58a633ce5ea205ee611576b5beef21b0b39ce1c7c291e99db34e4c4dd8192dbb","schema_version":"1.0","event_id":"sha256:58a633ce5ea205ee611576b5beef21b0b39ce1c7c291e99db34e4c4dd8192dbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ/bundle.json","state_url":"https://pith.science/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ/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-07-08T16:00:14Z","links":{"resolver":"https://pith.science/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ","bundle":"https://pith.science/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ/bundle.json","state":"https://pith.science/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUFSHSFBEQLSOFFBMBETJQLZIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RUFSHSFBEQLSOFFBMBETJQLZIQ","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":"2fe4092593b2870ef8f875630ae6948f52fafe53da80ad627c44c216be4000b9","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-03T09:25:44Z","title_canon_sha256":"c8a3262dc3d209568dca75a12c9dbf73a1cace8fbd5cee98b8ef299441dddabb"},"schema_version":"1.0","source":{"id":"2507.02467","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.02467","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"2507.02467v2","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02467","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"RUFSHSFBEQLS","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"pith_short_16","alias_value":"RUFSHSFBEQLSOFFB","created_at":"2026-07-05T11:35:14Z"},{"alias_kind":"pith_short_8","alias_value":"RUFSHSFB","created_at":"2026-07-05T11:35:14Z"}],"graph_snapshots":[{"event_id":"sha256:58a633ce5ea205ee611576b5beef21b0b39ce1c7c291e99db34e4c4dd8192dbb","target":"graph","created_at":"2026-07-05T11:35:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.02467/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We tackle the challenge of detecting multiple change points in large time series by optimising a penalised likelihood derived from exponential family models. Dynamic programming algorithms can solve this task exactly with at most quadratic time complexity. In recent years, the development of pruning strategies has drastically improved their computational efficiency. However, the two existing approaches have notable limitations: PELT struggles with pruning efficiency in sparse-change scenarios, while FPOP's structure is not adapted to multi-parametric settings. To address these issues, we intro","authors_text":"Charles Truong, Simon Quern\\'e, Vincent Runge","cross_cats":["stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-03T09:25:44Z","title":"DUST: A Duality-Based Pruning Method For Exact Multiple Change-Point Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02467","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:57d422599e821e04abc20208d314d5b7d55c7cc2502c28bab09e18c7d8ff755d","target":"record","created_at":"2026-07-05T11:35:14Z","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":"2fe4092593b2870ef8f875630ae6948f52fafe53da80ad627c44c216be4000b9","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2025-07-03T09:25:44Z","title_canon_sha256":"c8a3262dc3d209568dca75a12c9dbf73a1cace8fbd5cee98b8ef299441dddabb"},"schema_version":"1.0","source":{"id":"2507.02467","kind":"arxiv","version":2}},"canonical_sha256":"8d0b23c8a124172714a1604934c179442c059126772cd14d3ccab8d2677700ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d0b23c8a124172714a1604934c179442c059126772cd14d3ccab8d2677700ab","first_computed_at":"2026-07-05T11:35:14.828328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:14.828328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c8nRYk6jWwpePx64s5G02q5ZAsSaxLt0/dvo/1ySMxKdXiureAjp1WscN8rhksyG/rRMj6zuc6/0I81QdlKsDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:14.828803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.02467","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57d422599e821e04abc20208d314d5b7d55c7cc2502c28bab09e18c7d8ff755d","sha256:58a633ce5ea205ee611576b5beef21b0b39ce1c7c291e99db34e4c4dd8192dbb"],"state_sha256":"3e49515643625e87a728129c40732cd90ced57aaa7a8d358697ffa3984af38cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0VjMm4mL4CrsAt0oUT64B/63XZtxSdIiEMzb8HLFS4ouWkN9MWSR/nqg+kdbPr4c2mhsG1t5lZW+NnOc6YzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T16:00:14.982200Z","bundle_sha256":"7302c30af1fef624019c00a319e1ca8bf8773419ef1b1e1fcbe296aa6bf2eedb"}}