{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZIINP4AG5F74T7NQIQJ4ZR6TOU","short_pith_number":"pith:ZIINP4AG","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"},"canonical_sha256":"ca10d7f006e97fc9fdb04413ccc7d3750b9a3763e52abf29b0d239c749a14dec","source":{"kind":"arxiv","id":"2407.04407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.04407","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"2407.04407v1","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04407","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZIINP4AG5F74","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZIINP4AG5F74T7NQ","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZIINP4AG","created_at":"2026-07-05T08:40:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZIINP4AG5F74T7NQIQJ4ZR6TOU","target":"record","payload":{"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"},"canonical_sha256":"ca10d7f006e97fc9fdb04413ccc7d3750b9a3763e52abf29b0d239c749a14dec","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"},"source_kind":"arxiv","source_id":"2407.04407","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zwktcmrVHdE9HqQc5CvUJ1ernN/pcBa7BxJjIrLut75Tqu14sF8Hu8lLeGn9Pte83wvORpKX7u+twTBO5WQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:12:28.602222Z"},"content_sha256":"cbd7165174f90a5904144a9d4ea2261f4797ddd90a1d34bbc917ad7b5fa9256f","schema_version":"1.0","event_id":"sha256:cbd7165174f90a5904144a9d4ea2261f4797ddd90a1d34bbc917ad7b5fa9256f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZIINP4AG5F74T7NQIQJ4ZR6TOU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXoC8xW9fR08JtQOaggFe9DN5mnDO1rKsFadNErZZu4QYkslEr1ku2ciQNS9koI5rUxdZruLvJF7UBzrTnLYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T02:12:28.602682Z"},"content_sha256":"41b6846e75ac69225d722e0abdf593d8e05a4b829f0bf8dd6fdb33f8c6291fb3","schema_version":"1.0","event_id":"sha256:41b6846e75ac69225d722e0abdf593d8e05a4b829f0bf8dd6fdb33f8c6291fb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/bundle.json","state_url":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T02:12:28Z","links":{"resolver":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU","bundle":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/bundle.json","state":"https://pith.science/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIINP4AG5F74T7NQIQJ4ZR6TOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZIINP4AG5F74T7NQIQJ4ZR6TOU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0688cbee8297ee744949cb6106e0cd92a8303bd62b1e2556f6e2cd4a80f91dd5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-05T10:43:41Z","title_canon_sha256":"b240d52f52e85726bae31933f31220eb8174f5e072aa924e8d83165c4e557118"},"schema_version":"1.0","source":{"id":"2407.04407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.04407","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"2407.04407v1","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04407","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZIINP4AG5F74","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZIINP4AG5F74T7NQ","created_at":"2026-07-05T08:40:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZIINP4AG","created_at":"2026-07-05T08:40:33Z"}],"graph_snapshots":[{"event_id":"sha256:41b6846e75ac69225d722e0abdf593d8e05a4b829f0bf8dd6fdb33f8c6291fb3","target":"graph","created_at":"2026-07-05T08:40:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.04407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Rui Luo, Zhixin Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-05T10:43:41Z","title":"Trustworthy Classification through Rank-Based Conformal Prediction Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04407","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cbd7165174f90a5904144a9d4ea2261f4797ddd90a1d34bbc917ad7b5fa9256f","target":"record","created_at":"2026-07-05T08:40:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0688cbee8297ee744949cb6106e0cd92a8303bd62b1e2556f6e2cd4a80f91dd5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-05T10:43:41Z","title_canon_sha256":"b240d52f52e85726bae31933f31220eb8174f5e072aa924e8d83165c4e557118"},"schema_version":"1.0","source":{"id":"2407.04407","kind":"arxiv","version":1}},"canonical_sha256":"ca10d7f006e97fc9fdb04413ccc7d3750b9a3763e52abf29b0d239c749a14dec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca10d7f006e97fc9fdb04413ccc7d3750b9a3763e52abf29b0d239c749a14dec","first_computed_at":"2026-07-05T08:40:33.389946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:40:33.389946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KEW8dckl4ed+8sBWu57r1nDiF7NBgT7dO/TX5T60fMsxNAOQU6PLIJI1kx7Tx9yYwWvliEvHePguGBm55C5HCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:40:33.390414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.04407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbd7165174f90a5904144a9d4ea2261f4797ddd90a1d34bbc917ad7b5fa9256f","sha256:41b6846e75ac69225d722e0abdf593d8e05a4b829f0bf8dd6fdb33f8c6291fb3"],"state_sha256":"febfda90ae6e2bd82844ff2c97710cafb2b869a1677d5119d6e3eb14e16abcb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkCH2nHlfxdERtQl89Qa2rZhsOwaL6ExW72AKhOEToDSjRqCDFL5kyHiG62MWnMRSGMFz3usUx2RQghL8vg9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T02:12:28.605743Z","bundle_sha256":"72dc8957f7728d54db392f0d76796270ccb38ff58376c6daacac74f23e740c6b"}}