{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UEDEDY5U4ABN74JCMMAUF646JN","short_pith_number":"pith:UEDEDY5U","schema_version":"1.0","canonical_sha256":"a10641e3b4e002dff122630142fb9e4b5f922295fb03f89df1eec72c8be37124","source":{"kind":"arxiv","id":"2205.10569","version":1},"attestation_state":"computed","paper":{"title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Dingkun Long, Guangwei Xu, Pengjun Xie, Yanzhao Zhang","submitted_at":"2022-05-21T11:38:33Z","abstract_excerpt":"Deep pre-trained language models (e,g. BERT) are effective at large-scale text retrieval task. Existing text retrieval systems with state-of-the-art performance usually adopt a retrieve-then-reranking architecture due to the high computational cost of pre-trained language models and the large corpus size. Under such a multi-stage architecture, previous studies mainly focused on optimizing single stage of the framework thus improving the overall retrieval performance. However, how to directly couple multi-stage features for optimization has not been well studied. In this paper, we design Hybrid"},"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":"2205.10569","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-05-21T11:38:33Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"812de0ed12c8dc76f9d57d506516331122dcd2bb430225c38ba9d356756a50c3","abstract_canon_sha256":"9c5fa84d8b0dbc2edd6b4da71e3d6c52a2cc401678a106be9d3ca9de6569632f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:20.974411Z","signature_b64":"tQTfzgtG2UgO0iEMPfo3INJ7Y/Z08RTAE4YW/FzqV3kmILGR7OeaSN6W5XeTq0LhhtX/DAmlfb+yXURPSdGDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a10641e3b4e002dff122630142fb9e4b5f922295fb03f89df1eec72c8be37124","last_reissued_at":"2026-07-05T04:25:20.973995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:20.973995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Dingkun Long, Guangwei Xu, Pengjun Xie, Yanzhao Zhang","submitted_at":"2022-05-21T11:38:33Z","abstract_excerpt":"Deep pre-trained language models (e,g. BERT) are effective at large-scale text retrieval task. Existing text retrieval systems with state-of-the-art performance usually adopt a retrieve-then-reranking architecture due to the high computational cost of pre-trained language models and the large corpus size. Under such a multi-stage architecture, previous studies mainly focused on optimizing single stage of the framework thus improving the overall retrieval performance. However, how to directly couple multi-stage features for optimization has not been well studied. In this paper, we design Hybrid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10569","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/2205.10569/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":"2205.10569","created_at":"2026-07-05T04:25:20.974051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.10569v1","created_at":"2026-07-05T04:25:20.974051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10569","created_at":"2026-07-05T04:25:20.974051+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEDEDY5U4ABN","created_at":"2026-07-05T04:25:20.974051+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEDEDY5U4ABN74JC","created_at":"2026-07-05T04:25:20.974051+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEDEDY5U","created_at":"2026-07-05T04:25:20.974051+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00520","citing_title":"ERank: Fusing Supervised Fine-Tuning and Reinforcement Learning for Effective and Efficient Text Reranking","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN","json":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN.json","graph_json":"https://pith.science/api/pith-number/UEDEDY5U4ABN74JCMMAUF646JN/graph.json","events_json":"https://pith.science/api/pith-number/UEDEDY5U4ABN74JCMMAUF646JN/events.json","paper":"https://pith.science/paper/UEDEDY5U"},"agent_actions":{"view_html":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN","download_json":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN.json","view_paper":"https://pith.science/paper/UEDEDY5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.10569&json=true","fetch_graph":"https://pith.science/api/pith-number/UEDEDY5U4ABN74JCMMAUF646JN/graph.json","fetch_events":"https://pith.science/api/pith-number/UEDEDY5U4ABN74JCMMAUF646JN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN/action/storage_attestation","attest_author":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN/action/author_attestation","sign_citation":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN/action/citation_signature","submit_replication":"https://pith.science/pith/UEDEDY5U4ABN74JCMMAUF646JN/action/replication_record"}},"created_at":"2026-07-05T04:25:20.974051+00:00","updated_at":"2026-07-05T04:25:20.974051+00:00"}