{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MKPA72GYL24FOSSPLXOP3YG5YU","short_pith_number":"pith:MKPA72GY","schema_version":"1.0","canonical_sha256":"629e0fe8d85eb8574a4f5ddcfde0ddc51c6a223c4236a6de54a9f7c48bc9add1","source":{"kind":"arxiv","id":"2603.07245","version":5},"attestation_state":"computed","paper":{"title":"The Lov\\'{a}sz Local Lemma: Foundations and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities.","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Igal Sason","submitted_at":"2026-03-07T14:55:00Z","abstract_excerpt":"The Lov\\'{a}sz Local Lemma (LLL) is a central tool in probabilistic combinatorics, providing a sufficient condition under which a finite collection of undesirable events with limited dependencies can be simultaneously avoided with positive probability. This paper offers a self-contained expository treatment of the lemma and its strengthened versions, emphasizing mathematical foundations, conceptual clarity, and applications. We begin with a pedagogically motivated proof of the LLL based entirely on unconditional probability inequalities. Particular attention is given to the symmetric form of t"},"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":"2603.07245","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-03-07T14:55:00Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ebf4323c32107766075af41ce6a9706d8dc94a11ab38f23fd0fd717f93622915","abstract_canon_sha256":"1437cb367d9ecfdca96165c52c24cbb329e9a9d3e88481615e58b90584e757a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:24.586129Z","signature_b64":"JSVlI7OXexZztoIFeA9Wa3eAjqrWTH6dJcgp1/aps9N/Mlofm9E6ugopuXKCSAG7yv0aSuNjScOxICU9HRWCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"629e0fe8d85eb8574a4f5ddcfde0ddc51c6a223c4236a6de54a9f7c48bc9add1","last_reissued_at":"2026-06-12T01:09:24.585589Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:24.585589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Lov\\'{a}sz Local Lemma: Foundations and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities.","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Igal Sason","submitted_at":"2026-03-07T14:55:00Z","abstract_excerpt":"The Lov\\'{a}sz Local Lemma (LLL) is a central tool in probabilistic combinatorics, providing a sufficient condition under which a finite collection of undesirable events with limited dependencies can be simultaneously avoided with positive probability. This paper offers a self-contained expository treatment of the lemma and its strengthened versions, emphasizing mathematical foundations, conceptual clarity, and applications. We begin with a pedagogically motivated proof of the LLL based entirely on unconditional probability inequalities. Particular attention is given to the symmetric form of t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The paper presents a pedagogically motivated reformulation of the proof of the Lovász Local Lemma based solely on unconditional probability inequalities.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the reformulation using only unconditional probability inequalities is meaningfully simpler or more accessible than standard presentations in the literature.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An expository review presenting a pedagogically reformulated proof of the Lovász Local Lemma using unconditional inequalities, plus revisited applications and algorithmic perspectives.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3abe45727fe73bb1b79794ce682980c139f53bc23aa10bcfc8015eb4bea82ccf"},"source":{"id":"2603.07245","kind":"arxiv","version":5},"verdict":{"id":"4d7f496d-7dd0-4348-94e2-83dc28b8e9b7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T14:25:52.389414Z","strongest_claim":"The paper presents a pedagogically motivated reformulation of the proof of the Lovász Local Lemma based solely on unconditional probability inequalities.","one_line_summary":"An expository review presenting a pedagogically reformulated proof of the Lovász Local Lemma using unconditional inequalities, plus revisited applications and algorithmic perspectives.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the reformulation using only unconditional probability inequalities is meaningfully simpler or more accessible than standard presentations in the literature.","pith_extraction_headline":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.07245/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2603.07245","created_at":"2026-06-12T01:09:24.585666+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.07245v5","created_at":"2026-06-12T01:09:24.585666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.07245","created_at":"2026-06-12T01:09:24.585666+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKPA72GYL24F","created_at":"2026-06-12T01:09:24.585666+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKPA72GYL24FOSSP","created_at":"2026-06-12T01:09:24.585666+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKPA72GY","created_at":"2026-06-12T01:09:24.585666+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/MKPA72GYL24FOSSPLXOP3YG5YU","json":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU.json","graph_json":"https://pith.science/api/pith-number/MKPA72GYL24FOSSPLXOP3YG5YU/graph.json","events_json":"https://pith.science/api/pith-number/MKPA72GYL24FOSSPLXOP3YG5YU/events.json","paper":"https://pith.science/paper/MKPA72GY"},"agent_actions":{"view_html":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU","download_json":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU.json","view_paper":"https://pith.science/paper/MKPA72GY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.07245&json=true","fetch_graph":"https://pith.science/api/pith-number/MKPA72GYL24FOSSPLXOP3YG5YU/graph.json","fetch_events":"https://pith.science/api/pith-number/MKPA72GYL24FOSSPLXOP3YG5YU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/action/storage_attestation","attest_author":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/action/author_attestation","sign_citation":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/action/citation_signature","submit_replication":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/action/replication_record"}},"created_at":"2026-06-12T01:09:24.585666+00:00","updated_at":"2026-06-12T01:09:24.585666+00:00"}