{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:W3E2L4A5N5MKGZRWIFTP2H5JPA","short_pith_number":"pith:W3E2L4A5","schema_version":"1.0","canonical_sha256":"b6c9a5f01d6f58a366364166fd1fa9781c8d402b08b3030c72a0fd0f0ccab62c","source":{"kind":"arxiv","id":"1711.05851","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.05851","created_at":"2026-05-17T23:57:15.567742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05851v2","created_at":"2026-05-17T23:57:15.567742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05851","created_at":"2026-05-17T23:57:15.567742+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3E2L4A5N5MK","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3E2L4A5N5MKGZRW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3E2L4A5","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.13969","citing_title":"Autonomous Knowledge Graph Exploration with Adaptive Breadth-Depth Retrieval","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09542","citing_title":"LLM-Guided Monte Carlo Tree Search over Knowledge Graphs: Composing Mechanistic Explanations for Drug-Disease Pairs","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA","json":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA.json","graph_json":"https://pith.science/api/pith-number/W3E2L4A5N5MKGZRWIFTP2H5JPA/graph.json","events_json":"https://pith.science/api/pith-number/W3E2L4A5N5MKGZRWIFTP2H5JPA/events.json","paper":"https://pith.science/paper/W3E2L4A5"},"agent_actions":{"view_html":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA","download_json":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA.json","view_paper":"https://pith.science/paper/W3E2L4A5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05851&json=true","fetch_graph":"https://pith.science/api/pith-number/W3E2L4A5N5MKGZRWIFTP2H5JPA/graph.json","fetch_events":"https://pith.science/api/pith-number/W3E2L4A5N5MKGZRWIFTP2H5JPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/action/storage_attestation","attest_author":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/action/author_attestation","sign_citation":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/action/citation_signature","submit_replication":"https://pith.science/pith/W3E2L4A5N5MKGZRWIFTP2H5JPA/action/replication_record"}},"created_at":"2026-05-17T23:57:15.567742+00:00","updated_at":"2026-05-17T23:57:15.567742+00:00"}