{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YMXSU4RH7TZ44JVBM5HFITTUZH","short_pith_number":"pith:YMXSU4RH","canonical_record":{"source":{"id":"1706.01449","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-05T17:56:43Z","cross_cats_sorted":["cs.DB","cs.DS","cs.PF"],"title_canon_sha256":"aaf99dfbc33f522ad0074ecd7830f90b6151f0ddfc05218b593d3a4cc95238c9","abstract_canon_sha256":"4ad324bcfe561e0b38d038a2d05091123a9715246f2cd1a60c82c5cf76476ece"},"schema_version":"1.0"},"canonical_sha256":"c32f2a7227fcf3ce26a1674e544e74c9eeac7c2912ca0c4ec4daa318cdf3ccae","source":{"kind":"arxiv","id":"1706.01449","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01449","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01449v3","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01449","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"YMXSU4RH7TZ4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMXSU4RH7TZ44JVB","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMXSU4RH","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YMXSU4RH7TZ44JVBM5HFITTUZH","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01449","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-05T17:56:43Z","cross_cats_sorted":["cs.DB","cs.DS","cs.PF"],"title_canon_sha256":"aaf99dfbc33f522ad0074ecd7830f90b6151f0ddfc05218b593d3a4cc95238c9","abstract_canon_sha256":"4ad324bcfe561e0b38d038a2d05091123a9715246f2cd1a60c82c5cf76476ece"},"schema_version":"1.0"},"canonical_sha256":"c32f2a7227fcf3ce26a1674e544e74c9eeac7c2912ca0c4ec4daa318cdf3ccae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:14.873590Z","signature_b64":"0MyS9hfbbXHeApTMI0K92Bsj7fRV0DlqPo1hhmf3Qb7so+eMHqLH75bAx+oWc4A9j0U97+Fr/MEet5g8n+bZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c32f2a7227fcf3ce26a1674e544e74c9eeac7c2912ca0c4ec4daa318cdf3ccae","last_reissued_at":"2026-05-17T23:51:14.872944Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:14.872944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01449","source_version":3,"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:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ro/yPghIkk8nGZGB0y5OZ2XYiIT1PcvWtkvX/SOAKQfOPK8BwXX0pn8C0KCydl7jJhLGHdOfAmMnSY3imjgXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:22:20.019984Z"},"content_sha256":"ffdfae16973df6ee684870f09848bae440029a6eb459e7a8e5b5f2807b46fd0f","schema_version":"1.0","event_id":"sha256:ffdfae16973df6ee684870f09848bae440029a6eb459e7a8e5b5f2807b46fd0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YMXSU4RH7TZ44JVBM5HFITTUZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To Index or Not to Index: Optimizing Exact Maximum Inner Product Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS","cs.PF"],"primary_cat":"cs.IR","authors_text":"Firas Abuzaid, Geet Sethi, Matei Zaharia, Peter Bailis","submitted_at":"2017-06-05T17:56:43Z","abstract_excerpt":"Exact Maximum Inner Product Search (MIPS) is an important task that is widely pertinent to recommender systems and high-dimensional similarity search. The brute-force approach to solving exact MIPS is computationally expensive, thus spurring recent development of novel indexes and pruning techniques for this task. In this paper, we show that a hardware-efficient brute-force approach, blocked matrix multiply (BMM), can outperform the state-of-the-art MIPS solvers by over an order of magnitude, for some -- but not all -- inputs.\n  In this paper, we also present a novel MIPS solution, MAXIMUS, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01449","kind":"arxiv","version":3},"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:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggv6w6XzVJRJsJ9pgms8deyW2BqqlvZvcTQRya7v+5EpYa8ABuj/iT2pS8yJ5X0I51zVG9kPbe2xmSqdgjesAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:22:20.020651Z"},"content_sha256":"dc7d7b0afb4e98ad45481b397868fc5b886a1453708a5e8fe09e22bd1ff3366c","schema_version":"1.0","event_id":"sha256:dc7d7b0afb4e98ad45481b397868fc5b886a1453708a5e8fe09e22bd1ff3366c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/bundle.json","state_url":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/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-26T23:22:20Z","links":{"resolver":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH","bundle":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/bundle.json","state":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YMXSU4RH7TZ44JVBM5HFITTUZH","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":"4ad324bcfe561e0b38d038a2d05091123a9715246f2cd1a60c82c5cf76476ece","cross_cats_sorted":["cs.DB","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-05T17:56:43Z","title_canon_sha256":"aaf99dfbc33f522ad0074ecd7830f90b6151f0ddfc05218b593d3a4cc95238c9"},"schema_version":"1.0","source":{"id":"1706.01449","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01449","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01449v3","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01449","created_at":"2026-05-17T23:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"YMXSU4RH7TZ4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMXSU4RH7TZ44JVB","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMXSU4RH","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:dc7d7b0afb4e98ad45481b397868fc5b886a1453708a5e8fe09e22bd1ff3366c","target":"graph","created_at":"2026-05-17T23:51:14Z","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":"Exact Maximum Inner Product Search (MIPS) is an important task that is widely pertinent to recommender systems and high-dimensional similarity search. The brute-force approach to solving exact MIPS is computationally expensive, thus spurring recent development of novel indexes and pruning techniques for this task. In this paper, we show that a hardware-efficient brute-force approach, blocked matrix multiply (BMM), can outperform the state-of-the-art MIPS solvers by over an order of magnitude, for some -- but not all -- inputs.\n  In this paper, we also present a novel MIPS solution, MAXIMUS, th","authors_text":"Firas Abuzaid, Geet Sethi, Matei Zaharia, Peter Bailis","cross_cats":["cs.DB","cs.DS","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-05T17:56:43Z","title":"To Index or Not to Index: Optimizing Exact Maximum Inner Product Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01449","kind":"arxiv","version":3},"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:ffdfae16973df6ee684870f09848bae440029a6eb459e7a8e5b5f2807b46fd0f","target":"record","created_at":"2026-05-17T23:51:14Z","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":"4ad324bcfe561e0b38d038a2d05091123a9715246f2cd1a60c82c5cf76476ece","cross_cats_sorted":["cs.DB","cs.DS","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-06-05T17:56:43Z","title_canon_sha256":"aaf99dfbc33f522ad0074ecd7830f90b6151f0ddfc05218b593d3a4cc95238c9"},"schema_version":"1.0","source":{"id":"1706.01449","kind":"arxiv","version":3}},"canonical_sha256":"c32f2a7227fcf3ce26a1674e544e74c9eeac7c2912ca0c4ec4daa318cdf3ccae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c32f2a7227fcf3ce26a1674e544e74c9eeac7c2912ca0c4ec4daa318cdf3ccae","first_computed_at":"2026-05-17T23:51:14.872944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:14.872944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MyS9hfbbXHeApTMI0K92Bsj7fRV0DlqPo1hhmf3Qb7so+eMHqLH75bAx+oWc4A9j0U97+Fr/MEet5g8n+bZAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:14.873590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01449","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffdfae16973df6ee684870f09848bae440029a6eb459e7a8e5b5f2807b46fd0f","sha256:dc7d7b0afb4e98ad45481b397868fc5b886a1453708a5e8fe09e22bd1ff3366c"],"state_sha256":"8673f19488ba91917955a14f669b6d7efe9e915124149e309b5b49099268801e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eF2lPpIItCYQregRCyBYp95IGYOEjT8aGVKCv6p6xx1nJHdXeae0gdQoIkMAB2WaXX3rzrWns+53VnKGXjl8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:22:20.024241Z","bundle_sha256":"1b989bf31ffea9ed3b861a47a4a612fecc9b750e922cee0b6390075502df889b"}}