{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QGX67E2PZKBZW3VIO7CXPJO4WN","short_pith_number":"pith:QGX67E2P","schema_version":"1.0","canonical_sha256":"81afef934fca839b6ea877c577a5dcb34e2b5c17532bc51f9a92aff9796704dc","source":{"kind":"arxiv","id":"2604.09492","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking.","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Debasis Ganguly, Nilanjan Sinhababu, Pabitra Mitra, Soumedhik Bharati","submitted_at":"2026-04-10T16:59:54Z","abstract_excerpt":"Large Language Models (LLM) have been widely used in reranking. Computational overhead and large context lengths remain a challenging issue for LLM rerankers. Efficient reranking usually involves selecting a subset of the ranked list from the first stage, known as ranked list truncation (RLT). The truncated list is processed further by a reranker. For LLM rerankers, the ranked list is often partitioned and processed sequentially in batches to reduce the context length. Both these steps involve hyperparameters and topic-agnostic heuristics. Recently, LLMs have been shown to be effective for rel"},"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":"2604.09492","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-10T16:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"cbc28e6ec8a4d41d3ab4284c1f85071fb466865df675da2fa62d7302e782a3d1","abstract_canon_sha256":"a9a49c3d00c289976781603545460c904182e5ba5bba75708e5dd155b0bc3a54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:09.185610Z","signature_b64":"zRLL+Z5rT7bMw2JU7WtxWnaHfHekiuL48lx2GcN6rVy+pFlOZdHYC2LgGETicQwUV6Iz7FmvPU9NmFEUWrXSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81afef934fca839b6ea877c577a5dcb34e2b5c17532bc51f9a92aff9796704dc","last_reissued_at":"2026-05-29T01:05:09.184570Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:09.184570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking.","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Debasis Ganguly, Nilanjan Sinhababu, Pabitra Mitra, Soumedhik Bharati","submitted_at":"2026-04-10T16:59:54Z","abstract_excerpt":"Large Language Models (LLM) have been widely used in reranking. Computational overhead and large context lengths remain a challenging issue for LLM rerankers. Efficient reranking usually involves selecting a subset of the ranked list from the first stage, known as ranked list truncation (RLT). The truncated list is processed further by a reranker. For LLM rerankers, the ranked list is often partitioned and processed sequentially in batches to reduce the context length. Both these steps involve hyperparameters and topic-agnostic heuristics. Recently, LLMs have been shown to be effective for rel"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments on TREC Deep Learning benchmarks show that our approach outperforms existing RLT-based approaches. In-domain and out-of-domain benchmarks demonstrate that our proposed methods accelerate LLM-based listwise reranking by up to 66% compared to existing approaches.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"LLMs can be used to generate reference documents that act as a reliable pivot between relevant and non-relevant documents in a ranked list, based on the equivalence to relevance judgment.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"LLM-generated reference documents enable dynamic ranked list truncation and adaptive batching for listwise reranking, outperforming prior RLT methods and accelerating processing by up to 66% on TREC benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fd6a2866d0e851eaca05281cf3f5e4624f9374e5d36346df916b410eb6554f03"},"source":{"id":"2604.09492","kind":"arxiv","version":2},"verdict":{"id":"fc6ccfb3-af16-4963-b18c-3044ef4afd77","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T16:22:51.626003Z","strongest_claim":"Experiments on TREC Deep Learning benchmarks show that our approach outperforms existing RLT-based approaches. In-domain and out-of-domain benchmarks demonstrate that our proposed methods accelerate LLM-based listwise reranking by up to 66% compared to existing approaches.","one_line_summary":"LLM-generated reference documents enable dynamic ranked list truncation and adaptive batching for listwise reranking, outperforming prior RLT methods and accelerating processing by up to 66% on TREC benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"LLMs can be used to generate reference documents that act as a reliable pivot between relevant and non-relevant documents in a ranked list, based on the equivalence to relevance judgment.","pith_extraction_headline":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.09492/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":"2604.09492","created_at":"2026-05-29T01:05:09.184674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.09492v2","created_at":"2026-05-29T01:05:09.184674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.09492","created_at":"2026-05-29T01:05:09.184674+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGX67E2PZKBZ","created_at":"2026-05-29T01:05:09.184674+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGX67E2PZKBZW3VI","created_at":"2026-05-29T01:05:09.184674+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGX67E2P","created_at":"2026-05-29T01:05:09.184674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN","json":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN.json","graph_json":"https://pith.science/api/pith-number/QGX67E2PZKBZW3VIO7CXPJO4WN/graph.json","events_json":"https://pith.science/api/pith-number/QGX67E2PZKBZW3VIO7CXPJO4WN/events.json","paper":"https://pith.science/paper/QGX67E2P"},"agent_actions":{"view_html":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN","download_json":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN.json","view_paper":"https://pith.science/paper/QGX67E2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.09492&json=true","fetch_graph":"https://pith.science/api/pith-number/QGX67E2PZKBZW3VIO7CXPJO4WN/graph.json","fetch_events":"https://pith.science/api/pith-number/QGX67E2PZKBZW3VIO7CXPJO4WN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN/action/storage_attestation","attest_author":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN/action/author_attestation","sign_citation":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN/action/citation_signature","submit_replication":"https://pith.science/pith/QGX67E2PZKBZW3VIO7CXPJO4WN/action/replication_record"}},"created_at":"2026-05-29T01:05:09.184674+00:00","updated_at":"2026-05-29T01:05:09.184674+00:00"}