{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W3E2L4A5N5MKGZRWIFTP2H5JPA","short_pith_number":"pith:W3E2L4A5","canonical_record":{"source":{"id":"1711.05851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-15T23:45:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7fd4604b8f64a1a1fe3d9a35250723b9a4defc8f4b7a53e1aa34a50ac63bd8e6","abstract_canon_sha256":"c01fa70e36bb04f07d2bedc74ac71f19ae34b8345e8655136ff50134a6262eaf"},"schema_version":"1.0"},"canonical_sha256":"b6c9a5f01d6f58a366364166fd1fa9781c8d402b08b3030c72a0fd0f0ccab62c","source":{"kind":"arxiv","id":"1711.05851","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05851","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05851v2","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05851","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"W3E2L4A5N5MK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3E2L4A5N5MKGZRW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3E2L4A5","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W3E2L4A5N5MKGZRWIFTP2H5JPA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-15T23:45:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7fd4604b8f64a1a1fe3d9a35250723b9a4defc8f4b7a53e1aa34a50ac63bd8e6","abstract_canon_sha256":"c01fa70e36bb04f07d2bedc74ac71f19ae34b8345e8655136ff50134a6262eaf"},"schema_version":"1.0"},"canonical_sha256":"b6c9a5f01d6f58a366364166fd1fa9781c8d402b08b3030c72a0fd0f0ccab62c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:15.568163Z","signature_b64":"s4HVYr2nJhtgd3yDOZdegPdW4+fZeDKCH5w4PP6eSv7nnK3aKnqRwM3/jiN4ckut/ventAFA0Dg8pT3cyb8dDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c9a5f01d6f58a366364166fd1fa9781c8d402b08b3030c72a0fd0f0ccab62c","last_reissued_at":"2026-05-17T23:57:15.567649Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:15.567649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05851","source_version":2,"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:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmtZ6AYUhl+UqTGELZXJNJz17C4pwJeqogNnS2OkWrmagvLvaO+vfAVwDRo0yd6I6vaLdr8J3nfwSyunBja1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:38:21.192130Z"},"content_sha256":"e364a12a19fdbc80b42776797711e8afca112e553f2f08a10cfb0a9920f116e9","schema_version":"1.0","event_id":"sha256:e364a12a19fdbc80b42776797711e8afca112e553f2f08a10cfb0a9920f116e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W3E2L4A5N5MKGZRWIFTP2H5JPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Akshay Krishnamurthy, Alex Smola, Andrew McCallum, Ishan Durugkar, Luke Vilnis, Manzil Zaheer, Rajarshi Das, Shehzaad Dhuliawala","submitted_at":"2017-11-15T23:45:18Z","abstract_excerpt":"Knowledge bases (KB), both automatically and manually constructed, are often incomplete --- many valid facts can be inferred from the KB by synthesizing existing information. A popular approach to KB completion is to infer new relations by combinatory reasoning over the information found along other paths connecting a pair of entities. Given the enormous size of KBs and the exponential number of paths, previous path-based models have considered only the problem of predicting a missing relation given two entities or evaluating the truth of a proposed triple. Additionally, these methods have tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05851","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"},"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:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gck7F+hRbGqHVpGfPBlYF92Zwn5SMa2UClnTDLn91oEN7BDN7mkGVyu+Tgm/ylcVt9HEGR7y8Iisnc+c81gtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:38:21.192865Z"},"content_sha256":"c101451ad0ceaa37ac0a67bec3f99a61ff6c653eef457c2ec6f769797e71f8fc","schema_version":"1.0","event_id":"sha256:c101451ad0ceaa37ac0a67bec3f99a61ff6c653eef457c2ec6f769797e71f8fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/bundle.json","state_url":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/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-26T22:38:21Z","links":{"resolver":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA","bundle":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/bundle.json","state":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W3E2L4A5N5MKGZRWIFTP2H5JPA","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":"c01fa70e36bb04f07d2bedc74ac71f19ae34b8345e8655136ff50134a6262eaf","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-15T23:45:18Z","title_canon_sha256":"7fd4604b8f64a1a1fe3d9a35250723b9a4defc8f4b7a53e1aa34a50ac63bd8e6"},"schema_version":"1.0","source":{"id":"1711.05851","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05851","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05851v2","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05851","created_at":"2026-05-17T23:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"W3E2L4A5N5MK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3E2L4A5N5MKGZRW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3E2L4A5","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:c101451ad0ceaa37ac0a67bec3f99a61ff6c653eef457c2ec6f769797e71f8fc","target":"graph","created_at":"2026-05-17T23:57:15Z","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":"Knowledge bases (KB), both automatically and manually constructed, are often incomplete --- many valid facts can be inferred from the KB by synthesizing existing information. A popular approach to KB completion is to infer new relations by combinatory reasoning over the information found along other paths connecting a pair of entities. Given the enormous size of KBs and the exponential number of paths, previous path-based models have considered only the problem of predicting a missing relation given two entities or evaluating the truth of a proposed triple. Additionally, these methods have tra","authors_text":"Akshay Krishnamurthy, Alex Smola, Andrew McCallum, Ishan Durugkar, Luke Vilnis, Manzil Zaheer, Rajarshi Das, Shehzaad Dhuliawala","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-15T23:45:18Z","title":"Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05851","kind":"arxiv","version":2},"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:e364a12a19fdbc80b42776797711e8afca112e553f2f08a10cfb0a9920f116e9","target":"record","created_at":"2026-05-17T23:57:15Z","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":"c01fa70e36bb04f07d2bedc74ac71f19ae34b8345e8655136ff50134a6262eaf","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-15T23:45:18Z","title_canon_sha256":"7fd4604b8f64a1a1fe3d9a35250723b9a4defc8f4b7a53e1aa34a50ac63bd8e6"},"schema_version":"1.0","source":{"id":"1711.05851","kind":"arxiv","version":2}},"canonical_sha256":"b6c9a5f01d6f58a366364166fd1fa9781c8d402b08b3030c72a0fd0f0ccab62c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c9a5f01d6f58a366364166fd1fa9781c8d402b08b3030c72a0fd0f0ccab62c","first_computed_at":"2026-05-17T23:57:15.567649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:15.567649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s4HVYr2nJhtgd3yDOZdegPdW4+fZeDKCH5w4PP6eSv7nnK3aKnqRwM3/jiN4ckut/ventAFA0Dg8pT3cyb8dDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:15.568163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05851","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e364a12a19fdbc80b42776797711e8afca112e553f2f08a10cfb0a9920f116e9","sha256:c101451ad0ceaa37ac0a67bec3f99a61ff6c653eef457c2ec6f769797e71f8fc"],"state_sha256":"5aff579ce785d1b0bdd126e88dfbcf67c0914a672c65831598c3012e2466e964"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKTulFh4P6VwyqZnbtSNEL+5Rb3Sv6KmlfEYuKTZNPC3YqEm0CMSiMCZgzo6mkDYWsTcMyLBjbboDDpz6jn+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:38:21.196755Z","bundle_sha256":"2b2965a004a368cadfb066b70d23ee2852fde635571d7383dc7450a519bf8e29"}}