{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MGA2MMKTBVSWJ65LO3L7V6F3UZ","short_pith_number":"pith:MGA2MMKT","schema_version":"1.0","canonical_sha256":"6181a631530d6564fbab76d7faf8bba65150a0297441a18bfb2e525fc153f6b2","source":{"kind":"arxiv","id":"1802.02325","version":2},"attestation_state":"computed","paper":{"title":"On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Lijie Chen","submitted_at":"2018-02-07T07:04:51Z","abstract_excerpt":"In this paper we study the (Bichromatic) Maximum Inner Product Problem (Max-IP), in which we are given sets $A$ and $B$ of vectors, and the goal is to find $a \\in A$ and $b \\in B$ maximizing inner product $a \\cdot b$. Max-IP is very basic and serves as the base problem in the recent breakthrough of [Abboud et al., FOCS 2017] on hardness of approximation for polynomial-time problems. It is also used (implicitly) in the argument for hardness of exact $\\ell_2$-Furthest Pair (and other important problems in computational geometry) in poly-log-log dimensions in [Williams, SODA 2018]. We have three "},"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":"1802.02325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T07:04:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"654d8cc6f3f7d8a408b01527b473913e8b4f6d9b3358e56276cfa44eed9e995e","abstract_canon_sha256":"b82bb93f0af5bf1a217af8965ebf56438197cd63074f74a0cbdb37c1343426e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:56.596297Z","signature_b64":"r6fUECPm9N14B0kDZHm5GWI83PtsgTShDjZp2xeBxrqDt8/LG/+OLSMILIGyhzR7CDozn1qifS4Z7K+ksw+JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6181a631530d6564fbab76d7faf8bba65150a0297441a18bfb2e525fc153f6b2","last_reissued_at":"2026-05-18T00:21:56.595648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:56.595648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Lijie Chen","submitted_at":"2018-02-07T07:04:51Z","abstract_excerpt":"In this paper we study the (Bichromatic) Maximum Inner Product Problem (Max-IP), in which we are given sets $A$ and $B$ of vectors, and the goal is to find $a \\in A$ and $b \\in B$ maximizing inner product $a \\cdot b$. Max-IP is very basic and serves as the base problem in the recent breakthrough of [Abboud et al., FOCS 2017] on hardness of approximation for polynomial-time problems. It is also used (implicitly) in the argument for hardness of exact $\\ell_2$-Furthest Pair (and other important problems in computational geometry) in poly-log-log dimensions in [Williams, SODA 2018]. We have three "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02325","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":""},"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":"1802.02325","created_at":"2026-05-18T00:21:56.595734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02325v2","created_at":"2026-05-18T00:21:56.595734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02325","created_at":"2026-05-18T00:21:56.595734+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGA2MMKTBVSW","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGA2MMKTBVSWJ65L","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGA2MMKT","created_at":"2026-05-18T12:32:37.024351+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/MGA2MMKTBVSWJ65LO3L7V6F3UZ","json":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ.json","graph_json":"https://pith.science/api/pith-number/MGA2MMKTBVSWJ65LO3L7V6F3UZ/graph.json","events_json":"https://pith.science/api/pith-number/MGA2MMKTBVSWJ65LO3L7V6F3UZ/events.json","paper":"https://pith.science/paper/MGA2MMKT"},"agent_actions":{"view_html":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ","download_json":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ.json","view_paper":"https://pith.science/paper/MGA2MMKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02325&json=true","fetch_graph":"https://pith.science/api/pith-number/MGA2MMKTBVSWJ65LO3L7V6F3UZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MGA2MMKTBVSWJ65LO3L7V6F3UZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/action/storage_attestation","attest_author":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/action/author_attestation","sign_citation":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/action/citation_signature","submit_replication":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/action/replication_record"}},"created_at":"2026-05-18T00:21:56.595734+00:00","updated_at":"2026-05-18T00:21:56.595734+00:00"}