{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HZXO6Y7M2ZZ7UCKRV567NUQWHW","short_pith_number":"pith:HZXO6Y7M","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"},"canonical_sha256":"3e6eef63ecd673fa0951af7df6d2163d994cb137e458c5e55764b791da45de9c","source":{"kind":"arxiv","id":"1905.04914","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04914","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04914v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04914","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"HZXO6Y7M2ZZ7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HZXO6Y7M2ZZ7UCKR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HZXO6Y7M","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HZXO6Y7M2ZZ7UCKRV567NUQWHW","target":"record","payload":{"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"},"canonical_sha256":"3e6eef63ecd673fa0951af7df6d2163d994cb137e458c5e55764b791da45de9c","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"},"source_kind":"arxiv","source_id":"1905.04914","source_version":1,"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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9talrlL+evcmQmfCwYlK7cuwjyMudHwKzt4FtUHrwz/euMQ1GnoS51T9U9UVau94YnGGwcKNszvXKgnPXXsjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:55:39.523551Z"},"content_sha256":"1088acd1de8fc71d1b7f07d68519b3dadbe53439b81021e521fe9c942e7d7ad4","schema_version":"1.0","event_id":"sha256:1088acd1de8fc71d1b7f07d68519b3dadbe53439b81021e521fe9c942e7d7ad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HZXO6Y7M2ZZ7UCKRV567NUQWHW","target":"graph","payload":{"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"},"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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mv7TpeUJZw9IpLnELoYlgiN6nvjljhd+jgk+N/a1ezaCxyOUuL9jORW58ZQqCs0C7W55xfKEwlBdBj3DoQ70Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:55:39.524172Z"},"content_sha256":"114c2e1a5e70a4b1d05f345296b29c9f51d1f1a80c9bfcf28679e2abf12fda0b","schema_version":"1.0","event_id":"sha256:114c2e1a5e70a4b1d05f345296b29c9f51d1f1a80c9bfcf28679e2abf12fda0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/bundle.json","state_url":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/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-05-31T23:55:39Z","links":{"resolver":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW","bundle":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/bundle.json","state":"https://pith.science/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZXO6Y7M2ZZ7UCKRV567NUQWHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HZXO6Y7M2ZZ7UCKRV567NUQWHW","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":"c168e1ce38a6c39ccdcbd548c23fa9a6f5410cc5b92075840e9d5554174d7e7d","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-13T08:53:31Z","title_canon_sha256":"695b568bece7f6956c2743636d8eb4e56eb90e4ef15ae0831d895d9a216684db"},"schema_version":"1.0","source":{"id":"1905.04914","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04914","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04914v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04914","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"HZXO6Y7M2ZZ7","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HZXO6Y7M2ZZ7UCKR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HZXO6Y7M","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:114c2e1a5e70a4b1d05f345296b29c9f51d1f1a80c9bfcf28679e2abf12fda0b","target":"graph","created_at":"2026-05-17T23:46:23Z","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":"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","authors_text":"Lingbing Guo, Wei Hu, Zequn Sun","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-13T08:53:31Z","title":"Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04914","kind":"arxiv","version":1},"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:1088acd1de8fc71d1b7f07d68519b3dadbe53439b81021e521fe9c942e7d7ad4","target":"record","created_at":"2026-05-17T23:46:23Z","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":"c168e1ce38a6c39ccdcbd548c23fa9a6f5410cc5b92075840e9d5554174d7e7d","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-05-13T08:53:31Z","title_canon_sha256":"695b568bece7f6956c2743636d8eb4e56eb90e4ef15ae0831d895d9a216684db"},"schema_version":"1.0","source":{"id":"1905.04914","kind":"arxiv","version":1}},"canonical_sha256":"3e6eef63ecd673fa0951af7df6d2163d994cb137e458c5e55764b791da45de9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e6eef63ecd673fa0951af7df6d2163d994cb137e458c5e55764b791da45de9c","first_computed_at":"2026-05-17T23:46:23.111553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:23.111553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EsnPUUI4x5uvbfkHSSRtHbw0wNyUPg/uvtqi+4QAnZ0Bay7OMIZwTsV8AUhd/4J22zg367yXWHBUMkY2IHjVAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:23.112109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04914","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1088acd1de8fc71d1b7f07d68519b3dadbe53439b81021e521fe9c942e7d7ad4","sha256:114c2e1a5e70a4b1d05f345296b29c9f51d1f1a80c9bfcf28679e2abf12fda0b"],"state_sha256":"d3e3a0f3f7d0dba43cefe69cd3927a70ba98b5475eea4f6756ff96d4c8f058de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQi9EnMQoeOWmmuz83HlfFOAfWDrbiTsH4WL/9eV3Ay6b6B5CXR8cn2YBeqLdVIpT0lGPBopdSjJ7YdT0TriAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:55:39.527916Z","bundle_sha256":"6ab6f30927d0725de66004fc814df8f31de4e84d3944e1b7312a199a81e8b5ad"}}