{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GRLQYWQY3AQNMJDZMSQSTMKVSH","short_pith_number":"pith:GRLQYWQY","schema_version":"1.0","canonical_sha256":"34570c5a18d820d6247964a129b15591c0a45e9a380f12bb77905a516070afc3","source":{"kind":"arxiv","id":"2606.25249","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Re-Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ata Cinar Genc, Emir Kaan Korukluoglu, James Allan","submitted_at":"2026-06-24T00:12:44Z","abstract_excerpt":"Modern Information Retrieval (IR) systems typically use a \"retrieve-then-rerank\" pipeline, where a computationally expensive, pre-determined cross-encoder re-ranks the top results from a fast initial retriever. While effective, this approach often applies heavy re-ranking models regardless of query complexity, resulting in high latency and wasted computational resources on simple queries. We propose Adaptive Re-Ranking, an utility-based labeling framework for cost-aware routing and present empirical evidence (via oracle analysis and a trained baseline router) that per-query routing offers larg"},"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":"2606.25249","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-24T00:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"d90b4fa6adcc0bbb89212507407027d67c7fdeee896178f8ff124870616d8918","abstract_canon_sha256":"b5f2779e21af2ae38c6f84dc719dd50b77db74dd09666e50fe3c71729f636ea5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:22.116688Z","signature_b64":"yAkukoAqJUb5kuoOpaAQkzlAmTS/2zRzmIB0ED4m6o+X97pdeqXnlvHajkEpEhHyWZ+HBk+qZBb+aJHA2CeDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34570c5a18d820d6247964a129b15591c0a45e9a380f12bb77905a516070afc3","last_reissued_at":"2026-06-25T00:18:22.116211Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:22.116211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Re-Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ata Cinar Genc, Emir Kaan Korukluoglu, James Allan","submitted_at":"2026-06-24T00:12:44Z","abstract_excerpt":"Modern Information Retrieval (IR) systems typically use a \"retrieve-then-rerank\" pipeline, where a computationally expensive, pre-determined cross-encoder re-ranks the top results from a fast initial retriever. While effective, this approach often applies heavy re-ranking models regardless of query complexity, resulting in high latency and wasted computational resources on simple queries. We propose Adaptive Re-Ranking, an utility-based labeling framework for cost-aware routing and present empirical evidence (via oracle analysis and a trained baseline router) that per-query routing offers larg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25249","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/2606.25249/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":"2606.25249","created_at":"2026-06-25T00:18:22.116301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25249v1","created_at":"2026-06-25T00:18:22.116301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25249","created_at":"2026-06-25T00:18:22.116301+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRLQYWQY3AQN","created_at":"2026-06-25T00:18:22.116301+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRLQYWQY3AQNMJDZ","created_at":"2026-06-25T00:18:22.116301+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRLQYWQY","created_at":"2026-06-25T00:18:22.116301+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/GRLQYWQY3AQNMJDZMSQSTMKVSH","json":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH.json","graph_json":"https://pith.science/api/pith-number/GRLQYWQY3AQNMJDZMSQSTMKVSH/graph.json","events_json":"https://pith.science/api/pith-number/GRLQYWQY3AQNMJDZMSQSTMKVSH/events.json","paper":"https://pith.science/paper/GRLQYWQY"},"agent_actions":{"view_html":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH","download_json":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH.json","view_paper":"https://pith.science/paper/GRLQYWQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25249&json=true","fetch_graph":"https://pith.science/api/pith-number/GRLQYWQY3AQNMJDZMSQSTMKVSH/graph.json","fetch_events":"https://pith.science/api/pith-number/GRLQYWQY3AQNMJDZMSQSTMKVSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/action/storage_attestation","attest_author":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/action/author_attestation","sign_citation":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/action/citation_signature","submit_replication":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/action/replication_record"}},"created_at":"2026-06-25T00:18:22.116301+00:00","updated_at":"2026-06-25T00:18:22.116301+00:00"}