{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6ZOTSN6HTMIESZANETAAZ4H4PX","short_pith_number":"pith:6ZOTSN6H","schema_version":"1.0","canonical_sha256":"f65d3937c79b1049640d24c00cf0fc7ddaf087ebeaa121d77304088e5e961f6f","source":{"kind":"arxiv","id":"1708.03954","version":3},"attestation_state":"computed","paper":{"title":"An interactive version of the Lov\\'asz local lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"John Livieratos, Kostas I. Psaromiligkos, Lefteris Kirousis","submitted_at":"2017-08-13T18:56:53Z","abstract_excerpt":"Assume we are given (finitely many) mutually independent variables and (finitely many) \"undesirable\" events, each depending on a subset of the variables of at most $k$ elements, called the scope of the event. Assume that the probability of a variable belonging to the scope of an occurring event is bounded by $q$. We prove that if $ekq \\leq 1$ then there exists at least one assignment to the variables for which none of the events occurs. Examples are given where the criterion $ekq \\leq 1$ is applicable, whereas that of the classical version of the Lov\\'asz local lemma is not. The proof of the r"},"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":"1708.03954","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-13T18:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"82d2323f609df93d2a996fcc2ed959d33a5b556b449a2bc549ee887bfc4e815c","abstract_canon_sha256":"af2bfbba13e018c075aa6043c36c38a4179f7bf6a38b82723626893d728d405e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:46.404562Z","signature_b64":"w72Wm5heZ0FGCcVTSQ69cVPLn2TDkvR/doipWQgqY8ej3MnEiOpSc1dmTu2ynlu0H60MnOb3upItjZuhhucYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f65d3937c79b1049640d24c00cf0fc7ddaf087ebeaa121d77304088e5e961f6f","last_reissued_at":"2026-05-18T00:08:46.403984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:46.403984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An interactive version of the Lov\\'asz local lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"John Livieratos, Kostas I. Psaromiligkos, Lefteris Kirousis","submitted_at":"2017-08-13T18:56:53Z","abstract_excerpt":"Assume we are given (finitely many) mutually independent variables and (finitely many) \"undesirable\" events, each depending on a subset of the variables of at most $k$ elements, called the scope of the event. Assume that the probability of a variable belonging to the scope of an occurring event is bounded by $q$. We prove that if $ekq \\leq 1$ then there exists at least one assignment to the variables for which none of the events occurs. Examples are given where the criterion $ekq \\leq 1$ is applicable, whereas that of the classical version of the Lov\\'asz local lemma is not. The proof of the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03954","kind":"arxiv","version":3},"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":"1708.03954","created_at":"2026-05-18T00:08:46.404061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.03954v3","created_at":"2026-05-18T00:08:46.404061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03954","created_at":"2026-05-18T00:08:46.404061+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZOTSN6HTMIE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZOTSN6HTMIESZAN","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZOTSN6H","created_at":"2026-05-18T12:31:03.183658+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/6ZOTSN6HTMIESZANETAAZ4H4PX","json":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX.json","graph_json":"https://pith.science/api/pith-number/6ZOTSN6HTMIESZANETAAZ4H4PX/graph.json","events_json":"https://pith.science/api/pith-number/6ZOTSN6HTMIESZANETAAZ4H4PX/events.json","paper":"https://pith.science/paper/6ZOTSN6H"},"agent_actions":{"view_html":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX","download_json":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX.json","view_paper":"https://pith.science/paper/6ZOTSN6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.03954&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZOTSN6HTMIESZANETAAZ4H4PX/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZOTSN6HTMIESZANETAAZ4H4PX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX/action/storage_attestation","attest_author":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX/action/author_attestation","sign_citation":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX/action/citation_signature","submit_replication":"https://pith.science/pith/6ZOTSN6HTMIESZANETAAZ4H4PX/action/replication_record"}},"created_at":"2026-05-18T00:08:46.404061+00:00","updated_at":"2026-05-18T00:08:46.404061+00:00"}