{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RCEVOD7XVRVI5R7ZOSYDQGCSOQ","short_pith_number":"pith:RCEVOD7X","schema_version":"1.0","canonical_sha256":"8889570ff7ac6a8ec7f974b03818527432269b13b9467cb0dcbb2517f6565c6f","source":{"kind":"arxiv","id":"1805.06197","version":3},"attestation_state":"computed","paper":{"title":"A Structural Representation Learning for Multi-relational Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Huiting Hong, Lin Liu, William K. Cheung, Xin Li","submitted_at":"2018-05-16T09:02:00Z","abstract_excerpt":"Most of the existing multi-relational network embedding methods, e.g., TransE, are formulated to preserve pair-wise connectivity structures in the networks. With the observations that significant triangular connectivity structures and parallelogram connectivity structures found in many real multi-relational networks are often ignored and that a hard-constraint commonly adopted by most of the network embedding methods is inaccurate by design, we propose a novel representation learning model for multi-relational networks which can alleviate both fundamental limitations. Scalable learning algorit"},"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":"1805.06197","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-16T09:02:00Z","cross_cats_sorted":[],"title_canon_sha256":"a438dba86362610f81982ae9d2be01a92c750e6ca05c53cdf4e54fa3bd8e3cf2","abstract_canon_sha256":"4d4d06e91f689f5aad22ced1e66e994897ec04b05deb09e5ce98451dac4f7f44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:54.843996Z","signature_b64":"4/oZTsFQJAXS4zHRQp61vvJT8u/5zxAaLfhfB599ok5RDK852mb3ULPyIHhDs7At6XaNuHjcHP9eIecdJmJYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8889570ff7ac6a8ec7f974b03818527432269b13b9467cb0dcbb2517f6565c6f","last_reissued_at":"2026-05-18T00:13:54.843359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:54.843359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Structural Representation Learning for Multi-relational Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Huiting Hong, Lin Liu, William K. Cheung, Xin Li","submitted_at":"2018-05-16T09:02:00Z","abstract_excerpt":"Most of the existing multi-relational network embedding methods, e.g., TransE, are formulated to preserve pair-wise connectivity structures in the networks. With the observations that significant triangular connectivity structures and parallelogram connectivity structures found in many real multi-relational networks are often ignored and that a hard-constraint commonly adopted by most of the network embedding methods is inaccurate by design, we propose a novel representation learning model for multi-relational networks which can alleviate both fundamental limitations. Scalable learning algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06197","kind":"arxiv","version":3},"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":"1805.06197","created_at":"2026-05-18T00:13:54.843482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06197v3","created_at":"2026-05-18T00:13:54.843482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06197","created_at":"2026-05-18T00:13:54.843482+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCEVOD7XVRVI","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCEVOD7XVRVI5R7Z","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCEVOD7X","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08210","citing_title":"Relation-Aware Entity Alignment for Heterogeneous Knowledge Graphs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ","json":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ.json","graph_json":"https://pith.science/api/pith-number/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/graph.json","events_json":"https://pith.science/api/pith-number/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/events.json","paper":"https://pith.science/paper/RCEVOD7X"},"agent_actions":{"view_html":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ","download_json":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ.json","view_paper":"https://pith.science/paper/RCEVOD7X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06197&json=true","fetch_graph":"https://pith.science/api/pith-number/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/action/storage_attestation","attest_author":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/action/author_attestation","sign_citation":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/action/citation_signature","submit_replication":"https://pith.science/pith/RCEVOD7XVRVI5R7ZOSYDQGCSOQ/action/replication_record"}},"created_at":"2026-05-18T00:13:54.843482+00:00","updated_at":"2026-05-18T00:13:54.843482+00:00"}