{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HSVQIMDRBJ7L573ZD7BEPJYZ5B","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":"4bfc13bfbe3dded148818bf225834cb83a18db8460b2ee75a6237b4df0dbd7dc","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-06-15T23:56:39Z","title_canon_sha256":"4ff18f4050911f76809f1bac94b34f5c808dba18bfe26113bf27cfb5ded80a5e"},"schema_version":"1.0","source":{"id":"2306.09555","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.09555","created_at":"2026-07-05T08:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"2306.09555v2","created_at":"2026-07-05T08:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09555","created_at":"2026-07-05T08:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"HSVQIMDRBJ7L","created_at":"2026-07-05T08:20:07Z"},{"alias_kind":"pith_short_16","alias_value":"HSVQIMDRBJ7L573Z","created_at":"2026-07-05T08:20:07Z"},{"alias_kind":"pith_short_8","alias_value":"HSVQIMDR","created_at":"2026-07-05T08:20:07Z"}],"graph_snapshots":[{"event_id":"sha256:0f21e460fda46ce71cd1ca58c9cb052a5bfd5dcaa47a32deafd11816de91153f","target":"graph","created_at":"2026-07-05T08:20:07Z","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/2306.09555/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of detecting multiple changes in multiple independent time series. The search for the best segmentation can be expressed as a minimization problem over a given cost function. We focus on dynamic programming algorithms that solve this problem exactly. When the number of changes is proportional to data length, an inequality-based pruning rule encoded in the PELT algorithm leads to a linear time complexity. Another type of pruning, called functional pruning, gives a close-to-linear time complexity whatever the number of changes, but only for the analysis of univariate time","authors_text":"Guillem Rigaill, Liudmila Pishchagina, Vincent Runge","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-06-15T23:56:39Z","title":"Geometric-Based Pruning Rules For Change Point Detection in Multiple Independent Time Series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09555","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:ab031e2b831ab6bb2ea3d68bd4a656bb27ce6dd5802ab0b8e911b05444c4806c","target":"record","created_at":"2026-07-05T08:20:07Z","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":"4bfc13bfbe3dded148818bf225834cb83a18db8460b2ee75a6237b4df0dbd7dc","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-06-15T23:56:39Z","title_canon_sha256":"4ff18f4050911f76809f1bac94b34f5c808dba18bfe26113bf27cfb5ded80a5e"},"schema_version":"1.0","source":{"id":"2306.09555","kind":"arxiv","version":2}},"canonical_sha256":"3cab0430710a7ebeff791fc247a719e87e9ea405407f430520183b5cd2fc60e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cab0430710a7ebeff791fc247a719e87e9ea405407f430520183b5cd2fc60e2","first_computed_at":"2026-07-05T08:20:07.163602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:07.163602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"037UeZYGaAqCXX9cWeDeQroJ1mqkjuDPGNxRCLkvoaFQlzjdGgTgMjkdCeV7dTzYGKwoTmz83dSk9sRJas2gDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:07.164046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.09555","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab031e2b831ab6bb2ea3d68bd4a656bb27ce6dd5802ab0b8e911b05444c4806c","sha256:0f21e460fda46ce71cd1ca58c9cb052a5bfd5dcaa47a32deafd11816de91153f"],"state_sha256":"034e8f1858ba82e601e27189b9f38cd63be8aa7ac9bd0152d2fd2f6acff3a6f3"}