{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:M4IXDTOZ7LE4VQI6PSP7QDA4K2","short_pith_number":"pith:M4IXDTOZ","schema_version":"1.0","canonical_sha256":"671171cdd9fac9cac11e7c9ff80c1c56a4f5569537241e6211532a92e633f5f2","source":{"kind":"arxiv","id":"2403.10407","version":1},"attestation_state":"computed","paper":{"title":"A Thorough Comparison of Cross-Encoders and LLMs for Reranking SPLADE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Herv\\'e D\\'ejean, St\\'ephane Clinchant, Thibault Formal","submitted_at":"2024-03-15T15:39:56Z","abstract_excerpt":"We present a comparative study between cross-encoder and LLMs rerankers in the context of re-ranking effective SPLADE retrievers. We conduct a large evaluation on TREC Deep Learning datasets and out-of-domain datasets such as BEIR and LoTTE. In the first set of experiments, we show how cross-encoder rerankers are hard to distinguish when it comes to re-rerank SPLADE on MS MARCO. Observations shift in the out-of-domain scenario, where both the type of model and the number of documents to re-rank have an impact on effectiveness. Then, we focus on listwise rerankers based on Large Language Models"},"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":"2403.10407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2024-03-15T15:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"4189c55604e6450916ae5d090fd5b41ceb0320fc025f6f8971570a1b93ae7289","abstract_canon_sha256":"1fa425b2f11bcfdf250670de760b3dabb47652de17f9c7f4407a5981702ae00c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:34.995384Z","signature_b64":"j+iYweBXmV06UN4MyoeavFPxe86t8JkiiZKuYJ5J/a6ncpBAzXgKJfmqpNDEVascoVSQkpnJCzr9abSHQp9bCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"671171cdd9fac9cac11e7c9ff80c1c56a4f5569537241e6211532a92e633f5f2","last_reissued_at":"2026-07-05T07:56:34.994971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:34.994971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Thorough Comparison of Cross-Encoders and LLMs for Reranking SPLADE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Herv\\'e D\\'ejean, St\\'ephane Clinchant, Thibault Formal","submitted_at":"2024-03-15T15:39:56Z","abstract_excerpt":"We present a comparative study between cross-encoder and LLMs rerankers in the context of re-ranking effective SPLADE retrievers. We conduct a large evaluation on TREC Deep Learning datasets and out-of-domain datasets such as BEIR and LoTTE. In the first set of experiments, we show how cross-encoder rerankers are hard to distinguish when it comes to re-rerank SPLADE on MS MARCO. Observations shift in the out-of-domain scenario, where both the type of model and the number of documents to re-rank have an impact on effectiveness. Then, we focus on listwise rerankers based on Large Language Models"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10407","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/2403.10407/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":"2403.10407","created_at":"2026-07-05T07:56:34.995028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10407v1","created_at":"2026-07-05T07:56:34.995028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10407","created_at":"2026-07-05T07:56:34.995028+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4IXDTOZ7LE4","created_at":"2026-07-05T07:56:34.995028+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4IXDTOZ7LE4VQI6","created_at":"2026-07-05T07:56:34.995028+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4IXDTOZ","created_at":"2026-07-05T07:56:34.995028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25871","citing_title":"AutoRelAnnotator: Calibrated Model Cascades for Cost-Efficient Relevance Evaluation in Sponsored Search","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26483","citing_title":"Efficient Listwise Reranking with Compressed Document Representations","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2","json":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2.json","graph_json":"https://pith.science/api/pith-number/M4IXDTOZ7LE4VQI6PSP7QDA4K2/graph.json","events_json":"https://pith.science/api/pith-number/M4IXDTOZ7LE4VQI6PSP7QDA4K2/events.json","paper":"https://pith.science/paper/M4IXDTOZ"},"agent_actions":{"view_html":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2","download_json":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2.json","view_paper":"https://pith.science/paper/M4IXDTOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10407&json=true","fetch_graph":"https://pith.science/api/pith-number/M4IXDTOZ7LE4VQI6PSP7QDA4K2/graph.json","fetch_events":"https://pith.science/api/pith-number/M4IXDTOZ7LE4VQI6PSP7QDA4K2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2/action/storage_attestation","attest_author":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2/action/author_attestation","sign_citation":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2/action/citation_signature","submit_replication":"https://pith.science/pith/M4IXDTOZ7LE4VQI6PSP7QDA4K2/action/replication_record"}},"created_at":"2026-07-05T07:56:34.995028+00:00","updated_at":"2026-07-05T07:56:34.995028+00:00"}