{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MYRU6UTLO7FVBKFFFDJROCKC33","short_pith_number":"pith:MYRU6UTL","schema_version":"1.0","canonical_sha256":"66234f526b77cb50a8a528d3170942dee50bdade8cb835f878148a6bc0a55906","source":{"kind":"arxiv","id":"2602.05448","version":4},"attestation_state":"computed","paper":{"title":"BlitzRank: Principled Zero-shot Ranking Agents with Tournament Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Douwe Kiela, Sheshansh Agrawal, Thien Hang Nguyen","submitted_at":"2026-02-05T08:41:00Z","abstract_excerpt":"Selecting the top $m$ from $n$ items via expensive $k$-wise comparisons is central to settings ranging from LLM-based document reranking to crowdsourced evaluation and tournament design. Existing methods either rely on heuristics that discard comparison information, or exploit it at prohibitive cost. We introduce a tournament graph framework that provides a principled foundation for $k$-wise ranking. Our key observation is that each $k$-item comparison reveals an induced tournament of $\\binom{k}{2}$ pairwise preferences; aggregating these into a global preference graph and computing its transi"},"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":"2602.05448","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-05T08:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"ec0b9d2aee65027f0e68854e586ca09d79997ac1be56da69f7b0ec9240679323","abstract_canon_sha256":"788ac1c30967ecb486aeb8e178e0dfdacb1b024808f8a523bc5ebc44ac13fa0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:06.567901Z","signature_b64":"BolpGrSy9pS39Ww7mIO/LUaa3ypC2WNEpwDKGVu5+juzaDM398YVgM37ZQwP4qHZRnU/ikbZ6NQJdsXyyIqqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66234f526b77cb50a8a528d3170942dee50bdade8cb835f878148a6bc0a55906","last_reissued_at":"2026-05-26T02:05:06.567248Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:06.567248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BlitzRank: Principled Zero-shot Ranking Agents with Tournament Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Douwe Kiela, Sheshansh Agrawal, Thien Hang Nguyen","submitted_at":"2026-02-05T08:41:00Z","abstract_excerpt":"Selecting the top $m$ from $n$ items via expensive $k$-wise comparisons is central to settings ranging from LLM-based document reranking to crowdsourced evaluation and tournament design. Existing methods either rely on heuristics that discard comparison information, or exploit it at prohibitive cost. We introduce a tournament graph framework that provides a principled foundation for $k$-wise ranking. Our key observation is that each $k$-item comparison reveals an induced tournament of $\\binom{k}{2}$ pairwise preferences; aggregating these into a global preference graph and computing its transi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.05448","kind":"arxiv","version":4},"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/2602.05448/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":"2602.05448","created_at":"2026-05-26T02:05:06.567355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.05448v4","created_at":"2026-05-26T02:05:06.567355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.05448","created_at":"2026-05-26T02:05:06.567355+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYRU6UTLO7FV","created_at":"2026-05-26T02:05:06.567355+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYRU6UTLO7FVBKFF","created_at":"2026-05-26T02:05:06.567355+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYRU6UTL","created_at":"2026-05-26T02:05:06.567355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.01782","citing_title":"Whole-Pool Setwise Reranking with Long-Context Language Models","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33","json":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33.json","graph_json":"https://pith.science/api/pith-number/MYRU6UTLO7FVBKFFFDJROCKC33/graph.json","events_json":"https://pith.science/api/pith-number/MYRU6UTLO7FVBKFFFDJROCKC33/events.json","paper":"https://pith.science/paper/MYRU6UTL"},"agent_actions":{"view_html":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33","download_json":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33.json","view_paper":"https://pith.science/paper/MYRU6UTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.05448&json=true","fetch_graph":"https://pith.science/api/pith-number/MYRU6UTLO7FVBKFFFDJROCKC33/graph.json","fetch_events":"https://pith.science/api/pith-number/MYRU6UTLO7FVBKFFFDJROCKC33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33/action/storage_attestation","attest_author":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33/action/author_attestation","sign_citation":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33/action/citation_signature","submit_replication":"https://pith.science/pith/MYRU6UTLO7FVBKFFFDJROCKC33/action/replication_record"}},"created_at":"2026-05-26T02:05:06.567355+00:00","updated_at":"2026-05-26T02:05:06.567355+00:00"}