{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EDIZ4TOHXLHKNZEZRHSQZCEYQM","short_pith_number":"pith:EDIZ4TOH","schema_version":"1.0","canonical_sha256":"20d19e4dc7bacea6e49989e50c8898833babcf1405a7c1894b192fadfdb0820e","source":{"kind":"arxiv","id":"2410.13735","version":2},"attestation_state":"computed","paper":{"title":"Generative Conformal Prediction with Vectorized Non-Conformity Scores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Minxing Zheng, Shixiang Zhu","submitted_at":"2024-10-17T16:37:03Z","abstract_excerpt":"Conformal prediction (CP) provides model-agnostic uncertainty quantification with guaranteed coverage, but conventional methods often produce overly conservative uncertainty sets, especially in multi-dimensional settings. This limitation arises from simplistic non-conformity scores that rely solely on prediction error, failing to capture the prediction error distribution's complexity. To address this, we propose a generative conformal prediction framework with vectorized non-conformity scores, leveraging a generative model to sample multiple predictions from the fitted data distribution. By co"},"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":"2410.13735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-17T16:37:03Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"08eb591d58a7d99d77bd2aa36e543c47ff8492db13c34b3495b7c2c359a929f6","abstract_canon_sha256":"726026b2d5a89ac90051f7a792982fa872b4f1003a7d0e5bac5cc9e2fb17049e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:21.363281Z","signature_b64":"p0JfNmuF+ve9L5zm53W8okeQksheQ8JcmxZIfhO1cZapERkrAemj005VAE2AU+v60TTWjPvFdgCtJVF6xaK6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d19e4dc7bacea6e49989e50c8898833babcf1405a7c1894b192fadfdb0820e","last_reissued_at":"2026-07-05T10:12:21.362826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:21.362826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Conformal Prediction with Vectorized Non-Conformity Scores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"cs.LG","authors_text":"Minxing Zheng, Shixiang Zhu","submitted_at":"2024-10-17T16:37:03Z","abstract_excerpt":"Conformal prediction (CP) provides model-agnostic uncertainty quantification with guaranteed coverage, but conventional methods often produce overly conservative uncertainty sets, especially in multi-dimensional settings. This limitation arises from simplistic non-conformity scores that rely solely on prediction error, failing to capture the prediction error distribution's complexity. To address this, we propose a generative conformal prediction framework with vectorized non-conformity scores, leveraging a generative model to sample multiple predictions from the fitted data distribution. By co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13735","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/2410.13735/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":"2410.13735","created_at":"2026-07-05T10:12:21.362881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13735v2","created_at":"2026-07-05T10:12:21.362881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13735","created_at":"2026-07-05T10:12:21.362881+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDIZ4TOHXLHK","created_at":"2026-07-05T10:12:21.362881+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDIZ4TOHXLHKNZEZ","created_at":"2026-07-05T10:12:21.362881+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDIZ4TOH","created_at":"2026-07-05T10:12:21.362881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.07633","citing_title":"Flow-Based Conformal Predictive Distributions","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08506","citing_title":"Learning Polyhedral Conformal Sets for Robust Optimization","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08506","citing_title":"Learning Polyhedral Conformal Sets for Robust Optimization","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM","json":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM.json","graph_json":"https://pith.science/api/pith-number/EDIZ4TOHXLHKNZEZRHSQZCEYQM/graph.json","events_json":"https://pith.science/api/pith-number/EDIZ4TOHXLHKNZEZRHSQZCEYQM/events.json","paper":"https://pith.science/paper/EDIZ4TOH"},"agent_actions":{"view_html":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM","download_json":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM.json","view_paper":"https://pith.science/paper/EDIZ4TOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13735&json=true","fetch_graph":"https://pith.science/api/pith-number/EDIZ4TOHXLHKNZEZRHSQZCEYQM/graph.json","fetch_events":"https://pith.science/api/pith-number/EDIZ4TOHXLHKNZEZRHSQZCEYQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM/action/storage_attestation","attest_author":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM/action/author_attestation","sign_citation":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM/action/citation_signature","submit_replication":"https://pith.science/pith/EDIZ4TOHXLHKNZEZRHSQZCEYQM/action/replication_record"}},"created_at":"2026-07-05T10:12:21.362881+00:00","updated_at":"2026-07-05T10:12:21.362881+00:00"}