{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4N7WVTUXQH4KK4GFQ6EJBQWFMY","short_pith_number":"pith:4N7WVTUX","schema_version":"1.0","canonical_sha256":"e37f6ace9781f8a570c5878890c2c5661e13cc8be82e8a364d1c69353951497c","source":{"kind":"arxiv","id":"2406.11678","version":2},"attestation_state":"computed","paper":{"title":"TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Daiting Shi, Dawei Yin, Jiaxin Mao, Qi Liu, Weiwei Sun, Wei Yang, Xinyu Ma, Yiqun Chen, Yi Zhang","submitted_at":"2024-06-17T15:58:22Z","abstract_excerpt":"Large Language Models (LLMs) are increasingly employed in zero-shot documents ranking, yielding commendable results. However, several significant challenges still persist in LLMs for ranking: (1) LLMs are constrained by limited input length, precluding them from processing a large number of documents simultaneously; (2) The output document sequence is influenced by the input order of documents, resulting in inconsistent ranking outcomes; (3) Achieving a balance between cost and ranking performance is challenging. To tackle these issues, we introduce a novel documents ranking method called Tour"},"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":"2406.11678","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-06-17T15:58:22Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"c1b972c64448879a31038e1ea0fcd80d2ed95640405f7b05e0c6c907bbdbe27e","abstract_canon_sha256":"c7c9cf03d55847b90edca73af805d18989060821fb0457d0fc7f369d8a6bd4fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:26.733797Z","signature_b64":"b+rz69MFPIFmoPuVNVqnjnipu3x3u1mCSHYleolA6BY8MVWVdBwJ8mfx8zUV4DEAQY6m/iY3j87a93dx1ZIbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37f6ace9781f8a570c5878890c2c5661e13cc8be82e8a364d1c69353951497c","last_reissued_at":"2026-07-05T10:10:26.733326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:26.733326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TourRank: Utilizing Large Language Models for Documents Ranking with a Tournament-Inspired Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Daiting Shi, Dawei Yin, Jiaxin Mao, Qi Liu, Weiwei Sun, Wei Yang, Xinyu Ma, Yiqun Chen, Yi Zhang","submitted_at":"2024-06-17T15:58:22Z","abstract_excerpt":"Large Language Models (LLMs) are increasingly employed in zero-shot documents ranking, yielding commendable results. However, several significant challenges still persist in LLMs for ranking: (1) LLMs are constrained by limited input length, precluding them from processing a large number of documents simultaneously; (2) The output document sequence is influenced by the input order of documents, resulting in inconsistent ranking outcomes; (3) Achieving a balance between cost and ranking performance is challenging. To tackle these issues, we introduce a novel documents ranking method called Tour"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11678","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/2406.11678/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":"2406.11678","created_at":"2026-07-05T10:10:26.733385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.11678v2","created_at":"2026-07-05T10:10:26.733385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11678","created_at":"2026-07-05T10:10:26.733385+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N7WVTUXQH4K","created_at":"2026-07-05T10:10:26.733385+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N7WVTUXQH4KK4GF","created_at":"2026-07-05T10:10:26.733385+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N7WVTUX","created_at":"2026-07-05T10:10:26.733385+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14236","citing_title":"Active Learners as Efficient PRP Rerankers","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2511.14130","citing_title":"PRISM: Prompt-Refined In-Context System Modelling for Financial Retrieval","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14236","citing_title":"Active Learners as Efficient PRP Rerankers","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY","json":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY.json","graph_json":"https://pith.science/api/pith-number/4N7WVTUXQH4KK4GFQ6EJBQWFMY/graph.json","events_json":"https://pith.science/api/pith-number/4N7WVTUXQH4KK4GFQ6EJBQWFMY/events.json","paper":"https://pith.science/paper/4N7WVTUX"},"agent_actions":{"view_html":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY","download_json":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY.json","view_paper":"https://pith.science/paper/4N7WVTUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.11678&json=true","fetch_graph":"https://pith.science/api/pith-number/4N7WVTUXQH4KK4GFQ6EJBQWFMY/graph.json","fetch_events":"https://pith.science/api/pith-number/4N7WVTUXQH4KK4GFQ6EJBQWFMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY/action/storage_attestation","attest_author":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY/action/author_attestation","sign_citation":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY/action/citation_signature","submit_replication":"https://pith.science/pith/4N7WVTUXQH4KK4GFQ6EJBQWFMY/action/replication_record"}},"created_at":"2026-07-05T10:10:26.733385+00:00","updated_at":"2026-07-05T10:10:26.733385+00:00"}