{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7FEYUBNH7WCBPEHU2TNTPLMSVY","short_pith_number":"pith:7FEYUBNH","schema_version":"1.0","canonical_sha256":"f9498a05a7fd841790f4d4db37ad92ae281325a913bfc165588c084f2ae07bcb","source":{"kind":"arxiv","id":"1401.5543","version":5},"attestation_state":"computed","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^"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.5543","created_at":"2026-05-17T23:54:57.264311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5543v5","created_at":"2026-05-17T23:54:57.264311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5543","created_at":"2026-05-17T23:54:57.264311+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FEYUBNH7WCB","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FEYUBNH7WCBPEHU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FEYUBNH","created_at":"2026-05-18T12:28:16.859392+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/7FEYUBNH7WCBPEHU2TNTPLMSVY","json":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY.json","graph_json":"https://pith.science/api/pith-number/7FEYUBNH7WCBPEHU2TNTPLMSVY/graph.json","events_json":"https://pith.science/api/pith-number/7FEYUBNH7WCBPEHU2TNTPLMSVY/events.json","paper":"https://pith.science/paper/7FEYUBNH"},"agent_actions":{"view_html":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY","download_json":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY.json","view_paper":"https://pith.science/paper/7FEYUBNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5543&json=true","fetch_graph":"https://pith.science/api/pith-number/7FEYUBNH7WCBPEHU2TNTPLMSVY/graph.json","fetch_events":"https://pith.science/api/pith-number/7FEYUBNH7WCBPEHU2TNTPLMSVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/action/storage_attestation","attest_author":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/action/author_attestation","sign_citation":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/action/citation_signature","submit_replication":"https://pith.science/pith/7FEYUBNH7WCBPEHU2TNTPLMSVY/action/replication_record"}},"created_at":"2026-05-17T23:54:57.264311+00:00","updated_at":"2026-05-17T23:54:57.264311+00:00"}