{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7H2BISZCG2WI6ENJWAZ7CYLRJV","short_pith_number":"pith:7H2BISZC","schema_version":"1.0","canonical_sha256":"f9f4144b2236ac8f11a9b033f161714d4d6c5f0f662d8eb29e68cf592e981233","source":{"kind":"arxiv","id":"2506.22262","version":1},"attestation_state":"computed","paper":{"title":"JointRank: Rank Large Set with Single Pass","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Evgeny Dedov","submitted_at":"2025-06-27T14:30:12Z","abstract_excerpt":"Efficiently ranking relevant items from large candidate pools is a cornerstone of modern information retrieval systems -- such as web search, recommendation, and retrieval-augmented generation. Listwise rerankers, which improve relevance by jointly considering multiple candidates, are often limited in practice: either by model input size constraints, or by degraded quality when processing large sets. We propose a model-agnostic method for fast reranking large sets that exceed a model input limits. The method first partitions candidate items into overlapping blocks, each of which is ranked inde"},"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":"2506.22262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-06-27T14:30:12Z","cross_cats_sorted":[],"title_canon_sha256":"ceabdb4a8aebb698bfc55bd8f2618a526ddb2fc372d93a934df39a3d28d604d3","abstract_canon_sha256":"5ff7b4c3506ac84fc18bfc4fc12d93c02e85899cab806873d61611703c89050f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:24.423327Z","signature_b64":"ukxS0hjjkJw5bzSYs3DWRCPJNiyrif3fgsUr8siWxnsfM0h4y3aOORf7HFaUHVQr80yV+IgM3FrOUejvRSCrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9f4144b2236ac8f11a9b033f161714d4d6c5f0f662d8eb29e68cf592e981233","last_reissued_at":"2026-07-05T11:28:24.422859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:24.422859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"JointRank: Rank Large Set with Single Pass","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Evgeny Dedov","submitted_at":"2025-06-27T14:30:12Z","abstract_excerpt":"Efficiently ranking relevant items from large candidate pools is a cornerstone of modern information retrieval systems -- such as web search, recommendation, and retrieval-augmented generation. Listwise rerankers, which improve relevance by jointly considering multiple candidates, are often limited in practice: either by model input size constraints, or by degraded quality when processing large sets. We propose a model-agnostic method for fast reranking large sets that exceed a model input limits. The method first partitions candidate items into overlapping blocks, each of which is ranked inde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22262","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/2506.22262/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":"2506.22262","created_at":"2026-07-05T11:28:24.422915+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.22262v1","created_at":"2026-07-05T11:28:24.422915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22262","created_at":"2026-07-05T11:28:24.422915+00:00"},{"alias_kind":"pith_short_12","alias_value":"7H2BISZCG2WI","created_at":"2026-07-05T11:28:24.422915+00:00"},{"alias_kind":"pith_short_16","alias_value":"7H2BISZCG2WI6ENJ","created_at":"2026-07-05T11:28:24.422915+00:00"},{"alias_kind":"pith_short_8","alias_value":"7H2BISZC","created_at":"2026-07-05T11:28:24.422915+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV","json":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV.json","graph_json":"https://pith.science/api/pith-number/7H2BISZCG2WI6ENJWAZ7CYLRJV/graph.json","events_json":"https://pith.science/api/pith-number/7H2BISZCG2WI6ENJWAZ7CYLRJV/events.json","paper":"https://pith.science/paper/7H2BISZC"},"agent_actions":{"view_html":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV","download_json":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV.json","view_paper":"https://pith.science/paper/7H2BISZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.22262&json=true","fetch_graph":"https://pith.science/api/pith-number/7H2BISZCG2WI6ENJWAZ7CYLRJV/graph.json","fetch_events":"https://pith.science/api/pith-number/7H2BISZCG2WI6ENJWAZ7CYLRJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV/action/storage_attestation","attest_author":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV/action/author_attestation","sign_citation":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV/action/citation_signature","submit_replication":"https://pith.science/pith/7H2BISZCG2WI6ENJWAZ7CYLRJV/action/replication_record"}},"created_at":"2026-07-05T11:28:24.422915+00:00","updated_at":"2026-07-05T11:28:24.422915+00:00"}