{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:USZ7K2BS6SJHMX7RXHZ5MZL7GR","short_pith_number":"pith:USZ7K2BS","schema_version":"1.0","canonical_sha256":"a4b3f56832f492765ff1b9f3d6657f344fb26e865629788910f6fd37b61a9423","source":{"kind":"arxiv","id":"2204.13596","version":3},"attestation_state":"computed","paper":{"title":"Generative Multi-hop Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hanseok Oh, Hyunji Lee, Minjoon Seo, Sohee Yang","submitted_at":"2022-04-27T07:22:24Z","abstract_excerpt":"A common practice for text retrieval is to use an encoder to map the documents and the query to a common vector space and perform a nearest neighbor search (NNS); multi-hop retrieval also often adopts the same paradigm, usually with a modification of iteratively reformulating the query vector so that it can retrieve different documents at each hop. However, such a bi-encoder approach has limitations in multi-hop settings; (1) the reformulated query gets longer as the number of hops increases, which further tightens the embedding bottleneck of the query vector, and (2) it is prone to error prop"},"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":"2204.13596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-04-27T07:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"64ee883c2fdd4f6a0b3132939513b722d2301e6a918d98a718d7f13d6e91e4b4","abstract_canon_sha256":"ed3ad05d65ba28585d157b97b75bdaec97361284cd2cf4f29bc5cec99a9704b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:57.276892Z","signature_b64":"EVvK/NmHMiqRwo3XFcBqsVJelNgGrXauFS4FCVhLqTu/F7NARBXDl1mcUpgeY703/Vwb51PldaUAQdlJoT4pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4b3f56832f492765ff1b9f3d6657f344fb26e865629788910f6fd37b61a9423","last_reissued_at":"2026-07-05T05:06:57.276413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:57.276413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Multi-hop Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hanseok Oh, Hyunji Lee, Minjoon Seo, Sohee Yang","submitted_at":"2022-04-27T07:22:24Z","abstract_excerpt":"A common practice for text retrieval is to use an encoder to map the documents and the query to a common vector space and perform a nearest neighbor search (NNS); multi-hop retrieval also often adopts the same paradigm, usually with a modification of iteratively reformulating the query vector so that it can retrieve different documents at each hop. However, such a bi-encoder approach has limitations in multi-hop settings; (1) the reformulated query gets longer as the number of hops increases, which further tightens the embedding bottleneck of the query vector, and (2) it is prone to error prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.13596","kind":"arxiv","version":3},"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/2204.13596/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":"2204.13596","created_at":"2026-07-05T05:06:57.276475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.13596v3","created_at":"2026-07-05T05:06:57.276475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.13596","created_at":"2026-07-05T05:06:57.276475+00:00"},{"alias_kind":"pith_short_12","alias_value":"USZ7K2BS6SJH","created_at":"2026-07-05T05:06:57.276475+00:00"},{"alias_kind":"pith_short_16","alias_value":"USZ7K2BS6SJHMX7R","created_at":"2026-07-05T05:06:57.276475+00:00"},{"alias_kind":"pith_short_8","alias_value":"USZ7K2BS","created_at":"2026-07-05T05:06:57.276475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07555","citing_title":"O1 Embedder: Let Retrievers Think Before Action","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR","json":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR.json","graph_json":"https://pith.science/api/pith-number/USZ7K2BS6SJHMX7RXHZ5MZL7GR/graph.json","events_json":"https://pith.science/api/pith-number/USZ7K2BS6SJHMX7RXHZ5MZL7GR/events.json","paper":"https://pith.science/paper/USZ7K2BS"},"agent_actions":{"view_html":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR","download_json":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR.json","view_paper":"https://pith.science/paper/USZ7K2BS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.13596&json=true","fetch_graph":"https://pith.science/api/pith-number/USZ7K2BS6SJHMX7RXHZ5MZL7GR/graph.json","fetch_events":"https://pith.science/api/pith-number/USZ7K2BS6SJHMX7RXHZ5MZL7GR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR/action/storage_attestation","attest_author":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR/action/author_attestation","sign_citation":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR/action/citation_signature","submit_replication":"https://pith.science/pith/USZ7K2BS6SJHMX7RXHZ5MZL7GR/action/replication_record"}},"created_at":"2026-07-05T05:06:57.276475+00:00","updated_at":"2026-07-05T05:06:57.276475+00:00"}