{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VVGBTLZOJD5CZUUGDBMQUC6LEF","short_pith_number":"pith:VVGBTLZO","schema_version":"1.0","canonical_sha256":"ad4c19af2e48fa2cd28618590a0bcb216fcba06b1657c5f75fc3b6e0314e5ccf","source":{"kind":"arxiv","id":"2110.09978","version":1},"attestation_state":"computed","paper":{"title":"What is Learned in Knowledge Graph Embeddings?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Wood, Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer, Peter Chin, Tianqi Wu, Trung V. Dang","submitted_at":"2021-10-19T13:52:11Z","abstract_excerpt":"A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph with edge types. KGs are an important primitive in modern machine learning and artificial intelligence. Embedding-based models, such as the seminal TransE [Bordes et al., 2013] and the recent PairRE [Chao et al., 2020] are among the most popular and successful approaches for representing KGs and inferring missing edges (link completion). Their relative success is often credited in the literature to their ability to learn logical rules between the relations.\n  In this"},"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":"2110.09978","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-10-19T13:52:11Z","cross_cats_sorted":[],"title_canon_sha256":"5f7885597977682ae05fff6feaa4db88ffda822c1a9a672f86d491baceccc9da","abstract_canon_sha256":"4c764ce796e8d904ab3773f32e2e576ff290bbf5c32251507e8707826b0088a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:01.857367Z","signature_b64":"h5WKOBDNx1mlZd5aUcghwDanX6Oc0W6HaIMBZk/pWJugW3ZgNP/oqM9i34YUevXkIzrUORxeag6nrnKwXhWeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad4c19af2e48fa2cd28618590a0bcb216fcba06b1657c5f75fc3b6e0314e5ccf","last_reissued_at":"2026-07-05T03:24:01.856927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:01.856927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What is Learned in Knowledge Graph Embeddings?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Wood, Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer, Peter Chin, Tianqi Wu, Trung V. Dang","submitted_at":"2021-10-19T13:52:11Z","abstract_excerpt":"A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph with edge types. KGs are an important primitive in modern machine learning and artificial intelligence. Embedding-based models, such as the seminal TransE [Bordes et al., 2013] and the recent PairRE [Chao et al., 2020] are among the most popular and successful approaches for representing KGs and inferring missing edges (link completion). Their relative success is often credited in the literature to their ability to learn logical rules between the relations.\n  In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.09978","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/2110.09978/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":"2110.09978","created_at":"2026-07-05T03:24:01.856991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.09978v1","created_at":"2026-07-05T03:24:01.856991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.09978","created_at":"2026-07-05T03:24:01.856991+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVGBTLZOJD5C","created_at":"2026-07-05T03:24:01.856991+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVGBTLZOJD5CZUUG","created_at":"2026-07-05T03:24:01.856991+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVGBTLZO","created_at":"2026-07-05T03:24:01.856991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF","json":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF.json","graph_json":"https://pith.science/api/pith-number/VVGBTLZOJD5CZUUGDBMQUC6LEF/graph.json","events_json":"https://pith.science/api/pith-number/VVGBTLZOJD5CZUUGDBMQUC6LEF/events.json","paper":"https://pith.science/paper/VVGBTLZO"},"agent_actions":{"view_html":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF","download_json":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF.json","view_paper":"https://pith.science/paper/VVGBTLZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.09978&json=true","fetch_graph":"https://pith.science/api/pith-number/VVGBTLZOJD5CZUUGDBMQUC6LEF/graph.json","fetch_events":"https://pith.science/api/pith-number/VVGBTLZOJD5CZUUGDBMQUC6LEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF/action/storage_attestation","attest_author":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF/action/author_attestation","sign_citation":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF/action/citation_signature","submit_replication":"https://pith.science/pith/VVGBTLZOJD5CZUUGDBMQUC6LEF/action/replication_record"}},"created_at":"2026-07-05T03:24:01.856991+00:00","updated_at":"2026-07-05T03:24:01.856991+00:00"}