{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Z3XOVXV43L3AHLVZ5D6J7HSWHV","short_pith_number":"pith:Z3XOVXV4","schema_version":"1.0","canonical_sha256":"ceeeeadebcdaf603aeb9e8fc9f9e563d582522966a71f9f112f064c0c4638fc7","source":{"kind":"arxiv","id":"2506.20173","version":1},"attestation_state":"computed","paper":{"title":"Valid Selection among Conformal Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ME","stat.OT"],"primary_cat":"stat.ML","authors_text":"Aymeric Dieuleveut, Liviu Aolaritei, Mahmoud Hegazy, Michael I. Jordan","submitted_at":"2025-06-25T06:59:55Z","abstract_excerpt":"Conformal prediction offers a distribution-free framework for constructing prediction sets with coverage guarantees. In practice, multiple valid conformal prediction sets may be available, arising from different models or methodologies. However, selecting the most desirable set, such as the smallest, can invalidate the coverage guarantees. To address this challenge, we propose a stability-based approach that ensures coverage for the selected prediction set. We extend our results to the online conformal setting, propose several refinements in settings where additional structure is available, an"},"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":"2506.20173","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-06-25T06:59:55Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ME","stat.OT"],"title_canon_sha256":"c7ecbaf5b8c3fb3e4bf2df5733478b073275ba2bd10177db21eae1eb1d0fb01b","abstract_canon_sha256":"aabdd78c644038d042c7a4a67a39dee39bd088755344636086fdf9da8916aea2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:01.494865Z","signature_b64":"qTd30W1zRpMmHHO+3g53Smb2G7ITMxOGBNtytn12OwBekn7SUzb3lTBw6GtBoUQ/NWULnn+BZBaAFgskXZwPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceeeeadebcdaf603aeb9e8fc9f9e563d582522966a71f9f112f064c0c4638fc7","last_reissued_at":"2026-07-05T11:27:01.494353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:01.494353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Valid Selection among Conformal Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ME","stat.OT"],"primary_cat":"stat.ML","authors_text":"Aymeric Dieuleveut, Liviu Aolaritei, Mahmoud Hegazy, Michael I. Jordan","submitted_at":"2025-06-25T06:59:55Z","abstract_excerpt":"Conformal prediction offers a distribution-free framework for constructing prediction sets with coverage guarantees. In practice, multiple valid conformal prediction sets may be available, arising from different models or methodologies. However, selecting the most desirable set, such as the smallest, can invalidate the coverage guarantees. To address this challenge, we propose a stability-based approach that ensures coverage for the selected prediction set. We extend our results to the online conformal setting, propose several refinements in settings where additional structure is available, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20173","kind":"arxiv","version":1},"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/2506.20173/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":"2506.20173","created_at":"2026-07-05T11:27:01.494411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20173v1","created_at":"2026-07-05T11:27:01.494411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20173","created_at":"2026-07-05T11:27:01.494411+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3XOVXV43L3A","created_at":"2026-07-05T11:27:01.494411+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3XOVXV43L3AHLVZ","created_at":"2026-07-05T11:27:01.494411+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3XOVXV4","created_at":"2026-07-05T11:27:01.494411+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08506","citing_title":"Learning Polyhedral Conformal Sets for Robust Optimization","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08506","citing_title":"Learning Polyhedral Conformal Sets for Robust Optimization","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV","json":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV.json","graph_json":"https://pith.science/api/pith-number/Z3XOVXV43L3AHLVZ5D6J7HSWHV/graph.json","events_json":"https://pith.science/api/pith-number/Z3XOVXV43L3AHLVZ5D6J7HSWHV/events.json","paper":"https://pith.science/paper/Z3XOVXV4"},"agent_actions":{"view_html":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV","download_json":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV.json","view_paper":"https://pith.science/paper/Z3XOVXV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20173&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3XOVXV43L3AHLVZ5D6J7HSWHV/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3XOVXV43L3AHLVZ5D6J7HSWHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV/action/storage_attestation","attest_author":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV/action/author_attestation","sign_citation":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV/action/citation_signature","submit_replication":"https://pith.science/pith/Z3XOVXV43L3AHLVZ5D6J7HSWHV/action/replication_record"}},"created_at":"2026-07-05T11:27:01.494411+00:00","updated_at":"2026-07-05T11:27:01.494411+00:00"}