{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:75DAGXK63GDTOTCMBOFHBVML5N","short_pith_number":"pith:75DAGXK6","schema_version":"1.0","canonical_sha256":"ff46035d5ed987374c4c0b8a70d58beb5cac15e7247dace558a72c473e9701b0","source":{"kind":"arxiv","id":"1702.05456","version":2},"attestation_state":"computed","paper":{"title":"LCL problems on grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Christopher Purcell, Janne H. Korhonen, Joel Rybicki, Juho Hirvonen, Jukka Suomela, Patric R. J. \\\"Osterg{\\aa}rd, Przemys{\\l}aw Uzna\\'nski, Sebastian Brandt, Tuomo Lempi\\\"ainen","submitted_at":"2017-02-17T17:48:41Z","abstract_excerpt":"LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of $O(1)$, $\\Theta(\\log^* n)$, or $\\Theta(n)$, and the design of optimal algorithms can be fully automated.\n  This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: $O(1)$, $\\Theta(\\log^* n)$, and $\\Theta(n)$. However, given an LCL problem it is unde"},"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":"1702.05456","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-17T17:48:41Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"0e1299bdf88834411c41ef8848711f43881fc284220d0cc3d273dfa536d06407","abstract_canon_sha256":"58a470350983f8ca782e4d42eeac8be0872687212312b1a545b1e37da8092da6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:45.061488Z","signature_b64":"DDJ/V7dI9knShbihyIdmvZWvzAUaQvJ+y/4sHtIj578F4rWicyPPtGVW3qaUNRvt+f6L6n2X6eXamK4h4YZYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff46035d5ed987374c4c0b8a70d58beb5cac15e7247dace558a72c473e9701b0","last_reissued_at":"2026-05-18T00:43:45.060817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:45.060817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LCL problems on grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DC","authors_text":"Christopher Purcell, Janne H. Korhonen, Joel Rybicki, Juho Hirvonen, Jukka Suomela, Patric R. J. \\\"Osterg{\\aa}rd, Przemys{\\l}aw Uzna\\'nski, Sebastian Brandt, Tuomo Lempi\\\"ainen","submitted_at":"2017-02-17T17:48:41Z","abstract_excerpt":"LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of $O(1)$, $\\Theta(\\log^* n)$, or $\\Theta(n)$, and the design of optimal algorithms can be fully automated.\n  This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: $O(1)$, $\\Theta(\\log^* n)$, and $\\Theta(n)$. However, given an LCL problem it is unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05456","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":"1702.05456","created_at":"2026-05-18T00:43:45.060967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05456v2","created_at":"2026-05-18T00:43:45.060967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05456","created_at":"2026-05-18T00:43:45.060967+00:00"},{"alias_kind":"pith_short_12","alias_value":"75DAGXK63GDT","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"75DAGXK63GDTOTCM","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"75DAGXK6","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/75DAGXK63GDTOTCMBOFHBVML5N","json":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N.json","graph_json":"https://pith.science/api/pith-number/75DAGXK63GDTOTCMBOFHBVML5N/graph.json","events_json":"https://pith.science/api/pith-number/75DAGXK63GDTOTCMBOFHBVML5N/events.json","paper":"https://pith.science/paper/75DAGXK6"},"agent_actions":{"view_html":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N","download_json":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N.json","view_paper":"https://pith.science/paper/75DAGXK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05456&json=true","fetch_graph":"https://pith.science/api/pith-number/75DAGXK63GDTOTCMBOFHBVML5N/graph.json","fetch_events":"https://pith.science/api/pith-number/75DAGXK63GDTOTCMBOFHBVML5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/action/storage_attestation","attest_author":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/action/author_attestation","sign_citation":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/action/citation_signature","submit_replication":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/action/replication_record"}},"created_at":"2026-05-18T00:43:45.060967+00:00","updated_at":"2026-05-18T00:43:45.060967+00:00"}