{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TR5FHKYFH4LBH6JYUOUXH5FGKS","short_pith_number":"pith:TR5FHKYF","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"},"canonical_sha256":"9c7a53ab053f1613f938a3a973f4a654849ef809f75966893a015e97c73fa555","source":{"kind":"arxiv","id":"2011.06135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.06135","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"arxiv_version","alias_value":"2011.06135v1","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06135","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"pith_short_12","alias_value":"TR5FHKYFH4LB","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"pith_short_16","alias_value":"TR5FHKYFH4LBH6JY","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"pith_short_8","alias_value":"TR5FHKYF","created_at":"2026-07-05T01:51:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TR5FHKYFH4LBH6JYUOUXH5FGKS","target":"record","payload":{"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"},"canonical_sha256":"9c7a53ab053f1613f938a3a973f4a654849ef809f75966893a015e97c73fa555","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"},"source_kind":"arxiv","source_id":"2011.06135","source_version":1,"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-07-05T01:51:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1uChAFuVEa3l8TMUCH+OTl3HiaDnhZ42/Eecw1gy/orx1qxOfKbHO/q+rrc0wqrBY4Db2fTuJL9ladE12CHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:17:13.112022Z"},"content_sha256":"714326653fee55e4b1b4a927d78a84c63d6dccc5a31625960a7c573b0cf6af9d","schema_version":"1.0","event_id":"sha256:714326653fee55e4b1b4a927d78a84c63d6dccc5a31625960a7c573b0cf6af9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TR5FHKYFH4LBH6JYUOUXH5FGKS","target":"graph","payload":{"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"},"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-07-05T01:51:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qN15ED4ISWnaXb7h7DYrmCfBGHlnR2alsXeA1SzYNlf7IaCc4Uw3mV4FCryAkXsT2VPJzdDAO6Yay2CLJzQoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:17:13.112877Z"},"content_sha256":"0f6c9378f1756867e74a1ccef0ebcea8f395857213db51279aa41577aa746547","schema_version":"1.0","event_id":"sha256:0f6c9378f1756867e74a1ccef0ebcea8f395857213db51279aa41577aa746547"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/bundle.json","state_url":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/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-08-01T07:17:13Z","links":{"resolver":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS","bundle":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/bundle.json","state":"https://pith.science/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TR5FHKYFH4LBH6JYUOUXH5FGKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TR5FHKYFH4LBH6JYUOUXH5FGKS","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":"13f7e550a2f65f2672fe605056b09f0e3d7b0047352d306450a63c149d8c8067","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-11-12T00:45:16Z","title_canon_sha256":"55ebc9f4235961e07a0697ed24d73f19d86b5f579eaa1c04a4a04062bb6df239"},"schema_version":"1.0","source":{"id":"2011.06135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.06135","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"arxiv_version","alias_value":"2011.06135v1","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06135","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"pith_short_12","alias_value":"TR5FHKYFH4LB","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"pith_short_16","alias_value":"TR5FHKYFH4LBH6JY","created_at":"2026-07-05T01:51:12Z"},{"alias_kind":"pith_short_8","alias_value":"TR5FHKYF","created_at":"2026-07-05T01:51:12Z"}],"graph_snapshots":[{"event_id":"sha256:0f6c9378f1756867e74a1ccef0ebcea8f395857213db51279aa41577aa746547","target":"graph","created_at":"2026-07-05T01:51:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.06135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Min Jae Song, Young Kun Ko","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-11-12T00:45:16Z","title":"Hardness of Approximate Nearest Neighbor Search under L-infinity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06135","kind":"arxiv","version":1},"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:714326653fee55e4b1b4a927d78a84c63d6dccc5a31625960a7c573b0cf6af9d","target":"record","created_at":"2026-07-05T01:51:12Z","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":"13f7e550a2f65f2672fe605056b09f0e3d7b0047352d306450a63c149d8c8067","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-11-12T00:45:16Z","title_canon_sha256":"55ebc9f4235961e07a0697ed24d73f19d86b5f579eaa1c04a4a04062bb6df239"},"schema_version":"1.0","source":{"id":"2011.06135","kind":"arxiv","version":1}},"canonical_sha256":"9c7a53ab053f1613f938a3a973f4a654849ef809f75966893a015e97c73fa555","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c7a53ab053f1613f938a3a973f4a654849ef809f75966893a015e97c73fa555","first_computed_at":"2026-07-05T01:51:12.204420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:12.204420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PlnCEo6plAzX/ejoJqX6aZB/KaXVhNvc2dLW229QZWyTZ21jGpN7qVPREAVPRnMDPns1XzRX0Fy85HyqqHAOCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:12.204817Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.06135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:714326653fee55e4b1b4a927d78a84c63d6dccc5a31625960a7c573b0cf6af9d","sha256:0f6c9378f1756867e74a1ccef0ebcea8f395857213db51279aa41577aa746547"],"state_sha256":"1eaf74a1381bec02b1ad74469a1cb4f99ee2c4559d322b46e4a1d3f289159849"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwAMLiOuV9T6kXBHTfEsfvEhQIc9gnIY0zd4uYv+r3dl3+xXcThBTSzclMxJqZxYXy6c3gJhIygasadATyczCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T07:17:13.116529Z","bundle_sha256":"354f65c9af3d3fb7dd5db5696664574f844fae5ac062e63a613ebb0484d017e4"}}