{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JWCOWYFEV5U6KLB3CUDHMOVZVV","short_pith_number":"pith:JWCOWYFE","schema_version":"1.0","canonical_sha256":"4d84eb60a4af69e52c3b1506763ab9ad49223070eeed6e722aa277132fa167ad","source":{"kind":"arxiv","id":"2308.13916","version":5},"attestation_state":"computed","paper":{"title":"Exploring Large Language Models for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chengsheng Mao, Jiazhen Peng, Liang Yao, Yuan Luo","submitted_at":"2023-08-26T16:51:17Z","abstract_excerpt":"Knowledge graphs play a vital role in numerous artificial intelligence tasks, yet they frequently face the issue of incompleteness. In this study, we explore utilizing Large Language Models (LLM) for knowledge graph completion. We consider triples in knowledge graphs as text sequences and introduce an innovative framework called Knowledge Graph LLM (KG-LLM) to model these triples. Our technique employs entity and relation descriptions of a triple as prompts and utilizes the response for predictions. Experiments on various benchmark knowledge graphs demonstrate that our method attains state-of-"},"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":"2308.13916","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-08-26T16:51:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b0c58a8b8fb25ef00d0a0857387052ef0bf5914643bc62f423dac0bf006763c3","abstract_canon_sha256":"dd839a482993196039d7a3d7bcbd88d14e6a9ab9dd1f7dc07a496ce1e179e12f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:37.246505Z","signature_b64":"MZmRE6tytf5ckA7xeErZZKL/2xR66yH9/oopBZgYh2uh6P1cu3dXO5OWyfbv5MvgG1ufFrGd2sWjQ+J8hnQVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d84eb60a4af69e52c3b1506763ab9ad49223070eeed6e722aa277132fa167ad","last_reissued_at":"2026-07-05T10:13:37.245970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:37.245970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Large Language Models for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chengsheng Mao, Jiazhen Peng, Liang Yao, Yuan Luo","submitted_at":"2023-08-26T16:51:17Z","abstract_excerpt":"Knowledge graphs play a vital role in numerous artificial intelligence tasks, yet they frequently face the issue of incompleteness. In this study, we explore utilizing Large Language Models (LLM) for knowledge graph completion. We consider triples in knowledge graphs as text sequences and introduce an innovative framework called Knowledge Graph LLM (KG-LLM) to model these triples. Our technique employs entity and relation descriptions of a triple as prompts and utilizes the response for predictions. Experiments on various benchmark knowledge graphs demonstrate that our method attains state-of-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13916","kind":"arxiv","version":5},"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/2308.13916/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":"2308.13916","created_at":"2026-07-05T10:13:37.246028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13916v5","created_at":"2026-07-05T10:13:37.246028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13916","created_at":"2026-07-05T10:13:37.246028+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWCOWYFEV5U6","created_at":"2026-07-05T10:13:37.246028+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWCOWYFEV5U6KLB3","created_at":"2026-07-05T10:13:37.246028+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWCOWYFE","created_at":"2026-07-05T10:13:37.246028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.04338","citing_title":"In-depth Analysis of Graph-based RAG in a Unified Framework","ref_index":94,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17669","citing_title":"Multimodal Cultural Heritage Knowledge Graph Extension with Language and Vision Models","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17458","citing_title":"EHRAG: Bridging Semantic Gaps in Lightweight GraphRAG via Hybrid Hypergraph Construction and Retrieval","ref_index":96,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV","json":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV.json","graph_json":"https://pith.science/api/pith-number/JWCOWYFEV5U6KLB3CUDHMOVZVV/graph.json","events_json":"https://pith.science/api/pith-number/JWCOWYFEV5U6KLB3CUDHMOVZVV/events.json","paper":"https://pith.science/paper/JWCOWYFE"},"agent_actions":{"view_html":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV","download_json":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV.json","view_paper":"https://pith.science/paper/JWCOWYFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13916&json=true","fetch_graph":"https://pith.science/api/pith-number/JWCOWYFEV5U6KLB3CUDHMOVZVV/graph.json","fetch_events":"https://pith.science/api/pith-number/JWCOWYFEV5U6KLB3CUDHMOVZVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV/action/storage_attestation","attest_author":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV/action/author_attestation","sign_citation":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV/action/citation_signature","submit_replication":"https://pith.science/pith/JWCOWYFEV5U6KLB3CUDHMOVZVV/action/replication_record"}},"created_at":"2026-07-05T10:13:37.246028+00:00","updated_at":"2026-07-05T10:13:37.246028+00:00"}