{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LEECP4TMECHJIHE6M24ADY7OKM","short_pith_number":"pith:LEECP4TM","canonical_record":{"source":{"id":"1812.06360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-15T21:33:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"65038bbdfc26d01836bf7d7af97f307220a4b42359a0b9d5ed5e32e6e30361d2","abstract_canon_sha256":"c9664ed08c4b76387f3160b18e7af684eca648e57f95ac57c4022b11258e4fb3"},"schema_version":"1.0"},"canonical_sha256":"590827f26c208e941c9e66b801e3ee531e5cc07e647ef941a6386acef1d29f3b","source":{"kind":"arxiv","id":"1812.06360","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06360","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06360v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06360","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"LEECP4TMECHJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEECP4TMECHJIHE6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEECP4TM","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LEECP4TMECHJIHE6M24ADY7OKM","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-15T21:33:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"65038bbdfc26d01836bf7d7af97f307220a4b42359a0b9d5ed5e32e6e30361d2","abstract_canon_sha256":"c9664ed08c4b76387f3160b18e7af684eca648e57f95ac57c4022b11258e4fb3"},"schema_version":"1.0"},"canonical_sha256":"590827f26c208e941c9e66b801e3ee531e5cc07e647ef941a6386acef1d29f3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.443724Z","signature_b64":"Z/JQXCqCucVRmJrLqQi+HWELyoG4+XqlS7iLND+dfGlQwAdA2fbs7dDUhDCpqvFXiPnoSgpubyUz1C/7KhB1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590827f26c208e941c9e66b801e3ee531e5cc07e647ef941a6386acef1d29f3b","last_reissued_at":"2026-05-17T23:58:10.443226Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.443226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06360","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-05-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+iHjZFBNj0FD+8MjRR77jLBQ1vuMzfVySrjZI6O3vsY6WlkNWJKB9kw9PMZwD9O0Nf0hdBD49KeVbz8PEGVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:09:32.770938Z"},"content_sha256":"38588e51e720a32344b21265cd8403a6984ec9f468f915166d9bb6a6a367eaaa","schema_version":"1.0","event_id":"sha256:38588e51e720a32344b21265cd8403a6984ec9f468f915166d9bb6a6a367eaaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LEECP4TMECHJIHE6M24ADY7OKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bandit Approach to Maximum Inner Product Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Barzan Mozafari, Rui Liu, Tianyi Wu","submitted_at":"2018-12-15T21:33:56Z","abstract_excerpt":"There has been substantial research on sub-linear time approximate algorithms for Maximum Inner Product Search (MIPS). To achieve fast query time, state-of-the-art techniques require significant preprocessing, which can be a burden when the number of subsequent queries is not sufficiently large to amortize the cost. Furthermore, existing methods do not have the ability to directly control the suboptimality of their approximate results with theoretical guarantees. In this paper, we propose the first approximate algorithm for MIPS that does not require any preprocessing, and allows users to cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06360","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":""},"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-05-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlfQzgJ61h2VAG1ICDW4DYND0S9HwKT0O5Ri+G8Ysv2Vji0/bsnOHFTRgS4dgOfqrgdesdj2EnYaIQBB4TdHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:09:32.771605Z"},"content_sha256":"adb5528b4d09ff247b21876c40cc7a5bec8bfdc9c649860aec26400d71517b16","schema_version":"1.0","event_id":"sha256:adb5528b4d09ff247b21876c40cc7a5bec8bfdc9c649860aec26400d71517b16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEECP4TMECHJIHE6M24ADY7OKM/bundle.json","state_url":"https://pith.science/pith/LEECP4TMECHJIHE6M24ADY7OKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEECP4TMECHJIHE6M24ADY7OKM/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-05-18T19:09:32Z","links":{"resolver":"https://pith.science/pith/LEECP4TMECHJIHE6M24ADY7OKM","bundle":"https://pith.science/pith/LEECP4TMECHJIHE6M24ADY7OKM/bundle.json","state":"https://pith.science/pith/LEECP4TMECHJIHE6M24ADY7OKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEECP4TMECHJIHE6M24ADY7OKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LEECP4TMECHJIHE6M24ADY7OKM","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":"c9664ed08c4b76387f3160b18e7af684eca648e57f95ac57c4022b11258e4fb3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-15T21:33:56Z","title_canon_sha256":"65038bbdfc26d01836bf7d7af97f307220a4b42359a0b9d5ed5e32e6e30361d2"},"schema_version":"1.0","source":{"id":"1812.06360","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06360","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06360v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06360","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"LEECP4TMECHJ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEECP4TMECHJIHE6","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEECP4TM","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:adb5528b4d09ff247b21876c40cc7a5bec8bfdc9c649860aec26400d71517b16","target":"graph","created_at":"2026-05-17T23:58:10Z","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"},"paper":{"abstract_excerpt":"There has been substantial research on sub-linear time approximate algorithms for Maximum Inner Product Search (MIPS). To achieve fast query time, state-of-the-art techniques require significant preprocessing, which can be a burden when the number of subsequent queries is not sufficiently large to amortize the cost. Furthermore, existing methods do not have the ability to directly control the suboptimality of their approximate results with theoretical guarantees. In this paper, we propose the first approximate algorithm for MIPS that does not require any preprocessing, and allows users to cont","authors_text":"Barzan Mozafari, Rui Liu, Tianyi Wu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-15T21:33:56Z","title":"A Bandit Approach to Maximum Inner Product Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06360","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:38588e51e720a32344b21265cd8403a6984ec9f468f915166d9bb6a6a367eaaa","target":"record","created_at":"2026-05-17T23:58:10Z","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":"c9664ed08c4b76387f3160b18e7af684eca648e57f95ac57c4022b11258e4fb3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-15T21:33:56Z","title_canon_sha256":"65038bbdfc26d01836bf7d7af97f307220a4b42359a0b9d5ed5e32e6e30361d2"},"schema_version":"1.0","source":{"id":"1812.06360","kind":"arxiv","version":1}},"canonical_sha256":"590827f26c208e941c9e66b801e3ee531e5cc07e647ef941a6386acef1d29f3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"590827f26c208e941c9e66b801e3ee531e5cc07e647ef941a6386acef1d29f3b","first_computed_at":"2026-05-17T23:58:10.443226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:10.443226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z/JQXCqCucVRmJrLqQi+HWELyoG4+XqlS7iLND+dfGlQwAdA2fbs7dDUhDCpqvFXiPnoSgpubyUz1C/7KhB1BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:10.443724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06360","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38588e51e720a32344b21265cd8403a6984ec9f468f915166d9bb6a6a367eaaa","sha256:adb5528b4d09ff247b21876c40cc7a5bec8bfdc9c649860aec26400d71517b16"],"state_sha256":"d770381d881c6c9749b8c4835e8540ca5f341ac09e8e5130cdbe1d9bc8cf164d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkumkcLpyih5uzuM3qp09v6hhJMKsWKnxrmA3wnU3QUePBotbJmo9A0qyaek3FaDHkexR8ChJAVT0E9y92GvAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T19:09:32.773723Z","bundle_sha256":"6db60df6b1e32b8896ceae959117d7483d6dcacd274c6fbb69549e24a40688f1"}}