{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WWERPWCS5ZKDVT6V6XPYU4XLHL","short_pith_number":"pith:WWERPWCS","schema_version":"1.0","canonical_sha256":"b58917d852ee543acfd5f5df8a72eb3ac12eb3b32a4181c98c6af247e92dcec3","source":{"kind":"arxiv","id":"2405.14589","version":1},"attestation_state":"computed","paper":{"title":"Top-Down Partitioning for Efficient List-Wise Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Andrew Parry, Debasis Ganguly, Sean MacAvaney","submitted_at":"2024-05-23T14:00:26Z","abstract_excerpt":"Large Language Models (LLMs) have significantly impacted many facets of natural language processing and information retrieval. Unlike previous encoder-based approaches, the enlarged context window of these generative models allows for ranking multiple documents at once, commonly called list-wise ranking. However, there are still limits to the number of documents that can be ranked in a single inference of the model, leading to the broad adoption of a sliding window approach to identify the k most relevant items in a ranked list. We argue that the sliding window approach is not well-suited for "},"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":"2405.14589","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-05-23T14:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"8b6f25855dfe951796ddd5fa3a50f1781e7a21593eb0d9f93b8b966251fe2126","abstract_canon_sha256":"9c83b180073bf6b1fc7154cba47690cc49f1d6fe56cb82ce4b25b3cc6ef78502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:25.398000Z","signature_b64":"4pEYCDf8a/cNycEDbGYYutSjeg8qS++t92JthYn/uz6LEbV41EFGu+aSkeGWfPqVcXeDUH883b7a9r/MWq0gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58917d852ee543acfd5f5df8a72eb3ac12eb3b32a4181c98c6af247e92dcec3","last_reissued_at":"2026-07-05T08:22:25.397562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:25.397562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-Down Partitioning for Efficient List-Wise Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Andrew Parry, Debasis Ganguly, Sean MacAvaney","submitted_at":"2024-05-23T14:00:26Z","abstract_excerpt":"Large Language Models (LLMs) have significantly impacted many facets of natural language processing and information retrieval. Unlike previous encoder-based approaches, the enlarged context window of these generative models allows for ranking multiple documents at once, commonly called list-wise ranking. However, there are still limits to the number of documents that can be ranked in a single inference of the model, leading to the broad adoption of a sliding window approach to identify the k most relevant items in a ranked list. We argue that the sliding window approach is not well-suited for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14589","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/2405.14589/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":"2405.14589","created_at":"2026-07-05T08:22:25.397633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14589v1","created_at":"2026-07-05T08:22:25.397633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14589","created_at":"2026-07-05T08:22:25.397633+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWERPWCS5ZKD","created_at":"2026-07-05T08:22:25.397633+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWERPWCS5ZKDVT6V","created_at":"2026-07-05T08:22:25.397633+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWERPWCS","created_at":"2026-07-05T08:22:25.397633+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09492","citing_title":"Dynamic Ranked List Truncation for Reranking Pipelines via LLM-generated Reference-Documents","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL","json":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL.json","graph_json":"https://pith.science/api/pith-number/WWERPWCS5ZKDVT6V6XPYU4XLHL/graph.json","events_json":"https://pith.science/api/pith-number/WWERPWCS5ZKDVT6V6XPYU4XLHL/events.json","paper":"https://pith.science/paper/WWERPWCS"},"agent_actions":{"view_html":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL","download_json":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL.json","view_paper":"https://pith.science/paper/WWERPWCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14589&json=true","fetch_graph":"https://pith.science/api/pith-number/WWERPWCS5ZKDVT6V6XPYU4XLHL/graph.json","fetch_events":"https://pith.science/api/pith-number/WWERPWCS5ZKDVT6V6XPYU4XLHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL/action/storage_attestation","attest_author":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL/action/author_attestation","sign_citation":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL/action/citation_signature","submit_replication":"https://pith.science/pith/WWERPWCS5ZKDVT6V6XPYU4XLHL/action/replication_record"}},"created_at":"2026-07-05T08:22:25.397633+00:00","updated_at":"2026-07-05T08:22:25.397633+00:00"}