{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2MTTCNKNUJRZJHNUBED4HTNABG","short_pith_number":"pith:2MTTCNKN","schema_version":"1.0","canonical_sha256":"d32731354da263949db40907c3cda009a4581c3aa0625d6f00c872b6eed02e29","source":{"kind":"arxiv","id":"2501.09186","version":1},"attestation_state":"computed","paper":{"title":"Guiding Retrieval using LLM-based Listwise Rankers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Avishek Anand, Mandeep Rathee, Sean MacAvaney","submitted_at":"2025-01-15T22:23:53Z","abstract_excerpt":"Large Language Models (LLMs) have shown strong promise as rerankers, especially in ``listwise'' settings where an LLM is prompted to rerank several search results at once. However, this ``cascading'' retrieve-and-rerank approach is limited by the bounded recall problem: relevant documents not retrieved initially are permanently excluded from the final ranking. Adaptive retrieval techniques address this problem, but do not work with listwise rerankers because they assume a document's score is computed independently from other documents. In this paper, we propose an adaptation of an existing ada"},"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":"2501.09186","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-01-15T22:23:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a505ce01c2ec0a312ad90f042a43486c5564464cddc033bd0a4ef0e64a1d3bd2","abstract_canon_sha256":"a20609df291467f98bff36fd875ba14043405ed1de30a299e96c47f630901479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:43.274941Z","signature_b64":"Ag8cCkcfAoOlNGn1u1oAxmAGMuhf+K0UiyiP33T9aO6rIRLQeUX+4qbBi0Vjx1dbnfSbL4dIrF1QAHNyMyteAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d32731354da263949db40907c3cda009a4581c3aa0625d6f00c872b6eed02e29","last_reissued_at":"2026-07-05T10:01:43.274502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:43.274502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guiding Retrieval using LLM-based Listwise Rankers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Avishek Anand, Mandeep Rathee, Sean MacAvaney","submitted_at":"2025-01-15T22:23:53Z","abstract_excerpt":"Large Language Models (LLMs) have shown strong promise as rerankers, especially in ``listwise'' settings where an LLM is prompted to rerank several search results at once. However, this ``cascading'' retrieve-and-rerank approach is limited by the bounded recall problem: relevant documents not retrieved initially are permanently excluded from the final ranking. Adaptive retrieval techniques address this problem, but do not work with listwise rerankers because they assume a document's score is computed independently from other documents. In this paper, we propose an adaptation of an existing ada"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.09186","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/2501.09186/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":"2501.09186","created_at":"2026-07-05T10:01:43.274559+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.09186v1","created_at":"2026-07-05T10:01:43.274559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.09186","created_at":"2026-07-05T10:01:43.274559+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MTTCNKNUJRZ","created_at":"2026-07-05T10:01:43.274559+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MTTCNKNUJRZJHNU","created_at":"2026-07-05T10:01:43.274559+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MTTCNKN","created_at":"2026-07-05T10:01:43.274559+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/2MTTCNKNUJRZJHNUBED4HTNABG","json":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG.json","graph_json":"https://pith.science/api/pith-number/2MTTCNKNUJRZJHNUBED4HTNABG/graph.json","events_json":"https://pith.science/api/pith-number/2MTTCNKNUJRZJHNUBED4HTNABG/events.json","paper":"https://pith.science/paper/2MTTCNKN"},"agent_actions":{"view_html":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG","download_json":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG.json","view_paper":"https://pith.science/paper/2MTTCNKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.09186&json=true","fetch_graph":"https://pith.science/api/pith-number/2MTTCNKNUJRZJHNUBED4HTNABG/graph.json","fetch_events":"https://pith.science/api/pith-number/2MTTCNKNUJRZJHNUBED4HTNABG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG/action/storage_attestation","attest_author":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG/action/author_attestation","sign_citation":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG/action/citation_signature","submit_replication":"https://pith.science/pith/2MTTCNKNUJRZJHNUBED4HTNABG/action/replication_record"}},"created_at":"2026-07-05T10:01:43.274559+00:00","updated_at":"2026-07-05T10:01:43.274559+00:00"}