{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JFC2Y3RBDVTAWLWAVHWQD6J6PC","short_pith_number":"pith:JFC2Y3RB","schema_version":"1.0","canonical_sha256":"4945ac6e211d660b2ec0a9ed01f93e78a3ad10ec7571be522b0c2d0a253618f4","source":{"kind":"arxiv","id":"1904.05627","version":1},"attestation_state":"computed","paper":{"title":"Locality of not-so-weak coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Christoph Lenzen, Dennis Olivetti, Juho Hirvonen, Jukka Suomela","submitted_at":"2019-04-11T11:11:02Z","abstract_excerpt":"Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes:\n  - \"Easy\": solvable in $O(\\log^* n)$ rounds with both deterministic and randomized distributed algorithms.\n  - \"Hard\": requires at least $\\Omega(\\log n)$ rounds with deterministic and $\\Omega(\\log \\log n)$ rounds with ran"},"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":"1904.05627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-11T11:11:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1a74ca4b3304367e00c77285e51d3176bcc78986d70e8d430b992fac50d238be","abstract_canon_sha256":"112f843ab206125654855917ef687c7ef7e0a39d5516d2bd86fecaef6a436f90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:48.900163Z","signature_b64":"EfP84GotwAIiuYyCRKQenAjU52+hi146Q/sb9kP0ZYakH8Y5TwdwRBuIm6rR9RnrlLUF/0NyA9zOF9hbp+yECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4945ac6e211d660b2ec0a9ed01f93e78a3ad10ec7571be522b0c2d0a253618f4","last_reissued_at":"2026-05-17T23:48:48.899704Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:48.899704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locality of not-so-weak coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Christoph Lenzen, Dennis Olivetti, Juho Hirvonen, Jukka Suomela","submitted_at":"2019-04-11T11:11:02Z","abstract_excerpt":"Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes:\n  - \"Easy\": solvable in $O(\\log^* n)$ rounds with both deterministic and randomized distributed algorithms.\n  - \"Hard\": requires at least $\\Omega(\\log n)$ rounds with deterministic and $\\Omega(\\log \\log n)$ rounds with ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05627","kind":"arxiv","version":1},"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":"1904.05627","created_at":"2026-05-17T23:48:48.899782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05627v1","created_at":"2026-05-17T23:48:48.899782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05627","created_at":"2026-05-17T23:48:48.899782+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFC2Y3RBDVTA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFC2Y3RBDVTAWLWA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFC2Y3RB","created_at":"2026-05-18T12:33:18.533446+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/JFC2Y3RBDVTAWLWAVHWQD6J6PC","json":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC.json","graph_json":"https://pith.science/api/pith-number/JFC2Y3RBDVTAWLWAVHWQD6J6PC/graph.json","events_json":"https://pith.science/api/pith-number/JFC2Y3RBDVTAWLWAVHWQD6J6PC/events.json","paper":"https://pith.science/paper/JFC2Y3RB"},"agent_actions":{"view_html":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC","download_json":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC.json","view_paper":"https://pith.science/paper/JFC2Y3RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05627&json=true","fetch_graph":"https://pith.science/api/pith-number/JFC2Y3RBDVTAWLWAVHWQD6J6PC/graph.json","fetch_events":"https://pith.science/api/pith-number/JFC2Y3RBDVTAWLWAVHWQD6J6PC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC/action/storage_attestation","attest_author":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC/action/author_attestation","sign_citation":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC/action/citation_signature","submit_replication":"https://pith.science/pith/JFC2Y3RBDVTAWLWAVHWQD6J6PC/action/replication_record"}},"created_at":"2026-05-17T23:48:48.899782+00:00","updated_at":"2026-05-17T23:48:48.899782+00:00"}