{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CDI5UTGMP76PZ5VCXWSLZCOS45","short_pith_number":"pith:CDI5UTGM","schema_version":"1.0","canonical_sha256":"10d1da4ccc7ffcfcf6a2bda4bc89d2e76466e56bd53747cacc6e96cdcc69a8b9","source":{"kind":"arxiv","id":"2605.12668","version":1},"attestation_state":"computed","paper":{"title":"Online Conformal Prediction: Enforcing monotonicity via Online Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Online conformal prediction methods produce nested sets across coverage levels by using low-regret online optimization to control quantile errors.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Eduardo Ochoa Rivera","submitted_at":"2026-05-12T19:18:43Z","abstract_excerpt":"Conformal prediction provides a principled framework for uncertainty quantification with finite-sample coverage guarantees. While recent work has extended conformal prediction to online and sequential settings, existing methods typically focus on a single coverage level and do not ensure consistency across multiple confidence levels. In many real-world applications, such as weather forecasting, macroeconomic prediction, and risk management, different users operate under heterogeneous risk tolerances and require calibrated uncertainty estimates across a range of coverage levels. In such setting"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.12668","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-12T19:18:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"83cf5893574120c7c672b5ece5c463edfdd1d2a0a2f4b739b1cfa1db0cecd25d","abstract_canon_sha256":"104d0b6723736efeb5d3c6e9b562f2a89326931c4abc1106790ec16b41e3e42e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:50.290964Z","signature_b64":"cO/tUOubzENo+uPH7v4Kuy8/BtQC+Crd3kn629Z9gzOlJn6Zq9/E4VPjHCSDuCYo7lH2Ji4h9ZiaNW9e6QtoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10d1da4ccc7ffcfcf6a2bda4bc89d2e76466e56bd53747cacc6e96cdcc69a8b9","last_reissued_at":"2026-05-18T03:09:50.290047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:50.290047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Conformal Prediction: Enforcing monotonicity via Online Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Online conformal prediction methods produce nested sets across coverage levels by using low-regret online optimization to control quantile errors.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ambuj Tewari, Eduardo Ochoa Rivera","submitted_at":"2026-05-12T19:18:43Z","abstract_excerpt":"Conformal prediction provides a principled framework for uncertainty quantification with finite-sample coverage guarantees. While recent work has extended conformal prediction to online and sequential settings, existing methods typically focus on a single coverage level and do not ensure consistency across multiple confidence levels. In many real-world applications, such as weather forecasting, macroeconomic prediction, and risk management, different users operate under heterogeneous risk tolerances and require calibrated uncertainty estimates across a range of coverage levels. In such setting"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our approaches leverage an online optimization perspective with small regret that translates to quantile estimation error control while enforcing nestedness of prediction sets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the online optimization framework with small regret directly enforces both the coverage guarantees and the strict nestedness of prediction sets across levels without post-hoc adjustments or loss of efficiency.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Two novel online conformal prediction algorithms enforce nested prediction sets across coverage levels using online optimization with regret bounds for quantile error control.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Online conformal prediction methods produce nested sets across coverage levels by using low-regret online optimization to control quantile errors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"68e8542d14e8cdb142872e31ae14d98d81dffd16ac6b513d6ec2683fb93fad42"},"source":{"id":"2605.12668","kind":"arxiv","version":1},"verdict":{"id":"6a6d4e71-3afd-4cac-beaf-9e72131e8370","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:02:01.287080Z","strongest_claim":"Our approaches leverage an online optimization perspective with small regret that translates to quantile estimation error control while enforcing nestedness of prediction sets.","one_line_summary":"Two novel online conformal prediction algorithms enforce nested prediction sets across coverage levels using online optimization with regret bounds for quantile error control.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the online optimization framework with small regret directly enforces both the coverage guarantees and the strict nestedness of prediction sets across levels without post-hoc adjustments or loss of efficiency.","pith_extraction_headline":"Online conformal prediction methods produce nested sets across coverage levels by using low-regret online optimization to control quantile errors."},"references":{"count":29,"sample":[{"doi":"","year":null,"title":"The Thirty-ninth Annual Conference on Neural Information Processing Systems , year=","work_id":"afcf6681-617d-4e87-9635-ff5e4552cb84","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"European conference on machine learning , pages=","work_id":"f691f1cf-e556-4ba0-818d-31916634d675","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"Algorithmic learning in a random world , author=. 2005 , publisher=","work_id":"31470f85-2f7f-4117-905b-da888e9ae129","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"A Tutorial on Conformal Prediction. , author=. Journal of Machine Learning Research , volume=","work_id":"0f562caf-c2b9-4167-b0f9-9533b9395e5e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"The Annals of Statistics , volume=","work_id":"d51fa001-ea90-430d-9501-526dbd09809e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":29,"snapshot_sha256":"5a05573b473c336bf51def3d951a7cf599592b436e043fa2321fd9a0e83f6752","internal_anchors":1},"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":"2605.12668","created_at":"2026-05-18T03:09:50.290217+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12668v1","created_at":"2026-05-18T03:09:50.290217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12668","created_at":"2026-05-18T03:09:50.290217+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDI5UTGMP76P","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDI5UTGMP76PZ5VC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDI5UTGM","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45","json":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45.json","graph_json":"https://pith.science/api/pith-number/CDI5UTGMP76PZ5VCXWSLZCOS45/graph.json","events_json":"https://pith.science/api/pith-number/CDI5UTGMP76PZ5VCXWSLZCOS45/events.json","paper":"https://pith.science/paper/CDI5UTGM"},"agent_actions":{"view_html":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45","download_json":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45.json","view_paper":"https://pith.science/paper/CDI5UTGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12668&json=true","fetch_graph":"https://pith.science/api/pith-number/CDI5UTGMP76PZ5VCXWSLZCOS45/graph.json","fetch_events":"https://pith.science/api/pith-number/CDI5UTGMP76PZ5VCXWSLZCOS45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45/action/storage_attestation","attest_author":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45/action/author_attestation","sign_citation":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45/action/citation_signature","submit_replication":"https://pith.science/pith/CDI5UTGMP76PZ5VCXWSLZCOS45/action/replication_record"}},"created_at":"2026-05-18T03:09:50.290217+00:00","updated_at":"2026-05-18T03:09:50.290217+00:00"}