{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z4ARBCZ34SRWBVLOFIIHSLPNMK","short_pith_number":"pith:Z4ARBCZ3","canonical_record":{"source":{"id":"1606.06357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T22:52:48Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dcb9741d6aaeb22ca6df10e67842843457ee58766dcdf0c0fbb57b57121e17c8","abstract_canon_sha256":"e33e3421ea93e505e7752ee2ae3d657d212667de0db6e5252eac578197e44990"},"schema_version":"1.0"},"canonical_sha256":"cf01108b3be4a360d56e2a10792ded6281737e1948527c8515a213a9a6b8b81a","source":{"kind":"arxiv","id":"1606.06357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06357","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06357v1","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06357","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"Z4ARBCZ34SRW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z4ARBCZ34SRWBVLO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z4ARBCZ3","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z4ARBCZ34SRWBVLOFIIHSLPNMK","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T22:52:48Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dcb9741d6aaeb22ca6df10e67842843457ee58766dcdf0c0fbb57b57121e17c8","abstract_canon_sha256":"e33e3421ea93e505e7752ee2ae3d657d212667de0db6e5252eac578197e44990"},"schema_version":"1.0"},"canonical_sha256":"cf01108b3be4a360d56e2a10792ded6281737e1948527c8515a213a9a6b8b81a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:11.163225Z","signature_b64":"+MSsAoi4cfa1OIkCZmHDFvsIRYKLbNdvgrFDfq0Sj89eRVxsJB2ilmFFMeJ3cKWVePrzysz7HtDXELG019+jCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf01108b3be4a360d56e2a10792ded6281737e1948527c8515a213a9a6b8b81a","last_reissued_at":"2026-05-18T01:12:11.162802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:11.162802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06357","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+hiUzJkgrcJA55bHjHYBFw+L27ySJOFHrW/jIT6hDWyiTotW+3Uzj6u4OwgpuOuhcAH+1Auq4gwWYJZngn2LAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:55:34.750607Z"},"content_sha256":"678ebd460486b50b86db7c9cb2f30c39c876a851d8bcdde43a4175ebdae4cc5f","schema_version":"1.0","event_id":"sha256:678ebd460486b50b86db7c9cb2f30c39c876a851d8bcdde43a4175ebdae4cc5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z4ARBCZ34SRWBVLOFIIHSLPNMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complex Embeddings for Simple Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"\\'Eric Gaussier, Guillaume Bouchard, Johannes Welbl, Sebastian Riedel, Th\\'eo Trouillon","submitted_at":"2016-06-20T22:52:48Z","abstract_excerpt":"In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06357","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KtLztftfhRIflaIIB+6qNM/L520DY4u49jejYbtkLzJ0jkJ1CCwTZiWd5UJUuSHsWK407Kgb9l840v8wiXIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T10:55:34.751302Z"},"content_sha256":"489ea47ffa06aac84af6458db95f0cae091052925296a907d9b1b36f1f7ce43c","schema_version":"1.0","event_id":"sha256:489ea47ffa06aac84af6458db95f0cae091052925296a907d9b1b36f1f7ce43c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK/bundle.json","state_url":"https://pith.science/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T10:55:34Z","links":{"resolver":"https://pith.science/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK","bundle":"https://pith.science/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK/bundle.json","state":"https://pith.science/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4ARBCZ34SRWBVLOFIIHSLPNMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z4ARBCZ34SRWBVLOFIIHSLPNMK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e33e3421ea93e505e7752ee2ae3d657d212667de0db6e5252eac578197e44990","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T22:52:48Z","title_canon_sha256":"dcb9741d6aaeb22ca6df10e67842843457ee58766dcdf0c0fbb57b57121e17c8"},"schema_version":"1.0","source":{"id":"1606.06357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06357","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06357v1","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06357","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"Z4ARBCZ34SRW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z4ARBCZ34SRWBVLO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z4ARBCZ3","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:489ea47ffa06aac84af6458db95f0cae091052925296a907d9b1b36f1f7ce43c","target":"graph","created_at":"2026-05-18T01:12:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermit","authors_text":"\\'Eric Gaussier, Guillaume Bouchard, Johannes Welbl, Sebastian Riedel, Th\\'eo Trouillon","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T22:52:48Z","title":"Complex Embeddings for Simple Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06357","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:678ebd460486b50b86db7c9cb2f30c39c876a851d8bcdde43a4175ebdae4cc5f","target":"record","created_at":"2026-05-18T01:12:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e33e3421ea93e505e7752ee2ae3d657d212667de0db6e5252eac578197e44990","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-20T22:52:48Z","title_canon_sha256":"dcb9741d6aaeb22ca6df10e67842843457ee58766dcdf0c0fbb57b57121e17c8"},"schema_version":"1.0","source":{"id":"1606.06357","kind":"arxiv","version":1}},"canonical_sha256":"cf01108b3be4a360d56e2a10792ded6281737e1948527c8515a213a9a6b8b81a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf01108b3be4a360d56e2a10792ded6281737e1948527c8515a213a9a6b8b81a","first_computed_at":"2026-05-18T01:12:11.162802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:11.162802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+MSsAoi4cfa1OIkCZmHDFvsIRYKLbNdvgrFDfq0Sj89eRVxsJB2ilmFFMeJ3cKWVePrzysz7HtDXELG019+jCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:11.163225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:678ebd460486b50b86db7c9cb2f30c39c876a851d8bcdde43a4175ebdae4cc5f","sha256:489ea47ffa06aac84af6458db95f0cae091052925296a907d9b1b36f1f7ce43c"],"state_sha256":"63ef5057e40e541eab0cb6a2ed753da8dad9d10d9f2d7347cbb66ebc132ea46c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BL86BtjEDUWEG1MrVJxDGuffg65vk5CImk/xU/BV2zOd/EsE9LZ3v6rA2+7dFhdVWKN9Y3MqpV2gMjmNCA2KBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T10:55:34.755047Z","bundle_sha256":"1751476a35843aaf1bbfbf54b87987dc450fdeee05bf586bbb744b9594d83e8f"}}