{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EWYHJXTXBSSYKLP5RIA6J3IUJD","short_pith_number":"pith:EWYHJXTX","schema_version":"1.0","canonical_sha256":"25b074de770ca5852dfd8a01e4ed1448fc3d108fa42771492f9923ba3be659ad","source":{"kind":"arxiv","id":"1811.06510","version":4},"attestation_state":"computed","paper":{"title":"Anti-concentration in most directions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amir Yehudayoff, Anup Rao","submitted_at":"2018-11-15T18:11:54Z","abstract_excerpt":"We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\\{\\pm 1\\}^n$ with $|A| \\cdot |B| \\geq 2^{1.01 n}$, and $X \\in A$ and $Y \\in B$ are sampled independently and uniformly, then the inner product $\\langle X, Y \\rangle$ takes on any fixed value with probability at most $O(\\tfrac{1}{\\sqrt{n}})$. Extending Hal\\'asz work, we prove stronger bounds when the choices for $x$ are unstructured. We also describe applications to communication complexity, randomness extraction and additive combinatorics."},"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":"1811.06510","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2018-11-15T18:11:54Z","cross_cats_sorted":[],"title_canon_sha256":"b393dd8df3ee9fd96c65881859a090c67b4ec58f3d30d713c1f1eec3b4f72557","abstract_canon_sha256":"841583dcefd15346c5db893706e78db06df2107b0c38602ea20737c3213dd991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:04.282631Z","signature_b64":"8f/JRuiS5RYYvITTi+Xjydsa72XDoFkequu0upZnDsUibDdm7kqBTBlNEfcfPOi59qOazE7UnxnEuekIcreLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b074de770ca5852dfd8a01e4ed1448fc3d108fa42771492f9923ba3be659ad","last_reissued_at":"2026-05-17T23:52:04.281943Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:04.281943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anti-concentration in most directions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amir Yehudayoff, Anup Rao","submitted_at":"2018-11-15T18:11:54Z","abstract_excerpt":"We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\\{\\pm 1\\}^n$ with $|A| \\cdot |B| \\geq 2^{1.01 n}$, and $X \\in A$ and $Y \\in B$ are sampled independently and uniformly, then the inner product $\\langle X, Y \\rangle$ takes on any fixed value with probability at most $O(\\tfrac{1}{\\sqrt{n}})$. Extending Hal\\'asz work, we prove stronger bounds when the choices for $x$ are unstructured. We also describe applications to communication complexity, randomness extraction and additive combinatorics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06510","kind":"arxiv","version":4},"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":"1811.06510","created_at":"2026-05-17T23:52:04.282047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06510v4","created_at":"2026-05-17T23:52:04.282047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06510","created_at":"2026-05-17T23:52:04.282047+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWYHJXTXBSSY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWYHJXTXBSSYKLP5","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWYHJXTX","created_at":"2026-05-18T12:32:22.470017+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/EWYHJXTXBSSYKLP5RIA6J3IUJD","json":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD.json","graph_json":"https://pith.science/api/pith-number/EWYHJXTXBSSYKLP5RIA6J3IUJD/graph.json","events_json":"https://pith.science/api/pith-number/EWYHJXTXBSSYKLP5RIA6J3IUJD/events.json","paper":"https://pith.science/paper/EWYHJXTX"},"agent_actions":{"view_html":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD","download_json":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD.json","view_paper":"https://pith.science/paper/EWYHJXTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06510&json=true","fetch_graph":"https://pith.science/api/pith-number/EWYHJXTXBSSYKLP5RIA6J3IUJD/graph.json","fetch_events":"https://pith.science/api/pith-number/EWYHJXTXBSSYKLP5RIA6J3IUJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD/action/storage_attestation","attest_author":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD/action/author_attestation","sign_citation":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD/action/citation_signature","submit_replication":"https://pith.science/pith/EWYHJXTXBSSYKLP5RIA6J3IUJD/action/replication_record"}},"created_at":"2026-05-17T23:52:04.282047+00:00","updated_at":"2026-05-17T23:52:04.282047+00:00"}