{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WQNXOCBUH6CBAM2M25TPQPQTY6","short_pith_number":"pith:WQNXOCBU","schema_version":"1.0","canonical_sha256":"b41b7708343f8410334cd766f83e13c781fda6a97d3c1102a40d0a60fe1dcf1d","source":{"kind":"arxiv","id":"2310.09044","version":1},"attestation_state":"computed","paper":{"title":"KCTS: Knowledge-Constrained Tree Search Decoding with Token-Level Hallucination Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Sehyun Choi, Tianqing Fang, Yangqiu Song, Zhaowei Wang","submitted_at":"2023-10-13T12:12:34Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable human-level natural language generation capabilities. However, their potential to generate misinformation, often called the hallucination problem, poses a significant risk to their deployment. A common approach to address this issue is to retrieve relevant knowledge and fine-tune the LLM with the knowledge in its input. Unfortunately, this method incurs high training costs and may cause catastrophic forgetting for multi-tasking models. To overcome these limitations, we propose a knowledge-constrained decoding method called KCTS (Knowled"},"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":"2310.09044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-13T12:12:34Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"844021734d718d16c290d30d89571d809ac5df612409542ee9b91806cd105da3","abstract_canon_sha256":"191a8f134d1538644ba0d6bb5a6097ec70c324d9c4c9b18c6e64fb70b292817e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:39.252703Z","signature_b64":"HTODBvXg1l8TfkDuTc/zVLnQLZGbHxxAC9hLRz2qaoLcT6ZNpsQIhJ+sKenAt466HN2HuILm/vT+yM+hFzsJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b41b7708343f8410334cd766f83e13c781fda6a97d3c1102a40d0a60fe1dcf1d","last_reissued_at":"2026-07-05T07:00:39.252282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:39.252282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KCTS: Knowledge-Constrained Tree Search Decoding with Token-Level Hallucination Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Sehyun Choi, Tianqing Fang, Yangqiu Song, Zhaowei Wang","submitted_at":"2023-10-13T12:12:34Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable human-level natural language generation capabilities. However, their potential to generate misinformation, often called the hallucination problem, poses a significant risk to their deployment. A common approach to address this issue is to retrieve relevant knowledge and fine-tune the LLM with the knowledge in its input. Unfortunately, this method incurs high training costs and may cause catastrophic forgetting for multi-tasking models. To overcome these limitations, we propose a knowledge-constrained decoding method called KCTS (Knowled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09044","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/2310.09044/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":"2310.09044","created_at":"2026-07-05T07:00:39.252339+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.09044v1","created_at":"2026-07-05T07:00:39.252339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09044","created_at":"2026-07-05T07:00:39.252339+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQNXOCBUH6CB","created_at":"2026-07-05T07:00:39.252339+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQNXOCBUH6CBAM2M","created_at":"2026-07-05T07:00:39.252339+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQNXOCBU","created_at":"2026-07-05T07:00:39.252339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.14703","citing_title":"ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2311.05232","citing_title":"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03356","citing_title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6","json":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6.json","graph_json":"https://pith.science/api/pith-number/WQNXOCBUH6CBAM2M25TPQPQTY6/graph.json","events_json":"https://pith.science/api/pith-number/WQNXOCBUH6CBAM2M25TPQPQTY6/events.json","paper":"https://pith.science/paper/WQNXOCBU"},"agent_actions":{"view_html":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6","download_json":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6.json","view_paper":"https://pith.science/paper/WQNXOCBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.09044&json=true","fetch_graph":"https://pith.science/api/pith-number/WQNXOCBUH6CBAM2M25TPQPQTY6/graph.json","fetch_events":"https://pith.science/api/pith-number/WQNXOCBUH6CBAM2M25TPQPQTY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6/action/storage_attestation","attest_author":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6/action/author_attestation","sign_citation":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6/action/citation_signature","submit_replication":"https://pith.science/pith/WQNXOCBUH6CBAM2M25TPQPQTY6/action/replication_record"}},"created_at":"2026-07-05T07:00:39.252339+00:00","updated_at":"2026-07-05T07:00:39.252339+00:00"}