{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BRPG33NJXPXNFVJXR2OYKSLUXT","short_pith_number":"pith:BRPG33NJ","schema_version":"1.0","canonical_sha256":"0c5e6deda9bbeed2d5378e9d854974bcde98de645f9c0c058f43ee6d8c3c7592","source":{"kind":"arxiv","id":"1806.04523","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04523","created_at":"2026-05-18T00:13:33.516902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04523v1","created_at":"2026-05-18T00:13:33.516902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04523","created_at":"2026-05-18T00:13:33.516902+00:00"},{"alias_kind":"pith_short_12","alias_value":"BRPG33NJXPXN","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BRPG33NJXPXNFVJX","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BRPG33NJ","created_at":"2026-05-18T12:32:16.446611+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/BRPG33NJXPXNFVJXR2OYKSLUXT","json":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT.json","graph_json":"https://pith.science/api/pith-number/BRPG33NJXPXNFVJXR2OYKSLUXT/graph.json","events_json":"https://pith.science/api/pith-number/BRPG33NJXPXNFVJXR2OYKSLUXT/events.json","paper":"https://pith.science/paper/BRPG33NJ"},"agent_actions":{"view_html":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT","download_json":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT.json","view_paper":"https://pith.science/paper/BRPG33NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04523&json=true","fetch_graph":"https://pith.science/api/pith-number/BRPG33NJXPXNFVJXR2OYKSLUXT/graph.json","fetch_events":"https://pith.science/api/pith-number/BRPG33NJXPXNFVJXR2OYKSLUXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/action/storage_attestation","attest_author":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/action/author_attestation","sign_citation":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/action/citation_signature","submit_replication":"https://pith.science/pith/BRPG33NJXPXNFVJXR2OYKSLUXT/action/replication_record"}},"created_at":"2026-05-18T00:13:33.516902+00:00","updated_at":"2026-05-18T00:13:33.516902+00:00"}