{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M33O4JFVCKPOTVWE5DMRTVUHUI","short_pith_number":"pith:M33O4JFV","schema_version":"1.0","canonical_sha256":"66f6ee24b5129ee9d6c4e8d919d687a21a3d757b7013ef3633fd780610ff6609","source":{"kind":"arxiv","id":"2402.11163","version":1},"attestation_state":"computed","paper":{"title":"KG-Agent: An Efficient Autonomous Agent Framework for Complex Reasoning over Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chen Zhu, Hengshu Zhu, Jinhao Jiang, Ji-Rong Wen, Kun Zhou, Wayne Xin Zhao, Yang Song","submitted_at":"2024-02-17T02:07:49Z","abstract_excerpt":"In this paper, we aim to improve the reasoning ability of large language models (LLMs) over knowledge graphs (KGs) to answer complex questions. Inspired by existing methods that design the interaction strategy between LLMs and KG, we propose an autonomous LLM-based agent framework, called KG-Agent, which enables a small LLM to actively make decisions until finishing the reasoning process over KGs. In KG-Agent, we integrate the LLM, multifunctional toolbox, KG-based executor, and knowledge memory, and develop an iteration mechanism that autonomously selects the tool then updates the memory for "},"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":"2402.11163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-02-17T02:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"f5556cf3c1f6b8401181b0dbee756716c7ba8399639aa19d46b58930f66d0bd5","abstract_canon_sha256":"6bae876d253bc24d08433a34a8cb014bdc129d4ce5627f3943a7b979c1f4ab42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:35.072065Z","signature_b64":"eeAlfkstci69in/WF6qAJgyykQ6icJNOcAjL7acrUR26XvbRHWT/JaOdGV2RjDIpwkYC1eRd4yzsCWHMocTKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f6ee24b5129ee9d6c4e8d919d687a21a3d757b7013ef3633fd780610ff6609","last_reissued_at":"2026-07-05T07:46:35.071559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:35.071559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KG-Agent: An Efficient Autonomous Agent Framework for Complex Reasoning over Knowledge Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chen Zhu, Hengshu Zhu, Jinhao Jiang, Ji-Rong Wen, Kun Zhou, Wayne Xin Zhao, Yang Song","submitted_at":"2024-02-17T02:07:49Z","abstract_excerpt":"In this paper, we aim to improve the reasoning ability of large language models (LLMs) over knowledge graphs (KGs) to answer complex questions. Inspired by existing methods that design the interaction strategy between LLMs and KG, we propose an autonomous LLM-based agent framework, called KG-Agent, which enables a small LLM to actively make decisions until finishing the reasoning process over KGs. In KG-Agent, we integrate the LLM, multifunctional toolbox, KG-based executor, and knowledge memory, and develop an iteration mechanism that autonomously selects the tool then updates the memory for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11163","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/2402.11163/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":"2402.11163","created_at":"2026-07-05T07:46:35.071622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.11163v1","created_at":"2026-07-05T07:46:35.071622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11163","created_at":"2026-07-05T07:46:35.071622+00:00"},{"alias_kind":"pith_short_12","alias_value":"M33O4JFVCKPO","created_at":"2026-07-05T07:46:35.071622+00:00"},{"alias_kind":"pith_short_16","alias_value":"M33O4JFVCKPOTVWE","created_at":"2026-07-05T07:46:35.071622+00:00"},{"alias_kind":"pith_short_8","alias_value":"M33O4JFV","created_at":"2026-07-05T07:46:35.071622+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15102","citing_title":"Improving Multi-turn Dialogue Consistency with Self-Recall Thinking","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2510.08952","citing_title":"When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":182,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI","json":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI.json","graph_json":"https://pith.science/api/pith-number/M33O4JFVCKPOTVWE5DMRTVUHUI/graph.json","events_json":"https://pith.science/api/pith-number/M33O4JFVCKPOTVWE5DMRTVUHUI/events.json","paper":"https://pith.science/paper/M33O4JFV"},"agent_actions":{"view_html":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI","download_json":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI.json","view_paper":"https://pith.science/paper/M33O4JFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.11163&json=true","fetch_graph":"https://pith.science/api/pith-number/M33O4JFVCKPOTVWE5DMRTVUHUI/graph.json","fetch_events":"https://pith.science/api/pith-number/M33O4JFVCKPOTVWE5DMRTVUHUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI/action/storage_attestation","attest_author":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI/action/author_attestation","sign_citation":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI/action/citation_signature","submit_replication":"https://pith.science/pith/M33O4JFVCKPOTVWE5DMRTVUHUI/action/replication_record"}},"created_at":"2026-07-05T07:46:35.071622+00:00","updated_at":"2026-07-05T07:46:35.071622+00:00"}