{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NO6GJZLKHQU3GC6BV7DJCSCATY","short_pith_number":"pith:NO6GJZLK","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"},"canonical_sha256":"6bbc64e56a3c29b30bc1afc69148409e210a90ad5a37aea7d6a9adc5b98e9978","source":{"kind":"arxiv","id":"2312.07517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07517","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07517v1","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07517","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"NO6GJZLKHQU3","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"pith_short_16","alias_value":"NO6GJZLKHQU3GC6B","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"pith_short_8","alias_value":"NO6GJZLK","created_at":"2026-07-05T07:23:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NO6GJZLKHQU3GC6BV7DJCSCATY","target":"record","payload":{"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"},"canonical_sha256":"6bbc64e56a3c29b30bc1afc69148409e210a90ad5a37aea7d6a9adc5b98e9978","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"},"source_kind":"arxiv","source_id":"2312.07517","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-07-05T07:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Frkh0j9mj6NKtFGL2QCoChS22BGtFI0gK/YF16d6GgIFIDRsM3q96eWkFDVxg65J8oe51pf/qd4Ob4enhoA7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:37:53.880757Z"},"content_sha256":"a162f3208ffd313fbff86b8bfb8a83e4311d4ae0723f4a06ab5a9f3cff9429ab","schema_version":"1.0","event_id":"sha256:a162f3208ffd313fbff86b8bfb8a83e4311d4ae0723f4a06ab5a9f3cff9429ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NO6GJZLKHQU3GC6BV7DJCSCATY","target":"graph","payload":{"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"},"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-07-05T07:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qurouOBPxthfAxGA90f7xDzbvjkRQJmPUPAhVXFwOrtF8kfVdBw1VQgtkyvFkmZy1O4dJsPDaz/eaFOd461DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T13:37:53.881275Z"},"content_sha256":"a8d847ee9e9f1413e5b3575c5837bdc71653b1dd5d11a240c86bcb03a543344d","schema_version":"1.0","event_id":"sha256:a8d847ee9e9f1413e5b3575c5837bdc71653b1dd5d11a240c86bcb03a543344d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/bundle.json","state_url":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/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-08-10T13:37:53Z","links":{"resolver":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY","bundle":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/bundle.json","state":"https://pith.science/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NO6GJZLKHQU3GC6BV7DJCSCATY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NO6GJZLKHQU3GC6BV7DJCSCATY","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":"b7d03c9f507f0756c2ee411e9b7f0dcf663e590a6ce0ec534a83d15d1af457bb","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-12-12T18:48:25Z","title_canon_sha256":"3007907292ae11ff71337927b8e8731353238c0937c1078f782f99c86462b15f"},"schema_version":"1.0","source":{"id":"2312.07517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07517","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07517v1","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07517","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"NO6GJZLKHQU3","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"pith_short_16","alias_value":"NO6GJZLKHQU3GC6B","created_at":"2026-07-05T07:23:20Z"},{"alias_kind":"pith_short_8","alias_value":"NO6GJZLK","created_at":"2026-07-05T07:23:20Z"}],"graph_snapshots":[{"event_id":"sha256:a8d847ee9e9f1413e5b3575c5837bdc71653b1dd5d11a240c86bcb03a543344d","target":"graph","created_at":"2026-07-05T07:23:20Z","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/2312.07517/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ali Kebarighotbi, Farhad Ghassemi, Grant P. Strimel, Helian Feng, Jianwei Zhang, Xin He","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-12-12T18:48:25Z","title":"Search Optimization with Query Likelihood Boosting and Two-Level Approximate Search for Edge Devices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07517","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:a162f3208ffd313fbff86b8bfb8a83e4311d4ae0723f4a06ab5a9f3cff9429ab","target":"record","created_at":"2026-07-05T07:23:20Z","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":"b7d03c9f507f0756c2ee411e9b7f0dcf663e590a6ce0ec534a83d15d1af457bb","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-12-12T18:48:25Z","title_canon_sha256":"3007907292ae11ff71337927b8e8731353238c0937c1078f782f99c86462b15f"},"schema_version":"1.0","source":{"id":"2312.07517","kind":"arxiv","version":1}},"canonical_sha256":"6bbc64e56a3c29b30bc1afc69148409e210a90ad5a37aea7d6a9adc5b98e9978","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bbc64e56a3c29b30bc1afc69148409e210a90ad5a37aea7d6a9adc5b98e9978","first_computed_at":"2026-07-05T07:23:20.618975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:20.618975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GXYTovP+9Qy13GkZW4sSVzkYTt+FjH7rejtW4/zEZy07WuKj8X19q0iLUlgx/976ZJB/gBHVdZty3rXL1tsmDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:20.619399Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.07517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a162f3208ffd313fbff86b8bfb8a83e4311d4ae0723f4a06ab5a9f3cff9429ab","sha256:a8d847ee9e9f1413e5b3575c5837bdc71653b1dd5d11a240c86bcb03a543344d"],"state_sha256":"7dfc896551d19335f12237b02d0a222dc6656452b268b1542800645b1cf34f66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVLN/jIBBI7MvGvzv3STX63gfP7UtFtD1mnq7Wp62QKxh9s56J31AOuVqmRlgpdG/Lmk7FNKNgXjH5TlSr9fBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T13:37:53.885787Z","bundle_sha256":"59cff5814c040a756498ed95507e005408b36fff2d02d994737a3a36180723cb"}}