{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:U2PTRFAXPKKBDHM7UINZCBZCQ2","short_pith_number":"pith:U2PTRFAX","schema_version":"1.0","canonical_sha256":"a69f3894177a94119d9fa21b9107228699bd27820e03d12f0e802ce6a2313713","source":{"kind":"arxiv","id":"2603.10396","version":2},"attestation_state":"computed","paper":{"title":"Verbalizing LLM's Higher-order Uncertainty via Imprecise Probabilities","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anita Yang, Krikamol Muandet, Masaki Adachi, Michele Caprio, Siu Lun Chau","submitted_at":"2026-03-11T04:21:04Z","abstract_excerpt":"Despite the growing demand for eliciting uncertainty from large language models (LLMs), empirical evidence suggests that LLM behavior is not always adequately captured by the elicitation techniques developed under the classical probabilistic uncertainty framework. This mismatch leads to systematic failure modes, particularly in settings that involve ambiguous question-answering, in-context learning, and self-reflection. To address this, we propose novel prompt-based uncertainty elicitation techniques grounded in \\emph{imprecise probabilities}, a principled framework for repesenting and eliciti"},"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":"2603.10396","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-11T04:21:04Z","cross_cats_sorted":[],"title_canon_sha256":"798dc8d47cfe2be933154b575c0ecab56424258282acbc503b710f8a7729a85e","abstract_canon_sha256":"a26b965dd662eff5608c169d0ff924b8036493fec1a0ef26059ca4265cd6df6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a69f3894177a94119d9fa21b9107228699bd27820e03d12f0e802ce6a2313713","last_reissued_at":"2026-07-31T01:33:21.404313Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:33:21.404313Z"},"graph_snapshot":{"paper":{"title":"Verbalizing LLM's Higher-order Uncertainty via Imprecise Probabilities","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anita Yang, Krikamol Muandet, Masaki Adachi, Michele Caprio, Siu Lun Chau","submitted_at":"2026-03-11T04:21:04Z","abstract_excerpt":"Despite the growing demand for eliciting uncertainty from large language models (LLMs), empirical evidence suggests that LLM behavior is not always adequately captured by the elicitation techniques developed under the classical probabilistic uncertainty framework. This mismatch leads to systematic failure modes, particularly in settings that involve ambiguous question-answering, in-context learning, and self-reflection. To address this, we propose novel prompt-based uncertainty elicitation techniques grounded in \\emph{imprecise probabilities}, a principled framework for repesenting and eliciti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.10396","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/2603.10396/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":"2603.10396","created_at":"2026-07-31T01:33:21.407401+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.10396v2","created_at":"2026-07-31T01:33:21.407401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.10396","created_at":"2026-07-31T01:33:21.407401+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2PTRFAXPKKB","created_at":"2026-07-31T01:33:21.407401+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2PTRFAXPKKBDHM7","created_at":"2026-07-31T01:33:21.407401+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2PTRFAX","created_at":"2026-07-31T01:33:21.407401+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.10385","citing_title":"Regret Analysis of Guided Diffusion for Black-Box Optimization over Structured Inputs","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07572","citing_title":"Open-Ended Task Discovery via Bayesian Optimization","ref_index":75,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2","json":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2.json","graph_json":"https://pith.science/api/pith-number/U2PTRFAXPKKBDHM7UINZCBZCQ2/graph.json","events_json":"https://pith.science/api/pith-number/U2PTRFAXPKKBDHM7UINZCBZCQ2/events.json","paper":"https://pith.science/paper/U2PTRFAX"},"agent_actions":{"view_html":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2","download_json":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2.json","view_paper":"https://pith.science/paper/U2PTRFAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.10396&json=true","fetch_graph":"https://pith.science/api/pith-number/U2PTRFAXPKKBDHM7UINZCBZCQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/U2PTRFAXPKKBDHM7UINZCBZCQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2/action/storage_attestation","attest_author":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2/action/author_attestation","sign_citation":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2/action/citation_signature","submit_replication":"https://pith.science/pith/U2PTRFAXPKKBDHM7UINZCBZCQ2/action/replication_record"}},"created_at":"2026-07-31T01:33:21.407401+00:00","updated_at":"2026-07-31T01:33:21.407401+00:00"}