{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KOHPT623XW4ISKGKSHJHTPBHZO","short_pith_number":"pith:KOHPT623","schema_version":"1.0","canonical_sha256":"538ef9fb5bbdb88928ca91d279bc27cb9390658e69a1c6589f5952ca165fc447","source":{"kind":"arxiv","id":"1412.6575","version":4},"attestation_state":"computed","paper":{"title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bishan Yang, Jianfeng Gao, Li Deng, Wen-tau Yih, Xiaodong He","submitted_at":"2014-12-20T01:37:16Z","abstract_excerpt":"We consider learning representations of entities and relations in KBs using the neural-embedding approach. We show that most existing models, including NTN (Socher et al., 2013) and TransE (Bordes et al., 2013b), can be generalized under a unified learning framework, where entities are low-dimensional vectors learned from a neural network and relations are bilinear and/or linear mapping functions. Under this framework, we compare a variety of embedding models on the link prediction task. We show that a simple bilinear formulation achieves new state-of-the-art results for the task (achieving 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":"1412.6575","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-12-20T01:37:16Z","cross_cats_sorted":[],"title_canon_sha256":"9652386ac0d291f6edfaf267cbecd65bebec4d96104cfa533d7f1966914baa85","abstract_canon_sha256":"635af140f764aebcea1cc4829acff9d5aad8d48c0a9a417bbbfd01b0b5d80a75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.283947Z","signature_b64":"dqrrdkCPV3ylVQa7shkBZrIC25uzj9Bj3KU7M1HsZ/3F9VyJdna2NQNr2g4m5FMu0iR919ZOHtaSY0iECmOHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538ef9fb5bbdb88928ca91d279bc27cb9390658e69a1c6589f5952ca165fc447","last_reissued_at":"2026-05-18T01:34:35.283484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.283484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bishan Yang, Jianfeng Gao, Li Deng, Wen-tau Yih, Xiaodong He","submitted_at":"2014-12-20T01:37:16Z","abstract_excerpt":"We consider learning representations of entities and relations in KBs using the neural-embedding approach. We show that most existing models, including NTN (Socher et al., 2013) and TransE (Bordes et al., 2013b), can be generalized under a unified learning framework, where entities are low-dimensional vectors learned from a neural network and relations are bilinear and/or linear mapping functions. Under this framework, we compare a variety of embedding models on the link prediction task. We show that a simple bilinear formulation achieves new state-of-the-art results for the task (achieving a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6575","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1412.6575","created_at":"2026-05-18T01:34:35.283552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6575v4","created_at":"2026-05-18T01:34:35.283552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6575","created_at":"2026-05-18T01:34:35.283552+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOHPT623XW4I","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOHPT623XW4ISKGK","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOHPT623","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"1906.12330","citing_title":"Graph Star Net for Generalized Multi-Task Learning","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01457","citing_title":"Semantic Driven Fielded Entity Retrieval","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2010.03496","citing_title":"Inductive Entity Representations from Text via Link Prediction","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2409.08036","citing_title":"Heterogeneous Sheaf Neural Networks","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17669","citing_title":"Multimodal Cultural Heritage Knowledge Graph Extension with Language and Vision Models","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2506.12075","citing_title":"T-TExTS (Teaching Text Expansion for Teacher Scaffolding): Enhancing Text Selection in High School Literature through Knowledge Graph-Based Recommendation","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02778","citing_title":"When Modalities Remember: Continual Learning for Multimodal Knowledge Graphs","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05463","citing_title":"Robustness of Graph Self-Supervised Learning to Real-World Noise: A Case Study on Text-Driven Biomedical Graphs","ref_index":13,"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":195,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO","json":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO.json","graph_json":"https://pith.science/api/pith-number/KOHPT623XW4ISKGKSHJHTPBHZO/graph.json","events_json":"https://pith.science/api/pith-number/KOHPT623XW4ISKGKSHJHTPBHZO/events.json","paper":"https://pith.science/paper/KOHPT623"},"agent_actions":{"view_html":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO","download_json":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO.json","view_paper":"https://pith.science/paper/KOHPT623","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6575&json=true","fetch_graph":"https://pith.science/api/pith-number/KOHPT623XW4ISKGKSHJHTPBHZO/graph.json","fetch_events":"https://pith.science/api/pith-number/KOHPT623XW4ISKGKSHJHTPBHZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO/action/storage_attestation","attest_author":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO/action/author_attestation","sign_citation":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO/action/citation_signature","submit_replication":"https://pith.science/pith/KOHPT623XW4ISKGKSHJHTPBHZO/action/replication_record"}},"created_at":"2026-05-18T01:34:35.283552+00:00","updated_at":"2026-05-18T01:34:35.283552+00:00"}