{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:X667H5KKF6YH34YNKFUSJJQL6W","short_pith_number":"pith:X667H5KK","schema_version":"1.0","canonical_sha256":"bfbdf3f54a2fb07df30d516924a60bf585f4ee288ea9b76843a90b8a7d72fb70","source":{"kind":"arxiv","id":"2007.03114","version":3},"attestation_state":"computed","paper":{"title":"Efficient Conformal Prediction via Cascaded Inference with Expanded Admission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Fisch, Regina Barzilay, Tal Schuster, Tommi Jaakkola","submitted_at":"2020-07-06T23:13:07Z","abstract_excerpt":"In this paper, we present a novel approach for conformal prediction (CP), in which we aim to identify a set of promising prediction candidates -- in place of a single prediction. This set is guaranteed to contain a correct answer with high probability, and is well-suited for many open-ended classification tasks. In the standard CP paradigm, the predicted set can often be unusably large and also costly to obtain. This is particularly pervasive in settings where the correct answer is not unique, and the number of total possible answers is high. We first expand the CP correctness criterion to all"},"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":"2007.03114","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T23:13:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c3d459b088f7679cdf20e72dec8c979e91e6a55258909d887b3612063c623b0f","abstract_canon_sha256":"fac9a4e2ae0f84418d68a1da95b2bfbb12ce479af7f0b93cf5b4c7d07b148402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:21.967604Z","signature_b64":"Qr5bBZX3k4+/XJXVPLhs5fJgYkcQvPjV08NDpFz9EkRh2VUxZQ2xttqqxxNp8QLa363c2Z3T+I1WGJgCD2baCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfbdf3f54a2fb07df30d516924a60bf585f4ee288ea9b76843a90b8a7d72fb70","last_reissued_at":"2026-07-05T02:11:21.967040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:21.967040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Conformal Prediction via Cascaded Inference with Expanded Admission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Fisch, Regina Barzilay, Tal Schuster, Tommi Jaakkola","submitted_at":"2020-07-06T23:13:07Z","abstract_excerpt":"In this paper, we present a novel approach for conformal prediction (CP), in which we aim to identify a set of promising prediction candidates -- in place of a single prediction. This set is guaranteed to contain a correct answer with high probability, and is well-suited for many open-ended classification tasks. In the standard CP paradigm, the predicted set can often be unusably large and also costly to obtain. This is particularly pervasive in settings where the correct answer is not unique, and the number of total possible answers is high. We first expand the CP correctness criterion to all"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03114","kind":"arxiv","version":3},"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/2007.03114/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":"2007.03114","created_at":"2026-07-05T02:11:21.967112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03114v3","created_at":"2026-07-05T02:11:21.967112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03114","created_at":"2026-07-05T02:11:21.967112+00:00"},{"alias_kind":"pith_short_12","alias_value":"X667H5KKF6YH","created_at":"2026-07-05T02:11:21.967112+00:00"},{"alias_kind":"pith_short_16","alias_value":"X667H5KKF6YH34YN","created_at":"2026-07-05T02:11:21.967112+00:00"},{"alias_kind":"pith_short_8","alias_value":"X667H5KK","created_at":"2026-07-05T02:11:21.967112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28730","citing_title":"Full Conformal Prediction under Stochastic Non-Conformity Measure","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2308.05374","citing_title":"Trustworthy LLMs: a Survey and Guideline for Evaluating Large Language Models' Alignment","ref_index":115,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08857","citing_title":"RareCP: Regime-Aware Retrieval for Efficient Conformal Prediction","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W","json":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W.json","graph_json":"https://pith.science/api/pith-number/X667H5KKF6YH34YNKFUSJJQL6W/graph.json","events_json":"https://pith.science/api/pith-number/X667H5KKF6YH34YNKFUSJJQL6W/events.json","paper":"https://pith.science/paper/X667H5KK"},"agent_actions":{"view_html":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W","download_json":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W.json","view_paper":"https://pith.science/paper/X667H5KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03114&json=true","fetch_graph":"https://pith.science/api/pith-number/X667H5KKF6YH34YNKFUSJJQL6W/graph.json","fetch_events":"https://pith.science/api/pith-number/X667H5KKF6YH34YNKFUSJJQL6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W/action/storage_attestation","attest_author":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W/action/author_attestation","sign_citation":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W/action/citation_signature","submit_replication":"https://pith.science/pith/X667H5KKF6YH34YNKFUSJJQL6W/action/replication_record"}},"created_at":"2026-07-05T02:11:21.967112+00:00","updated_at":"2026-07-05T02:11:21.967112+00:00"}