{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TEID3PFWPJD7WLMKACKPWQI6YS","short_pith_number":"pith:TEID3PFW","schema_version":"1.0","canonical_sha256":"99103dbcb67a47fb2d8a0094fb411ec48ddbe8bfe3154dd56d70d982eb0c773f","source":{"kind":"arxiv","id":"1908.06270","version":2},"attestation_state":"computed","paper":{"title":"A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Sebastian Brandt, Yannic Maus","submitted_at":"2019-08-17T09:24:35Z","abstract_excerpt":"The Lov\\'{a}sz Local Lemma (LLL) says that, given a set of bad events that depend on the values of some random variables and where each event happens with probability at most $p$ and depends on at most $d$ other events, there is an assignment of the variables that avoids all bad events if the LLL criterion $ep(d+1)<1$ is satisfied.\n  In this paper, we study the dependency of the distributed complexity of the LLL problem on the chosen LLL criterion. We show that for the fundamental case of each random variable of the considered LLL instance being associated with an edge of the input graph, that"},"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":"1908.06270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-17T09:24:35Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"deaba5d860b31a08f4ce769fdde57d2bc06b49286f616da4ea17f69760a858dd","abstract_canon_sha256":"dd72761925bd6bb6a4db44be8dbd6ed236a32324c424d49e847a4b2bb966b109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:29.243469Z","signature_b64":"VJS+RV5fdTOJCpyRCuioWpSkcSISq05FkSFsmAswloVpsKvEeJsAvxBps0w/GdGc8+Ubxtad8mDiK9EG8chtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99103dbcb67a47fb2d8a0094fb411ec48ddbe8bfe3154dd56d70d982eb0c773f","last_reissued_at":"2026-07-04T23:58:29.243006Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:29.243006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Jara Uitto, Sebastian Brandt, Yannic Maus","submitted_at":"2019-08-17T09:24:35Z","abstract_excerpt":"The Lov\\'{a}sz Local Lemma (LLL) says that, given a set of bad events that depend on the values of some random variables and where each event happens with probability at most $p$ and depends on at most $d$ other events, there is an assignment of the variables that avoids all bad events if the LLL criterion $ep(d+1)<1$ is satisfied.\n  In this paper, we study the dependency of the distributed complexity of the LLL problem on the chosen LLL criterion. We show that for the fundamental case of each random variable of the considered LLL instance being associated with an edge of the input graph, that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06270","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06270/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":"1908.06270","created_at":"2026-07-04T23:58:29.243063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06270v2","created_at":"2026-07-04T23:58:29.243063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06270","created_at":"2026-07-04T23:58:29.243063+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEID3PFWPJD7","created_at":"2026-07-04T23:58:29.243063+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEID3PFWPJD7WLMK","created_at":"2026-07-04T23:58:29.243063+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEID3PFW","created_at":"2026-07-04T23:58:29.243063+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03139","citing_title":"Flows with minimal subdynamics","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS","json":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS.json","graph_json":"https://pith.science/api/pith-number/TEID3PFWPJD7WLMKACKPWQI6YS/graph.json","events_json":"https://pith.science/api/pith-number/TEID3PFWPJD7WLMKACKPWQI6YS/events.json","paper":"https://pith.science/paper/TEID3PFW"},"agent_actions":{"view_html":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS","download_json":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS.json","view_paper":"https://pith.science/paper/TEID3PFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06270&json=true","fetch_graph":"https://pith.science/api/pith-number/TEID3PFWPJD7WLMKACKPWQI6YS/graph.json","fetch_events":"https://pith.science/api/pith-number/TEID3PFWPJD7WLMKACKPWQI6YS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS/action/storage_attestation","attest_author":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS/action/author_attestation","sign_citation":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS/action/citation_signature","submit_replication":"https://pith.science/pith/TEID3PFWPJD7WLMKACKPWQI6YS/action/replication_record"}},"created_at":"2026-07-04T23:58:29.243063+00:00","updated_at":"2026-07-04T23:58:29.243063+00:00"}