{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YMXSU4RH7TZ44JVBM5HFITTUZH","short_pith_number":"pith:YMXSU4RH","schema_version":"1.0","canonical_sha256":"c32f2a7227fcf3ce26a1674e544e74c9eeac7c2912ca0c4ec4daa318cdf3ccae","source":{"kind":"arxiv","id":"1706.01449","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.01449","created_at":"2026-05-17T23:51:14.873040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01449v3","created_at":"2026-05-17T23:51:14.873040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01449","created_at":"2026-05-17T23:51:14.873040+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMXSU4RH7TZ4","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMXSU4RH7TZ44JVB","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMXSU4RH","created_at":"2026-05-18T12:31:56.362134+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/YMXSU4RH7TZ44JVBM5HFITTUZH","json":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH.json","graph_json":"https://pith.science/api/pith-number/YMXSU4RH7TZ44JVBM5HFITTUZH/graph.json","events_json":"https://pith.science/api/pith-number/YMXSU4RH7TZ44JVBM5HFITTUZH/events.json","paper":"https://pith.science/paper/YMXSU4RH"},"agent_actions":{"view_html":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH","download_json":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH.json","view_paper":"https://pith.science/paper/YMXSU4RH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01449&json=true","fetch_graph":"https://pith.science/api/pith-number/YMXSU4RH7TZ44JVBM5HFITTUZH/graph.json","fetch_events":"https://pith.science/api/pith-number/YMXSU4RH7TZ44JVBM5HFITTUZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/action/storage_attestation","attest_author":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/action/author_attestation","sign_citation":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/action/citation_signature","submit_replication":"https://pith.science/pith/YMXSU4RH7TZ44JVBM5HFITTUZH/action/replication_record"}},"created_at":"2026-05-17T23:51:14.873040+00:00","updated_at":"2026-05-17T23:51:14.873040+00:00"}