{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W3VSSAOZBFSGNANEIJIKWWCOTE","short_pith_number":"pith:W3VSSAOZ","canonical_record":{"source":{"id":"1506.00379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-01T08:22:49Z","cross_cats_sorted":[],"title_canon_sha256":"49fad05f71af61202624081c99e86eb66641d8f68a2373e62585b0337c705fd3","abstract_canon_sha256":"e31f9aa3a3644afe68f1fde59514ccde5a07bd29f67adea8256150bd6ea6ec7e"},"schema_version":"1.0"},"canonical_sha256":"b6eb2901d909646681a44250ab584e992e4ec0cf2f5b01e268a59985683e17c9","source":{"kind":"arxiv","id":"1506.00379","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00379","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00379v2","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00379","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"W3VSSAOZBFSG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W3VSSAOZBFSGNANE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W3VSSAOZ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W3VSSAOZBFSGNANEIJIKWWCOTE","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-01T08:22:49Z","cross_cats_sorted":[],"title_canon_sha256":"49fad05f71af61202624081c99e86eb66641d8f68a2373e62585b0337c705fd3","abstract_canon_sha256":"e31f9aa3a3644afe68f1fde59514ccde5a07bd29f67adea8256150bd6ea6ec7e"},"schema_version":"1.0"},"canonical_sha256":"b6eb2901d909646681a44250ab584e992e4ec0cf2f5b01e268a59985683e17c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.864393Z","signature_b64":"88UrRX/2CaeH1oA4iz7ICOrJLrlFF/WieEfESU6+pwi+4Le3qoNf1UoA7ZAA69CvCxBf/NqRGZAiCs28NWVJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6eb2901d909646681a44250ab584e992e4ec0cf2f5b01e268a59985683e17c9","last_reissued_at":"2026-05-18T01:35:15.863931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.863931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00379","source_version":2,"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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGONWuExMPTSORCL610adPQHa/LBF64l/JVr3DyRoxFTdCd9Uk+4N5sDrtBhYMSoIkuDMjFQ16MFC8P39WDEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:55:07.642143Z"},"content_sha256":"bfaa73b1d6159f5fa95ec6333abf541f341fa1279765693016c89df1fdacdc1e","schema_version":"1.0","event_id":"sha256:bfaa73b1d6159f5fa95ec6333abf541f341fa1279765693016c89df1fdacdc1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W3VSSAOZBFSGNANEIJIKWWCOTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Relation Paths for Representation Learning of Knowledge Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Huanbo Luan, Maosong Sun, Siwei Rao, Song Liu, Yankai Lin, Zhiyuan Liu","submitted_at":"2015-06-01T08:22:49Z","abstract_excerpt":"Representation learning of knowledge bases (KBs) aims to embed both entities and relations into a low-dimensional space. Most existing methods only consider direct relations in representation learning. We argue that multiple-step relation paths also contain rich inference patterns between entities, and propose a path-based representation learning model. This model considers relation paths as translations between entities for representation learning, and addresses two key challenges: (1) Since not all relation paths are reliable, we design a path-constraint resource allocation algorithm to meas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00379","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"},"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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCzRbFQDYHEd0tu7wgWfS0KVFIoviNZQ95SAJUvBYNWsAK703V2Sott6algHeEB4wKLcZ72+lZK8nCq6vv0kAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:55:07.642501Z"},"content_sha256":"4d66eaaa0cd55af2b178b66d2b74143479e46fbbb79f65ce8a50eda306be3288","schema_version":"1.0","event_id":"sha256:4d66eaaa0cd55af2b178b66d2b74143479e46fbbb79f65ce8a50eda306be3288"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/bundle.json","state_url":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/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-02T17:55:07Z","links":{"resolver":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE","bundle":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/bundle.json","state":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W3VSSAOZBFSGNANEIJIKWWCOTE","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":"e31f9aa3a3644afe68f1fde59514ccde5a07bd29f67adea8256150bd6ea6ec7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-01T08:22:49Z","title_canon_sha256":"49fad05f71af61202624081c99e86eb66641d8f68a2373e62585b0337c705fd3"},"schema_version":"1.0","source":{"id":"1506.00379","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00379","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00379v2","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00379","created_at":"2026-05-18T01:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"W3VSSAOZBFSG","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W3VSSAOZBFSGNANE","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W3VSSAOZ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:4d66eaaa0cd55af2b178b66d2b74143479e46fbbb79f65ce8a50eda306be3288","target":"graph","created_at":"2026-05-18T01:35:15Z","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":"Representation learning of knowledge bases (KBs) aims to embed both entities and relations into a low-dimensional space. Most existing methods only consider direct relations in representation learning. We argue that multiple-step relation paths also contain rich inference patterns between entities, and propose a path-based representation learning model. This model considers relation paths as translations between entities for representation learning, and addresses two key challenges: (1) Since not all relation paths are reliable, we design a path-constraint resource allocation algorithm to meas","authors_text":"Huanbo Luan, Maosong Sun, Siwei Rao, Song Liu, Yankai Lin, Zhiyuan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-01T08:22:49Z","title":"Modeling Relation Paths for Representation Learning of Knowledge Bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00379","kind":"arxiv","version":2},"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:bfaa73b1d6159f5fa95ec6333abf541f341fa1279765693016c89df1fdacdc1e","target":"record","created_at":"2026-05-18T01:35:15Z","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":"e31f9aa3a3644afe68f1fde59514ccde5a07bd29f67adea8256150bd6ea6ec7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-01T08:22:49Z","title_canon_sha256":"49fad05f71af61202624081c99e86eb66641d8f68a2373e62585b0337c705fd3"},"schema_version":"1.0","source":{"id":"1506.00379","kind":"arxiv","version":2}},"canonical_sha256":"b6eb2901d909646681a44250ab584e992e4ec0cf2f5b01e268a59985683e17c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6eb2901d909646681a44250ab584e992e4ec0cf2f5b01e268a59985683e17c9","first_computed_at":"2026-05-18T01:35:15.863931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:15.863931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88UrRX/2CaeH1oA4iz7ICOrJLrlFF/WieEfESU6+pwi+4Le3qoNf1UoA7ZAA69CvCxBf/NqRGZAiCs28NWVJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:15.864393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00379","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfaa73b1d6159f5fa95ec6333abf541f341fa1279765693016c89df1fdacdc1e","sha256:4d66eaaa0cd55af2b178b66d2b74143479e46fbbb79f65ce8a50eda306be3288"],"state_sha256":"cdb9b89e686d7b8b30261ce3fa3513e63aac7427f5bec0658eb567e4ef7055dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hx6PPGuO9cZwPeLh71plQRksoAz6oIVl96KvWW9ft82KNaE5ccFL4SYr/GvG+aa8dd8bHHvIYICYTzYc284EDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:55:07.644533Z","bundle_sha256":"babf271c1303b4f4dc14525580b9fb4a734559efaf5b7f7aa319131faae0b6eb"}}