{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GGC4SKMJ456Q2FAHZBNTL25LDL","short_pith_number":"pith:GGC4SKMJ","schema_version":"1.0","canonical_sha256":"3185c92989e77d0d1407c85b35ebab1adc33420350014c3dd62fb8ad66530005","source":{"kind":"arxiv","id":"1909.03193","version":2},"attestation_state":"computed","paper":{"title":"KG-BERT: BERT 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, Liang Yao, Yuan Luo","submitted_at":"2019-09-07T06:09:25Z","abstract_excerpt":"Knowledge graphs are important resources for many artificial intelligence tasks but often suffer from incompleteness. In this work, we propose to use pre-trained language models for knowledge graph completion. We treat triples in knowledge graphs as textual sequences and propose a novel framework named Knowledge Graph Bidirectional Encoder Representations from Transformer (KG-BERT) to model these triples. Our method takes entity and relation descriptions of a triple as input and computes scoring function of the triple with the KG-BERT language model. Experimental results on multiple benchmark "},"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":"1909.03193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-09-07T06:09:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5c73a642b508edc849e41f1b4259df06f4496b0857dbcc6f97f9c39529e3a439","abstract_canon_sha256":"aff51b58ddbe5d6c130f4c9596e640c160e67490a89dcb2a71fc90de0e214c73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:58.720051Z","signature_b64":"YK2PYu6fKEeSaQ6Ht5mj92OTVrcBXg/mb0wO2iQRPYT8DapsdWVX0tBcocqgndW2G9wUlUAa0cp9szcMJWu7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3185c92989e77d0d1407c85b35ebab1adc33420350014c3dd62fb8ad66530005","last_reissued_at":"2026-07-05T00:03:58.719620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:58.719620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KG-BERT: BERT 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, Liang Yao, Yuan Luo","submitted_at":"2019-09-07T06:09:25Z","abstract_excerpt":"Knowledge graphs are important resources for many artificial intelligence tasks but often suffer from incompleteness. In this work, we propose to use pre-trained language models for knowledge graph completion. We treat triples in knowledge graphs as textual sequences and propose a novel framework named Knowledge Graph Bidirectional Encoder Representations from Transformer (KG-BERT) to model these triples. Our method takes entity and relation descriptions of a triple as input and computes scoring function of the triple with the KG-BERT language model. Experimental results on multiple benchmark "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03193","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/1909.03193/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":"1909.03193","created_at":"2026-07-05T00:03:58.719681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.03193v2","created_at":"2026-07-05T00:03:58.719681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03193","created_at":"2026-07-05T00:03:58.719681+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGC4SKMJ456Q","created_at":"2026-07-05T00:03:58.719681+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGC4SKMJ456Q2FAH","created_at":"2026-07-05T00:03:58.719681+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGC4SKMJ","created_at":"2026-07-05T00:03:58.719681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11560","citing_title":"LLMs+Graphs: Toward Graph-Native, Synergistic AI Systems","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08658","citing_title":"Extending Ontologies: From Dense Embeddings to Hybrid Quantum-Fuzzy Systems","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2509.26383","citing_title":"Efficient and Transferable Agentic Knowledge Graph RAG via Reinforcement Learning","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2010.03496","citing_title":"Inductive Entity Representations from Text via Link Prediction","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2502.08547","citing_title":"Representation learning to advance multi-institutional studies with electronic health record data from US and France","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18768","citing_title":"ClinQueryAgent: A Conversational Agent for Population Health Management","ref_index":98,"is_internal_anchor":false},{"citing_arxiv_id":"2510.21828","citing_title":"Structured and Abstractive Reasoning on Multi-modal Relational Knowledge Images","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2602.14335","citing_title":"Predicting New Concept-Object Associations in Astronomy by Mining the Literature","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11159","citing_title":"CORE: Cyclic Orthotope Relation Embedding for Knowledge Graph Completion","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10317","citing_title":"Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10488","citing_title":"DeepRefine: Agent-Compiled Knowledge Refinement via Reinforcement Learning","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25693","citing_title":"RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21649","citing_title":"GS-Quant: Granular Semantic and Generative Structural Quantization for Knowledge Graph Completion","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL","json":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL.json","graph_json":"https://pith.science/api/pith-number/GGC4SKMJ456Q2FAHZBNTL25LDL/graph.json","events_json":"https://pith.science/api/pith-number/GGC4SKMJ456Q2FAHZBNTL25LDL/events.json","paper":"https://pith.science/paper/GGC4SKMJ"},"agent_actions":{"view_html":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL","download_json":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL.json","view_paper":"https://pith.science/paper/GGC4SKMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.03193&json=true","fetch_graph":"https://pith.science/api/pith-number/GGC4SKMJ456Q2FAHZBNTL25LDL/graph.json","fetch_events":"https://pith.science/api/pith-number/GGC4SKMJ456Q2FAHZBNTL25LDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL/action/storage_attestation","attest_author":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL/action/author_attestation","sign_citation":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL/action/citation_signature","submit_replication":"https://pith.science/pith/GGC4SKMJ456Q2FAHZBNTL25LDL/action/replication_record"}},"created_at":"2026-07-05T00:03:58.719681+00:00","updated_at":"2026-07-05T00:03:58.719681+00:00"}