{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NDFUZJ4MLUHO2F6I5VGV6DBEHW","short_pith_number":"pith:NDFUZJ4M","schema_version":"1.0","canonical_sha256":"68cb4ca78c5d0eed17c8ed4d5f0c243db4a6a9074b0f0b6fdab0bb60e9e4d778","source":{"kind":"arxiv","id":"2402.01139","version":2},"attestation_state":"computed","paper":{"title":"Online conformal prediction with decaying step sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Anastasios N. Angelopoulos, Rina Foygel Barber, Stephen Bates","submitted_at":"2024-02-02T04:42:09Z","abstract_excerpt":"We introduce a method for online conformal prediction with decaying step sizes. Like previous methods, ours possesses a retrospective guarantee of coverage for arbitrary sequences. However, unlike previous methods, we can simultaneously estimate a population quantile when it exists. Our theory and experiments indicate substantially improved practical properties: in particular, when the distribution is stable, the coverage is close to the desired level for every time point, not just on average over the observed sequence."},"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":"2402.01139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-02-02T04:42:09Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"1b9aba198d4228d2d14516634cc3a6a0e07240889c3fc9c0d88843a79d2f729d","abstract_canon_sha256":"3273879d652ced55f81cef886310592cdc3c89f10dda1ef12a7cc349ebf8bf8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:00.493869Z","signature_b64":"nKJXBT2Y4S0yV8yqemLIHVLcDXUPbVdvocyMlQiu0MfRB3mKJZves9kz7gNRBinT9EKt9BjYYl0E81bzWOJRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cb4ca78c5d0eed17c8ed4d5f0c243db4a6a9074b0f0b6fdab0bb60e9e4d778","last_reissued_at":"2026-07-05T08:24:00.493333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:00.493333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online conformal prediction with decaying step sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Anastasios N. Angelopoulos, Rina Foygel Barber, Stephen Bates","submitted_at":"2024-02-02T04:42:09Z","abstract_excerpt":"We introduce a method for online conformal prediction with decaying step sizes. Like previous methods, ours possesses a retrospective guarantee of coverage for arbitrary sequences. However, unlike previous methods, we can simultaneously estimate a population quantile when it exists. Our theory and experiments indicate substantially improved practical properties: in particular, when the distribution is stable, the coverage is close to the desired level for every time point, not just on average over the observed sequence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01139","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/2402.01139/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":"2402.01139","created_at":"2026-07-05T08:24:00.493395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.01139v2","created_at":"2026-07-05T08:24:00.493395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01139","created_at":"2026-07-05T08:24:00.493395+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDFUZJ4MLUHO","created_at":"2026-07-05T08:24:00.493395+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDFUZJ4MLUHO2F6I","created_at":"2026-07-05T08:24:00.493395+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDFUZJ4M","created_at":"2026-07-05T08:24:00.493395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.04406","citing_title":"Decomposition-Based Modular Conformal Prediction for Two-Stage Modeling","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20515","citing_title":"Online Conformal Prediction with Corrupted Feedback","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12668","citing_title":"Online Conformal Prediction: Enforcing monotonicity via Online Optimization","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06116","citing_title":"Policy-Guided Stepwise Model Routing for Cost-Effective Reasoning","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW","json":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW.json","graph_json":"https://pith.science/api/pith-number/NDFUZJ4MLUHO2F6I5VGV6DBEHW/graph.json","events_json":"https://pith.science/api/pith-number/NDFUZJ4MLUHO2F6I5VGV6DBEHW/events.json","paper":"https://pith.science/paper/NDFUZJ4M"},"agent_actions":{"view_html":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW","download_json":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW.json","view_paper":"https://pith.science/paper/NDFUZJ4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.01139&json=true","fetch_graph":"https://pith.science/api/pith-number/NDFUZJ4MLUHO2F6I5VGV6DBEHW/graph.json","fetch_events":"https://pith.science/api/pith-number/NDFUZJ4MLUHO2F6I5VGV6DBEHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW/action/storage_attestation","attest_author":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW/action/author_attestation","sign_citation":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW/action/citation_signature","submit_replication":"https://pith.science/pith/NDFUZJ4MLUHO2F6I5VGV6DBEHW/action/replication_record"}},"created_at":"2026-07-05T08:24:00.493395+00:00","updated_at":"2026-07-05T08:24:00.493395+00:00"}