{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NO6GJZLKHQU3GC6BV7DJCSCATY","short_pith_number":"pith:NO6GJZLK","schema_version":"1.0","canonical_sha256":"6bbc64e56a3c29b30bc1afc69148409e210a90ad5a37aea7d6a9adc5b98e9978","source":{"kind":"arxiv","id":"2312.07517","version":1},"attestation_state":"computed","paper":{"title":"Search Optimization with Query Likelihood Boosting and Two-Level Approximate Search for Edge Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Ali Kebarighotbi, Farhad Ghassemi, Grant P. Strimel, Helian Feng, Jianwei Zhang, Xin He","submitted_at":"2023-12-12T18:48:25Z","abstract_excerpt":"We present a novel search optimization solution for approximate nearest neighbor (ANN) search on resource-constrained edge devices. Traditional ANN approaches fall short in meeting the specific demands of real-world scenarios, e.g., skewed query likelihood distribution and search on large-scale indices with a low latency and small footprint. To address these limitations, we introduce two key components: a Query Likelihood Boosted Tree (QLBT) to optimize average search latency for frequently used small datasets, and a two-level approximate search algorithm to enable efficient retrieval with lar"},"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":"2312.07517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-12-12T18:48:25Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"3007907292ae11ff71337927b8e8731353238c0937c1078f782f99c86462b15f","abstract_canon_sha256":"b7d03c9f507f0756c2ee411e9b7f0dcf663e590a6ce0ec534a83d15d1af457bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:20.619399Z","signature_b64":"GXYTovP+9Qy13GkZW4sSVzkYTt+FjH7rejtW4/zEZy07WuKj8X19q0iLUlgx/976ZJB/gBHVdZty3rXL1tsmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bbc64e56a3c29b30bc1afc69148409e210a90ad5a37aea7d6a9adc5b98e9978","last_reissued_at":"2026-07-05T07:23:20.618975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:20.618975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search Optimization with Query Likelihood Boosting and Two-Level Approximate Search for Edge Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Ali Kebarighotbi, Farhad Ghassemi, Grant P. Strimel, Helian Feng, Jianwei Zhang, Xin He","submitted_at":"2023-12-12T18:48:25Z","abstract_excerpt":"We present a novel search optimization solution for approximate nearest neighbor (ANN) search on resource-constrained edge devices. Traditional ANN approaches fall short in meeting the specific demands of real-world scenarios, e.g., skewed query likelihood distribution and search on large-scale indices with a low latency and small footprint. To address these limitations, we introduce two key components: a Query Likelihood Boosted Tree (QLBT) to optimize average search latency for frequently used small datasets, and a two-level approximate search algorithm to enable efficient retrieval with lar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07517","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/2312.07517/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":"2312.07517","created_at":"2026-07-05T07:23:20.619048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.07517v1","created_at":"2026-07-05T07:23:20.619048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07517","created_at":"2026-07-05T07:23:20.619048+00:00"},{"alias_kind":"pith_short_12","alias_value":"NO6GJZLKHQU3","created_at":"2026-07-05T07:23:20.619048+00:00"},{"alias_kind":"pith_short_16","alias_value":"NO6GJZLKHQU3GC6B","created_at":"2026-07-05T07:23:20.619048+00:00"},{"alias_kind":"pith_short_8","alias_value":"NO6GJZLK","created_at":"2026-07-05T07:23:20.619048+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/NO6GJZLKHQU3GC6BV7DJCSCATY","json":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY.json","graph_json":"https://pith.science/api/pith-number/NO6GJZLKHQU3GC6BV7DJCSCATY/graph.json","events_json":"https://pith.science/api/pith-number/NO6GJZLKHQU3GC6BV7DJCSCATY/events.json","paper":"https://pith.science/paper/NO6GJZLK"},"agent_actions":{"view_html":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY","download_json":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY.json","view_paper":"https://pith.science/paper/NO6GJZLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.07517&json=true","fetch_graph":"https://pith.science/api/pith-number/NO6GJZLKHQU3GC6BV7DJCSCATY/graph.json","fetch_events":"https://pith.science/api/pith-number/NO6GJZLKHQU3GC6BV7DJCSCATY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/action/storage_attestation","attest_author":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/action/author_attestation","sign_citation":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/action/citation_signature","submit_replication":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/action/replication_record"}},"created_at":"2026-07-05T07:23:20.619048+00:00","updated_at":"2026-07-05T07:23:20.619048+00:00"}