{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MKPA72GYL24FOSSPLXOP3YG5YU","short_pith_number":"pith:MKPA72GY","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"},"canonical_sha256":"629e0fe8d85eb8574a4f5ddcfde0ddc51c6a223c4236a6de54a9f7c48bc9add1","source":{"kind":"arxiv","id":"2603.07245","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.07245","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"2603.07245v5","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.07245","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"MKPA72GYL24F","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"pith_short_16","alias_value":"MKPA72GYL24FOSSP","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"pith_short_8","alias_value":"MKPA72GY","created_at":"2026-06-12T01:09:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MKPA72GYL24FOSSPLXOP3YG5YU","target":"record","payload":{"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"},"canonical_sha256":"629e0fe8d85eb8574a4f5ddcfde0ddc51c6a223c4236a6de54a9f7c48bc9add1","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"},"source_kind":"arxiv","source_id":"2603.07245","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-06-12T01:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iplID1GQcHitTrr7KHxV06KKxP5+QnhEyPOlna2LAdadHWKfGctnbdBKEUngZpAKHWzuMlijVxxqiStJpdfKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:12:30.803358Z"},"content_sha256":"d1a01d78540a6ce668422a30043bc8dcfea99288f17cab34cf8ac4779c7e63d3","schema_version":"1.0","event_id":"sha256:d1a01d78540a6ce668422a30043bc8dcfea99288f17cab34cf8ac4779c7e63d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MKPA72GYL24FOSSPLXOP3YG5YU","target":"graph","payload":{"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"},"verdict_id":"4d7f496d-7dd0-4348-94e2-83dc28b8e9b7"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHTiv7pCfpTtxLC+uA79qhD0L/3wTC94Jbl0m4/lXMRV2y6odMhGPbPXLis/QYKasjfN7KeLq0RKgNl/GAsgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:12:30.803837Z"},"content_sha256":"f7b02651292ae30cc2272eaf8715b079f6ec556f4e32419c80a01382e63e5eee","schema_version":"1.0","event_id":"sha256:f7b02651292ae30cc2272eaf8715b079f6ec556f4e32419c80a01382e63e5eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/bundle.json","state_url":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKPA72GYL24FOSSPLXOP3YG5YU/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-23T14:12:30Z","links":{"resolver":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU","bundle":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/bundle.json","state":"https://pith.science/pith/MKPA72GYL24FOSSPLXOP3YG5YU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKPA72GYL24FOSSPLXOP3YG5YU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MKPA72GYL24FOSSPLXOP3YG5YU","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":"1437cb367d9ecfdca96165c52c24cbb329e9a9d3e88481615e58b90584e757a3","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-03-07T14:55:00Z","title_canon_sha256":"ebf4323c32107766075af41ce6a9706d8dc94a11ab38f23fd0fd717f93622915"},"schema_version":"1.0","source":{"id":"2603.07245","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.07245","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"2603.07245v5","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.07245","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"MKPA72GYL24F","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"pith_short_16","alias_value":"MKPA72GYL24FOSSP","created_at":"2026-06-12T01:09:24Z"},{"alias_kind":"pith_short_8","alias_value":"MKPA72GY","created_at":"2026-06-12T01:09:24Z"}],"graph_snapshots":[{"event_id":"sha256:f7b02651292ae30cc2272eaf8715b079f6ec556f4e32419c80a01382e63e5eee","target":"graph","created_at":"2026-06-12T01:09:24Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The paper presents a pedagogically motivated reformulation of the proof of the Lovász Local Lemma based solely on unconditional probability inequalities."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the reformulation using only unconditional probability inequalities is meaningfully simpler or more accessible than standard presentations in the literature."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An expository review presenting a pedagogically reformulated proof of the Lovász Local Lemma using unconditional inequalities, plus revisited applications and algorithmic perspectives."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities."}],"snapshot_sha256":"3abe45727fe73bb1b79794ce682980c139f53bc23aa10bcfc8015eb4bea82ccf"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.07245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Igal Sason","cross_cats":["math.PR"],"headline":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-03-07T14:55:00Z","title":"The Lov\\'{a}sz Local Lemma: Foundations and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.07245","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-15T14:25:52.389414Z","id":"4d7f496d-7dd0-4348-94e2-83dc28b8e9b7","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"The Lovász Local Lemma admits a proof based solely on unconditional probability inequalities.","strongest_claim":"The paper presents a pedagogically motivated reformulation of the proof of the Lovász Local Lemma based solely on unconditional probability inequalities.","weakest_assumption":"That the reformulation using only unconditional probability inequalities is meaningfully simpler or more accessible than standard presentations in the literature."}},"verdict_id":"4d7f496d-7dd0-4348-94e2-83dc28b8e9b7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d1a01d78540a6ce668422a30043bc8dcfea99288f17cab34cf8ac4779c7e63d3","target":"record","created_at":"2026-06-12T01:09:24Z","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":"1437cb367d9ecfdca96165c52c24cbb329e9a9d3e88481615e58b90584e757a3","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-03-07T14:55:00Z","title_canon_sha256":"ebf4323c32107766075af41ce6a9706d8dc94a11ab38f23fd0fd717f93622915"},"schema_version":"1.0","source":{"id":"2603.07245","kind":"arxiv","version":5}},"canonical_sha256":"629e0fe8d85eb8574a4f5ddcfde0ddc51c6a223c4236a6de54a9f7c48bc9add1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"629e0fe8d85eb8574a4f5ddcfde0ddc51c6a223c4236a6de54a9f7c48bc9add1","first_computed_at":"2026-06-12T01:09:24.585589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:24.585589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JSVlI7OXexZztoIFeA9Wa3eAjqrWTH6dJcgp1/aps9N/Mlofm9E6ugopuXKCSAG7yv0aSuNjScOxICU9HRWCDw==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:24.586129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.07245","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a01d78540a6ce668422a30043bc8dcfea99288f17cab34cf8ac4779c7e63d3","sha256:f7b02651292ae30cc2272eaf8715b079f6ec556f4e32419c80a01382e63e5eee"],"state_sha256":"16f96ba24d6fd49aa1e7507188c1ada29b8f67bcf095340c4c0da606fb36bd7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OS48wJfZPqfciRilHlWkJHcd6fFtyxrKLAhVJ3e1K987SG4jjEoc4hrY6bp+wK7deMNQ4oLFctO5WDQHVX6WBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:12:30.806148Z","bundle_sha256":"fb8dd982a178171d91173b3c0d3267c227a46dfa59d88404ed02b43754777fa0"}}