{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GRLQYWQY3AQNMJDZMSQSTMKVSH","short_pith_number":"pith:GRLQYWQY","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"},"canonical_sha256":"34570c5a18d820d6247964a129b15591c0a45e9a380f12bb77905a516070afc3","source":{"kind":"arxiv","id":"2606.25249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25249","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25249v1","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25249","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"GRLQYWQY3AQN","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRLQYWQY3AQNMJDZ","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRLQYWQY","created_at":"2026-06-25T00:18:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GRLQYWQY3AQNMJDZMSQSTMKVSH","target":"record","payload":{"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"},"canonical_sha256":"34570c5a18d820d6247964a129b15591c0a45e9a380f12bb77905a516070afc3","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"},"source_kind":"arxiv","source_id":"2606.25249","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T00:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMAmdUJejouzv2aGdmhChJ3R16Hw3yznRRWq5ZAbF6Kj5+r7su1rfGk0HsRuzU5ry5tQqjcPvlixzIvRTw13DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:47:27.726393Z"},"content_sha256":"8b7b422914bf68684af26f46584f9ff0160ea65e2ea6c7c5ae818fa796ceb959","schema_version":"1.0","event_id":"sha256:8b7b422914bf68684af26f46584f9ff0160ea65e2ea6c7c5ae818fa796ceb959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GRLQYWQY3AQNMJDZMSQSTMKVSH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T00:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmuuqALqdY8atuZEmSSyIt/9G5zcxyNfhNtclQv2HrtkV+ePHvKjDrCZ2qcvsJts4jIxkXZFYQHUDKKTZ/+RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T13:47:27.726771Z"},"content_sha256":"3706e807e1dcd1c13040c99045f278f5b9b20aaac1be58a7cacfeb820779977d","schema_version":"1.0","event_id":"sha256:3706e807e1dcd1c13040c99045f278f5b9b20aaac1be58a7cacfeb820779977d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/bundle.json","state_url":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T13:47:27Z","links":{"resolver":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH","bundle":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/bundle.json","state":"https://pith.science/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRLQYWQY3AQNMJDZMSQSTMKVSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GRLQYWQY3AQNMJDZMSQSTMKVSH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5f2779e21af2ae38c6f84dc719dd50b77db74dd09666e50fe3c71729f636ea5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-24T00:12:44Z","title_canon_sha256":"d90b4fa6adcc0bbb89212507407027d67c7fdeee896178f8ff124870616d8918"},"schema_version":"1.0","source":{"id":"2606.25249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.25249","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"2606.25249v1","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25249","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"GRLQYWQY3AQN","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRLQYWQY3AQNMJDZ","created_at":"2026-06-25T00:18:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRLQYWQY","created_at":"2026-06-25T00:18:22Z"}],"graph_snapshots":[{"event_id":"sha256:3706e807e1dcd1c13040c99045f278f5b9b20aaac1be58a7cacfeb820779977d","target":"graph","created_at":"2026-06-25T00:18:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.25249/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ata Cinar Genc, Emir Kaan Korukluoglu, James Allan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-24T00:12:44Z","title":"Adaptive Re-Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25249","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b7b422914bf68684af26f46584f9ff0160ea65e2ea6c7c5ae818fa796ceb959","target":"record","created_at":"2026-06-25T00:18:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5f2779e21af2ae38c6f84dc719dd50b77db74dd09666e50fe3c71729f636ea5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2026-06-24T00:12:44Z","title_canon_sha256":"d90b4fa6adcc0bbb89212507407027d67c7fdeee896178f8ff124870616d8918"},"schema_version":"1.0","source":{"id":"2606.25249","kind":"arxiv","version":1}},"canonical_sha256":"34570c5a18d820d6247964a129b15591c0a45e9a380f12bb77905a516070afc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34570c5a18d820d6247964a129b15591c0a45e9a380f12bb77905a516070afc3","first_computed_at":"2026-06-25T00:18:22.116211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:22.116211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yAkukoAqJUb5kuoOpaAQkzlAmTS/2zRzmIB0ED4m6o+X97pdeqXnlvHajkEpEhHyWZ+HBk+qZBb+aJHA2CeDDQ==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:22.116688Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.25249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b7b422914bf68684af26f46584f9ff0160ea65e2ea6c7c5ae818fa796ceb959","sha256:3706e807e1dcd1c13040c99045f278f5b9b20aaac1be58a7cacfeb820779977d"],"state_sha256":"a6734c04ad9ea81ed5aafabfc8c9eff878a177013cd8d3681fa2a020ce6f6422"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKZ3V2eDwqg55J7Mo5dlp+8Kns8s87zQhJ7BtXXVpHl7w5aCg300jgHeq00SFedI6Y9IgkEwD0JCglCw1Z/9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T13:47:27.728924Z","bundle_sha256":"5a34d538915854018150c99a2782b20fb904b2ec8f68c56612c495fdffb5bcbf"}}