{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5LNQG6JQM5N3FQVOGRYC73BN4A","short_pith_number":"pith:5LNQG6JQ","schema_version":"1.0","canonical_sha256":"eadb037930675bb2c2ae34702fec2de03ba3cb2ef401fad541242a9666de723b","source":{"kind":"arxiv","id":"2310.09497","version":2},"attestation_state":"computed","paper":{"title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Bevan Koopman, Guido Zuccon, Honglei Zhuang, Shengyao Zhuang","submitted_at":"2023-10-14T05:20:02Z","abstract_excerpt":"We propose a novel zero-shot document ranking approach based on Large Language Models (LLMs): the Setwise prompting approach. Our approach complements existing prompting approaches for LLM-based zero-shot ranking: Pointwise, Pairwise, and Listwise. Through the first-of-its-kind comparative evaluation within a consistent experimental framework and considering factors like model size, token consumption, latency, among others, we show that existing approaches are inherently characterised by trade-offs between effectiveness and efficiency. We find that while Pointwise approaches score high on effi"},"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":"2310.09497","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2023-10-14T05:20:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"af969289a4b77b93d0b4d6d00bd3518bd74d40da986d47aef44d52590b5d11f1","abstract_canon_sha256":"44a8cdf58d044cc8941ac1521b8993a1cb6f9ff62737bb5c62e0f8d547be4006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:57.763165Z","signature_b64":"LFext1Yp4nkZIrLbswhXvRtH0405ZrEEMbpSel6iCJerD1gqXGzhbTKRSPq63s7CRnj6DYlDaCDQ39so0bB/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eadb037930675bb2c2ae34702fec2de03ba3cb2ef401fad541242a9666de723b","last_reissued_at":"2026-07-05T08:24:57.762641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:57.762641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Setwise Approach for Effective and Highly Efficient Zero-shot Ranking with Large Language Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Bevan Koopman, Guido Zuccon, Honglei Zhuang, Shengyao Zhuang","submitted_at":"2023-10-14T05:20:02Z","abstract_excerpt":"We propose a novel zero-shot document ranking approach based on Large Language Models (LLMs): the Setwise prompting approach. Our approach complements existing prompting approaches for LLM-based zero-shot ranking: Pointwise, Pairwise, and Listwise. Through the first-of-its-kind comparative evaluation within a consistent experimental framework and considering factors like model size, token consumption, latency, among others, we show that existing approaches are inherently characterised by trade-offs between effectiveness and efficiency. We find that while Pointwise approaches score high on effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09497","kind":"arxiv","version":2},"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/2310.09497/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":"2310.09497","created_at":"2026-07-05T08:24:57.762706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.09497v2","created_at":"2026-07-05T08:24:57.762706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09497","created_at":"2026-07-05T08:24:57.762706+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LNQG6JQM5N3","created_at":"2026-07-05T08:24:57.762706+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LNQG6JQM5N3FQVO","created_at":"2026-07-05T08:24:57.762706+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LNQG6JQ","created_at":"2026-07-05T08:24:57.762706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2312.02724","citing_title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26483","citing_title":"Efficient Listwise Reranking with Compressed Document Representations","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A","json":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A.json","graph_json":"https://pith.science/api/pith-number/5LNQG6JQM5N3FQVOGRYC73BN4A/graph.json","events_json":"https://pith.science/api/pith-number/5LNQG6JQM5N3FQVOGRYC73BN4A/events.json","paper":"https://pith.science/paper/5LNQG6JQ"},"agent_actions":{"view_html":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A","download_json":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A.json","view_paper":"https://pith.science/paper/5LNQG6JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.09497&json=true","fetch_graph":"https://pith.science/api/pith-number/5LNQG6JQM5N3FQVOGRYC73BN4A/graph.json","fetch_events":"https://pith.science/api/pith-number/5LNQG6JQM5N3FQVOGRYC73BN4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A/action/storage_attestation","attest_author":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A/action/author_attestation","sign_citation":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A/action/citation_signature","submit_replication":"https://pith.science/pith/5LNQG6JQM5N3FQVOGRYC73BN4A/action/replication_record"}},"created_at":"2026-07-05T08:24:57.762706+00:00","updated_at":"2026-07-05T08:24:57.762706+00:00"}