{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YIWK65NEE2FPPXCNQSCVG377SH","short_pith_number":"pith:YIWK65NE","schema_version":"1.0","canonical_sha256":"c22caf75a4268af7dc4d8485536fff91ce1e39b64a316262013106bcb3f2d18b","source":{"kind":"arxiv","id":"2310.11220","version":1},"attestation_state":"computed","paper":{"title":"KG-GPT: A General Framework for Reasoning on Knowledge Graphs Using Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Edward Choi, Jiho Kim, Yeonsu Kwon, Yohan Jo","submitted_at":"2023-10-17T12:51:35Z","abstract_excerpt":"While large language models (LLMs) have made considerable advancements in understanding and generating unstructured text, their application in structured data remains underexplored. Particularly, using LLMs for complex reasoning tasks on knowledge graphs (KGs) remains largely untouched. To address this, we propose KG-GPT, a multi-purpose framework leveraging LLMs for tasks employing KGs. KG-GPT comprises three steps: Sentence Segmentation, Graph Retrieval, and Inference, each aimed at partitioning sentences, retrieving relevant graph components, and deriving logical conclusions, respectively. "},"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":"2310.11220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-17T12:51:35Z","cross_cats_sorted":[],"title_canon_sha256":"f6136c296c7fa1945e64500878d56a10c60ce2dc679192692f5ad0882d9bfb5e","abstract_canon_sha256":"6d876a5a22baaa3088a38804ed5f1c749b4a88b45d3a5c6d9563ea9129c3f1d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:52.558561Z","signature_b64":"JKbJdqEXL23p9K9ry7YHEGfFYyOiB0+8YejxOM38PrmZaeoG26vifxqb7aOkkibergg/cu2qZYll4FFoaeqADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c22caf75a4268af7dc4d8485536fff91ce1e39b64a316262013106bcb3f2d18b","last_reissued_at":"2026-07-05T07:01:52.558106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:52.558106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KG-GPT: A General Framework for Reasoning on Knowledge Graphs Using Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Edward Choi, Jiho Kim, Yeonsu Kwon, Yohan Jo","submitted_at":"2023-10-17T12:51:35Z","abstract_excerpt":"While large language models (LLMs) have made considerable advancements in understanding and generating unstructured text, their application in structured data remains underexplored. Particularly, using LLMs for complex reasoning tasks on knowledge graphs (KGs) remains largely untouched. To address this, we propose KG-GPT, a multi-purpose framework leveraging LLMs for tasks employing KGs. KG-GPT comprises three steps: Sentence Segmentation, Graph Retrieval, and Inference, each aimed at partitioning sentences, retrieving relevant graph components, and deriving logical conclusions, respectively. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11220","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/2310.11220/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":"2310.11220","created_at":"2026-07-05T07:01:52.558160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11220v1","created_at":"2026-07-05T07:01:52.558160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11220","created_at":"2026-07-05T07:01:52.558160+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIWK65NEE2FP","created_at":"2026-07-05T07:01:52.558160+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIWK65NEE2FPPXCN","created_at":"2026-07-05T07:01:52.558160+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIWK65NE","created_at":"2026-07-05T07:01:52.558160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":145,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH","json":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH.json","graph_json":"https://pith.science/api/pith-number/YIWK65NEE2FPPXCNQSCVG377SH/graph.json","events_json":"https://pith.science/api/pith-number/YIWK65NEE2FPPXCNQSCVG377SH/events.json","paper":"https://pith.science/paper/YIWK65NE"},"agent_actions":{"view_html":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH","download_json":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH.json","view_paper":"https://pith.science/paper/YIWK65NE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11220&json=true","fetch_graph":"https://pith.science/api/pith-number/YIWK65NEE2FPPXCNQSCVG377SH/graph.json","fetch_events":"https://pith.science/api/pith-number/YIWK65NEE2FPPXCNQSCVG377SH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH/action/storage_attestation","attest_author":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH/action/author_attestation","sign_citation":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH/action/citation_signature","submit_replication":"https://pith.science/pith/YIWK65NEE2FPPXCNQSCVG377SH/action/replication_record"}},"created_at":"2026-07-05T07:01:52.558160+00:00","updated_at":"2026-07-05T07:01:52.558160+00:00"}