{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TR5FHKYFH4LBH6JYUOUXH5FGKS","short_pith_number":"pith:TR5FHKYF","schema_version":"1.0","canonical_sha256":"9c7a53ab053f1613f938a3a973f4a654849ef809f75966893a015e97c73fa555","source":{"kind":"arxiv","id":"2011.06135","version":1},"attestation_state":"computed","paper":{"title":"Hardness of Approximate Nearest Neighbor Search under L-infinity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Min Jae Song, Young Kun Ko","submitted_at":"2020-11-12T00:45:16Z","abstract_excerpt":"We show conditional hardness of Approximate Nearest Neighbor Search (ANN) under the $\\ell_\\infty$ norm with two simple reductions. Our first reduction shows that hardness of a special case of the Shortest Vector Problem (SVP), which captures many provably hard instances of SVP, implies a lower bound for ANN with polynomial preprocessing time under the same norm. Combined with a recent quantitative hardness result on SVP under $\\ell_\\infty$ (Bennett et al., FOCS 2017), our reduction implies that finding a $(1+\\varepsilon)$-approximate nearest neighbor under $\\ell_\\infty$ with polynomial preproc"},"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":"2011.06135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-11-12T00:45:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"55ebc9f4235961e07a0697ed24d73f19d86b5f579eaa1c04a4a04062bb6df239","abstract_canon_sha256":"13f7e550a2f65f2672fe605056b09f0e3d7b0047352d306450a63c149d8c8067"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:12.204817Z","signature_b64":"PlnCEo6plAzX/ejoJqX6aZB/KaXVhNvc2dLW229QZWyTZ21jGpN7qVPREAVPRnMDPns1XzRX0Fy85HyqqHAOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c7a53ab053f1613f938a3a973f4a654849ef809f75966893a015e97c73fa555","last_reissued_at":"2026-07-05T01:51:12.204420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:12.204420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Approximate Nearest Neighbor Search under L-infinity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Min Jae Song, Young Kun Ko","submitted_at":"2020-11-12T00:45:16Z","abstract_excerpt":"We show conditional hardness of Approximate Nearest Neighbor Search (ANN) under the $\\ell_\\infty$ norm with two simple reductions. Our first reduction shows that hardness of a special case of the Shortest Vector Problem (SVP), which captures many provably hard instances of SVP, implies a lower bound for ANN with polynomial preprocessing time under the same norm. Combined with a recent quantitative hardness result on SVP under $\\ell_\\infty$ (Bennett et al., FOCS 2017), our reduction implies that finding a $(1+\\varepsilon)$-approximate nearest neighbor under $\\ell_\\infty$ with polynomial preproc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06135","kind":"arxiv","version":1},"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/2011.06135/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":"2011.06135","created_at":"2026-07-05T01:51:12.204472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06135v1","created_at":"2026-07-05T01:51:12.204472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06135","created_at":"2026-07-05T01:51:12.204472+00:00"},{"alias_kind":"pith_short_12","alias_value":"TR5FHKYFH4LB","created_at":"2026-07-05T01:51:12.204472+00:00"},{"alias_kind":"pith_short_16","alias_value":"TR5FHKYFH4LBH6JY","created_at":"2026-07-05T01:51:12.204472+00:00"},{"alias_kind":"pith_short_8","alias_value":"TR5FHKYF","created_at":"2026-07-05T01:51:12.204472+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/TR5FHKYFH4LBH6JYUOUXH5FGKS","json":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS.json","graph_json":"https://pith.science/api/pith-number/TR5FHKYFH4LBH6JYUOUXH5FGKS/graph.json","events_json":"https://pith.science/api/pith-number/TR5FHKYFH4LBH6JYUOUXH5FGKS/events.json","paper":"https://pith.science/paper/TR5FHKYF"},"agent_actions":{"view_html":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS","download_json":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS.json","view_paper":"https://pith.science/paper/TR5FHKYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06135&json=true","fetch_graph":"https://pith.science/api/pith-number/TR5FHKYFH4LBH6JYUOUXH5FGKS/graph.json","fetch_events":"https://pith.science/api/pith-number/TR5FHKYFH4LBH6JYUOUXH5FGKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/action/storage_attestation","attest_author":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/action/author_attestation","sign_citation":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/action/citation_signature","submit_replication":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/action/replication_record"}},"created_at":"2026-07-05T01:51:12.204472+00:00","updated_at":"2026-07-05T01:51:12.204472+00:00"}