{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HZXO6Y7M2ZZ7UCKRV567NUQWHW","short_pith_number":"pith:HZXO6Y7M","schema_version":"1.0","canonical_sha256":"3e6eef63ecd673fa0951af7df6d2163d994cb137e458c5e55764b791da45de9c","source":{"kind":"arxiv","id":"1905.04914","version":1},"attestation_state":"computed","paper":{"title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Lingbing Guo, Wei Hu, Zequn Sun","submitted_at":"2019-05-13T08:53:31Z","abstract_excerpt":"We study the problem of knowledge graph (KG) embedding. A widely-established assumption to this problem is that similar entities are likely to have similar relational roles. However, existing related methods derive KG embeddings mainly based on triple-level learning, which lack the capability of capturing long-term relational dependencies of entities. Moreover, triple-level learning is insufficient for the propagation of semantic information among entities, especially for the case of cross-KG embedding. In this paper, we propose recurrent skipping networks (RSNs), which employ a skipping mecha"},"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":"1905.04914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-13T08:53:31Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"695b568bece7f6956c2743636d8eb4e56eb90e4ef15ae0831d895d9a216684db","abstract_canon_sha256":"c168e1ce38a6c39ccdcbd548c23fa9a6f5410cc5b92075840e9d5554174d7e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.112109Z","signature_b64":"EsnPUUI4x5uvbfkHSSRtHbw0wNyUPg/uvtqi+4QAnZ0Bay7OMIZwTsV8AUhd/4J22zg367yXWHBUMkY2IHjVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e6eef63ecd673fa0951af7df6d2163d994cb137e458c5e55764b791da45de9c","last_reissued_at":"2026-05-17T23:46:23.111553Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.111553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.AI","authors_text":"Lingbing Guo, Wei Hu, Zequn Sun","submitted_at":"2019-05-13T08:53:31Z","abstract_excerpt":"We study the problem of knowledge graph (KG) embedding. A widely-established assumption to this problem is that similar entities are likely to have similar relational roles. However, existing related methods derive KG embeddings mainly based on triple-level learning, which lack the capability of capturing long-term relational dependencies of entities. Moreover, triple-level learning is insufficient for the propagation of semantic information among entities, especially for the case of cross-KG embedding. In this paper, we propose recurrent skipping networks (RSNs), which employ a skipping mecha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04914","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.04914","created_at":"2026-05-17T23:46:23.111631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04914v1","created_at":"2026-05-17T23:46:23.111631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04914","created_at":"2026-05-17T23:46:23.111631+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZXO6Y7M2ZZ7","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZXO6Y7M2ZZ7UCKR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZXO6Y7M","created_at":"2026-05-18T12:33:18.533446+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/HZXO6Y7M2ZZ7UCKRV567NUQWHW","json":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW.json","graph_json":"https://pith.science/api/pith-number/HZXO6Y7M2ZZ7UCKRV567NUQWHW/graph.json","events_json":"https://pith.science/api/pith-number/HZXO6Y7M2ZZ7UCKRV567NUQWHW/events.json","paper":"https://pith.science/paper/HZXO6Y7M"},"agent_actions":{"view_html":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW","download_json":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW.json","view_paper":"https://pith.science/paper/HZXO6Y7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04914&json=true","fetch_graph":"https://pith.science/api/pith-number/HZXO6Y7M2ZZ7UCKRV567NUQWHW/graph.json","fetch_events":"https://pith.science/api/pith-number/HZXO6Y7M2ZZ7UCKRV567NUQWHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/action/storage_attestation","attest_author":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/action/author_attestation","sign_citation":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/action/citation_signature","submit_replication":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/action/replication_record"}},"created_at":"2026-05-17T23:46:23.111631+00:00","updated_at":"2026-05-17T23:46:23.111631+00:00"}