{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XCQ6AHX2GHYAGXTGHW232ZKA3L","short_pith_number":"pith:XCQ6AHX2","schema_version":"1.0","canonical_sha256":"b8a1e01efa31f0035e663db5bd6540dade9cb983bc93671e7e4d71e494e9b0bb","source":{"kind":"arxiv","id":"2403.01216","version":2},"attestation_state":"computed","paper":{"title":"API Is Enough: Conformal Prediction for Large Language Models Without Logit-Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Hongwei Wang, Jiayuan Su, Jing Luo, Lu Cheng","submitted_at":"2024-03-02T14:14:45Z","abstract_excerpt":"This study aims to address the pervasive challenge of quantifying uncertainty in large language models (LLMs) without logit-access. Conformal Prediction (CP), known for its model-agnostic and distribution-free features, is a desired approach for various LLMs and data distributions. However, existing CP methods for LLMs typically assume access to the logits, which are unavailable for some API-only LLMs. In addition, logits are known to be miscalibrated, potentially leading to degraded CP performance. To tackle these challenges, we introduce a novel CP method that (1) is tailored for API-only LL"},"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":"2403.01216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-03-02T14:14:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dc19d88dd5e31ab7d097a52ad0565b372cb8b5952002c81abbf37b202fd44226","abstract_canon_sha256":"877141ae4241bada39160883c2879be48146e6a9213f792cd3bc066ad039f67d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:18.505313Z","signature_b64":"X9AvaIfQZBAQfGHUa4mT7fBYkbL8kp0FC2YJsxY/zGy5sOe01teN4JFo5CrzPVOOgmz4Lu8N/BMigapMqCN/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8a1e01efa31f0035e663db5bd6540dade9cb983bc93671e7e4d71e494e9b0bb","last_reissued_at":"2026-07-05T08:04:18.504862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:18.504862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"API Is Enough: Conformal Prediction for Large Language Models Without Logit-Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Hongwei Wang, Jiayuan Su, Jing Luo, Lu Cheng","submitted_at":"2024-03-02T14:14:45Z","abstract_excerpt":"This study aims to address the pervasive challenge of quantifying uncertainty in large language models (LLMs) without logit-access. Conformal Prediction (CP), known for its model-agnostic and distribution-free features, is a desired approach for various LLMs and data distributions. However, existing CP methods for LLMs typically assume access to the logits, which are unavailable for some API-only LLMs. In addition, logits are known to be miscalibrated, potentially leading to degraded CP performance. To tackle these challenges, we introduce a novel CP method that (1) is tailored for API-only LL"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01216","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/2403.01216/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":"2403.01216","created_at":"2026-07-05T08:04:18.504917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01216v2","created_at":"2026-07-05T08:04:18.504917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01216","created_at":"2026-07-05T08:04:18.504917+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCQ6AHX2GHYA","created_at":"2026-07-05T08:04:18.504917+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCQ6AHX2GHYAGXTG","created_at":"2026-07-05T08:04:18.504917+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCQ6AHX2","created_at":"2026-07-05T08:04:18.504917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12587","citing_title":"Strategic Decision Support for AI Agents","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08277","citing_title":"Remember with Confidence: Uncertainty Quantification for Spatio-temporal Memory with Probabilistic Guarantees","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2602.01733","citing_title":"ST-BCP: Tightening Coverage Bound for Backward Conformal Prediction via Non-Conformity Score Transformation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19220","citing_title":"Position: Uncertainty Quantification in LLMs is Just Unsupervised Clustering","ref_index":114,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20098","citing_title":"Differentiable Conformal Training for LLM Reasoning Factuality","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08077","citing_title":"Conformal Path Reasoning: Trustworthy Knowledge Graph Question Answering via Path-Level Calibration","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07667","citing_title":"From Debate to Decision: Conformal Social Choice for Safe Multi-Agent Deliberation","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L","json":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L.json","graph_json":"https://pith.science/api/pith-number/XCQ6AHX2GHYAGXTGHW232ZKA3L/graph.json","events_json":"https://pith.science/api/pith-number/XCQ6AHX2GHYAGXTGHW232ZKA3L/events.json","paper":"https://pith.science/paper/XCQ6AHX2"},"agent_actions":{"view_html":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L","download_json":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L.json","view_paper":"https://pith.science/paper/XCQ6AHX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01216&json=true","fetch_graph":"https://pith.science/api/pith-number/XCQ6AHX2GHYAGXTGHW232ZKA3L/graph.json","fetch_events":"https://pith.science/api/pith-number/XCQ6AHX2GHYAGXTGHW232ZKA3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L/action/storage_attestation","attest_author":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L/action/author_attestation","sign_citation":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L/action/citation_signature","submit_replication":"https://pith.science/pith/XCQ6AHX2GHYAGXTGHW232ZKA3L/action/replication_record"}},"created_at":"2026-07-05T08:04:18.504917+00:00","updated_at":"2026-07-05T08:04:18.504917+00:00"}