{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T5Z4CCVNOTYYF2HEIZJMIBQHUV","short_pith_number":"pith:T5Z4CCVN","schema_version":"1.0","canonical_sha256":"9f73c10aad74f182e8e44652c40607a54497e3da7b9934ac0f2ecd69aed3dfde","source":{"kind":"arxiv","id":"1902.10197","version":1},"attestation_state":"computed","paper":{"title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Tang, Jian-Yun Nie, Zhi-Hong Deng, Zhiqing Sun","submitted_at":"2019-02-26T20:15:09Z","abstract_excerpt":"We study the problem of learning representations of entities and relations in knowledge graphs for predicting missing links. The success of such a task heavily relies on the ability of modeling and inferring the patterns of (or between) the relations. In this paper, we present a new approach for knowledge graph embedding called RotatE, which is able to model and infer various relation patterns including: symmetry/antisymmetry, inversion, and composition. Specifically, the RotatE model defines each relation as a rotation from the source entity to the target entity in the complex vector space. I"},"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":"1902.10197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T20:15:09Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"fe624f6c2703e438943780ab9af4b384b85a6f9aca684b0cf0b2a50bd16d54a9","abstract_canon_sha256":"a650b6083c9ba3673000d1f5cbb8055c60afbfc50e2fac1caa4e552dd5191c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.521238Z","signature_b64":"ADN/I9YXBOZ1scCS5WKl/WqGXBUa/vuoNCYOMm6ErOEIZdDGJQhbda0d2PiauIZ/9+5hST9Xi0zxGNkpIhxsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f73c10aad74f182e8e44652c40607a54497e3da7b9934ac0f2ecd69aed3dfde","last_reissued_at":"2026-05-17T23:52:31.520801Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.520801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jian Tang, Jian-Yun Nie, Zhi-Hong Deng, Zhiqing Sun","submitted_at":"2019-02-26T20:15:09Z","abstract_excerpt":"We study the problem of learning representations of entities and relations in knowledge graphs for predicting missing links. The success of such a task heavily relies on the ability of modeling and inferring the patterns of (or between) the relations. In this paper, we present a new approach for knowledge graph embedding called RotatE, which is able to model and infer various relation patterns including: symmetry/antisymmetry, inversion, and composition. Specifically, the RotatE model defines each relation as a rotation from the source entity to the target entity in the complex vector space. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10197","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":""},"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":"1902.10197","created_at":"2026-05-17T23:52:31.520867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10197v1","created_at":"2026-05-17T23:52:31.520867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10197","created_at":"2026-05-17T23:52:31.520867+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5Z4CCVNOTYY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5Z4CCVNOTYYF2HE","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5Z4CCVN","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2605.21916","citing_title":"A2QTGN: Adaptive Amplitude Quantum-Integrated Temporal Graph Network for Dynamic Link Prediction","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22734","citing_title":"ChronoMedKG: A Temporally-Grounded Biomedical Knowledge Graph and Benchmark for Clinical Reasoning","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19644","citing_title":"Inferring Sensitive Attributes from Knowledge Graph Embeddings: Attack and Defense Strategies","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2602.03417","citing_title":"FactNet: A Billion-Scale Knowledge Graph for Multilingual Factual Grounding","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02778","citing_title":"When Modalities Remember: Continual Learning for Multimodal Knowledge Graphs","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03104","citing_title":"AlertStar: Path-Aware Alert Prediction on Hyper-Relational Knowledge Graphs","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10317","citing_title":"Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06154","citing_title":"Graphlets as Building Blocks for Structural Vocabulary in Knowledge Graph Foundation Models","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00265","citing_title":"Polaris: Coupled Orbital Polar Embeddings for Hierarchical Concept Learning","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10947","citing_title":"Multi-Faceted Continual Knowledge Graph Embedding for Semantic-Aware Link Prediction","ref_index":29,"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":194,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV","json":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV.json","graph_json":"https://pith.science/api/pith-number/T5Z4CCVNOTYYF2HEIZJMIBQHUV/graph.json","events_json":"https://pith.science/api/pith-number/T5Z4CCVNOTYYF2HEIZJMIBQHUV/events.json","paper":"https://pith.science/paper/T5Z4CCVN"},"agent_actions":{"view_html":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV","download_json":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV.json","view_paper":"https://pith.science/paper/T5Z4CCVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10197&json=true","fetch_graph":"https://pith.science/api/pith-number/T5Z4CCVNOTYYF2HEIZJMIBQHUV/graph.json","fetch_events":"https://pith.science/api/pith-number/T5Z4CCVNOTYYF2HEIZJMIBQHUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV/action/storage_attestation","attest_author":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV/action/author_attestation","sign_citation":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV/action/citation_signature","submit_replication":"https://pith.science/pith/T5Z4CCVNOTYYF2HEIZJMIBQHUV/action/replication_record"}},"created_at":"2026-05-17T23:52:31.520867+00:00","updated_at":"2026-05-17T23:52:31.520867+00:00"}