{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:R6AKCZOGIFS2CH7EPFVO3MLR56","short_pith_number":"pith:R6AKCZOG","schema_version":"1.0","canonical_sha256":"8f80a165c64165a11fe4796aedb171efabaa844bb7e829d8d41b658c3cd88fd9","source":{"kind":"arxiv","id":"2402.05203","version":2},"attestation_state":"computed","paper":{"title":"Bellman Conformal Inference: Calibrating Prediction Intervals For Time Series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Cand\\`es, Lihua Lei, Zitong Yang","submitted_at":"2024-02-07T19:15:33Z","abstract_excerpt":"We introduce Bellman Conformal Inference (BCI), a framework that wraps around any time series forecasting models and provides approximately calibrated prediction intervals. Unlike existing methods, BCI is able to leverage multi-step ahead forecasts and explicitly optimize the average interval lengths by solving a one-dimensional stochastic control problem (SCP) at each time step. In particular, we use the dynamic programming algorithm to find the optimal policy for the SCP. We prove that BCI achieves long-term coverage under arbitrary distribution shifts and temporal dependence, even with poor"},"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.05203","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-07T19:15:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b848fdaaf858eca3fcee1675047ea19d6e755cc8860e0a525ad075f3c95cd72a","abstract_canon_sha256":"35f8063072ab74f4535f5a9475eb7e9ae6f45f3e9fdd204b8e77c99ace08764d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:15.350502Z","signature_b64":"6oeorTCKEDu0vCoDdq4gIVlVgx09jU60VwMUmQXZgSty2EzKuYDkM2VRQLIOsj+kFXMiDBA+bQSRwCKkfp/8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f80a165c64165a11fe4796aedb171efabaa844bb7e829d8d41b658c3cd88fd9","last_reissued_at":"2026-07-05T07:43:15.349988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:15.349988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bellman Conformal Inference: Calibrating Prediction Intervals For Time Series","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Cand\\`es, Lihua Lei, Zitong Yang","submitted_at":"2024-02-07T19:15:33Z","abstract_excerpt":"We introduce Bellman Conformal Inference (BCI), a framework that wraps around any time series forecasting models and provides approximately calibrated prediction intervals. Unlike existing methods, BCI is able to leverage multi-step ahead forecasts and explicitly optimize the average interval lengths by solving a one-dimensional stochastic control problem (SCP) at each time step. In particular, we use the dynamic programming algorithm to find the optimal policy for the SCP. We prove that BCI achieves long-term coverage under arbitrary distribution shifts and temporal dependence, even with poor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05203","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.05203/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.05203","created_at":"2026-07-05T07:43:15.350053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05203v2","created_at":"2026-07-05T07:43:15.350053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05203","created_at":"2026-07-05T07:43:15.350053+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6AKCZOGIFS2","created_at":"2026-07-05T07:43:15.350053+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6AKCZOGIFS2CH7E","created_at":"2026-07-05T07:43:15.350053+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6AKCZOG","created_at":"2026-07-05T07:43:15.350053+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24463","citing_title":"Cost-Aware Adaptive Conformal Inference for Runtime Assurance in Dynamic Environments","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00419","citing_title":"Parameter-Free and Group Conditional Online Conformal Prediction","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2512.23694","citing_title":"Bellman Calibration for $V$-Learning in Offline Reinforcement Learning","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56","json":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56.json","graph_json":"https://pith.science/api/pith-number/R6AKCZOGIFS2CH7EPFVO3MLR56/graph.json","events_json":"https://pith.science/api/pith-number/R6AKCZOGIFS2CH7EPFVO3MLR56/events.json","paper":"https://pith.science/paper/R6AKCZOG"},"agent_actions":{"view_html":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56","download_json":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56.json","view_paper":"https://pith.science/paper/R6AKCZOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05203&json=true","fetch_graph":"https://pith.science/api/pith-number/R6AKCZOGIFS2CH7EPFVO3MLR56/graph.json","fetch_events":"https://pith.science/api/pith-number/R6AKCZOGIFS2CH7EPFVO3MLR56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56/action/storage_attestation","attest_author":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56/action/author_attestation","sign_citation":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56/action/citation_signature","submit_replication":"https://pith.science/pith/R6AKCZOGIFS2CH7EPFVO3MLR56/action/replication_record"}},"created_at":"2026-07-05T07:43:15.350053+00:00","updated_at":"2026-07-05T07:43:15.350053+00:00"}