{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ORDKRURUWNDFZXYH6SIHPE32BC","short_pith_number":"pith:ORDKRURU","schema_version":"1.0","canonical_sha256":"7446a8d234b3465cdf07f49077937a08abd1567855d9c1b9a0ccb0ecd0dfb615","source":{"kind":"arxiv","id":"2607.29606","version":1},"attestation_state":"computed","paper":{"title":"QASP: Query-Adaptive Robust Vector Search Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Andy Warfield, Hakan Ferhatosmanoglu, Kushal Kumar, Tal Wagner","submitted_at":"2026-07-31T16:38:47Z","abstract_excerpt":"A fundamental challenge of vector search is achieving consistently high recall while minimizing computational costs. Fixed search parameters cause significant performance variance across queries, and conventional evaluation on average recall masks these per-query disparities. We introduce QASP (Query-Adaptive robust vector Search Policy), which predicts the complete recall progression curve per query via a single upfront supervised regression, from which a search policy is derived for any recall target; this avoids iterative model invocations during search or separate predictors per target. By"},"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":"2607.29606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-31T16:38:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6769813b8272ffce59ee6b22ad03d358df107abcd296d148327ba94ff4adf164","abstract_canon_sha256":"c7a45a53fc6daafd1e6e71a37ddf05896e4a7c3003bc26898f551d9317b5a181"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:40:19.190946Z","signature_b64":"F0ooKBkQWXu9SO+uoUiFjQPshcO0++5hYWY/glO5Pwr1uIqPsS3jilqzt+wCWYnWYJtlFDZjwJtB9ZjasCs2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7446a8d234b3465cdf07f49077937a08abd1567855d9c1b9a0ccb0ecd0dfb615","last_reissued_at":"2026-08-03T01:40:19.189313Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:40:19.189313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QASP: Query-Adaptive Robust Vector Search Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Andy Warfield, Hakan Ferhatosmanoglu, Kushal Kumar, Tal Wagner","submitted_at":"2026-07-31T16:38:47Z","abstract_excerpt":"A fundamental challenge of vector search is achieving consistently high recall while minimizing computational costs. Fixed search parameters cause significant performance variance across queries, and conventional evaluation on average recall masks these per-query disparities. We introduce QASP (Query-Adaptive robust vector Search Policy), which predicts the complete recall progression curve per query via a single upfront supervised regression, from which a search policy is derived for any recall target; this avoids iterative model invocations during search or separate predictors per target. By"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.29606","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/2607.29606/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":"2607.29606","created_at":"2026-08-03T01:40:19.190214+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.29606v1","created_at":"2026-08-03T01:40:19.190214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.29606","created_at":"2026-08-03T01:40:19.190214+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORDKRURUWNDF","created_at":"2026-08-03T01:40:19.190214+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORDKRURUWNDFZXYH","created_at":"2026-08-03T01:40:19.190214+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORDKRURU","created_at":"2026-08-03T01:40:19.190214+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/ORDKRURUWNDFZXYH6SIHPE32BC","json":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC.json","graph_json":"https://pith.science/api/pith-number/ORDKRURUWNDFZXYH6SIHPE32BC/graph.json","events_json":"https://pith.science/api/pith-number/ORDKRURUWNDFZXYH6SIHPE32BC/events.json","paper":"https://pith.science/paper/ORDKRURU"},"agent_actions":{"view_html":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC","download_json":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC.json","view_paper":"https://pith.science/paper/ORDKRURU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.29606&json=true","fetch_graph":"https://pith.science/api/pith-number/ORDKRURUWNDFZXYH6SIHPE32BC/graph.json","fetch_events":"https://pith.science/api/pith-number/ORDKRURUWNDFZXYH6SIHPE32BC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC/action/storage_attestation","attest_author":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC/action/author_attestation","sign_citation":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC/action/citation_signature","submit_replication":"https://pith.science/pith/ORDKRURUWNDFZXYH6SIHPE32BC/action/replication_record"}},"created_at":"2026-08-03T01:40:19.190214+00:00","updated_at":"2026-08-03T01:40:19.190214+00:00"}