{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VYIOU4SCENSG7KA2GGHCJSMUYD","short_pith_number":"pith:VYIOU4SC","schema_version":"1.0","canonical_sha256":"ae10ea724223646fa81a318e24c994c0c84c991f9a5a8d1d444c253052ecb6cb","source":{"kind":"arxiv","id":"1705.04840","version":2},"attestation_state":"computed","paper":{"title":"Sublogarithmic Distributed Algorithms for Lov\\'asz Local lemma, and the Complexity Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manuela Fischer, Mohsen Ghaffari","submitted_at":"2017-05-13T14:49:23Z","abstract_excerpt":"Locally Checkable Labeling (LCL) problems include essentially all the classic problems of $\\mathsf{LOCAL}$ distributed algorithms. In a recent enlightening revelation, Chang and Pettie [arXiv 1704.06297] showed that any LCL (on bounded degree graphs) that has an $o(\\log n)$-round randomized algorithm can be solved in $T_{LLL}(n)$ rounds, which is the randomized complexity of solving (a relaxed variant of) the Lov\\'asz Local Lemma (LLL) on bounded degree $n$-node graphs. Currently, the best known upper bound on $T_{LLL}(n)$ is $O(\\log n)$, by Chung, Pettie, and Su [PODC'14], while the best know"},"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":"1705.04840","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-13T14:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"1931af2ab4c9f93d6d6526a90b56f78e4e63043352ed952d890ae45112753dcb","abstract_canon_sha256":"c54bcbc541bbe536d516ec7e33278f7dec724f46ba82385276c070cba5bb9a04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:22.888614Z","signature_b64":"OQORIZlXYV2GUOm5GLbDA5aQh4BnHOSmFGAxkYZEMgYQljvQHg1frBpHHhFajuRHPk6euK5xVA/PO5dAN/2YAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae10ea724223646fa81a318e24c994c0c84c991f9a5a8d1d444c253052ecb6cb","last_reissued_at":"2026-05-18T00:44:22.888018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:22.888018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublogarithmic Distributed Algorithms for Lov\\'asz Local lemma, and the Complexity Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manuela Fischer, Mohsen Ghaffari","submitted_at":"2017-05-13T14:49:23Z","abstract_excerpt":"Locally Checkable Labeling (LCL) problems include essentially all the classic problems of $\\mathsf{LOCAL}$ distributed algorithms. In a recent enlightening revelation, Chang and Pettie [arXiv 1704.06297] showed that any LCL (on bounded degree graphs) that has an $o(\\log n)$-round randomized algorithm can be solved in $T_{LLL}(n)$ rounds, which is the randomized complexity of solving (a relaxed variant of) the Lov\\'asz Local Lemma (LLL) on bounded degree $n$-node graphs. Currently, the best known upper bound on $T_{LLL}(n)$ is $O(\\log n)$, by Chung, Pettie, and Su [PODC'14], while the best know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04840","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":""},"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":"1705.04840","created_at":"2026-05-18T00:44:22.888102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04840v2","created_at":"2026-05-18T00:44:22.888102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04840","created_at":"2026-05-18T00:44:22.888102+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYIOU4SCENSG","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYIOU4SCENSG7KA2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYIOU4SC","created_at":"2026-05-18T12:31:49.984773+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/VYIOU4SCENSG7KA2GGHCJSMUYD","json":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD.json","graph_json":"https://pith.science/api/pith-number/VYIOU4SCENSG7KA2GGHCJSMUYD/graph.json","events_json":"https://pith.science/api/pith-number/VYIOU4SCENSG7KA2GGHCJSMUYD/events.json","paper":"https://pith.science/paper/VYIOU4SC"},"agent_actions":{"view_html":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD","download_json":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD.json","view_paper":"https://pith.science/paper/VYIOU4SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04840&json=true","fetch_graph":"https://pith.science/api/pith-number/VYIOU4SCENSG7KA2GGHCJSMUYD/graph.json","fetch_events":"https://pith.science/api/pith-number/VYIOU4SCENSG7KA2GGHCJSMUYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD/action/storage_attestation","attest_author":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD/action/author_attestation","sign_citation":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD/action/citation_signature","submit_replication":"https://pith.science/pith/VYIOU4SCENSG7KA2GGHCJSMUYD/action/replication_record"}},"created_at":"2026-05-18T00:44:22.888102+00:00","updated_at":"2026-05-18T00:44:22.888102+00:00"}