{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7FEYUBNH7WCBPEHU2TNTPLMSVY","short_pith_number":"pith:7FEYUBNH","canonical_record":{"source":{"id":"1401.5543","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-22T02:47:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4d023e6b8580ef7384f7b614dd75f797377d5e5371c27aa0050cf5643c10d941","abstract_canon_sha256":"1a75131b1c882859882760f2d5aaf69ffe48a605da9094a15497e222e3c4e301"},"schema_version":"1.0"},"canonical_sha256":"f9498a05a7fd841790f4d4db37ad92ae281325a913bfc165588c084f2ae07bcb","source":{"kind":"arxiv","id":"1401.5543","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5543","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5543v5","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5543","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"7FEYUBNH7WCB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FEYUBNH7WCBPEHU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FEYUBNH","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7FEYUBNH7WCBPEHU2TNTPLMSVY","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5543","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-22T02:47:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4d023e6b8580ef7384f7b614dd75f797377d5e5371c27aa0050cf5643c10d941","abstract_canon_sha256":"1a75131b1c882859882760f2d5aaf69ffe48a605da9094a15497e222e3c4e301"},"schema_version":"1.0"},"canonical_sha256":"f9498a05a7fd841790f4d4db37ad92ae281325a913bfc165588c084f2ae07bcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:57.264885Z","signature_b64":"9kKeSfLwhG4G4jaYZOs6qds2I8hZ1upkg5USPD/O5O2syYwbY1DU/5yV3dgOVNVT4HZ6sYkptAnU+zaburugDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9498a05a7fd841790f4d4db37ad92ae281325a913bfc165588c084f2ae07bcb","last_reissued_at":"2026-05-17T23:54:57.264212Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:57.264212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5543","source_version":5,"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-17T23:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBhWBGN+PvwUQ9ZgqexHQUKvQWwxdfskbsggQciN+HQzLZFkmBIlPaEalvFRYPxUqJ26gAp7VuK2UAV6rg0gAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:28:27.360439Z"},"content_sha256":"9c4e0dba59dca4d9602d7ccd008ec8a19cf4c1cfdc6d87c4a06935a96bae9f12","schema_version":"1.0","event_id":"sha256:9c4e0dba59dca4d9602d7ccd008ec8a19cf4c1cfdc6d87c4a06935a96bae9f12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7FEYUBNH7WCBPEHU2TNTPLMSVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds on the Probability of a Finite Union of Events","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Fady Alajaji, Glen Takahara, Jun Yang","submitted_at":"2014-01-22T02:47:08Z","abstract_excerpt":"In this paper, lower bounds on the probability of a finite union of events are considered, i.e. $P\\left(\\bigcup_{i=1}^N A_i\\right)$, in terms of the individual event probabilities $\\{P(A_i), i=1,\\ldots,N\\}$ and the sums of the pairwise event probabilities, i.e., $\\{\\sum_{j:j\\neq i} P(A_i\\cap A_j), i=1,\\ldots,N\\}$. The contribution of this paper includes the following: (i) in the class of all lower bounds that are established in terms of only the $P(A_i)$'s and $\\sum_{j:j\\neq i} P(A_i\\cap A_j)$'s, the optimal lower bound is given numerically by solving a linear programming (LP) problem with $N^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5543","kind":"arxiv","version":5},"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-17T23:54:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TQ+KKi7AWRgHGAGZsHvN/X3Xd628Ug1sqrIPAtycFv7jBIEHotlFCFdKsvUyUaIAE2x6cwM7ImstxpJgCeFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:28:27.361026Z"},"content_sha256":"40640405cc12b78b854f2ab9e55fc232146bbb52c44e96bc29ca5ece7a1eac99","schema_version":"1.0","event_id":"sha256:40640405cc12b78b854f2ab9e55fc232146bbb52c44e96bc29ca5ece7a1eac99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/bundle.json","state_url":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/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-06-07T09:28:27Z","links":{"resolver":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY","bundle":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/bundle.json","state":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7FEYUBNH7WCBPEHU2TNTPLMSVY","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":"1a75131b1c882859882760f2d5aaf69ffe48a605da9094a15497e222e3c4e301","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-22T02:47:08Z","title_canon_sha256":"4d023e6b8580ef7384f7b614dd75f797377d5e5371c27aa0050cf5643c10d941"},"schema_version":"1.0","source":{"id":"1401.5543","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5543","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5543v5","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5543","created_at":"2026-05-17T23:54:57Z"},{"alias_kind":"pith_short_12","alias_value":"7FEYUBNH7WCB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FEYUBNH7WCBPEHU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FEYUBNH","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:40640405cc12b78b854f2ab9e55fc232146bbb52c44e96bc29ca5ece7a1eac99","target":"graph","created_at":"2026-05-17T23:54:57Z","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":"In this paper, lower bounds on the probability of a finite union of events are considered, i.e. $P\\left(\\bigcup_{i=1}^N A_i\\right)$, in terms of the individual event probabilities $\\{P(A_i), i=1,\\ldots,N\\}$ and the sums of the pairwise event probabilities, i.e., $\\{\\sum_{j:j\\neq i} P(A_i\\cap A_j), i=1,\\ldots,N\\}$. The contribution of this paper includes the following: (i) in the class of all lower bounds that are established in terms of only the $P(A_i)$'s and $\\sum_{j:j\\neq i} P(A_i\\cap A_j)$'s, the optimal lower bound is given numerically by solving a linear programming (LP) problem with $N^","authors_text":"Fady Alajaji, Glen Takahara, Jun Yang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-22T02:47:08Z","title":"Lower Bounds on the Probability of a Finite Union of Events"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5543","kind":"arxiv","version":5},"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:9c4e0dba59dca4d9602d7ccd008ec8a19cf4c1cfdc6d87c4a06935a96bae9f12","target":"record","created_at":"2026-05-17T23:54:57Z","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":"1a75131b1c882859882760f2d5aaf69ffe48a605da9094a15497e222e3c4e301","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-01-22T02:47:08Z","title_canon_sha256":"4d023e6b8580ef7384f7b614dd75f797377d5e5371c27aa0050cf5643c10d941"},"schema_version":"1.0","source":{"id":"1401.5543","kind":"arxiv","version":5}},"canonical_sha256":"f9498a05a7fd841790f4d4db37ad92ae281325a913bfc165588c084f2ae07bcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9498a05a7fd841790f4d4db37ad92ae281325a913bfc165588c084f2ae07bcb","first_computed_at":"2026-05-17T23:54:57.264212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:57.264212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kKeSfLwhG4G4jaYZOs6qds2I8hZ1upkg5USPD/O5O2syYwbY1DU/5yV3dgOVNVT4HZ6sYkptAnU+zaburugDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:57.264885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5543","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c4e0dba59dca4d9602d7ccd008ec8a19cf4c1cfdc6d87c4a06935a96bae9f12","sha256:40640405cc12b78b854f2ab9e55fc232146bbb52c44e96bc29ca5ece7a1eac99"],"state_sha256":"8ebc26933388f173ee1ca4ed55bdd303f6a28f133acff04620be25388a77a023"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODcLPbLc+22U06S9XSI/hZWW5P2SULH4VGKlrkq1WiIUU/gxwX1mnz9NLQ+3BgPSJsYh07NIkAEepFcVYPNICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:28:27.364431Z","bundle_sha256":"804a1bd0609be440d732632d4d112408aeaee6e3b33434b0eef86f491540560a"}}