{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RRVAON4XHUAQLLQJJCI6OONCS2","short_pith_number":"pith:RRVAON4X","canonical_record":{"source":{"id":"1507.00829","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-03T06:58:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4e688bb6372c6ad8b12d6749ddb628f689b06aaaab0f92077a9342faaca62e29","abstract_canon_sha256":"24bd9ffbcb268edd2890f3e3034f362387debc6575012970e671847b6e1f2b2d"},"schema_version":"1.0"},"canonical_sha256":"8c6a0737973d0105ae094891e739a296992a540e7191910dcdca6583e82bf9e8","source":{"kind":"arxiv","id":"1507.00829","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00829","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00829v4","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00829","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"RRVAON4XHUAQ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RRVAON4XHUAQLLQJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RRVAON4X","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RRVAON4XHUAQLLQJJCI6OONCS2","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00829","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-03T06:58:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4e688bb6372c6ad8b12d6749ddb628f689b06aaaab0f92077a9342faaca62e29","abstract_canon_sha256":"24bd9ffbcb268edd2890f3e3034f362387debc6575012970e671847b6e1f2b2d"},"schema_version":"1.0"},"canonical_sha256":"8c6a0737973d0105ae094891e739a296992a540e7191910dcdca6583e82bf9e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:37.993174Z","signature_b64":"Lpt+4rBx8nILwH6BC2YK8Eg3JYxO3Edak+zImzSR3BAn+dLWJEgGUpvr1dvDdSpNnb4RoQOp/HAgt4/e57gKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c6a0737973d0105ae094891e739a296992a540e7191910dcdca6583e82bf9e8","last_reissued_at":"2026-05-18T01:35:37.992371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:37.992371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00829","source_version":4,"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-05-18T01:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kaDnxZ/pIm5ZK5RhoRrRdq4rXShV9G8Eh20iZysBKJXDSpQmebfgtJGJ9qjKdX4KgNaNYy97m+VpS3eYK86rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:04.027079Z"},"content_sha256":"07db01b9b9d551faa658caff049d294e0effe5c83ad4f562672d04cacb873794","schema_version":"1.0","event_id":"sha256:07db01b9b9d551faa658caff049d294e0effe5c83ad4f562672d04cacb873794"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RRVAON4XHUAQLLQJJCI6OONCS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anti-concentration for polynomials of independent random variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.PR","authors_text":"Oanh Nguyen, Raghu Meka, Van Vu","submitted_at":"2015-07-03T06:58:13Z","abstract_excerpt":"We prove anti-concentration results for polynomials of independent random variables with arbitrary degree. Our results extend the classical Littlewood-Offord result for linear polynomials, and improve several earlier estimates.\n  We discuss applications in two different areas. In complexity theory, we prove near optimal lower bounds for computing the Parity, addressing a challenge in complexity theory posed by Razborov and Viola, and also address a problem concerning OR functions. In random graph theory, we derive a general anti-concentration result on the number of copies of a fixed graph in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00829","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"},"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-05-18T01:35:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8aFVqGu7Q8TGM6xs9Vfg6iFrOFwv1kDE0PB59BCY1RtwKG9uEUS57JA1yC/rnMyVDlVxWodhRaluj4D8eGd2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:08:04.027806Z"},"content_sha256":"5bd5b673f54e86e99d7e54a261ba2838bfb67f73ca5e7a0e0b977ebd4a4f7afa","schema_version":"1.0","event_id":"sha256:5bd5b673f54e86e99d7e54a261ba2838bfb67f73ca5e7a0e0b977ebd4a4f7afa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRVAON4XHUAQLLQJJCI6OONCS2/bundle.json","state_url":"https://pith.science/pith/RRVAON4XHUAQLLQJJCI6OONCS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRVAON4XHUAQLLQJJCI6OONCS2/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-05-28T21:08:04Z","links":{"resolver":"https://pith.science/pith/RRVAON4XHUAQLLQJJCI6OONCS2","bundle":"https://pith.science/pith/RRVAON4XHUAQLLQJJCI6OONCS2/bundle.json","state":"https://pith.science/pith/RRVAON4XHUAQLLQJJCI6OONCS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRVAON4XHUAQLLQJJCI6OONCS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RRVAON4XHUAQLLQJJCI6OONCS2","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":"24bd9ffbcb268edd2890f3e3034f362387debc6575012970e671847b6e1f2b2d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-03T06:58:13Z","title_canon_sha256":"4e688bb6372c6ad8b12d6749ddb628f689b06aaaab0f92077a9342faaca62e29"},"schema_version":"1.0","source":{"id":"1507.00829","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00829","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00829v4","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00829","created_at":"2026-05-18T01:35:37Z"},{"alias_kind":"pith_short_12","alias_value":"RRVAON4XHUAQ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RRVAON4XHUAQLLQJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RRVAON4X","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5bd5b673f54e86e99d7e54a261ba2838bfb67f73ca5e7a0e0b977ebd4a4f7afa","target":"graph","created_at":"2026-05-18T01:35:37Z","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"},"paper":{"abstract_excerpt":"We prove anti-concentration results for polynomials of independent random variables with arbitrary degree. Our results extend the classical Littlewood-Offord result for linear polynomials, and improve several earlier estimates.\n  We discuss applications in two different areas. In complexity theory, we prove near optimal lower bounds for computing the Parity, addressing a challenge in complexity theory posed by Razborov and Viola, and also address a problem concerning OR functions. In random graph theory, we derive a general anti-concentration result on the number of copies of a fixed graph in ","authors_text":"Oanh Nguyen, Raghu Meka, Van Vu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-03T06:58:13Z","title":"Anti-concentration for polynomials of independent random variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00829","kind":"arxiv","version":4},"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:07db01b9b9d551faa658caff049d294e0effe5c83ad4f562672d04cacb873794","target":"record","created_at":"2026-05-18T01:35:37Z","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":"24bd9ffbcb268edd2890f3e3034f362387debc6575012970e671847b6e1f2b2d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-03T06:58:13Z","title_canon_sha256":"4e688bb6372c6ad8b12d6749ddb628f689b06aaaab0f92077a9342faaca62e29"},"schema_version":"1.0","source":{"id":"1507.00829","kind":"arxiv","version":4}},"canonical_sha256":"8c6a0737973d0105ae094891e739a296992a540e7191910dcdca6583e82bf9e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c6a0737973d0105ae094891e739a296992a540e7191910dcdca6583e82bf9e8","first_computed_at":"2026-05-18T01:35:37.992371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:37.992371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lpt+4rBx8nILwH6BC2YK8Eg3JYxO3Edak+zImzSR3BAn+dLWJEgGUpvr1dvDdSpNnb4RoQOp/HAgt4/e57gKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:37.993174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00829","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07db01b9b9d551faa658caff049d294e0effe5c83ad4f562672d04cacb873794","sha256:5bd5b673f54e86e99d7e54a261ba2838bfb67f73ca5e7a0e0b977ebd4a4f7afa"],"state_sha256":"d7cf93c3e490d3740766278110238623c158833f1d9f4e5f4cb1975b3193f87e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5iJ7RrwboLYmJeHm0upCy1AxBCXQ12TBnLZCnkKQ1C57XClearo3k8b1TtIU8XuFPZgFajKE8H8RBKaTvGieAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:08:04.031595Z","bundle_sha256":"fddb6a2962d059dea472152a4b09118d871766e3b9375690f5c9247709069338"}}