{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YAAOKWGCDPHMXQRJRECJ2GTUOL","short_pith_number":"pith:YAAOKWGC","canonical_record":{"source":{"id":"1703.10316","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2017-03-30T05:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"7ce1881834a58475411f0ba59cb0c4f550193fcc13e3760b09f23b752ccb77b8","abstract_canon_sha256":"7eaf6e80c1c008e6c7238baf050f94400346dff0d40558920df911c0d1cbf690"},"schema_version":"1.0"},"canonical_sha256":"c000e558c21bcecbc22989049d1a7472eab48ef57a88b03df47bed116a874832","source":{"kind":"arxiv","id":"1703.10316","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10316","created_at":"2026-05-18T00:26:30Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10316v4","created_at":"2026-05-18T00:26:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10316","created_at":"2026-05-18T00:26:30Z"},{"alias_kind":"pith_short_12","alias_value":"YAAOKWGCDPHM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YAAOKWGCDPHMXQRJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YAAOKWGC","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YAAOKWGCDPHMXQRJRECJ2GTUOL","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10316","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2017-03-30T05:20:18Z","cross_cats_sorted":[],"title_canon_sha256":"7ce1881834a58475411f0ba59cb0c4f550193fcc13e3760b09f23b752ccb77b8","abstract_canon_sha256":"7eaf6e80c1c008e6c7238baf050f94400346dff0d40558920df911c0d1cbf690"},"schema_version":"1.0"},"canonical_sha256":"c000e558c21bcecbc22989049d1a7472eab48ef57a88b03df47bed116a874832","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:30.316751Z","signature_b64":"iWQ4VNcatl2KMF0Gk4+cOaok3HXnXxS5bcHjWPj7vzJegLflldvQfEkbBussT5fy92BOR+Wb/WZ1QGMX+NFxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c000e558c21bcecbc22989049d1a7472eab48ef57a88b03df47bed116a874832","last_reissued_at":"2026-05-18T00:26:30.316021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:30.316021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10316","source_version":4,"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-18T00:26:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlME917IhRrBULCYM79oDZc+2Y+aT0gpnBiDgolirkqAAcZTQNArIsMeJywWs7vEv+nYBJB1poIJctK5MkbfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:25:00.436698Z"},"content_sha256":"6cd75836215849c091c6f455121fabc503971adc0713810f6e108d6d8045ec73","schema_version":"1.0","event_id":"sha256:6cd75836215849c091c6f455121fabc503971adc0713810f6e108d6d8045ec73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YAAOKWGCDPHMXQRJRECJ2GTUOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Parallel Translating Embedding For Knowledge Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Denghui Zhang, Manling Li, Xueqi Cheng, Yantao Jia, Yuanzhuo Wang","submitted_at":"2017-03-30T05:20:18Z","abstract_excerpt":"Knowledge graph embedding aims to embed entities and relations of knowledge graphs into low-dimensional vector spaces. Translating embedding methods regard relations as the translation from head entities to tail entities, which achieve the state-of-the-art results among knowledge graph embedding methods. However, a major limitation of these methods is the time consuming training process, which may take several days or even weeks for large knowledge graphs, and result in great difficulty in practical applications. In this paper, we propose an efficient parallel framework for translating embeddi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10316","kind":"arxiv","version":4},"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-18T00:26:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxG9MurjlOO96kH5BLGuVjQpvKuwSAonm7jEe3KcV7l57syLWn3KGDJUVwfGzgx2SUWyp3D8yNNm5bv1Vz/GAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:25:00.437038Z"},"content_sha256":"8bd95887c6235337ee25d8bc6e957025d58e1d05240e395b03e373705f6441bb","schema_version":"1.0","event_id":"sha256:8bd95887c6235337ee25d8bc6e957025d58e1d05240e395b03e373705f6441bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL/bundle.json","state_url":"https://pith.science/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL/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-06-02T00:25:00Z","links":{"resolver":"https://pith.science/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL","bundle":"https://pith.science/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL/bundle.json","state":"https://pith.science/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAAOKWGCDPHMXQRJRECJ2GTUOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YAAOKWGCDPHMXQRJRECJ2GTUOL","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":"7eaf6e80c1c008e6c7238baf050f94400346dff0d40558920df911c0d1cbf690","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2017-03-30T05:20:18Z","title_canon_sha256":"7ce1881834a58475411f0ba59cb0c4f550193fcc13e3760b09f23b752ccb77b8"},"schema_version":"1.0","source":{"id":"1703.10316","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10316","created_at":"2026-05-18T00:26:30Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10316v4","created_at":"2026-05-18T00:26:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10316","created_at":"2026-05-18T00:26:30Z"},{"alias_kind":"pith_short_12","alias_value":"YAAOKWGCDPHM","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YAAOKWGCDPHMXQRJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YAAOKWGC","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:8bd95887c6235337ee25d8bc6e957025d58e1d05240e395b03e373705f6441bb","target":"graph","created_at":"2026-05-18T00:26:30Z","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":"Knowledge graph embedding aims to embed entities and relations of knowledge graphs into low-dimensional vector spaces. Translating embedding methods regard relations as the translation from head entities to tail entities, which achieve the state-of-the-art results among knowledge graph embedding methods. However, a major limitation of these methods is the time consuming training process, which may take several days or even weeks for large knowledge graphs, and result in great difficulty in practical applications. In this paper, we propose an efficient parallel framework for translating embeddi","authors_text":"Denghui Zhang, Manling Li, Xueqi Cheng, Yantao Jia, Yuanzhuo Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2017-03-30T05:20:18Z","title":"Efficient Parallel Translating Embedding For Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10316","kind":"arxiv","version":4},"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:6cd75836215849c091c6f455121fabc503971adc0713810f6e108d6d8045ec73","target":"record","created_at":"2026-05-18T00:26:30Z","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":"7eaf6e80c1c008e6c7238baf050f94400346dff0d40558920df911c0d1cbf690","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2017-03-30T05:20:18Z","title_canon_sha256":"7ce1881834a58475411f0ba59cb0c4f550193fcc13e3760b09f23b752ccb77b8"},"schema_version":"1.0","source":{"id":"1703.10316","kind":"arxiv","version":4}},"canonical_sha256":"c000e558c21bcecbc22989049d1a7472eab48ef57a88b03df47bed116a874832","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c000e558c21bcecbc22989049d1a7472eab48ef57a88b03df47bed116a874832","first_computed_at":"2026-05-18T00:26:30.316021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:30.316021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iWQ4VNcatl2KMF0Gk4+cOaok3HXnXxS5bcHjWPj7vzJegLflldvQfEkbBussT5fy92BOR+Wb/WZ1QGMX+NFxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:30.316751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10316","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cd75836215849c091c6f455121fabc503971adc0713810f6e108d6d8045ec73","sha256:8bd95887c6235337ee25d8bc6e957025d58e1d05240e395b03e373705f6441bb"],"state_sha256":"a274ee3e84d4a99e2505927ef1ca714f23804d8d23e9d29f1362ca88c3f2558c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69QlBnzixJz303AIQIVOdgRbER8yjJqgwtu4FVxo530bswnZuE+XNghtd4XNPnVHIlWR0oDONmWtRNTCnn13Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:25:00.438926Z","bundle_sha256":"c1309dadb812e2833727f3061948e2bf33a6e2073c52a781b16d2518132dd440"}}