{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6UM7MYT6JA5UFOZ7ID6HHWCZFU","short_pith_number":"pith:6UM7MYT6","schema_version":"1.0","canonical_sha256":"f519f6627e483b42bb3f40fc73d8592d01de5fb5a8d05fa466880810b1296a08","source":{"kind":"arxiv","id":"2103.03323","version":4},"attestation_state":"computed","paper":{"title":"Distribution-free uncertainty quantification for classification under label shift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aaditya Ramdas, Aleksandr Podkopaev","submitted_at":"2021-03-04T20:51:03Z","abstract_excerpt":"Trustworthy deployment of ML models requires a proper measure of uncertainty, especially in safety-critical applications. We focus on uncertainty quantification (UQ) for classification problems via two avenues -- prediction sets using conformal prediction and calibration of probabilistic predictors by post-hoc binning -- since these possess distribution-free guarantees for i.i.d. data. Two common ways of generalizing beyond the i.i.d. setting include handling covariate and label shift. Within the context of distribution-free UQ, the former has already received attention, but not the latter. It"},"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":"2103.03323","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-03-04T20:51:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6353867a5ff2ea9d2a48a1c2070a80d5af726287b2bee420d6b6c4eb38867681","abstract_canon_sha256":"4b1134aa212163d2b81b25c70527226eb6bdf93b7a1c205af099736876221d02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:54.310276Z","signature_b64":"I8k2ePSnPdXKmLFmWE4zmqXcIiJH72lwAZoiJaZdQMvS+QRz4qLvHwg7Cj6gHHyGzwTdnGXBCf4/zSbftdPvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f519f6627e483b42bb3f40fc73d8592d01de5fb5a8d05fa466880810b1296a08","last_reissued_at":"2026-07-05T02:55:54.309873Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:54.309873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distribution-free uncertainty quantification for classification under label shift","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aaditya Ramdas, Aleksandr Podkopaev","submitted_at":"2021-03-04T20:51:03Z","abstract_excerpt":"Trustworthy deployment of ML models requires a proper measure of uncertainty, especially in safety-critical applications. We focus on uncertainty quantification (UQ) for classification problems via two avenues -- prediction sets using conformal prediction and calibration of probabilistic predictors by post-hoc binning -- since these possess distribution-free guarantees for i.i.d. data. Two common ways of generalizing beyond the i.i.d. setting include handling covariate and label shift. Within the context of distribution-free UQ, the former has already received attention, but not the latter. It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03323","kind":"arxiv","version":4},"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/2103.03323/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":"2103.03323","created_at":"2026-07-05T02:55:54.309928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03323v4","created_at":"2026-07-05T02:55:54.309928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03323","created_at":"2026-07-05T02:55:54.309928+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UM7MYT6JA5U","created_at":"2026-07-05T02:55:54.309928+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UM7MYT6JA5UFOZ7","created_at":"2026-07-05T02:55:54.309928+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UM7MYT6","created_at":"2026-07-05T02:55:54.309928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08857","citing_title":"RareCP: Regime-Aware Retrieval for Efficient Conformal Prediction","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU","json":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU.json","graph_json":"https://pith.science/api/pith-number/6UM7MYT6JA5UFOZ7ID6HHWCZFU/graph.json","events_json":"https://pith.science/api/pith-number/6UM7MYT6JA5UFOZ7ID6HHWCZFU/events.json","paper":"https://pith.science/paper/6UM7MYT6"},"agent_actions":{"view_html":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU","download_json":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU.json","view_paper":"https://pith.science/paper/6UM7MYT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03323&json=true","fetch_graph":"https://pith.science/api/pith-number/6UM7MYT6JA5UFOZ7ID6HHWCZFU/graph.json","fetch_events":"https://pith.science/api/pith-number/6UM7MYT6JA5UFOZ7ID6HHWCZFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU/action/storage_attestation","attest_author":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU/action/author_attestation","sign_citation":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU/action/citation_signature","submit_replication":"https://pith.science/pith/6UM7MYT6JA5UFOZ7ID6HHWCZFU/action/replication_record"}},"created_at":"2026-07-05T02:55:54.309928+00:00","updated_at":"2026-07-05T02:55:54.309928+00:00"}