{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DPYFJTXDQPCZ5QRSDBUUO7YFDO","short_pith_number":"pith:DPYFJTXD","schema_version":"1.0","canonical_sha256":"1bf054cee383c59ec2321869477f051ba600260c485dfad135dbc26ad285130b","source":{"kind":"arxiv","id":"1602.05391","version":2},"attestation_state":"computed","paper":{"title":"Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yitong Yin","submitted_at":"2016-02-17T12:52:27Z","abstract_excerpt":"We prove an $\\Omega(d/\\log \\frac{sw}{nd})$ lower bound for the average-case cell-probe complexity of deterministic or Las Vegas randomized algorithms solving approximate near-neighbor (ANN) problem in $d$-dimensional Hamming space in the cell-probe model with $w$-bit cells, using a table of size $s$. This lower bound matches the highest known worst-case cell-probe lower bounds for any static data structure problems.\n  This average-case cell-probe lower bound is proved in a general framework which relates the cell-probe complexity of ANN to isoperimetric inequalities in the underlying metric sp"},"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":"1602.05391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-17T12:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"2c71721b29e816ee91f86f1d6fefe385654bae60eda3e8674843b0a67729ff96","abstract_canon_sha256":"45dbdbf59e70f7bdedb622752b2ff8173be4d200291f894a16db776f1817a348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.662201Z","signature_b64":"86eHKS70BL32rYIVA30OiZZZwpB3vd+yaulGdqnZjeaA9DFPJPCEfXAyP3XAO2HpaCdpBEQ8D7aqdu9gBSOFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bf054cee383c59ec2321869477f051ba600260c485dfad135dbc26ad285130b","last_reissued_at":"2026-05-18T00:53:17.661445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.661445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple average-case lower bounds for approximate near-neighbor from isoperimetric inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yitong Yin","submitted_at":"2016-02-17T12:52:27Z","abstract_excerpt":"We prove an $\\Omega(d/\\log \\frac{sw}{nd})$ lower bound for the average-case cell-probe complexity of deterministic or Las Vegas randomized algorithms solving approximate near-neighbor (ANN) problem in $d$-dimensional Hamming space in the cell-probe model with $w$-bit cells, using a table of size $s$. This lower bound matches the highest known worst-case cell-probe lower bounds for any static data structure problems.\n  This average-case cell-probe lower bound is proved in a general framework which relates the cell-probe complexity of ANN to isoperimetric inequalities in the underlying metric sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05391","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":"1602.05391","created_at":"2026-05-18T00:53:17.661556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05391v2","created_at":"2026-05-18T00:53:17.661556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05391","created_at":"2026-05-18T00:53:17.661556+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPYFJTXDQPCZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPYFJTXDQPCZ5QRS","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPYFJTXD","created_at":"2026-05-18T12:30:12.583610+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/DPYFJTXDQPCZ5QRSDBUUO7YFDO","json":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO.json","graph_json":"https://pith.science/api/pith-number/DPYFJTXDQPCZ5QRSDBUUO7YFDO/graph.json","events_json":"https://pith.science/api/pith-number/DPYFJTXDQPCZ5QRSDBUUO7YFDO/events.json","paper":"https://pith.science/paper/DPYFJTXD"},"agent_actions":{"view_html":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO","download_json":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO.json","view_paper":"https://pith.science/paper/DPYFJTXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05391&json=true","fetch_graph":"https://pith.science/api/pith-number/DPYFJTXDQPCZ5QRSDBUUO7YFDO/graph.json","fetch_events":"https://pith.science/api/pith-number/DPYFJTXDQPCZ5QRSDBUUO7YFDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO/action/storage_attestation","attest_author":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO/action/author_attestation","sign_citation":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO/action/citation_signature","submit_replication":"https://pith.science/pith/DPYFJTXDQPCZ5QRSDBUUO7YFDO/action/replication_record"}},"created_at":"2026-05-18T00:53:17.661556+00:00","updated_at":"2026-05-18T00:53:17.661556+00:00"}