{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MPQQSBQDQW5B6EDER7SLVGMZET","short_pith_number":"pith:MPQQSBQD","schema_version":"1.0","canonical_sha256":"63e109060385ba1f10648fe4ba999924ce6fb18a4e18aef92025b8990af3c022","source":{"kind":"arxiv","id":"2504.05163","version":2},"attestation_state":"computed","paper":{"title":"Evaluating Knowledge Graph Based Retrieval Augmented Generation Methods under Knowledge Incompleteness","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dongzhuoran Zhou, Evgeny Kharlamov, Jiaoyan Chen, Steffen Staab, Xiaxia Wang, Yuan He, Yuqicheng Zhu","submitted_at":"2025-04-07T15:08:03Z","abstract_excerpt":"Knowledge Graph based Retrieval-Augmented Generation (KG-RAG) is a technique that enhances Large Language Model (LLM) inference in tasks like Question Answering (QA) by retrieving relevant information from knowledge graphs (KGs). However, real-world KGs are often incomplete, meaning that essential information for answering questions may be missing. Existing benchmarks do not adequately capture the impact of KG incompleteness on KG-RAG performance. In this paper, we systematically evaluate KG-RAG methods under incomplete KGs by removing triples using different methods and analyzing the resultin"},"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":"2504.05163","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-07T15:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"55939656566a3c8f8812031639028bded197e196930e09977efdc5222fde3780","abstract_canon_sha256":"df95a8354d28ce508855ab3216947fd0bf8862b7a29281dd0ef56d6959a4b339"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:44.949811Z","signature_b64":"vgPlIazz/VSSA58jxUjVp9ehNAAPUNfPI+m6Mr+IZBDcmxeC6R6dY9bMwyt0x47Y29ejlGXeu4IGS6fLi9VhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e109060385ba1f10648fe4ba999924ce6fb18a4e18aef92025b8990af3c022","last_reissued_at":"2026-07-05T12:01:44.949296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:44.949296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating Knowledge Graph Based Retrieval Augmented Generation Methods under Knowledge Incompleteness","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dongzhuoran Zhou, Evgeny Kharlamov, Jiaoyan Chen, Steffen Staab, Xiaxia Wang, Yuan He, Yuqicheng Zhu","submitted_at":"2025-04-07T15:08:03Z","abstract_excerpt":"Knowledge Graph based Retrieval-Augmented Generation (KG-RAG) is a technique that enhances Large Language Model (LLM) inference in tasks like Question Answering (QA) by retrieving relevant information from knowledge graphs (KGs). However, real-world KGs are often incomplete, meaning that essential information for answering questions may be missing. Existing benchmarks do not adequately capture the impact of KG incompleteness on KG-RAG performance. In this paper, we systematically evaluate KG-RAG methods under incomplete KGs by removing triples using different methods and analyzing the resultin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05163","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/2504.05163/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":"2504.05163","created_at":"2026-07-05T12:01:44.949366+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05163v2","created_at":"2026-07-05T12:01:44.949366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05163","created_at":"2026-07-05T12:01:44.949366+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPQQSBQDQW5B","created_at":"2026-07-05T12:01:44.949366+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPQQSBQDQW5B6EDE","created_at":"2026-07-05T12:01:44.949366+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPQQSBQD","created_at":"2026-07-05T12:01:44.949366+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05476","citing_title":"A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13979","citing_title":"Leveraging LLM-GNN Integration for Open-World Question Answering over Knowledge Graphs","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET","json":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET.json","graph_json":"https://pith.science/api/pith-number/MPQQSBQDQW5B6EDER7SLVGMZET/graph.json","events_json":"https://pith.science/api/pith-number/MPQQSBQDQW5B6EDER7SLVGMZET/events.json","paper":"https://pith.science/paper/MPQQSBQD"},"agent_actions":{"view_html":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET","download_json":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET.json","view_paper":"https://pith.science/paper/MPQQSBQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05163&json=true","fetch_graph":"https://pith.science/api/pith-number/MPQQSBQDQW5B6EDER7SLVGMZET/graph.json","fetch_events":"https://pith.science/api/pith-number/MPQQSBQDQW5B6EDER7SLVGMZET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET/action/storage_attestation","attest_author":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET/action/author_attestation","sign_citation":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET/action/citation_signature","submit_replication":"https://pith.science/pith/MPQQSBQDQW5B6EDER7SLVGMZET/action/replication_record"}},"created_at":"2026-07-05T12:01:44.949366+00:00","updated_at":"2026-07-05T12:01:44.949366+00:00"}