{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BRPG33NJXPXNFVJXR2OYKSLUXT","short_pith_number":"pith:BRPG33NJ","canonical_record":{"source":{"id":"1806.04523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T13:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"199b07e63d05475a272a8cea67c6586d37b96806da07cb066b94f5bc8bee6506","abstract_canon_sha256":"b837eb954c77bd4e9fe0cd3ae58d9e3c00178e89e0128d131f0d951a63334b09"},"schema_version":"1.0"},"canonical_sha256":"0c5e6deda9bbeed2d5378e9d854974bcde98de645f9c0c058f43ee6d8c3c7592","source":{"kind":"arxiv","id":"1806.04523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04523","created_at":"2026-05-18T00:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04523v1","created_at":"2026-05-18T00:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04523","created_at":"2026-05-18T00:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"BRPG33NJXPXN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRPG33NJXPXNFVJX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRPG33NJ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BRPG33NJXPXNFVJXR2OYKSLUXT","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T13:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"199b07e63d05475a272a8cea67c6586d37b96806da07cb066b94f5bc8bee6506","abstract_canon_sha256":"b837eb954c77bd4e9fe0cd3ae58d9e3c00178e89e0128d131f0d951a63334b09"},"schema_version":"1.0"},"canonical_sha256":"0c5e6deda9bbeed2d5378e9d854974bcde98de645f9c0c058f43ee6d8c3c7592","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:33.517285Z","signature_b64":"fkCCtDXLdZ+kSfiktWBy6SUvZmv3f4W36T8D4/JyW85j3Jre8p7UCi9SCAt9tn2IYCazHBwXXOd/fcvUIrxmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c5e6deda9bbeed2d5378e9d854974bcde98de645f9c0c058f43ee6d8c3c7592","last_reissued_at":"2026-05-18T00:13:33.516821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:33.516821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04523","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-18T00:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4EMImQzV/vqC1moEpVhmPg681EuvzVBvrStY4G2LLjmNSKTSBe7gMCZoV1PvW0NDqD4/rVnPFwSryYYZddbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:13:42.380040Z"},"content_sha256":"b61c73d7e47673995bab24d2d01ded2f037749b174f9acd1f1bf8b136774248d","schema_version":"1.0","event_id":"sha256:b61c73d7e47673995bab24d2d01ded2f037749b174f9acd1f1bf8b136774248d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BRPG33NJXPXNFVJXR2OYKSLUXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hinrich Sch\\\"utze, Wenpeng Yin, Yadollah Yaghoobzadeh","submitted_at":"2018-06-12T13:52:15Z","abstract_excerpt":"Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. Reasoning over multi-hop (mh) KG paths is thus an important capability that is needed for question answering or other NLP tasks that require knowledge about the world. mh-KG reasoning includes diverse scenarios, e.g., given a head entity and a relation path, predict the tail entity; or given two entities connected by some relation paths, predict the unknown relation between them. We present ROPs, recurrent one-hop predictors, that predict entities at each step of mh-KB paths by using recurrent neural networks and vec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04523","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-18T00:13:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBkPGT1xMvqVeCCZcoWuf20GdWwQRS+NEVvZvJ2PF2tn9MJW9HaZY51E5Ny8joog60Dcq2UdRKGlAlci2171Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:13:42.380402Z"},"content_sha256":"2f451e155253175155dbcb9ac1e5a00fcc0f646b6f780b87545e74744fbb5f56","schema_version":"1.0","event_id":"sha256:2f451e155253175155dbcb9ac1e5a00fcc0f646b6f780b87545e74744fbb5f56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/bundle.json","state_url":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/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-30T16:13:42Z","links":{"resolver":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT","bundle":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/bundle.json","state":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BRPG33NJXPXNFVJXR2OYKSLUXT","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":"b837eb954c77bd4e9fe0cd3ae58d9e3c00178e89e0128d131f0d951a63334b09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T13:52:15Z","title_canon_sha256":"199b07e63d05475a272a8cea67c6586d37b96806da07cb066b94f5bc8bee6506"},"schema_version":"1.0","source":{"id":"1806.04523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04523","created_at":"2026-05-18T00:13:33Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04523v1","created_at":"2026-05-18T00:13:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04523","created_at":"2026-05-18T00:13:33Z"},{"alias_kind":"pith_short_12","alias_value":"BRPG33NJXPXN","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRPG33NJXPXNFVJX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRPG33NJ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:2f451e155253175155dbcb9ac1e5a00fcc0f646b6f780b87545e74744fbb5f56","target":"graph","created_at":"2026-05-18T00:13:33Z","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":"Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. Reasoning over multi-hop (mh) KG paths is thus an important capability that is needed for question answering or other NLP tasks that require knowledge about the world. mh-KG reasoning includes diverse scenarios, e.g., given a head entity and a relation path, predict the tail entity; or given two entities connected by some relation paths, predict the unknown relation between them. We present ROPs, recurrent one-hop predictors, that predict entities at each step of mh-KB paths by using recurrent neural networks and vec","authors_text":"Hinrich Sch\\\"utze, Wenpeng Yin, Yadollah Yaghoobzadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T13:52:15Z","title":"Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04523","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:b61c73d7e47673995bab24d2d01ded2f037749b174f9acd1f1bf8b136774248d","target":"record","created_at":"2026-05-18T00:13:33Z","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":"b837eb954c77bd4e9fe0cd3ae58d9e3c00178e89e0128d131f0d951a63334b09","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-12T13:52:15Z","title_canon_sha256":"199b07e63d05475a272a8cea67c6586d37b96806da07cb066b94f5bc8bee6506"},"schema_version":"1.0","source":{"id":"1806.04523","kind":"arxiv","version":1}},"canonical_sha256":"0c5e6deda9bbeed2d5378e9d854974bcde98de645f9c0c058f43ee6d8c3c7592","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c5e6deda9bbeed2d5378e9d854974bcde98de645f9c0c058f43ee6d8c3c7592","first_computed_at":"2026-05-18T00:13:33.516821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:33.516821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkCCtDXLdZ+kSfiktWBy6SUvZmv3f4W36T8D4/JyW85j3Jre8p7UCi9SCAt9tn2IYCazHBwXXOd/fcvUIrxmAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:33.517285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b61c73d7e47673995bab24d2d01ded2f037749b174f9acd1f1bf8b136774248d","sha256:2f451e155253175155dbcb9ac1e5a00fcc0f646b6f780b87545e74744fbb5f56"],"state_sha256":"c3e4b9a80842452bf404a622b70b6d22559a741832ac504fa9b85baea7b60573"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcJm96SMBD+IvKakecXuP9b3OAoWmOYsztY0Bv0aoxFS47UD7py1NAxFe13FFDUsychrqIQeXldzEzK04JKjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:13:42.382409Z","bundle_sha256":"1e13f8ddc24324b3268319ec8af416d34a82a20c9c90acb5c71bbcd1e4c54dfc"}}