{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ID7SH3HHYDH4T6ZDTDEJCR73YD","short_pith_number":"pith:ID7SH3HH","schema_version":"1.0","canonical_sha256":"40ff23ece7c0cfc9fb2398c89147fbc0d68cdaea31bd0f08e6c76ccab729e85a","source":{"kind":"arxiv","id":"1609.08136","version":4},"attestation_state":"computed","paper":{"title":"Resilience for the Littlewood-Offord Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Afonso S. Bandeira, Asaf Ferber, Matthew Kwan","submitted_at":"2016-09-26T19:46:27Z","abstract_excerpt":"Consider the sum $X(\\xi)=\\sum_{i=1}^n a_i\\xi_i$, where $a=(a_i)_{i=1}^n$ is a sequence of non-zero reals and $\\xi=(\\xi_i)_{i=1}^n$ is a sequence of i.i.d. Rademacher random variables (that is, $\\Pr[\\xi_i=1]=\\Pr[\\xi_i=-1]=1/2$). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities $\\Pr[X=x]$. In this paper we study a resilience version of the Littlewood-Offord problem: how many of the $\\xi_i$ is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptoticall"},"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":"1609.08136","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-26T19:46:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"79796cb65739ebfdb0a4dad24454fb9d6187908dc1660e6365146e2f9978ea6b","abstract_canon_sha256":"243283a27bced1c56a9a759aa172908ad4b4d07bd14ed976c52f58954abae6cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:42.067099Z","signature_b64":"762XKIG0w6zCHKBdZcKVdIMZFBBY7o7k/lAQxSw39s+EigPKxX0L4qSqgFjtpUhfN3/u8HCBc+xZuBQwfAVvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40ff23ece7c0cfc9fb2398c89147fbc0d68cdaea31bd0f08e6c76ccab729e85a","last_reissued_at":"2026-05-18T00:38:42.066637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:42.066637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resilience for the Littlewood-Offord Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Afonso S. Bandeira, Asaf Ferber, Matthew Kwan","submitted_at":"2016-09-26T19:46:27Z","abstract_excerpt":"Consider the sum $X(\\xi)=\\sum_{i=1}^n a_i\\xi_i$, where $a=(a_i)_{i=1}^n$ is a sequence of non-zero reals and $\\xi=(\\xi_i)_{i=1}^n$ is a sequence of i.i.d. Rademacher random variables (that is, $\\Pr[\\xi_i=1]=\\Pr[\\xi_i=-1]=1/2$). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities $\\Pr[X=x]$. In this paper we study a resilience version of the Littlewood-Offord problem: how many of the $\\xi_i$ is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptoticall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08136","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":"1609.08136","created_at":"2026-05-18T00:38:42.066714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08136v4","created_at":"2026-05-18T00:38:42.066714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08136","created_at":"2026-05-18T00:38:42.066714+00:00"},{"alias_kind":"pith_short_12","alias_value":"ID7SH3HHYDH4","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"ID7SH3HHYDH4T6ZD","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"ID7SH3HH","created_at":"2026-05-18T12:30:22.444734+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/ID7SH3HHYDH4T6ZDTDEJCR73YD","json":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD.json","graph_json":"https://pith.science/api/pith-number/ID7SH3HHYDH4T6ZDTDEJCR73YD/graph.json","events_json":"https://pith.science/api/pith-number/ID7SH3HHYDH4T6ZDTDEJCR73YD/events.json","paper":"https://pith.science/paper/ID7SH3HH"},"agent_actions":{"view_html":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD","download_json":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD.json","view_paper":"https://pith.science/paper/ID7SH3HH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08136&json=true","fetch_graph":"https://pith.science/api/pith-number/ID7SH3HHYDH4T6ZDTDEJCR73YD/graph.json","fetch_events":"https://pith.science/api/pith-number/ID7SH3HHYDH4T6ZDTDEJCR73YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD/action/storage_attestation","attest_author":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD/action/author_attestation","sign_citation":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD/action/citation_signature","submit_replication":"https://pith.science/pith/ID7SH3HHYDH4T6ZDTDEJCR73YD/action/replication_record"}},"created_at":"2026-05-18T00:38:42.066714+00:00","updated_at":"2026-05-18T00:38:42.066714+00:00"}