{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UE5IUYCT4S3RS7J66HA7N2QPXC","short_pith_number":"pith:UE5IUYCT","schema_version":"1.0","canonical_sha256":"a13a8a6053e4b7197d3ef1c1f6ea0fb8b74a2bba1804e8e18a53f312cbabd59b","source":{"kind":"arxiv","id":"2406.17519","version":2},"attestation_state":"computed","paper":{"title":"Entropy-Based Decoding for Retrieval-Augmented Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aiwei Liu, Bin Wu, Irwin King, Jingjing Li, Zexuan Qiu, Zijing Ou","submitted_at":"2024-06-25T12:59:38Z","abstract_excerpt":"Augmenting Large Language Models (LLMs) with retrieved external knowledge has proven effective for improving the factual accuracy of generated responses. Despite their success, retrieval-augmented LLMs still face the distractibility issue, where the generated responses are negatively influenced by noise from both external and internal knowledge sources. In this paper, we introduce a novel, training-free decoding method guided by entropy considerations to mitigate this issue. Our approach utilizes entropy-based document-parallel ensemble decoding to prioritize low-entropy distributions from ret"},"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":"2406.17519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-25T12:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"545e8910bacd2b9335adc5b99c14466fd624feef448316df481b88e0f7848661","abstract_canon_sha256":"95675331caf8a56989f9c2b7b9cc93de4a963d2a5cf46b21a6485a7f4a965e88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:17.843846Z","signature_b64":"x7ElrHVWGss/Ks6LZSsRaKr7aywYuZxLaelevcInd/wNpjgnz2Zh4y8vOdY4zzlUF0WvqPoQ1MTwiOLuX7v4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a13a8a6053e4b7197d3ef1c1f6ea0fb8b74a2bba1804e8e18a53f312cbabd59b","last_reissued_at":"2026-07-05T10:15:17.843343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:17.843343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy-Based Decoding for Retrieval-Augmented Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aiwei Liu, Bin Wu, Irwin King, Jingjing Li, Zexuan Qiu, Zijing Ou","submitted_at":"2024-06-25T12:59:38Z","abstract_excerpt":"Augmenting Large Language Models (LLMs) with retrieved external knowledge has proven effective for improving the factual accuracy of generated responses. Despite their success, retrieval-augmented LLMs still face the distractibility issue, where the generated responses are negatively influenced by noise from both external and internal knowledge sources. In this paper, we introduce a novel, training-free decoding method guided by entropy considerations to mitigate this issue. Our approach utilizes entropy-based document-parallel ensemble decoding to prioritize low-entropy distributions from ret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.17519","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/2406.17519/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":"2406.17519","created_at":"2026-07-05T10:15:17.843408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.17519v2","created_at":"2026-07-05T10:15:17.843408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.17519","created_at":"2026-07-05T10:15:17.843408+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE5IUYCT4S3R","created_at":"2026-07-05T10:15:17.843408+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE5IUYCT4S3RS7J6","created_at":"2026-07-05T10:15:17.843408+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE5IUYCT","created_at":"2026-07-05T10:15:17.843408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22335","citing_title":"Context-Fidelity Boosting: Enhancing Faithful Generation through Watermark-Inspired Decoding","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC","json":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC.json","graph_json":"https://pith.science/api/pith-number/UE5IUYCT4S3RS7J66HA7N2QPXC/graph.json","events_json":"https://pith.science/api/pith-number/UE5IUYCT4S3RS7J66HA7N2QPXC/events.json","paper":"https://pith.science/paper/UE5IUYCT"},"agent_actions":{"view_html":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC","download_json":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC.json","view_paper":"https://pith.science/paper/UE5IUYCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.17519&json=true","fetch_graph":"https://pith.science/api/pith-number/UE5IUYCT4S3RS7J66HA7N2QPXC/graph.json","fetch_events":"https://pith.science/api/pith-number/UE5IUYCT4S3RS7J66HA7N2QPXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC/action/storage_attestation","attest_author":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC/action/author_attestation","sign_citation":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC/action/citation_signature","submit_replication":"https://pith.science/pith/UE5IUYCT4S3RS7J66HA7N2QPXC/action/replication_record"}},"created_at":"2026-07-05T10:15:17.843408+00:00","updated_at":"2026-07-05T10:15:17.843408+00:00"}