{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HSVQIMDRBJ7L573ZD7BEPJYZ5B","short_pith_number":"pith:HSVQIMDR","schema_version":"1.0","canonical_sha256":"3cab0430710a7ebeff791fc247a719e87e9ea405407f430520183b5cd2fc60e2","source":{"kind":"arxiv","id":"2306.09555","version":2},"attestation_state":"computed","paper":{"title":"Geometric-Based Pruning Rules For Change Point Detection in Multiple Independent Time Series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"Guillem Rigaill, Liudmila Pishchagina, Vincent Runge","submitted_at":"2023-06-15T23:56:39Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2306.09555","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-06-15T23:56:39Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"4ff18f4050911f76809f1bac94b34f5c808dba18bfe26113bf27cfb5ded80a5e","abstract_canon_sha256":"4bfc13bfbe3dded148818bf225834cb83a18db8460b2ee75a6237b4df0dbd7dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:07.164046Z","signature_b64":"037UeZYGaAqCXX9cWeDeQroJ1mqkjuDPGNxRCLkvoaFQlzjdGgTgMjkdCeV7dTzYGKwoTmz83dSk9sRJas2gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cab0430710a7ebeff791fc247a719e87e9ea405407f430520183b5cd2fc60e2","last_reissued_at":"2026-07-05T08:20:07.163602Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:07.163602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric-Based Pruning Rules For Change Point Detection in Multiple Independent Time Series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"Guillem Rigaill, Liudmila Pishchagina, Vincent Runge","submitted_at":"2023-06-15T23:56:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09555","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/2306.09555/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.09555","created_at":"2026-07-05T08:20:07.163661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.09555v2","created_at":"2026-07-05T08:20:07.163661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09555","created_at":"2026-07-05T08:20:07.163661+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSVQIMDRBJ7L","created_at":"2026-07-05T08:20:07.163661+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSVQIMDRBJ7L573Z","created_at":"2026-07-05T08:20:07.163661+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSVQIMDR","created_at":"2026-07-05T08:20:07.163661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B","json":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B.json","graph_json":"https://pith.science/api/pith-number/HSVQIMDRBJ7L573ZD7BEPJYZ5B/graph.json","events_json":"https://pith.science/api/pith-number/HSVQIMDRBJ7L573ZD7BEPJYZ5B/events.json","paper":"https://pith.science/paper/HSVQIMDR"},"agent_actions":{"view_html":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B","download_json":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B.json","view_paper":"https://pith.science/paper/HSVQIMDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.09555&json=true","fetch_graph":"https://pith.science/api/pith-number/HSVQIMDRBJ7L573ZD7BEPJYZ5B/graph.json","fetch_events":"https://pith.science/api/pith-number/HSVQIMDRBJ7L573ZD7BEPJYZ5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B/action/storage_attestation","attest_author":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B/action/author_attestation","sign_citation":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B/action/citation_signature","submit_replication":"https://pith.science/pith/HSVQIMDRBJ7L573ZD7BEPJYZ5B/action/replication_record"}},"created_at":"2026-07-05T08:20:07.163661+00:00","updated_at":"2026-07-05T08:20:07.163661+00:00"}