{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MGA2MMKTBVSWJ65LO3L7V6F3UZ","short_pith_number":"pith:MGA2MMKT","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"},"canonical_sha256":"6181a631530d6564fbab76d7faf8bba65150a0297441a18bfb2e525fc153f6b2","source":{"kind":"arxiv","id":"1802.02325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02325","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02325v2","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02325","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"MGA2MMKTBVSW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MGA2MMKTBVSWJ65L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MGA2MMKT","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MGA2MMKTBVSWJ65LO3L7V6F3UZ","target":"record","payload":{"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"},"canonical_sha256":"6181a631530d6564fbab76d7faf8bba65150a0297441a18bfb2e525fc153f6b2","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"},"source_kind":"arxiv","source_id":"1802.02325","source_version":2,"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-18T00:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55sUxdpqdnwx/BxLx9mS+2VpEs0od7elPoVJf8eqI67odLxTdX+pHUUD+mNfqJaVdmnHXyshxw/abPhp03tPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:39:50.919457Z"},"content_sha256":"10dab9967033b8f5f16198de566e3236ee7ca13e8f43e829bedb822b18d56727","schema_version":"1.0","event_id":"sha256:10dab9967033b8f5f16198de566e3236ee7ca13e8f43e829bedb822b18d56727"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MGA2MMKTBVSWJ65LO3L7V6F3UZ","target":"graph","payload":{"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"},"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-18T00:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tvPRpMQQvcZIWGqqS0BGJPy7mvpDQn2mwbCor748M0EsLiSyaQ9qYz+w4SvS4v+VlHLHcPypMU0D+LNgBNlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:39:50.919814Z"},"content_sha256":"805d46e07d4c2cf8090ad3aa6c6b22720bee50a46e3d736a24cb2c5646b9cd5b","schema_version":"1.0","event_id":"sha256:805d46e07d4c2cf8090ad3aa6c6b22720bee50a46e3d736a24cb2c5646b9cd5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/bundle.json","state_url":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/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-20T18:39:50Z","links":{"resolver":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ","bundle":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/bundle.json","state":"https://pith.science/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGA2MMKTBVSWJ65LO3L7V6F3UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MGA2MMKTBVSWJ65LO3L7V6F3UZ","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":"b82bb93f0af5bf1a217af8965ebf56438197cd63074f74a0cbdb37c1343426e9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T07:04:51Z","title_canon_sha256":"654d8cc6f3f7d8a408b01527b473913e8b4f6d9b3358e56276cfa44eed9e995e"},"schema_version":"1.0","source":{"id":"1802.02325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02325","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02325v2","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02325","created_at":"2026-05-18T00:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"MGA2MMKTBVSW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MGA2MMKTBVSWJ65L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MGA2MMKT","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:805d46e07d4c2cf8090ad3aa6c6b22720bee50a46e3d736a24cb2c5646b9cd5b","target":"graph","created_at":"2026-05-18T00:21:56Z","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":"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 ","authors_text":"Lijie Chen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T07:04:51Z","title":"On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02325","kind":"arxiv","version":2},"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:10dab9967033b8f5f16198de566e3236ee7ca13e8f43e829bedb822b18d56727","target":"record","created_at":"2026-05-18T00:21:56Z","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":"b82bb93f0af5bf1a217af8965ebf56438197cd63074f74a0cbdb37c1343426e9","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-07T07:04:51Z","title_canon_sha256":"654d8cc6f3f7d8a408b01527b473913e8b4f6d9b3358e56276cfa44eed9e995e"},"schema_version":"1.0","source":{"id":"1802.02325","kind":"arxiv","version":2}},"canonical_sha256":"6181a631530d6564fbab76d7faf8bba65150a0297441a18bfb2e525fc153f6b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6181a631530d6564fbab76d7faf8bba65150a0297441a18bfb2e525fc153f6b2","first_computed_at":"2026-05-18T00:21:56.595648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:56.595648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6fUECPm9N14B0kDZHm5GWI83PtsgTShDjZp2xeBxrqDt8/LG/+OLSMILIGyhzR7CDozn1qifS4Z7K+ksw+JAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:56.596297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10dab9967033b8f5f16198de566e3236ee7ca13e8f43e829bedb822b18d56727","sha256:805d46e07d4c2cf8090ad3aa6c6b22720bee50a46e3d736a24cb2c5646b9cd5b"],"state_sha256":"7cbe259f2a6ce7d62853eafe5d256edede5410ed4c45c0c5dd83e6675170923e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4t1EBDbKR3l4qEZkcrmt+iH3JmAwBa4SdRhY0mRwiyBLyUrlzom4e5X53sQ6sttHXVWL9/0M2H9ddQ8K6gzTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:39:50.921870Z","bundle_sha256":"f447777b4a0173858bf4cdd50a1afd777a2c96d19fc8fb3cb8f67820f971fcd9"}}