{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MH3R6333RF5HMG46565BSHPVJY","short_pith_number":"pith:MH3R6333","schema_version":"1.0","canonical_sha256":"61f71f6f7b897a761b9eefba191df54e085a96c57796600cb1565783e42f1fbd","source":{"kind":"arxiv","id":"2602.06267","version":2},"attestation_state":"computed","paper":{"title":"Conformal changepoint localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Rohan Hore","submitted_at":"2026-02-05T23:50:53Z","abstract_excerpt":"We study the problem of offline changepoint localization in a distribution-free setting. One observes a vector of data with a single changepoint, assuming that the data before and after the changepoint are i.i.d. (or more generally exchangeable) from arbitrary and unknown distributions. The goal is to produce a finite-sample confidence set for the index at which the change occurs without making any other assumptions. Existing methods often rely on parametric assumptions, tail conditions, or asymptotic approximations, or only produce point estimates. In contrast, our distribution-free algorithm"},"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":"2602.06267","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-02-05T23:50:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f716cf3754083c91a3a94b155ee8a5f0068b46e3d828dce2caefa577f1f1adfd","abstract_canon_sha256":"a52a392c0327e9f001a664ecec3df14283bda5f38e5e1b36ffcf3870ea70e2c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T00:24:35.969793Z","signature_b64":"T0Sle59lJehiyLMozwqMNBCZK9Xnw5dNU+v7OQOY2eIMVKWDk2ZUzUgnwH3aoK3MrvYgTy04CRGkRIlO5piHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f71f6f7b897a761b9eefba191df54e085a96c57796600cb1565783e42f1fbd","last_reissued_at":"2026-07-29T00:24:35.968851Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T00:24:35.968851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conformal changepoint localization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Rohan Hore","submitted_at":"2026-02-05T23:50:53Z","abstract_excerpt":"We study the problem of offline changepoint localization in a distribution-free setting. One observes a vector of data with a single changepoint, assuming that the data before and after the changepoint are i.i.d. (or more generally exchangeable) from arbitrary and unknown distributions. The goal is to produce a finite-sample confidence set for the index at which the change occurs without making any other assumptions. Existing methods often rely on parametric assumptions, tail conditions, or asymptotic approximations, or only produce point estimates. In contrast, our distribution-free algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.06267","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/2602.06267/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":"2602.06267","created_at":"2026-07-29T00:24:35.969287+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.06267v2","created_at":"2026-07-29T00:24:35.969287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.06267","created_at":"2026-07-29T00:24:35.969287+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH3R6333RF5H","created_at":"2026-07-29T00:24:35.969287+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH3R6333RF5HMG46","created_at":"2026-07-29T00:24:35.969287+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH3R6333","created_at":"2026-07-29T00:24:35.969287+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.01256","citing_title":"Distribution-free changepoint localization after sequential change detection","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21627","citing_title":"Distribution-free root cause analysis","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2411.11824","citing_title":"Theoretical Foundations of Conformal Prediction","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY","json":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY.json","graph_json":"https://pith.science/api/pith-number/MH3R6333RF5HMG46565BSHPVJY/graph.json","events_json":"https://pith.science/api/pith-number/MH3R6333RF5HMG46565BSHPVJY/events.json","paper":"https://pith.science/paper/MH3R6333"},"agent_actions":{"view_html":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY","download_json":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY.json","view_paper":"https://pith.science/paper/MH3R6333","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.06267&json=true","fetch_graph":"https://pith.science/api/pith-number/MH3R6333RF5HMG46565BSHPVJY/graph.json","fetch_events":"https://pith.science/api/pith-number/MH3R6333RF5HMG46565BSHPVJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY/action/storage_attestation","attest_author":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY/action/author_attestation","sign_citation":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY/action/citation_signature","submit_replication":"https://pith.science/pith/MH3R6333RF5HMG46565BSHPVJY/action/replication_record"}},"created_at":"2026-07-29T00:24:35.969287+00:00","updated_at":"2026-07-29T00:24:35.969287+00:00"}