{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RCETD6GI7ZBNGOI3QK3SYG76BW","short_pith_number":"pith:RCETD6GI","schema_version":"1.0","canonical_sha256":"888931f8c8fe42d3391b82b72c1bfe0d9f4f4141a68514e64a91085592240789","source":{"kind":"arxiv","id":"2310.06430","version":2},"attestation_state":"computed","paper":{"title":"Conformal Prediction for Deep Classifier via Label Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Hongxin Wei, HuaJun Xi, Huaxiu Yao, Jianguo Huang, Linjun Zhang, Yue Qiu","submitted_at":"2023-10-10T08:54:14Z","abstract_excerpt":"Conformal prediction is a statistical framework that generates prediction sets containing ground-truth labels with a desired coverage guarantee. The predicted probabilities produced by machine learning models are generally miscalibrated, leading to large prediction sets in conformal prediction. To address this issue, we propose a novel algorithm named $\\textit{Sorted Adaptive Prediction Sets}$ (SAPS), which discards all the probability values except for the maximum softmax probability. The key idea behind SAPS is to minimize the dependence of the non-conformity score on the probability values "},"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":"2310.06430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-10T08:54:14Z","cross_cats_sorted":["cs.CV","math.ST","stat.TH"],"title_canon_sha256":"502e18790fe7c959187181800fbad374bb7752e104e8134c895eb1e622e9715c","abstract_canon_sha256":"025552e5e903e3bfd67de38cfe1bc6319e3f39999e236e3c2d15ffce80d8eb25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:03.009646Z","signature_b64":"bam3XQYTTGbIM66qum82+IIrkcvxJlsV5bHGpJkYBW5Dd7zTLACEuvgeIS2xWJCnO5Sow0XOIryx+D+SytkmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888931f8c8fe42d3391b82b72c1bfe0d9f4f4141a68514e64a91085592240789","last_reissued_at":"2026-07-05T08:28:03.009151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:03.009151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conformal Prediction for Deep Classifier via Label Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Hongxin Wei, HuaJun Xi, Huaxiu Yao, Jianguo Huang, Linjun Zhang, Yue Qiu","submitted_at":"2023-10-10T08:54:14Z","abstract_excerpt":"Conformal prediction is a statistical framework that generates prediction sets containing ground-truth labels with a desired coverage guarantee. The predicted probabilities produced by machine learning models are generally miscalibrated, leading to large prediction sets in conformal prediction. To address this issue, we propose a novel algorithm named $\\textit{Sorted Adaptive Prediction Sets}$ (SAPS), which discards all the probability values except for the maximum softmax probability. The key idea behind SAPS is to minimize the dependence of the non-conformity score on the probability values "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06430","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/2310.06430/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":"2310.06430","created_at":"2026-07-05T08:28:03.009212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.06430v2","created_at":"2026-07-05T08:28:03.009212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06430","created_at":"2026-07-05T08:28:03.009212+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCETD6GI7ZBN","created_at":"2026-07-05T08:28:03.009212+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCETD6GI7ZBNGOI3","created_at":"2026-07-05T08:28:03.009212+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCETD6GI","created_at":"2026-07-05T08:28:03.009212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.01733","citing_title":"Improving Backward Conformal Prediction via Non-Conformity Score Transformation","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW","json":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW.json","graph_json":"https://pith.science/api/pith-number/RCETD6GI7ZBNGOI3QK3SYG76BW/graph.json","events_json":"https://pith.science/api/pith-number/RCETD6GI7ZBNGOI3QK3SYG76BW/events.json","paper":"https://pith.science/paper/RCETD6GI"},"agent_actions":{"view_html":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW","download_json":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW.json","view_paper":"https://pith.science/paper/RCETD6GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.06430&json=true","fetch_graph":"https://pith.science/api/pith-number/RCETD6GI7ZBNGOI3QK3SYG76BW/graph.json","fetch_events":"https://pith.science/api/pith-number/RCETD6GI7ZBNGOI3QK3SYG76BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW/action/storage_attestation","attest_author":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW/action/author_attestation","sign_citation":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW/action/citation_signature","submit_replication":"https://pith.science/pith/RCETD6GI7ZBNGOI3QK3SYG76BW/action/replication_record"}},"created_at":"2026-07-05T08:28:03.009212+00:00","updated_at":"2026-07-05T08:28:03.009212+00:00"}