{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KRIAOL4ORK5ABJZSEYMYIADGWJ","short_pith_number":"pith:KRIAOL4O","schema_version":"1.0","canonical_sha256":"5450072f8e8aba00a7322619840066b2510571c5f3e2eae2ac1077d5c8c698e2","source":{"kind":"arxiv","id":"2402.15838","version":3},"attestation_state":"computed","paper":{"title":"ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Eunbi Choi, Hyeongu Yun, Jiyeon Kim, Seung-won Hwang, Soyoung Yoon, Yireun Kim","submitted_at":"2024-02-24T15:31:59Z","abstract_excerpt":"We propose ListT5, a novel reranking approach based on Fusion-in-Decoder (FiD) that handles multiple candidate passages at both train and inference time. We also introduce an efficient inference framework for listwise ranking based on m-ary tournament sort with output caching. We evaluate and compare our model on the BEIR benchmark for zero-shot retrieval task, demonstrating that ListT5 (1) outperforms the state-of-the-art RankT5 baseline with a notable +1.3 gain in the average NDCG@10 score, (2) has an efficiency comparable to pointwise ranking models and surpasses the efficiency of previous "},"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":"2402.15838","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-02-24T15:31:59Z","cross_cats_sorted":[],"title_canon_sha256":"03f76911e5635282bb88f47b299babfe1085edd7b0ff0ea85b9c24568edbd270","abstract_canon_sha256":"8582a6071d52c19999081cb873e76efe87a471dd0f0e868b258d0e2e81c699fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:27.195005Z","signature_b64":"E+be3v/pUpTY8C+fjCF1Z7gFXWTBkQInQAHmhcVmtxcRvfYyrhuNC1fY03rx4dwX/srGs+2+Ko5xaIhKToQ7Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5450072f8e8aba00a7322619840066b2510571c5f3e2eae2ac1077d5c8c698e2","last_reissued_at":"2026-07-05T08:28:27.194577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:27.194577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Eunbi Choi, Hyeongu Yun, Jiyeon Kim, Seung-won Hwang, Soyoung Yoon, Yireun Kim","submitted_at":"2024-02-24T15:31:59Z","abstract_excerpt":"We propose ListT5, a novel reranking approach based on Fusion-in-Decoder (FiD) that handles multiple candidate passages at both train and inference time. We also introduce an efficient inference framework for listwise ranking based on m-ary tournament sort with output caching. We evaluate and compare our model on the BEIR benchmark for zero-shot retrieval task, demonstrating that ListT5 (1) outperforms the state-of-the-art RankT5 baseline with a notable +1.3 gain in the average NDCG@10 score, (2) has an efficiency comparable to pointwise ranking models and surpasses the efficiency of previous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15838","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/2402.15838/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":"2402.15838","created_at":"2026-07-05T08:28:27.194633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.15838v3","created_at":"2026-07-05T08:28:27.194633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15838","created_at":"2026-07-05T08:28:27.194633+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRIAOL4ORK5A","created_at":"2026-07-05T08:28:27.194633+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRIAOL4ORK5ABJZS","created_at":"2026-07-05T08:28:27.194633+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRIAOL4O","created_at":"2026-07-05T08:28:27.194633+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27810","citing_title":"LRanker: LLM Ranker for Massive Candidates","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01399","citing_title":"Verbal-R3: Verbal Reranker as the Missing Bridge between Retrieval and Reasoning","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08834","citing_title":"BracketRank: Large Language Model Document Ranking via Reasoning-based Competitive Elimination","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ","json":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ.json","graph_json":"https://pith.science/api/pith-number/KRIAOL4ORK5ABJZSEYMYIADGWJ/graph.json","events_json":"https://pith.science/api/pith-number/KRIAOL4ORK5ABJZSEYMYIADGWJ/events.json","paper":"https://pith.science/paper/KRIAOL4O"},"agent_actions":{"view_html":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ","download_json":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ.json","view_paper":"https://pith.science/paper/KRIAOL4O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.15838&json=true","fetch_graph":"https://pith.science/api/pith-number/KRIAOL4ORK5ABJZSEYMYIADGWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KRIAOL4ORK5ABJZSEYMYIADGWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ/action/storage_attestation","attest_author":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ/action/author_attestation","sign_citation":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ/action/citation_signature","submit_replication":"https://pith.science/pith/KRIAOL4ORK5ABJZSEYMYIADGWJ/action/replication_record"}},"created_at":"2026-07-05T08:28:27.194633+00:00","updated_at":"2026-07-05T08:28:27.194633+00:00"}