{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CRKHS654WUIDX5ONW2CSGYTAEO","short_pith_number":"pith:CRKHS654","schema_version":"1.0","canonical_sha256":"1454797bbcb5103bf5cdb68523626023acd8c4210a66cdd1ded0ff7edd2d45fe","source":{"kind":"arxiv","id":"2305.02156","version":1},"attestation_state":"computed","paper":{"title":"Zero-Shot Listwise Document Reranking with a Large Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Ronak Pradeep, Xinyu Zhang, Xueguang Ma","submitted_at":"2023-05-03T14:45:34Z","abstract_excerpt":"Supervised ranking methods based on bi-encoder or cross-encoder architectures have shown success in multi-stage text ranking tasks, but they require large amounts of relevance judgments as training data. In this work, we propose Listwise Reranker with a Large Language Model (LRL), which achieves strong reranking effectiveness without using any task-specific training data. Different from the existing pointwise ranking methods, where documents are scored independently and ranked according to the scores, LRL directly generates a reordered list of document identifiers given the candidate documents"},"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":"2305.02156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-05-03T14:45:34Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6d2bf3f761a66536bc7d0183662db5868b49b5008af932436ad25321ba773e34","abstract_canon_sha256":"b16d7a3982fbc21d40cc2258d5f45e4f7172861c9ab09afacd1e35b3b5a556e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:47.946706Z","signature_b64":"JpjLvERfbCZEjN0PFD34oRKqwTt7bFKnloZ2WriY/+RxWZ5SJCTtb7ogqQj8sJZJ0MDVihuGJTgdQUqZhBgFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1454797bbcb5103bf5cdb68523626023acd8c4210a66cdd1ded0ff7edd2d45fe","last_reissued_at":"2026-07-05T06:06:47.946215Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:47.946215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-Shot Listwise Document Reranking with a Large Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Ronak Pradeep, Xinyu Zhang, Xueguang Ma","submitted_at":"2023-05-03T14:45:34Z","abstract_excerpt":"Supervised ranking methods based on bi-encoder or cross-encoder architectures have shown success in multi-stage text ranking tasks, but they require large amounts of relevance judgments as training data. In this work, we propose Listwise Reranker with a Large Language Model (LRL), which achieves strong reranking effectiveness without using any task-specific training data. Different from the existing pointwise ranking methods, where documents are scored independently and ranked according to the scores, LRL directly generates a reordered list of document identifiers given the candidate documents"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02156","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/2305.02156/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":"2305.02156","created_at":"2026-07-05T06:06:47.946274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02156v1","created_at":"2026-07-05T06:06:47.946274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02156","created_at":"2026-07-05T06:06:47.946274+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRKHS654WUID","created_at":"2026-07-05T06:06:47.946274+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRKHS654WUIDX5ON","created_at":"2026-07-05T06:06:47.946274+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRKHS654","created_at":"2026-07-05T06:06:47.946274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":24,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02387","citing_title":"Bringing Agentic Search to Earth Observation Data Discovery","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01782","citing_title":"Whole-Pool Setwise Reranking with Long-Context Language Models","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31693","citing_title":"ShopX: A Foundation Model for Intent-to-Item Fulfillment in Agentic Shopping","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27429","citing_title":"Ocean4Rec: Offline LLM-Derived OCEAN Profiles for Request-Time VOD Reranking","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28737","citing_title":"5ting at SemEval-2026 Task 8: Strong End-to-End Multi-Turn RAG via LLM-Based Reranking and Faithfulness Control","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28017","citing_title":"Can It Reach the Generator? Investigating the Survival of Prompt-Injection Attacks in Realistic RAG Settings","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2411.15594","citing_title":"A Survey on LLM-as-a-Judge","ref_index":105,"is_internal_anchor":false},{"citing_arxiv_id":"2502.00709","citing_title":"RankFlow: A Multi-Role Collaborative Reranking Workflow Utilizing Large Language Models","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2504.21015","citing_title":"Don't Retrieve, Generate: Prompting LLMs for Synthetic Training Data in Dense Retrieval","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20683","citing_title":"Layer-wise Token Compression for Efficient Document Reranking","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2509.00303","citing_title":"Access Paths for Efficient Ordering with Large Language Models","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20683","citing_title":"Layer-wise Token Compression for Efficient Document Reranking","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00505","citing_title":"LLM-Oriented Information Retrieval: A Denoising-First Perspective","ref_index":121,"is_internal_anchor":false},{"citing_arxiv_id":"2506.03487","citing_title":"ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2509.08150","citing_title":"Verbalized Algorithms: Classical Algorithms are All You Need (Mostly)","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2511.11653","citing_title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2312.02724","citing_title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2602.22591","citing_title":"Where Relevance Emerges: A Layer-Wise Study of Internal Attention for Zero-Shot Re-Ranking","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27599","citing_title":"One Pass, Any Order: Position-Invariant Listwise Reranking for LLM-Based Recommendation","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08737","citing_title":"The Extrapolation Cliff in On-Policy Distillation of Near-Deterministic Structured Outputs","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24608","citing_title":"Learning to Route Queries to Heads for Attention-based Re-ranking with Large Language Models","ref_index":21,"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":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00505","citing_title":"LLM-Oriented Information Retrieval: A Denoising-First Perspective","ref_index":118,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17237","citing_title":"HeadRank: Decoding-Free Passage Reranking via Preference-Aligned Attention Heads","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO","json":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO.json","graph_json":"https://pith.science/api/pith-number/CRKHS654WUIDX5ONW2CSGYTAEO/graph.json","events_json":"https://pith.science/api/pith-number/CRKHS654WUIDX5ONW2CSGYTAEO/events.json","paper":"https://pith.science/paper/CRKHS654"},"agent_actions":{"view_html":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO","download_json":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO.json","view_paper":"https://pith.science/paper/CRKHS654","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02156&json=true","fetch_graph":"https://pith.science/api/pith-number/CRKHS654WUIDX5ONW2CSGYTAEO/graph.json","fetch_events":"https://pith.science/api/pith-number/CRKHS654WUIDX5ONW2CSGYTAEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO/action/storage_attestation","attest_author":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO/action/author_attestation","sign_citation":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO/action/citation_signature","submit_replication":"https://pith.science/pith/CRKHS654WUIDX5ONW2CSGYTAEO/action/replication_record"}},"created_at":"2026-07-05T06:06:47.946274+00:00","updated_at":"2026-07-05T06:06:47.946274+00:00"}