{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PK7AIXIWGM7DVPAJTYUUADMOGN","short_pith_number":"pith:PK7AIXIW","schema_version":"1.0","canonical_sha256":"7abe045d16333e3abc099e29400d8e336ba1b4723f84da5d80ed1077a6868776","source":{"kind":"arxiv","id":"2212.02027","version":1},"attestation_state":"computed","paper":{"title":"Retrieval as Attention: End-to-end Learning of Retrieval and Reading within a Single Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Graham Neubig, Haibo Ding, Jamie Callan, Jun Araki, Luyu Gao, Zhengbao Jiang, Zhiruo Wang","submitted_at":"2022-12-05T04:51:21Z","abstract_excerpt":"Systems for knowledge-intensive tasks such as open-domain question answering (QA) usually consist of two stages: efficient retrieval of relevant documents from a large corpus and detailed reading of the selected documents to generate answers. Retrievers and readers are usually modeled separately, which necessitates a cumbersome implementation and is hard to train and adapt in an end-to-end fashion. In this paper, we revisit this design and eschew the separate architecture and training in favor of a single Transformer that performs Retrieval as Attention (ReAtt), and end-to-end training solely "},"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":"2212.02027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-12-05T04:51:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"37784d83c05897a316cc7a8a10c4499afd96128863e17e74bfddbc49b5cf4f7d","abstract_canon_sha256":"a79b656ee73be41725daeab077d1df1a8eb10fa826d60fbfc91d2870674de46b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:19.658373Z","signature_b64":"CgQQmQVEgzhzVoFkuD1SG6/J3nNeURFdptO4UxvyS2Mp/a8hAnlkfYslhqoDmsl6yQ23ww9+zE7SlIOpDDKVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7abe045d16333e3abc099e29400d8e336ba1b4723f84da5d80ed1077a6868776","last_reissued_at":"2026-07-05T05:22:19.657818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:19.657818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Retrieval as Attention: End-to-end Learning of Retrieval and Reading within a Single Transformer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Graham Neubig, Haibo Ding, Jamie Callan, Jun Araki, Luyu Gao, Zhengbao Jiang, Zhiruo Wang","submitted_at":"2022-12-05T04:51:21Z","abstract_excerpt":"Systems for knowledge-intensive tasks such as open-domain question answering (QA) usually consist of two stages: efficient retrieval of relevant documents from a large corpus and detailed reading of the selected documents to generate answers. Retrievers and readers are usually modeled separately, which necessitates a cumbersome implementation and is hard to train and adapt in an end-to-end fashion. In this paper, we revisit this design and eschew the separate architecture and training in favor of a single Transformer that performs Retrieval as Attention (ReAtt), and end-to-end training solely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02027","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.02027/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":"2212.02027","created_at":"2026-07-05T05:22:19.657872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.02027v1","created_at":"2026-07-05T05:22:19.657872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02027","created_at":"2026-07-05T05:22:19.657872+00:00"},{"alias_kind":"pith_short_12","alias_value":"PK7AIXIWGM7D","created_at":"2026-07-05T05:22:19.657872+00:00"},{"alias_kind":"pith_short_16","alias_value":"PK7AIXIWGM7DVPAJ","created_at":"2026-07-05T05:22:19.657872+00:00"},{"alias_kind":"pith_short_8","alias_value":"PK7AIXIW","created_at":"2026-07-05T05:22:19.657872+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2401.18059","citing_title":"RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval","ref_index":115,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN","json":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN.json","graph_json":"https://pith.science/api/pith-number/PK7AIXIWGM7DVPAJTYUUADMOGN/graph.json","events_json":"https://pith.science/api/pith-number/PK7AIXIWGM7DVPAJTYUUADMOGN/events.json","paper":"https://pith.science/paper/PK7AIXIW"},"agent_actions":{"view_html":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN","download_json":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN.json","view_paper":"https://pith.science/paper/PK7AIXIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.02027&json=true","fetch_graph":"https://pith.science/api/pith-number/PK7AIXIWGM7DVPAJTYUUADMOGN/graph.json","fetch_events":"https://pith.science/api/pith-number/PK7AIXIWGM7DVPAJTYUUADMOGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN/action/storage_attestation","attest_author":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN/action/author_attestation","sign_citation":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN/action/citation_signature","submit_replication":"https://pith.science/pith/PK7AIXIWGM7DVPAJTYUUADMOGN/action/replication_record"}},"created_at":"2026-07-05T05:22:19.657872+00:00","updated_at":"2026-07-05T05:22:19.657872+00:00"}