{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FFB75GTHWIXQNJGAHHVAHW55CK","short_pith_number":"pith:FFB75GTH","schema_version":"1.0","canonical_sha256":"2943fe9a67b22f06a4c039ea03dbbd12b85631e88cec8867808b0aa27c6f7db6","source":{"kind":"arxiv","id":"2104.07302","version":2},"attestation_state":"computed","paper":{"title":"TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hanwang Zhang, Jiaxin Shi, Juanzi Li, Lei Hou, Shulin Cao","submitted_at":"2021-04-15T08:23:05Z","abstract_excerpt":"Multi-hop Question Answering (QA) is a challenging task because it requires precise reasoning with entity relations at every step towards the answer. The relations can be represented in terms of labels in knowledge graph (e.g., \\textit{spouse}) or text in text corpus (e.g., \\textit{they have been married for 26 years}). Existing models usually infer the answer by predicting the sequential relation path or aggregating the hidden graph features. The former is hard to optimize, and the latter lacks interpretability. In this paper, we propose TransferNet, an effective and transparent model for mul"},"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":"2104.07302","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-04-15T08:23:05Z","cross_cats_sorted":[],"title_canon_sha256":"c0efdab2134c9da88a91d7b3df7c1c57f44e63221c39b0e1d3d4b85255f7649a","abstract_canon_sha256":"7ab932fade9b746f2fdb1ee7344a5255423fd76af59c8a75b3ccc9ba2db4546c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:09.970794Z","signature_b64":"qufsd3+CzwLbPJSZoA1yfgK8ruoi2TPOMhKWzLNaCqmt6iYb0lz2ElJsctV8hJa3n6ZqvrVNO9mzcTk8nGHaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2943fe9a67b22f06a4c039ea03dbbd12b85631e88cec8867808b0aa27c6f7db6","last_reissued_at":"2026-07-05T03:21:09.970347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:09.970347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hanwang Zhang, Jiaxin Shi, Juanzi Li, Lei Hou, Shulin Cao","submitted_at":"2021-04-15T08:23:05Z","abstract_excerpt":"Multi-hop Question Answering (QA) is a challenging task because it requires precise reasoning with entity relations at every step towards the answer. The relations can be represented in terms of labels in knowledge graph (e.g., \\textit{spouse}) or text in text corpus (e.g., \\textit{they have been married for 26 years}). Existing models usually infer the answer by predicting the sequential relation path or aggregating the hidden graph features. The former is hard to optimize, and the latter lacks interpretability. In this paper, we propose TransferNet, an effective and transparent model for mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.07302","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.07302/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.07302","created_at":"2026-07-05T03:21:09.970409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.07302v2","created_at":"2026-07-05T03:21:09.970409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.07302","created_at":"2026-07-05T03:21:09.970409+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFB75GTHWIXQ","created_at":"2026-07-05T03:21:09.970409+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFB75GTHWIXQNJGA","created_at":"2026-07-05T03:21:09.970409+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFB75GTH","created_at":"2026-07-05T03:21:09.970409+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.15353","citing_title":"NeuroSymActive: Differentiable Neural-Symbolic Reasoning with Active Exploration for Knowledge Graph Question Answering","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11193","citing_title":"TRACE: An Experiential Framework for Coherent Multi-hop Knowledge Graph Question Answering","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK","json":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK.json","graph_json":"https://pith.science/api/pith-number/FFB75GTHWIXQNJGAHHVAHW55CK/graph.json","events_json":"https://pith.science/api/pith-number/FFB75GTHWIXQNJGAHHVAHW55CK/events.json","paper":"https://pith.science/paper/FFB75GTH"},"agent_actions":{"view_html":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK","download_json":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK.json","view_paper":"https://pith.science/paper/FFB75GTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.07302&json=true","fetch_graph":"https://pith.science/api/pith-number/FFB75GTHWIXQNJGAHHVAHW55CK/graph.json","fetch_events":"https://pith.science/api/pith-number/FFB75GTHWIXQNJGAHHVAHW55CK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK/action/storage_attestation","attest_author":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK/action/author_attestation","sign_citation":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK/action/citation_signature","submit_replication":"https://pith.science/pith/FFB75GTHWIXQNJGAHHVAHW55CK/action/replication_record"}},"created_at":"2026-07-05T03:21:09.970409+00:00","updated_at":"2026-07-05T03:21:09.970409+00:00"}