{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W3VSSAOZBFSGNANEIJIKWWCOTE","short_pith_number":"pith:W3VSSAOZ","schema_version":"1.0","canonical_sha256":"b6eb2901d909646681a44250ab584e992e4ec0cf2f5b01e268a59985683e17c9","source":{"kind":"arxiv","id":"1506.00379","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00379","created_at":"2026-05-18T01:35:15.864000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00379v2","created_at":"2026-05-18T01:35:15.864000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00379","created_at":"2026-05-18T01:35:15.864000+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3VSSAOZBFSG","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3VSSAOZBFSGNANE","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3VSSAOZ","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE","json":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE.json","graph_json":"https://pith.science/api/pith-number/W3VSSAOZBFSGNANEIJIKWWCOTE/graph.json","events_json":"https://pith.science/api/pith-number/W3VSSAOZBFSGNANEIJIKWWCOTE/events.json","paper":"https://pith.science/paper/W3VSSAOZ"},"agent_actions":{"view_html":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE","download_json":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE.json","view_paper":"https://pith.science/paper/W3VSSAOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00379&json=true","fetch_graph":"https://pith.science/api/pith-number/W3VSSAOZBFSGNANEIJIKWWCOTE/graph.json","fetch_events":"https://pith.science/api/pith-number/W3VSSAOZBFSGNANEIJIKWWCOTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/action/storage_attestation","attest_author":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/action/author_attestation","sign_citation":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/action/citation_signature","submit_replication":"https://pith.science/pith/W3VSSAOZBFSGNANEIJIKWWCOTE/action/replication_record"}},"created_at":"2026-05-18T01:35:15.864000+00:00","updated_at":"2026-05-18T01:35:15.864000+00:00"}