{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H6HIPFYGTHJJDW42MD3XKNXCIM","short_pith_number":"pith:H6HIPFYG","schema_version":"1.0","canonical_sha256":"3f8e87970699d291db9a60f77536e24316dc0eb65c0ed1eebba6607941bae0a3","source":{"kind":"arxiv","id":"1901.09590","version":2},"attestation_state":"computed","paper":{"title":"TuckER: Tensor Factorization for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Allen, Ivana Bala\\v{z}evi\\'c, Timothy M. Hospedales","submitted_at":"2019-01-28T10:42:26Z","abstract_excerpt":"Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones. We propose TuckER, a relatively straightforward but powerful linear model based on Tucker decomposition of the binary tensor representation of knowledge graph triples. TuckER outperforms previous state-of-the-art models across standard link prediction datasets, acting as a strong baseline for more elaborate models. We show that TuckER is a fully expressive model, derive suffic"},"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":"1901.09590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-28T10:42:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"abb5c9781b8e34aee514bf6e9f136d739007745ab1b0643fbd6758d5a3c13a49","abstract_canon_sha256":"6b4e1d7f4f2a7d6980ef3aee9566be7120e4f9076a4c6e0c2ea1675fa47dc7f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:17:25.503222Z","signature_b64":"nL1zgcZVUEUSBwCxL3KJFaqx0qzTNp2183FILLZio8fbCmcjAuMGVhD/yi3bN1rkzljoE4So4O/5EdiaThWbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8e87970699d291db9a60f77536e24316dc0eb65c0ed1eebba6607941bae0a3","last_reissued_at":"2026-07-05T00:17:25.502845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:17:25.502845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TuckER: Tensor Factorization for Knowledge Graph Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Allen, Ivana Bala\\v{z}evi\\'c, Timothy M. Hospedales","submitted_at":"2019-01-28T10:42:26Z","abstract_excerpt":"Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones. We propose TuckER, a relatively straightforward but powerful linear model based on Tucker decomposition of the binary tensor representation of knowledge graph triples. TuckER outperforms previous state-of-the-art models across standard link prediction datasets, acting as a strong baseline for more elaborate models. We show that TuckER is a fully expressive model, derive suffic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09590","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/1901.09590/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":"1901.09590","created_at":"2026-07-05T00:17:25.502918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09590v2","created_at":"2026-07-05T00:17:25.502918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09590","created_at":"2026-07-05T00:17:25.502918+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6HIPFYGTHJJ","created_at":"2026-07-05T00:17:25.502918+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6HIPFYGTHJJDW42","created_at":"2026-07-05T00:17:25.502918+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6HIPFYG","created_at":"2026-07-05T00:17:25.502918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29860","citing_title":"Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29860","citing_title":"Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"1907.03143","citing_title":"Diachronic Embedding for Temporal Knowledge Graph Completion","ref_index":2,"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":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17669","citing_title":"Multimodal Cultural Heritage Knowledge Graph Extension with Language and Vision Models","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM","json":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM.json","graph_json":"https://pith.science/api/pith-number/H6HIPFYGTHJJDW42MD3XKNXCIM/graph.json","events_json":"https://pith.science/api/pith-number/H6HIPFYGTHJJDW42MD3XKNXCIM/events.json","paper":"https://pith.science/paper/H6HIPFYG"},"agent_actions":{"view_html":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM","download_json":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM.json","view_paper":"https://pith.science/paper/H6HIPFYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09590&json=true","fetch_graph":"https://pith.science/api/pith-number/H6HIPFYGTHJJDW42MD3XKNXCIM/graph.json","fetch_events":"https://pith.science/api/pith-number/H6HIPFYGTHJJDW42MD3XKNXCIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM/action/storage_attestation","attest_author":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM/action/author_attestation","sign_citation":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM/action/citation_signature","submit_replication":"https://pith.science/pith/H6HIPFYGTHJJDW42MD3XKNXCIM/action/replication_record"}},"created_at":"2026-07-05T00:17:25.502918+00:00","updated_at":"2026-07-05T00:17:25.502918+00:00"}