{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:D46USAXENGGFOL25PO4ZAE3VBW","short_pith_number":"pith:D46USAXE","canonical_record":{"source":{"id":"2303.08723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-03-15T16:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"092851caf47bfbdfac8511224ba9bd340e8befb2b371b3467c453e8856b9cb6f","abstract_canon_sha256":"e1c03dffef108e5752fdcd5e8dba9b110a6fe4b1138779e13c65d22badd108ae"},"schema_version":"1.0"},"canonical_sha256":"1f3d4902e4698c572f5d7bb99013750da1abd27e6fe81bf32fd307bd953972e4","source":{"kind":"arxiv","id":"2303.08723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.08723","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.08723v1","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.08723","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"D46USAXENGGF","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"pith_short_16","alias_value":"D46USAXENGGFOL25","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"pith_short_8","alias_value":"D46USAXE","created_at":"2026-07-05T05:51:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:D46USAXENGGFOL25PO4ZAE3VBW","target":"record","payload":{"canonical_record":{"source":{"id":"2303.08723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-03-15T16:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"092851caf47bfbdfac8511224ba9bd340e8befb2b371b3467c453e8856b9cb6f","abstract_canon_sha256":"e1c03dffef108e5752fdcd5e8dba9b110a6fe4b1138779e13c65d22badd108ae"},"schema_version":"1.0"},"canonical_sha256":"1f3d4902e4698c572f5d7bb99013750da1abd27e6fe81bf32fd307bd953972e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:36.696145Z","signature_b64":"KuTiS62Lqwg9ob/iu4QWbUhCap4kUpvEHH7+N8BNGJEaguW1q95ezIMypoE7WPsK7vB+daWqojY7cGHTYNVeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f3d4902e4698c572f5d7bb99013750da1abd27e6fe81bf32fd307bd953972e4","last_reissued_at":"2026-07-05T05:51:36.695626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:36.695626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.08723","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-07-05T05:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOibuz4kNpxv+CRGZ6N5/uTZfABuGEGWrj47bnaeW+Q+UVfQqJP1w6GlWAZhbqjcclTMRsI2B4g5b1aFW5waDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:25:21.349941Z"},"content_sha256":"0834d068b6c1a6da3b42e9f758ca73184d5146ededcac8f34169db893608db26","schema_version":"1.0","event_id":"sha256:0834d068b6c1a6da3b42e9f758ca73184d5146ededcac8f34169db893608db26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:D46USAXENGGFOL25PO4ZAE3VBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ms.FPOP: An Exact and Fast Segmentation Algorithm With a Multiscale Penalty","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Arnaud Liehrmann, Guillem Rigaill","submitted_at":"2023-03-15T16:09:14Z","abstract_excerpt":"Given a time series in $R^n$ with a piecewise constant mean and independent noises, we propose an exact dynamic programming algorithm to minimize a least square criterion with a multiscale penalty promoting well-spread changepoints. Such a penalty has been proposed in Verzelen et al. (2020), and it achieves optimal rates for changepoint detection and changepoint localization. Our proposed algorithm, named Ms.FPOP, extends functional pruning ideas of Rigaill (2015) and Maidstone et al. (2017) to multiscale penalties. For large signals, $n \\geq 10^5$, with relatively few real changepoints, Ms.FP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.08723","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.08723/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-05T05:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cA7zemsvM1SiqGXQ7ibT9xmNvRevp3QCSA7JpalY1iREqpIY8tOffwrpVioC65CizCeTP0HoWg1uJVrx6amDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T14:25:21.350446Z"},"content_sha256":"e77994eaf95b62b6e033127dd6f4d2e39885834ee63dd9b9a0ab349ba4d8403f","schema_version":"1.0","event_id":"sha256:e77994eaf95b62b6e033127dd6f4d2e39885834ee63dd9b9a0ab349ba4d8403f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D46USAXENGGFOL25PO4ZAE3VBW/bundle.json","state_url":"https://pith.science/pith/D46USAXENGGFOL25PO4ZAE3VBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D46USAXENGGFOL25PO4ZAE3VBW/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-08-23T14:25:21Z","links":{"resolver":"https://pith.science/pith/D46USAXENGGFOL25PO4ZAE3VBW","bundle":"https://pith.science/pith/D46USAXENGGFOL25PO4ZAE3VBW/bundle.json","state":"https://pith.science/pith/D46USAXENGGFOL25PO4ZAE3VBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D46USAXENGGFOL25PO4ZAE3VBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:D46USAXENGGFOL25PO4ZAE3VBW","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":"e1c03dffef108e5752fdcd5e8dba9b110a6fe4b1138779e13c65d22badd108ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-03-15T16:09:14Z","title_canon_sha256":"092851caf47bfbdfac8511224ba9bd340e8befb2b371b3467c453e8856b9cb6f"},"schema_version":"1.0","source":{"id":"2303.08723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.08723","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.08723v1","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.08723","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"D46USAXENGGF","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"pith_short_16","alias_value":"D46USAXENGGFOL25","created_at":"2026-07-05T05:51:36Z"},{"alias_kind":"pith_short_8","alias_value":"D46USAXE","created_at":"2026-07-05T05:51:36Z"}],"graph_snapshots":[{"event_id":"sha256:e77994eaf95b62b6e033127dd6f4d2e39885834ee63dd9b9a0ab349ba4d8403f","target":"graph","created_at":"2026-07-05T05:51: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.08723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a time series in $R^n$ with a piecewise constant mean and independent noises, we propose an exact dynamic programming algorithm to minimize a least square criterion with a multiscale penalty promoting well-spread changepoints. Such a penalty has been proposed in Verzelen et al. (2020), and it achieves optimal rates for changepoint detection and changepoint localization. Our proposed algorithm, named Ms.FPOP, extends functional pruning ideas of Rigaill (2015) and Maidstone et al. (2017) to multiscale penalties. For large signals, $n \\geq 10^5$, with relatively few real changepoints, Ms.FP","authors_text":"Arnaud Liehrmann, Guillem Rigaill","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-03-15T16:09:14Z","title":"Ms.FPOP: An Exact and Fast Segmentation Algorithm With a Multiscale Penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.08723","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:0834d068b6c1a6da3b42e9f758ca73184d5146ededcac8f34169db893608db26","target":"record","created_at":"2026-07-05T05:51: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":"e1c03dffef108e5752fdcd5e8dba9b110a6fe4b1138779e13c65d22badd108ae","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-03-15T16:09:14Z","title_canon_sha256":"092851caf47bfbdfac8511224ba9bd340e8befb2b371b3467c453e8856b9cb6f"},"schema_version":"1.0","source":{"id":"2303.08723","kind":"arxiv","version":1}},"canonical_sha256":"1f3d4902e4698c572f5d7bb99013750da1abd27e6fe81bf32fd307bd953972e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f3d4902e4698c572f5d7bb99013750da1abd27e6fe81bf32fd307bd953972e4","first_computed_at":"2026-07-05T05:51:36.695626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:51:36.695626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KuTiS62Lqwg9ob/iu4QWbUhCap4kUpvEHH7+N8BNGJEaguW1q95ezIMypoE7WPsK7vB+daWqojY7cGHTYNVeCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:51:36.696145Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.08723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0834d068b6c1a6da3b42e9f758ca73184d5146ededcac8f34169db893608db26","sha256:e77994eaf95b62b6e033127dd6f4d2e39885834ee63dd9b9a0ab349ba4d8403f"],"state_sha256":"ababaccabe441a0ec05712a53a40ad55136fe1027f0f0c301cae11b9c972c3f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtqPRi8GCR66FvUKbiUEDcrD0uqeGn4/cySBy4iOnfzFRpobx/cp2kxtNzX//5MsaUnIheilq5rNtOcoDL5FBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T14:25:21.354290Z","bundle_sha256":"a300d3e173a49f6c59ee1c79663bde13d17ef871f0e865126d41d8f72eacd6c5"}}