{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4B6P7FKTVOWWQLCSRGMGCPSPXV","short_pith_number":"pith:4B6P7FKT","schema_version":"1.0","canonical_sha256":"e07cff9553abad682c528998613e4fbd718a0a0c482a1ede053de7f729424421","source":{"kind":"arxiv","id":"2309.15088","version":1},"attestation_state":"computed","paper":{"title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Ronak Pradeep, Sahel Sharifymoghaddam","submitted_at":"2023-09-26T17:31:57Z","abstract_excerpt":"Researchers have successfully applied large language models (LLMs) such as ChatGPT to reranking in an information retrieval context, but to date, such work has mostly been built on proprietary models hidden behind opaque API endpoints. This approach yields experimental results that are not reproducible and non-deterministic, threatening the veracity of outcomes that build on such shaky foundations. To address this significant shortcoming, we present RankVicuna, the first fully open-source LLM capable of performing high-quality listwise reranking in a zero-shot setting. Experimental results on "},"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":"2309.15088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-09-26T17:31:57Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"b543f1b8f2ca53a2aecaedc019f35e68221cf09388f50a7a2950cc348cc24787","abstract_canon_sha256":"185c723e506edf02396850021890070908e5cc61f7accbba0c2a7084d1c4c6b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:33.876388Z","signature_b64":"ZJJ9rA3PLmM0+MyEaKaFmsgOVXkvDfpUtztLVqgRazATbhfLlGxsi3Xo8hQ4nT3QpF8cXsxVQXpANju+uXPbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e07cff9553abad682c528998613e4fbd718a0a0c482a1ede053de7f729424421","last_reissued_at":"2026-07-05T06:54:33.875879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:33.875879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Jimmy Lin, Ronak Pradeep, Sahel Sharifymoghaddam","submitted_at":"2023-09-26T17:31:57Z","abstract_excerpt":"Researchers have successfully applied large language models (LLMs) such as ChatGPT to reranking in an information retrieval context, but to date, such work has mostly been built on proprietary models hidden behind opaque API endpoints. This approach yields experimental results that are not reproducible and non-deterministic, threatening the veracity of outcomes that build on such shaky foundations. To address this significant shortcoming, we present RankVicuna, the first fully open-source LLM capable of performing high-quality listwise reranking in a zero-shot setting. Experimental results on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15088","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/2309.15088/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":"2309.15088","created_at":"2026-07-05T06:54:33.875940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15088v1","created_at":"2026-07-05T06:54:33.875940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15088","created_at":"2026-07-05T06:54:33.875940+00:00"},{"alias_kind":"pith_short_12","alias_value":"4B6P7FKTVOWW","created_at":"2026-07-05T06:54:33.875940+00:00"},{"alias_kind":"pith_short_16","alias_value":"4B6P7FKTVOWWQLCS","created_at":"2026-07-05T06:54:33.875940+00:00"},{"alias_kind":"pith_short_8","alias_value":"4B6P7FKT","created_at":"2026-07-05T06:54:33.875940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":24,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05968","citing_title":"InfluMatch: Frontier-Quality KOL Search at 4B-Model Cost","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2606.22807","citing_title":"KaLM-Reranker-V1: Fast but Not Late Interaction for Compressed Document Reranking","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01162","citing_title":"Trie-based Experiment Plans for Efficient IR Pipeline Experiments","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01782","citing_title":"Whole-Pool Setwise Reranking with Long-Context Language Models","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01070","citing_title":"Test-Time Training for Zero-Resource Dense Retrieval Reranking","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31003","citing_title":"Graph-GRPO: Dependency-Aware Credit Assignment for Generative E-commerce Search Relevance","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27429","citing_title":"Ocean4Rec: Offline LLM-Derived OCEAN Profiles for Request-Time VOD Reranking","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27810","citing_title":"LRanker: LLM Ranker for Massive Candidates","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20683","citing_title":"Layer-wise Token Compression for Efficient Document Reranking","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21948","citing_title":"SCI-Defense: Defending Manipulation Attacks from Generative Engine Optimization","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2509.00303","citing_title":"Access Paths for Efficient Ordering with Large Language Models","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20683","citing_title":"Layer-wise Token Compression for Efficient Document Reranking","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2312.02724","citing_title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","ref_index":32,"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":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11864","citing_title":"Very Efficient Listwise Multimodal Reranking for Long Documents","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27410","citing_title":"From Unstructured to Structured: LLM-Guided Attribute Graphs for Entity Search and Ranking","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23734","citing_title":"Prism-Reranker: Beyond Relevance Scoring -- Jointly Producing Contributions and Evidence for Agentic Retrieval","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06351","citing_title":"SIGMA-ASL: Sensor-Integrated Multimodal Dataset for Sign Language Recognition","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22180","citing_title":"ResRank: Unifying Retrieval and Listwise Reranking via End-to-End Joint Training with Residual Passage Compression","ref_index":3,"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":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09492","citing_title":"Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05204","citing_title":"Entities as Retrieval Signals: A Systematic Study of Coverage, Supervision, and Evaluation in Entity-Oriented Ranking","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2506.05176","citing_title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15621","citing_title":"Rethinking the Necessity of Adaptive Retrieval-Augmented Generation through the Lens of Adaptive Listwise Ranking","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV","json":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV.json","graph_json":"https://pith.science/api/pith-number/4B6P7FKTVOWWQLCSRGMGCPSPXV/graph.json","events_json":"https://pith.science/api/pith-number/4B6P7FKTVOWWQLCSRGMGCPSPXV/events.json","paper":"https://pith.science/paper/4B6P7FKT"},"agent_actions":{"view_html":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV","download_json":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV.json","view_paper":"https://pith.science/paper/4B6P7FKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15088&json=true","fetch_graph":"https://pith.science/api/pith-number/4B6P7FKTVOWWQLCSRGMGCPSPXV/graph.json","fetch_events":"https://pith.science/api/pith-number/4B6P7FKTVOWWQLCSRGMGCPSPXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV/action/storage_attestation","attest_author":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV/action/author_attestation","sign_citation":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV/action/citation_signature","submit_replication":"https://pith.science/pith/4B6P7FKTVOWWQLCSRGMGCPSPXV/action/replication_record"}},"created_at":"2026-07-05T06:54:33.875940+00:00","updated_at":"2026-07-05T06:54:33.875940+00:00"}