{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FTXLHPV36K3UOHA5AR4ICGXO5F","short_pith_number":"pith:FTXLHPV3","schema_version":"1.0","canonical_sha256":"2ceeb3bebbf2b7471c1d0478811aeee9643191959033affc793737f9ebbf4817","source":{"kind":"arxiv","id":"2510.07750","version":3},"attestation_state":"computed","paper":{"title":"Calibrating Decision Robustness via Inverse Conformal Risk Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shixiang Zhu, Wenbin Zhou","submitted_at":"2025-10-09T03:38:17Z","abstract_excerpt":"Robust optimization safeguards decisions against uncertainty by optimizing against worst-case scenarios, yet their effectiveness hinges on a prespecified robustness level that is often chosen ad hoc, leading to either insufficient protection or overly conservative and costly solutions. Recent approaches using conformal prediction construct data-driven uncertainty sets with finite-sample coverage guarantees, but they still fix coverage targets a priori and offer little guidance for selecting robustness levels. We propose a new framework that provides distribution-free, finite-sample guarantees "},"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":"2510.07750","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-10-09T03:38:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"454feaba6a581f7d05f0b2c94eaace492ff4e83f36b14e689cad4ae66419af41","abstract_canon_sha256":"6c382df0ea2c60ce3623d61bdf65962b9e224889511c61144402d7461aff36d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:19.619404Z","signature_b64":"xC6rJpsw7/WozqPz/KWwlwYqSd0sXrPjPGiRLo93LGdbQsVztiJnS7aa9i3S/w1WWdJQqPwFyHzPhqhDVfuqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ceeb3bebbf2b7471c1d0478811aeee9643191959033affc793737f9ebbf4817","last_reissued_at":"2026-06-11T01:09:19.618377Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:19.618377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Calibrating Decision Robustness via Inverse Conformal Risk Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shixiang Zhu, Wenbin Zhou","submitted_at":"2025-10-09T03:38:17Z","abstract_excerpt":"Robust optimization safeguards decisions against uncertainty by optimizing against worst-case scenarios, yet their effectiveness hinges on a prespecified robustness level that is often chosen ad hoc, leading to either insufficient protection or overly conservative and costly solutions. Recent approaches using conformal prediction construct data-driven uncertainty sets with finite-sample coverage guarantees, but they still fix coverage targets a priori and offer little guidance for selecting robustness levels. We propose a new framework that provides distribution-free, finite-sample guarantees "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.07750","kind":"arxiv","version":3},"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/2510.07750/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":"2510.07750","created_at":"2026-06-11T01:09:19.618525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.07750v3","created_at":"2026-06-11T01:09:19.618525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.07750","created_at":"2026-06-11T01:09:19.618525+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTXLHPV36K3U","created_at":"2026-06-11T01:09:19.618525+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTXLHPV36K3UOHA5","created_at":"2026-06-11T01:09:19.618525+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTXLHPV3","created_at":"2026-06-11T01:09:19.618525+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.25068","citing_title":"Adapt Only When It Pays: Budgeted Decision-Loss Priority for Delayed Online Time-Series Adaptation","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08506","citing_title":"Learning Polyhedral Conformal Sets for Robust Optimization","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08506","citing_title":"Learning Polyhedral Conformal Sets for Robust Optimization","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F","json":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F.json","graph_json":"https://pith.science/api/pith-number/FTXLHPV36K3UOHA5AR4ICGXO5F/graph.json","events_json":"https://pith.science/api/pith-number/FTXLHPV36K3UOHA5AR4ICGXO5F/events.json","paper":"https://pith.science/paper/FTXLHPV3"},"agent_actions":{"view_html":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F","download_json":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F.json","view_paper":"https://pith.science/paper/FTXLHPV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.07750&json=true","fetch_graph":"https://pith.science/api/pith-number/FTXLHPV36K3UOHA5AR4ICGXO5F/graph.json","fetch_events":"https://pith.science/api/pith-number/FTXLHPV36K3UOHA5AR4ICGXO5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F/action/storage_attestation","attest_author":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F/action/author_attestation","sign_citation":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F/action/citation_signature","submit_replication":"https://pith.science/pith/FTXLHPV36K3UOHA5AR4ICGXO5F/action/replication_record"}},"created_at":"2026-06-11T01:09:19.618525+00:00","updated_at":"2026-06-11T01:09:19.618525+00:00"}