{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:623S6HIGYRXOF7HBEDVYJNP7ZJ","short_pith_number":"pith:623S6HIG","schema_version":"1.0","canonical_sha256":"f6b72f1d06c46ee2fce120eb84b5ffca573d39bebad054f9fe8f2118a871c94f","source":{"kind":"arxiv","id":"2508.13362","version":2},"attestation_state":"computed","paper":{"title":"Optimization-based Online Conformal Prediction for Multi-step Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Rodr\\'iguez, Daniel Menacho, Ruipu Li","submitted_at":"2025-08-18T21:14:07Z","abstract_excerpt":"Conformal prediction (CP) is well-suited for uncertainty quantification in time series forecasting due to its distribution-free coverage guarantees. However, existing multi-step methods often struggle to balance coverage validity with efficiency: they either calibrate horizons independently, ignoring temporal correlations, or enforce strict simultaneous coverage, resulting in overly conservative intervals. In this work, we propose O2CP: Optimization-based Online Conformal Prediction, a unified framework for online conformal prediction that explicitly models multi-step error dependencies withou"},"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":"2508.13362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-18T21:14:07Z","cross_cats_sorted":[],"title_canon_sha256":"7e59bc710cd8b085940746a4802600cf09a1ff107de560c1d1afbba68b24991f","abstract_canon_sha256":"78c1120f4aabb5c321af85b7f57dcbff375e77e4c04536e458a348d24724573c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T00:08:25.566079Z","signature_b64":"hlBKqn0Y01uslqrVh3H5MCcMIqGQsMNNSWi3L0jE9FMO3P2ufvaTGlUGbQhq0B5gZxZQzKCT1bNpPuu2VylZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6b72f1d06c46ee2fce120eb84b5ffca573d39bebad054f9fe8f2118a871c94f","last_reissued_at":"2026-06-10T00:08:25.565397Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T00:08:25.565397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization-based Online Conformal Prediction for Multi-step Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Rodr\\'iguez, Daniel Menacho, Ruipu Li","submitted_at":"2025-08-18T21:14:07Z","abstract_excerpt":"Conformal prediction (CP) is well-suited for uncertainty quantification in time series forecasting due to its distribution-free coverage guarantees. However, existing multi-step methods often struggle to balance coverage validity with efficiency: they either calibrate horizons independently, ignoring temporal correlations, or enforce strict simultaneous coverage, resulting in overly conservative intervals. In this work, we propose O2CP: Optimization-based Online Conformal Prediction, a unified framework for online conformal prediction that explicitly models multi-step error dependencies withou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.13362","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/2508.13362/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":"2508.13362","created_at":"2026-06-10T00:08:25.565471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.13362v2","created_at":"2026-06-10T00:08:25.565471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.13362","created_at":"2026-06-10T00:08:25.565471+00:00"},{"alias_kind":"pith_short_12","alias_value":"623S6HIGYRXO","created_at":"2026-06-10T00:08:25.565471+00:00"},{"alias_kind":"pith_short_16","alias_value":"623S6HIGYRXOF7HB","created_at":"2026-06-10T00:08:25.565471+00:00"},{"alias_kind":"pith_short_8","alias_value":"623S6HIG","created_at":"2026-06-10T00:08:25.565471+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.04375","citing_title":"Experiment-as-Code Labs: A Declarative Stack for AI-Driven Scientific Discovery","ref_index":80,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04375","citing_title":"Experiment-as-Code Labs: A Declarative Stack for AI-Driven Scientific Discovery","ref_index":80,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ","json":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ.json","graph_json":"https://pith.science/api/pith-number/623S6HIGYRXOF7HBEDVYJNP7ZJ/graph.json","events_json":"https://pith.science/api/pith-number/623S6HIGYRXOF7HBEDVYJNP7ZJ/events.json","paper":"https://pith.science/paper/623S6HIG"},"agent_actions":{"view_html":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ","download_json":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ.json","view_paper":"https://pith.science/paper/623S6HIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.13362&json=true","fetch_graph":"https://pith.science/api/pith-number/623S6HIGYRXOF7HBEDVYJNP7ZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/623S6HIGYRXOF7HBEDVYJNP7ZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ/action/storage_attestation","attest_author":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ/action/author_attestation","sign_citation":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ/action/citation_signature","submit_replication":"https://pith.science/pith/623S6HIGYRXOF7HBEDVYJNP7ZJ/action/replication_record"}},"created_at":"2026-06-10T00:08:25.565471+00:00","updated_at":"2026-06-10T00:08:25.565471+00:00"}