{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KORK53CO7BNVPP3EGGVTLBCWQT","short_pith_number":"pith:KORK53CO","schema_version":"1.0","canonical_sha256":"53a2aeec4ef85b57bf6431ab35845684dcb13e620d394e9883e281e35ef22cb0","source":{"kind":"arxiv","id":"2105.11255","version":1},"attestation_state":"computed","paper":{"title":"Optimized conformal classification using gradient descent approximation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anthony Bellotti","submitted_at":"2021-05-24T13:14:41Z","abstract_excerpt":"Conformal predictors are an important class of algorithms that allow predictions to be made with a user-defined confidence level. They are able to do this by outputting prediction sets, rather than simple point predictions. The conformal predictor is valid in the sense that the accuracy of its predictions is guaranteed to meet the confidence level, only assuming exchangeability in the data. Since accuracy is guaranteed, the performance of a conformal predictor is measured through the efficiency of the prediction sets. Typically, a conformal predictor is built on an underlying machine learning "},"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":"2105.11255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-05-24T13:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"e51f142bfba4ec3c2f5fc0e5135cab2f6a7ec5be154cb83be6ff91745324acb8","abstract_canon_sha256":"b8192d84397dce009f99f1d8823290f9d6bb7cedd403c8f5637a2fcac8f61ddb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:36.910826Z","signature_b64":"2keDY9Y41SYJv+PRTuB2dGT5kMAPDhoLUVKD6zazXhrQCtKMJQwhN8jP6xVMcwUrPgYHyXCgpOP0FvGObt+4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53a2aeec4ef85b57bf6431ab35845684dcb13e620d394e9883e281e35ef22cb0","last_reissued_at":"2026-07-05T02:42:36.910423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:36.910423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized conformal classification using gradient descent approximation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anthony Bellotti","submitted_at":"2021-05-24T13:14:41Z","abstract_excerpt":"Conformal predictors are an important class of algorithms that allow predictions to be made with a user-defined confidence level. They are able to do this by outputting prediction sets, rather than simple point predictions. The conformal predictor is valid in the sense that the accuracy of its predictions is guaranteed to meet the confidence level, only assuming exchangeability in the data. Since accuracy is guaranteed, the performance of a conformal predictor is measured through the efficiency of the prediction sets. Typically, a conformal predictor is built on an underlying machine learning "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11255","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/2105.11255/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":"2105.11255","created_at":"2026-07-05T02:42:36.910487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.11255v1","created_at":"2026-07-05T02:42:36.910487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11255","created_at":"2026-07-05T02:42:36.910487+00:00"},{"alias_kind":"pith_short_12","alias_value":"KORK53CO7BNV","created_at":"2026-07-05T02:42:36.910487+00:00"},{"alias_kind":"pith_short_16","alias_value":"KORK53CO7BNVPP3E","created_at":"2026-07-05T02:42:36.910487+00:00"},{"alias_kind":"pith_short_8","alias_value":"KORK53CO","created_at":"2026-07-05T02:42:36.910487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10734","citing_title":"SPACR: Single-Pass Adaptive Training of Uncertainty-Aware Conformal Regressors","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18354","citing_title":"Decoupled Conformal Optimisation: Efficient Prediction Sets via Independent Tuning and Calibration","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT","json":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT.json","graph_json":"https://pith.science/api/pith-number/KORK53CO7BNVPP3EGGVTLBCWQT/graph.json","events_json":"https://pith.science/api/pith-number/KORK53CO7BNVPP3EGGVTLBCWQT/events.json","paper":"https://pith.science/paper/KORK53CO"},"agent_actions":{"view_html":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT","download_json":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT.json","view_paper":"https://pith.science/paper/KORK53CO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.11255&json=true","fetch_graph":"https://pith.science/api/pith-number/KORK53CO7BNVPP3EGGVTLBCWQT/graph.json","fetch_events":"https://pith.science/api/pith-number/KORK53CO7BNVPP3EGGVTLBCWQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT/action/storage_attestation","attest_author":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT/action/author_attestation","sign_citation":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT/action/citation_signature","submit_replication":"https://pith.science/pith/KORK53CO7BNVPP3EGGVTLBCWQT/action/replication_record"}},"created_at":"2026-07-05T02:42:36.910487+00:00","updated_at":"2026-07-05T02:42:36.910487+00:00"}