{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BRXKJS7HDSQFSA74IW5CGX2YWB","short_pith_number":"pith:BRXKJS7H","schema_version":"1.0","canonical_sha256":"0c6ea4cbe71ca05903fc45ba235f58b06fb2f703133ff6edae948ac08f7b90cb","source":{"kind":"arxiv","id":"2608.07954","version":1},"attestation_state":"computed","paper":{"title":"KGCache: Amortized Subgraph Retrieval for KG Reasoning with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariful Azad, Changcheng Yuan, Sabuj Laskar, Uros Stanic","submitted_at":"2026-08-08T06:36:24Z","abstract_excerpt":"Large language models can answer knowledge-intensive questions more reliably when they are grounded with knowledge graphs, but systems such as Think-on-Graph and Reasoning-on-Graph repeatedly query the same graph neighborhoods across different questions. In this work, we study this repeated retrieval in Knowledge Graph Question Answering~(KGQA) workloads and propose KGCache, an in-memory cache for one-hop knowledge graph neighborhoods. KGCache is designed to be compatible with both iterative traversal (ToG) and one shot planning (RoG) KGQA paradigms. KGCache is placed between the KGQA engine a"},"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":"2608.07954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-08T06:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"a3496327dfc227a88ca47470194dfd140c2a1b77a3de240aac56c53b614ff00c","abstract_canon_sha256":"147a2b408ae8105fe49fdfbe42c89b21fb9a0c58e2fdcd690e5f4c1b4d206272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:21:13.216232Z","signature_b64":"IC1juLyjxXFjNMQqXshX6jAYp/Dx/p6zJQNaUie7rpeBue1gHcT7DR1qz1GBMPhRwExBtz1bLE3jKpsJTOdPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c6ea4cbe71ca05903fc45ba235f58b06fb2f703133ff6edae948ac08f7b90cb","last_reissued_at":"2026-08-11T01:21:13.213047Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:21:13.213047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KGCache: Amortized Subgraph Retrieval for KG Reasoning with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariful Azad, Changcheng Yuan, Sabuj Laskar, Uros Stanic","submitted_at":"2026-08-08T06:36:24Z","abstract_excerpt":"Large language models can answer knowledge-intensive questions more reliably when they are grounded with knowledge graphs, but systems such as Think-on-Graph and Reasoning-on-Graph repeatedly query the same graph neighborhoods across different questions. In this work, we study this repeated retrieval in Knowledge Graph Question Answering~(KGQA) workloads and propose KGCache, an in-memory cache for one-hop knowledge graph neighborhoods. KGCache is designed to be compatible with both iterative traversal (ToG) and one shot planning (RoG) KGQA paradigms. KGCache is placed between the KGQA engine a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07954","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/2608.07954/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":"2608.07954","created_at":"2026-08-11T01:21:13.214024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07954v1","created_at":"2026-08-11T01:21:13.214024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07954","created_at":"2026-08-11T01:21:13.214024+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRXKJS7HDSQF","created_at":"2026-08-11T01:21:13.214024+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRXKJS7HDSQFSA74","created_at":"2026-08-11T01:21:13.214024+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRXKJS7H","created_at":"2026-08-11T01:21:13.214024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB","json":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB.json","graph_json":"https://pith.science/api/pith-number/BRXKJS7HDSQFSA74IW5CGX2YWB/graph.json","events_json":"https://pith.science/api/pith-number/BRXKJS7HDSQFSA74IW5CGX2YWB/events.json","paper":"https://pith.science/paper/BRXKJS7H"},"agent_actions":{"view_html":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB","download_json":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB.json","view_paper":"https://pith.science/paper/BRXKJS7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07954&json=true","fetch_graph":"https://pith.science/api/pith-number/BRXKJS7HDSQFSA74IW5CGX2YWB/graph.json","fetch_events":"https://pith.science/api/pith-number/BRXKJS7HDSQFSA74IW5CGX2YWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB/action/storage_attestation","attest_author":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB/action/author_attestation","sign_citation":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB/action/citation_signature","submit_replication":"https://pith.science/pith/BRXKJS7HDSQFSA74IW5CGX2YWB/action/replication_record"}},"created_at":"2026-08-11T01:21:13.214024+00:00","updated_at":"2026-08-11T01:21:13.214024+00:00"}