{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QGX67E2PZKBZW3VIO7CXPJO4WN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9a49c3d00c289976781603545460c904182e5ba5bba75708e5dd155b0bc3a54","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-10T16:59:54Z","title_canon_sha256":"cbc28e6ec8a4d41d3ab4284c1f85071fb466865df675da2fa62d7302e782a3d1"},"schema_version":"1.0","source":{"id":"2604.09492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.09492","created_at":"2026-05-29T01:05:09Z"},{"alias_kind":"arxiv_version","alias_value":"2604.09492v2","created_at":"2026-05-29T01:05:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.09492","created_at":"2026-05-29T01:05:09Z"},{"alias_kind":"pith_short_12","alias_value":"QGX67E2PZKBZ","created_at":"2026-05-29T01:05:09Z"},{"alias_kind":"pith_short_16","alias_value":"QGX67E2PZKBZW3VI","created_at":"2026-05-29T01:05:09Z"},{"alias_kind":"pith_short_8","alias_value":"QGX67E2P","created_at":"2026-05-29T01:05:09Z"}],"graph_snapshots":[{"event_id":"sha256:cf3a01da4d3bd80267f7b5fed0d027b7a7aac0d4ffe45ba67b7765a161e2479e","target":"graph","created_at":"2026-05-29T01:05:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking."}],"snapshot_sha256":"fd6a2866d0e851eaca05281cf3f5e4624f9374e5d36346df916b410eb6554f03"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.09492/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Debasis Ganguly, Nilanjan Sinhababu, Pabitra Mitra, Soumedhik Bharati","cross_cats":[],"headline":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-10T16:59:54Z","title":"Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.09492","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T16:22:51.626003Z","id":"fc6ccfb3-af16-4963-b18c-3044ef4afd77","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"LLM-generated reference documents serve as pivots to dynamically truncate ranked lists and accelerate listwise reranking.","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.","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."}},"verdict_id":"fc6ccfb3-af16-4963-b18c-3044ef4afd77"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:41574dab11f9a85460020b56bfd036efa938bc29086fe805dbbda57941fd1be8","target":"record","created_at":"2026-05-29T01:05:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a9a49c3d00c289976781603545460c904182e5ba5bba75708e5dd155b0bc3a54","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-04-10T16:59:54Z","title_canon_sha256":"cbc28e6ec8a4d41d3ab4284c1f85071fb466865df675da2fa62d7302e782a3d1"},"schema_version":"1.0","source":{"id":"2604.09492","kind":"arxiv","version":2}},"canonical_sha256":"81afef934fca839b6ea877c577a5dcb34e2b5c17532bc51f9a92aff9796704dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81afef934fca839b6ea877c577a5dcb34e2b5c17532bc51f9a92aff9796704dc","first_computed_at":"2026-05-29T01:05:09.184570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:05:09.184570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zRLL+Z5rT7bMw2JU7WtxWnaHfHekiuL48lx2GcN6rVy+pFlOZdHYC2LgGETicQwUV6Iz7FmvPU9NmFEUWrXSAA==","signature_status":"signed_v1","signed_at":"2026-05-29T01:05:09.185610Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.09492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41574dab11f9a85460020b56bfd036efa938bc29086fe805dbbda57941fd1be8","sha256:cf3a01da4d3bd80267f7b5fed0d027b7a7aac0d4ffe45ba67b7765a161e2479e"],"state_sha256":"4ecce6df73f02a9cb596c003b3e6f20a5cb4a9dc82f5e83fab493f1604dda173"}