{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NVRQ4KAGES7NUD7MORGWY7WVWR","short_pith_number":"pith:NVRQ4KAG","schema_version":"1.0","canonical_sha256":"6d630e280624beda0fec744d6c7ed5b47e82d13d18388a07b8f17f0aa6f7c4dc","source":{"kind":"arxiv","id":"2603.08001","version":2},"attestation_state":"computed","paper":{"title":"Amortizing Maximum Inner Product Search with Learned Support Functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jo\\~ao Monteiro, Marco Cuturi, Michal Klein, Theo X. Olausson","submitted_at":"2026-03-09T06:09:20Z","abstract_excerpt":"Maximum inner product search (MIPS) is a crucial subroutine in machine learning, requiring the identification of a vector taken within a database (the keys) that best aligns with a given query. We propose amortized MIPS: a regression-based approach that trains neural networks to directly predict MIPS solutions, amortizing the cost of repeatedly solving MIPS for queries drawn from a known distribution over a fixed key database. Our key insight is that the MIPS value function is the \\emph{support} function of the set of keys, a well-studied convex function whose gradient yields the optimal key. "},"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":"2603.08001","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-09T06:09:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b54c504cc4fe9b1f099aecff857f298a84b561285b0e60df28a0b684199bab60","abstract_canon_sha256":"c9331cfd882344d6e226aa6b97b55f43553608794bcb00aa33ad72d2991973bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:55.959034Z","signature_b64":"T2LTSL1kJRJB7J+krMRvFL3MrPD7uT3EhXARcLurSev0vKlpFbxFWdX72OiorDgDzLfSQsZZBNmqJRj0FLRoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d630e280624beda0fec744d6c7ed5b47e82d13d18388a07b8f17f0aa6f7c4dc","last_reissued_at":"2026-06-19T16:09:55.958623Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:55.958623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amortizing Maximum Inner Product Search with Learned Support Functions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jo\\~ao Monteiro, Marco Cuturi, Michal Klein, Theo X. Olausson","submitted_at":"2026-03-09T06:09:20Z","abstract_excerpt":"Maximum inner product search (MIPS) is a crucial subroutine in machine learning, requiring the identification of a vector taken within a database (the keys) that best aligns with a given query. We propose amortized MIPS: a regression-based approach that trains neural networks to directly predict MIPS solutions, amortizing the cost of repeatedly solving MIPS for queries drawn from a known distribution over a fixed key database. Our key insight is that the MIPS value function is the \\emph{support} function of the set of keys, a well-studied convex function whose gradient yields the optimal key. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.08001","kind":"arxiv","version":2},"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/2603.08001/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":"2603.08001","created_at":"2026-06-19T16:09:55.958678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.08001v2","created_at":"2026-06-19T16:09:55.958678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.08001","created_at":"2026-06-19T16:09:55.958678+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVRQ4KAGES7N","created_at":"2026-06-19T16:09:55.958678+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVRQ4KAGES7NUD7M","created_at":"2026-06-19T16:09:55.958678+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVRQ4KAG","created_at":"2026-06-19T16:09:55.958678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.09778","citing_title":"Nectar: Neural Estimation of Cached-Token Attention via Regression","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR","json":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR.json","graph_json":"https://pith.science/api/pith-number/NVRQ4KAGES7NUD7MORGWY7WVWR/graph.json","events_json":"https://pith.science/api/pith-number/NVRQ4KAGES7NUD7MORGWY7WVWR/events.json","paper":"https://pith.science/paper/NVRQ4KAG"},"agent_actions":{"view_html":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR","download_json":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR.json","view_paper":"https://pith.science/paper/NVRQ4KAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.08001&json=true","fetch_graph":"https://pith.science/api/pith-number/NVRQ4KAGES7NUD7MORGWY7WVWR/graph.json","fetch_events":"https://pith.science/api/pith-number/NVRQ4KAGES7NUD7MORGWY7WVWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR/action/storage_attestation","attest_author":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR/action/author_attestation","sign_citation":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR/action/citation_signature","submit_replication":"https://pith.science/pith/NVRQ4KAGES7NUD7MORGWY7WVWR/action/replication_record"}},"created_at":"2026-06-19T16:09:55.958678+00:00","updated_at":"2026-06-19T16:09:55.958678+00:00"}