{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6B7UCXO4VWULU6KTPT3CW6VOCA","short_pith_number":"pith:6B7UCXO4","schema_version":"1.0","canonical_sha256":"f07f415ddcada8ba79537cf62b7aae10323125abfded7bb2e02b855c03d47016","source":{"kind":"arxiv","id":"2106.09848","version":2},"attestation_state":"computed","paper":{"title":"PAC Prediction Sets Under Covariate Shift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Edgar Dobriban, Insup Lee, Osbert Bastani, Sangdon Park","submitted_at":"2021-06-17T23:28:42Z","abstract_excerpt":"An important challenge facing modern machine learning is how to rigorously quantify the uncertainty of model predictions. Conveying uncertainty is especially important when there are changes to the underlying data distribution that might invalidate the predictive model. Yet, most existing uncertainty quantification algorithms break down in the presence of such shifts. We propose a novel approach that addresses this challenge by constructing \\emph{probably approximately correct (PAC)} prediction sets in the presence of covariate shift. Our approach focuses on the setting where there is a covari"},"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":"2106.09848","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-17T23:28:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e6ebb34858a8c6218979dc1b73cbba14fa6144192fcf30d45c9c338eace6d2df","abstract_canon_sha256":"d5186ac7025be2753d07afd2219fdf04410eecf35e8e057c645f2eb8f9c33928"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:05:31.902783Z","signature_b64":"ppI1PR3tIQ55MrWf0pbfJAtsltbzTBzjWG6zWFrFTYZJ2/Btg4EeHx2FsgD3KpQ57qlUxaAdTXMsZ25buHwPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f07f415ddcada8ba79537cf62b7aae10323125abfded7bb2e02b855c03d47016","last_reissued_at":"2026-07-05T04:05:31.902269Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:05:31.902269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PAC Prediction Sets Under Covariate Shift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Edgar Dobriban, Insup Lee, Osbert Bastani, Sangdon Park","submitted_at":"2021-06-17T23:28:42Z","abstract_excerpt":"An important challenge facing modern machine learning is how to rigorously quantify the uncertainty of model predictions. Conveying uncertainty is especially important when there are changes to the underlying data distribution that might invalidate the predictive model. Yet, most existing uncertainty quantification algorithms break down in the presence of such shifts. We propose a novel approach that addresses this challenge by constructing \\emph{probably approximately correct (PAC)} prediction sets in the presence of covariate shift. Our approach focuses on the setting where there is a covari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09848","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/2106.09848/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":"2106.09848","created_at":"2026-07-05T04:05:31.902339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.09848v2","created_at":"2026-07-05T04:05:31.902339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09848","created_at":"2026-07-05T04:05:31.902339+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B7UCXO4VWUL","created_at":"2026-07-05T04:05:31.902339+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B7UCXO4VWULU6KT","created_at":"2026-07-05T04:05:31.902339+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B7UCXO4","created_at":"2026-07-05T04:05:31.902339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08551","citing_title":"Enhanced localized conformal prediction with imperfect auxiliary information","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18812","citing_title":"PASC: Pipeline-Aware Conformal Prediction with Joint Coverage Guarantees for Multi-Stage NLP and LLM Pipelines","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17934","citing_title":"Conditional Predictive Inference for General Structured Data with Group Symmetries","ref_index":118,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02072","citing_title":"Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05591","citing_title":"In-Context Positive-Unlabeled Learning","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA","json":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA.json","graph_json":"https://pith.science/api/pith-number/6B7UCXO4VWULU6KTPT3CW6VOCA/graph.json","events_json":"https://pith.science/api/pith-number/6B7UCXO4VWULU6KTPT3CW6VOCA/events.json","paper":"https://pith.science/paper/6B7UCXO4"},"agent_actions":{"view_html":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA","download_json":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA.json","view_paper":"https://pith.science/paper/6B7UCXO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.09848&json=true","fetch_graph":"https://pith.science/api/pith-number/6B7UCXO4VWULU6KTPT3CW6VOCA/graph.json","fetch_events":"https://pith.science/api/pith-number/6B7UCXO4VWULU6KTPT3CW6VOCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA/action/storage_attestation","attest_author":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA/action/author_attestation","sign_citation":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA/action/citation_signature","submit_replication":"https://pith.science/pith/6B7UCXO4VWULU6KTPT3CW6VOCA/action/replication_record"}},"created_at":"2026-07-05T04:05:31.902339+00:00","updated_at":"2026-07-05T04:05:31.902339+00:00"}