{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZIINP4AG5F74T7NQIQJ4ZR6TOU","short_pith_number":"pith:ZIINP4AG","schema_version":"1.0","canonical_sha256":"ca10d7f006e97fc9fdb04413ccc7d3750b9a3763e52abf29b0d239c749a14dec","source":{"kind":"arxiv","id":"2407.04407","version":1},"attestation_state":"computed","paper":{"title":"Trustworthy Classification through Rank-Based Conformal Prediction Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rui Luo, Zhixin Zhou","submitted_at":"2024-07-05T10:43:41Z","abstract_excerpt":"Machine learning classification tasks often benefit from predicting a set of possible labels with confidence scores to capture uncertainty. However, existing methods struggle with the high-dimensional nature of the data and the lack of well-calibrated probabilities from modern classification models. We propose a novel conformal prediction method that employs a rank-based score function suitable for classification models that predict the order of labels correctly, even if not well-calibrated. Our approach constructs prediction sets that achieve the desired coverage rate while managing their siz"},"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":"2407.04407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-05T10:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"b240d52f52e85726bae31933f31220eb8174f5e072aa924e8d83165c4e557118","abstract_canon_sha256":"0688cbee8297ee744949cb6106e0cd92a8303bd62b1e2556f6e2cd4a80f91dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:33.390414Z","signature_b64":"KEW8dckl4ed+8sBWu57r1nDiF7NBgT7dO/TX5T60fMsxNAOQU6PLIJI1kx7Tx9yYwWvliEvHePguGBm55C5HCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca10d7f006e97fc9fdb04413ccc7d3750b9a3763e52abf29b0d239c749a14dec","last_reissued_at":"2026-07-05T08:40:33.389946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:33.389946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trustworthy Classification through Rank-Based Conformal Prediction Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rui Luo, Zhixin Zhou","submitted_at":"2024-07-05T10:43:41Z","abstract_excerpt":"Machine learning classification tasks often benefit from predicting a set of possible labels with confidence scores to capture uncertainty. However, existing methods struggle with the high-dimensional nature of the data and the lack of well-calibrated probabilities from modern classification models. We propose a novel conformal prediction method that employs a rank-based score function suitable for classification models that predict the order of labels correctly, even if not well-calibrated. Our approach constructs prediction sets that achieve the desired coverage rate while managing their siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04407","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/2407.04407/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":"2407.04407","created_at":"2026-07-05T08:40:33.390001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04407v1","created_at":"2026-07-05T08:40:33.390001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04407","created_at":"2026-07-05T08:40:33.390001+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIINP4AG5F74","created_at":"2026-07-05T08:40:33.390001+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIINP4AG5F74T7NQ","created_at":"2026-07-05T08:40:33.390001+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIINP4AG","created_at":"2026-07-05T08:40:33.390001+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05409","citing_title":"CRISP: Rank-Guided Iterative Squeezing for Robust Medical Image Segmentation under Domain Shift","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU","json":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU.json","graph_json":"https://pith.science/api/pith-number/ZIINP4AG5F74T7NQIQJ4ZR6TOU/graph.json","events_json":"https://pith.science/api/pith-number/ZIINP4AG5F74T7NQIQJ4ZR6TOU/events.json","paper":"https://pith.science/paper/ZIINP4AG"},"agent_actions":{"view_html":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU","download_json":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU.json","view_paper":"https://pith.science/paper/ZIINP4AG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04407&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIINP4AG5F74T7NQIQJ4ZR6TOU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIINP4AG5F74T7NQIQJ4ZR6TOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/action/storage_attestation","attest_author":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/action/author_attestation","sign_citation":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/action/citation_signature","submit_replication":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/action/replication_record"}},"created_at":"2026-07-05T08:40:33.390001+00:00","updated_at":"2026-07-05T08:40:33.390001+00:00"}