{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UJYV5HOM3UCYVTPACKW47QQFWE","short_pith_number":"pith:UJYV5HOM","schema_version":"1.0","canonical_sha256":"a2715e9dccdd058acde012adcfc205b106a55533163a9aba1a55b748aa841573","source":{"kind":"arxiv","id":"2208.08401","version":3},"attestation_state":"computed","paper":{"title":"Conformal Inference for Online Prediction with Arbitrary Distribution Shifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ME","authors_text":"Emmanuel Cand\\`es, Isaac Gibbs","submitted_at":"2022-08-17T16:51:12Z","abstract_excerpt":"We consider the problem of forming prediction sets in an online setting where the distribution generating the data is allowed to vary over time. Previous approaches to this problem suffer from over-weighting historical data and thus may fail to quickly react to the underlying dynamics. Here we correct this issue and develop a novel procedure with provably small regret over all local time intervals of a given width. We achieve this by modifying the adaptive conformal inference (ACI) algorithm of Gibbs and Cand\\`{e}s (2021) to contain an additional step in which the step-size parameter of ACI's "},"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":"2208.08401","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2022-08-17T16:51:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"394af3418ec7e4fd3efb45fcdf3db100b0bc03f1c073792d418889dbb19b0cfd","abstract_canon_sha256":"8be449c838e3073b928c26995229141c40118c6d4ffa8180f02d6216e96610a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:57:38.249554Z","signature_b64":"TxvPG4uemiMNk3+NaRrQEc09xu+TXTF/nzS/ZJkvYnJyzUPj1GOqsApPZ3JWyPFmIxnpwGdmSG0sLIATe9t5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2715e9dccdd058acde012adcfc205b106a55533163a9aba1a55b748aa841573","last_reissued_at":"2026-07-05T06:57:38.249027Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:57:38.249027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conformal Inference for Online Prediction with Arbitrary Distribution Shifts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ME","authors_text":"Emmanuel Cand\\`es, Isaac Gibbs","submitted_at":"2022-08-17T16:51:12Z","abstract_excerpt":"We consider the problem of forming prediction sets in an online setting where the distribution generating the data is allowed to vary over time. Previous approaches to this problem suffer from over-weighting historical data and thus may fail to quickly react to the underlying dynamics. Here we correct this issue and develop a novel procedure with provably small regret over all local time intervals of a given width. We achieve this by modifying the adaptive conformal inference (ACI) algorithm of Gibbs and Cand\\`{e}s (2021) to contain an additional step in which the step-size parameter of ACI's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.08401","kind":"arxiv","version":3},"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/2208.08401/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":"2208.08401","created_at":"2026-07-05T06:57:38.249088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.08401v3","created_at":"2026-07-05T06:57:38.249088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.08401","created_at":"2026-07-05T06:57:38.249088+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJYV5HOM3UCY","created_at":"2026-07-05T06:57:38.249088+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJYV5HOM3UCYVTPA","created_at":"2026-07-05T06:57:38.249088+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJYV5HOM","created_at":"2026-07-05T06:57:38.249088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24696","citing_title":"CALIBURN: Operationally Calibrated Streaming Intrusion Detection with Regime-Dependent Conformal Risk Control","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08857","citing_title":"RareCP: Regime-Aware Retrieval for Efficient Conformal Prediction","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2107.07511","citing_title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE","json":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE.json","graph_json":"https://pith.science/api/pith-number/UJYV5HOM3UCYVTPACKW47QQFWE/graph.json","events_json":"https://pith.science/api/pith-number/UJYV5HOM3UCYVTPACKW47QQFWE/events.json","paper":"https://pith.science/paper/UJYV5HOM"},"agent_actions":{"view_html":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE","download_json":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE.json","view_paper":"https://pith.science/paper/UJYV5HOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.08401&json=true","fetch_graph":"https://pith.science/api/pith-number/UJYV5HOM3UCYVTPACKW47QQFWE/graph.json","fetch_events":"https://pith.science/api/pith-number/UJYV5HOM3UCYVTPACKW47QQFWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE/action/storage_attestation","attest_author":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE/action/author_attestation","sign_citation":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE/action/citation_signature","submit_replication":"https://pith.science/pith/UJYV5HOM3UCYVTPACKW47QQFWE/action/replication_record"}},"created_at":"2026-07-05T06:57:38.249088+00:00","updated_at":"2026-07-05T06:57:38.249088+00:00"}