{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VWTV4BT5OW4245NFGSH3ZRS26T","short_pith_number":"pith:VWTV4BT5","schema_version":"1.0","canonical_sha256":"ada75e067d75b9ae75a5348fbcc65af4ceac5707b75ccd585aafcd9321f40456","source":{"kind":"arxiv","id":"1802.04868","version":2},"attestation_state":"computed","paper":{"title":"SimplE Embedding for Link Prediction in Knowledge Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Poole, Seyed Mehran Kazemi","submitted_at":"2018-02-13T21:41:32Z","abstract_excerpt":"Knowledge graphs contain knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs contain only a small subset of what is true in the world. Link prediction approaches aim at predicting new links for a knowledge graph given the existing links among the entities. Tensor factorization approaches have proved promising for such link prediction problems. Proposed in 1927, Canonical Polyadic (CP) decomposition is among the first tensor factorization approaches. CP generally performs poorly for link prediction as it learns two independent embedding "},"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":"1802.04868","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2018-02-13T21:41:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"80174143bdbf5d1cd5712b71b2b1e0ff6acfc8d063b8d26fd4189b4d32d30c1b","abstract_canon_sha256":"807fa24f3fff47f2f9f3240893bb80b91d2fb6f6c7eebdf2d0bcc1a0914d96e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.212146Z","signature_b64":"U8kMDLxpWWMtdv1mok9X+oEUu31WVYRT/4AQKSsPh4wLdblRZv9bivBpYOQ61ihgmGjyofk8Uq+OsnHVgfqiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada75e067d75b9ae75a5348fbcc65af4ceac5707b75ccd585aafcd9321f40456","last_reissued_at":"2026-05-18T00:02:18.211711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.211711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SimplE Embedding for Link Prediction in Knowledge Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Poole, Seyed Mehran Kazemi","submitted_at":"2018-02-13T21:41:32Z","abstract_excerpt":"Knowledge graphs contain knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs contain only a small subset of what is true in the world. Link prediction approaches aim at predicting new links for a knowledge graph given the existing links among the entities. Tensor factorization approaches have proved promising for such link prediction problems. Proposed in 1927, Canonical Polyadic (CP) decomposition is among the first tensor factorization approaches. CP generally performs poorly for link prediction as it learns two independent embedding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04868","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":""},"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":"1802.04868","created_at":"2026-05-18T00:02:18.211772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04868v2","created_at":"2026-05-18T00:02:18.211772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04868","created_at":"2026-05-18T00:02:18.211772+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWTV4BT5OW42","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWTV4BT5OW4245NF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWTV4BT5","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00544","citing_title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T","json":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T.json","graph_json":"https://pith.science/api/pith-number/VWTV4BT5OW4245NFGSH3ZRS26T/graph.json","events_json":"https://pith.science/api/pith-number/VWTV4BT5OW4245NFGSH3ZRS26T/events.json","paper":"https://pith.science/paper/VWTV4BT5"},"agent_actions":{"view_html":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T","download_json":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T.json","view_paper":"https://pith.science/paper/VWTV4BT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04868&json=true","fetch_graph":"https://pith.science/api/pith-number/VWTV4BT5OW4245NFGSH3ZRS26T/graph.json","fetch_events":"https://pith.science/api/pith-number/VWTV4BT5OW4245NFGSH3ZRS26T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T/action/storage_attestation","attest_author":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T/action/author_attestation","sign_citation":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T/action/citation_signature","submit_replication":"https://pith.science/pith/VWTV4BT5OW4245NFGSH3ZRS26T/action/replication_record"}},"created_at":"2026-05-18T00:02:18.211772+00:00","updated_at":"2026-05-18T00:02:18.211772+00:00"}