{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZM4NFLHW5C3C2J52EVMKU5GHQY","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":"f43c0fcfab01e3e2e2896f69e18a052d0fb4af7622cc56041c6dd060c4e1ede4","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T13:12:23Z","title_canon_sha256":"a51052cb97d617cc03403bef6e0fa5bf06a8df3b454058cb0311c3da67b0aedc"},"schema_version":"1.0","source":{"id":"2006.00516","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00516","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00516v6","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00516","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZM4NFLHW5C3C","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZM4NFLHW5C3C2J52","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZM4NFLHW","created_at":"2026-07-05T05:18:42Z"}],"graph_snapshots":[{"event_id":"sha256:5f8b46ef049c9c3b52294ff19a02b881a4ae3e0d1ff78942728dd4cec8b9dedf","target":"graph","created_at":"2026-07-05T05:18:42Z","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/2006.00516/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While useful probability bounds for $n$ pairwise independent Bernoulli random variables adding up to at least an integer $k$ have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several results in this direction. Firstly, when $k = 1$, the tightest upper bound on the probability of the union of $n$ pairwise independent events is provided in closed-form for any input marginal probability vector $\\mathbf{p} \\in [0,1]^n$. To prove the result, we show the existence of a positively correlated Bernoulli random vector with transformed bivariate pr","authors_text":"Arjun Ramachandra, Karthik Natarajan","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T13:12:23Z","title":"Tight Probability Bounds with Pairwise Independence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00516","kind":"arxiv","version":6},"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:5e8b3eb657ad5c7fca935752b8d28649ae30baa5373566d4643274fec2c4e933","target":"record","created_at":"2026-07-05T05:18:42Z","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":"f43c0fcfab01e3e2e2896f69e18a052d0fb4af7622cc56041c6dd060c4e1ede4","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-31T13:12:23Z","title_canon_sha256":"a51052cb97d617cc03403bef6e0fa5bf06a8df3b454058cb0311c3da67b0aedc"},"schema_version":"1.0","source":{"id":"2006.00516","kind":"arxiv","version":6}},"canonical_sha256":"cb38d2acf6e8b62d27ba2558aa74c7861eaf445d375878f541fc05f7499b14f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb38d2acf6e8b62d27ba2558aa74c7861eaf445d375878f541fc05f7499b14f5","first_computed_at":"2026-07-05T05:18:42.632942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:42.632942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azOCBcPvjVodz1S9pYZGdSppCE46m2TJ6GEIYRnvb8Io3hTASuTWt/NPapAwHFZHYOjJPIIvuFIwDrdETr99Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:42.633364Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.00516","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e8b3eb657ad5c7fca935752b8d28649ae30baa5373566d4643274fec2c4e933","sha256:5f8b46ef049c9c3b52294ff19a02b881a4ae3e0d1ff78942728dd4cec8b9dedf"],"state_sha256":"37e6943b3f08146ae336f173ddecedd92698af6a058e65d5b3068a2f8150e108"}