{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LFR7FHJVQ23EUTF5BZT7UOSJPU","short_pith_number":"pith:LFR7FHJV","schema_version":"1.0","canonical_sha256":"5963f29d3586b64a4cbd0e67fa3a497d0f48bbc6b8cb9791702be8cd8fff049b","source":{"kind":"arxiv","id":"2405.13873","version":4},"attestation_state":"computed","paper":{"title":"FiDeLiS: Faithful Reasoning in Large Language Model for Knowledge Graph Question Answering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Bryan Hooi, Kun Wang, Nian Liu, Xiaoxin He, Yuan Sui, Yufei He","submitted_at":"2024-05-22T17:56:53Z","abstract_excerpt":"Large Language Models (LLMs) are often challenged by generating erroneous or hallucinated responses, especially in complex reasoning tasks. Leveraging Knowledge Graphs (KGs) as external knowledge sources has emerged as a viable solution. However, existing KG-enhanced methods, either retrieval-based or agent-based, encounter difficulties in accurately retrieving knowledge and efficiently traversing KGs at scale. In this paper, we propose a unified framework, FiDeLiS, designed to improve the factuality of LLM responses by anchoring answers to verifiable reasoning steps retrieved from KGs. To ach"},"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":"2405.13873","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-05-22T17:56:53Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6c9fbf969293e95ee1c59f4b42ff53861dd50652a7a7f23913a0f76a4e1e096a","abstract_canon_sha256":"6f7e10f98855f288acc2982d70ad356a4c9ec2cc8fcf025b80946be0a9cfe650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:02.406209Z","signature_b64":"1YNu2JDnUbwcUTh1OBdIYEXIoHOsiLrkEj6/kWZDiZECbPQCqOVAvM5HpQ3EBhz//xidfJRuk8XwHXvZuYk4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5963f29d3586b64a4cbd0e67fa3a497d0f48bbc6b8cb9791702be8cd8fff049b","last_reissued_at":"2026-07-05T11:07:02.405728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:02.405728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FiDeLiS: Faithful Reasoning in Large Language Model for Knowledge Graph Question Answering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Bryan Hooi, Kun Wang, Nian Liu, Xiaoxin He, Yuan Sui, Yufei He","submitted_at":"2024-05-22T17:56:53Z","abstract_excerpt":"Large Language Models (LLMs) are often challenged by generating erroneous or hallucinated responses, especially in complex reasoning tasks. Leveraging Knowledge Graphs (KGs) as external knowledge sources has emerged as a viable solution. However, existing KG-enhanced methods, either retrieval-based or agent-based, encounter difficulties in accurately retrieving knowledge and efficiently traversing KGs at scale. In this paper, we propose a unified framework, FiDeLiS, designed to improve the factuality of LLM responses by anchoring answers to verifiable reasoning steps retrieved from KGs. To ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.13873","kind":"arxiv","version":4},"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/2405.13873/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":"2405.13873","created_at":"2026-07-05T11:07:02.405784+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.13873v4","created_at":"2026-07-05T11:07:02.405784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.13873","created_at":"2026-07-05T11:07:02.405784+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFR7FHJVQ23E","created_at":"2026-07-05T11:07:02.405784+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFR7FHJVQ23EUTF5","created_at":"2026-07-05T11:07:02.405784+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFR7FHJV","created_at":"2026-07-05T11:07:02.405784+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.17086","citing_title":"Advancing Multi-Agent RAG Systems with Minimalist Reinforcement Learning","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU","json":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU.json","graph_json":"https://pith.science/api/pith-number/LFR7FHJVQ23EUTF5BZT7UOSJPU/graph.json","events_json":"https://pith.science/api/pith-number/LFR7FHJVQ23EUTF5BZT7UOSJPU/events.json","paper":"https://pith.science/paper/LFR7FHJV"},"agent_actions":{"view_html":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU","download_json":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU.json","view_paper":"https://pith.science/paper/LFR7FHJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.13873&json=true","fetch_graph":"https://pith.science/api/pith-number/LFR7FHJVQ23EUTF5BZT7UOSJPU/graph.json","fetch_events":"https://pith.science/api/pith-number/LFR7FHJVQ23EUTF5BZT7UOSJPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU/action/storage_attestation","attest_author":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU/action/author_attestation","sign_citation":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU/action/citation_signature","submit_replication":"https://pith.science/pith/LFR7FHJVQ23EUTF5BZT7UOSJPU/action/replication_record"}},"created_at":"2026-07-05T11:07:02.405784+00:00","updated_at":"2026-07-05T11:07:02.405784+00:00"}