{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:75DAGXK63GDTOTCMBOFHBVML5N","short_pith_number":"pith:75DAGXK6","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"},"canonical_sha256":"ff46035d5ed987374c4c0b8a70d58beb5cac15e7247dace558a72c473e9701b0","source":{"kind":"arxiv","id":"1702.05456","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05456","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05456v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05456","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"75DAGXK63GDT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"75DAGXK63GDTOTCM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"75DAGXK6","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:75DAGXK63GDTOTCMBOFHBVML5N","target":"record","payload":{"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"},"canonical_sha256":"ff46035d5ed987374c4c0b8a70d58beb5cac15e7247dace558a72c473e9701b0","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"},"source_kind":"arxiv","source_id":"1702.05456","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bEsD4gqUKACRDUIyf3MhV411vOtuhs5Razs3bpgb9IBxtOi2bJTIahJoxGrLm0cSZcd3wyn8vcihc3dsvt3aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:00:16.724782Z"},"content_sha256":"15f94c358bccb05d8e3e6e2d369e6824d1f0ad0a151d9ec29e352ac70a9ef1a8","schema_version":"1.0","event_id":"sha256:15f94c358bccb05d8e3e6e2d369e6824d1f0ad0a151d9ec29e352ac70a9ef1a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:75DAGXK63GDTOTCMBOFHBVML5N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YK0GnlyK+Ihbn2QxYYUl6xSQT7iXyGjXyFb7H7D0mKnLHiOedwLGdRMbyS334UIVqHHfkTZ7Mb8xUK1xnS2DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:00:16.725480Z"},"content_sha256":"a7b28b37ecbb4d6e8116563fa835cd170e2197c3dda37ffa0ccb512e0eac7bd2","schema_version":"1.0","event_id":"sha256:a7b28b37ecbb4d6e8116563fa835cd170e2197c3dda37ffa0ccb512e0eac7bd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/bundle.json","state_url":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75DAGXK63GDTOTCMBOFHBVML5N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T19:00:16Z","links":{"resolver":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N","bundle":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/bundle.json","state":"https://pith.science/pith/75DAGXK63GDTOTCMBOFHBVML5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75DAGXK63GDTOTCMBOFHBVML5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:75DAGXK63GDTOTCMBOFHBVML5N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"58a470350983f8ca782e4d42eeac8be0872687212312b1a545b1e37da8092da6","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-17T17:48:41Z","title_canon_sha256":"0e1299bdf88834411c41ef8848711f43881fc284220d0cc3d273dfa536d06407"},"schema_version":"1.0","source":{"id":"1702.05456","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05456","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05456v2","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05456","created_at":"2026-05-18T00:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"75DAGXK63GDT","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"75DAGXK63GDTOTCM","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"75DAGXK6","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a7b28b37ecbb4d6e8116563fa835cd170e2197c3dda37ffa0ccb512e0eac7bd2","target":"graph","created_at":"2026-05-18T00:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","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","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-17T17:48:41Z","title":"LCL problems on grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05456","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:15f94c358bccb05d8e3e6e2d369e6824d1f0ad0a151d9ec29e352ac70a9ef1a8","target":"record","created_at":"2026-05-18T00:43:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"58a470350983f8ca782e4d42eeac8be0872687212312b1a545b1e37da8092da6","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-17T17:48:41Z","title_canon_sha256":"0e1299bdf88834411c41ef8848711f43881fc284220d0cc3d273dfa536d06407"},"schema_version":"1.0","source":{"id":"1702.05456","kind":"arxiv","version":2}},"canonical_sha256":"ff46035d5ed987374c4c0b8a70d58beb5cac15e7247dace558a72c473e9701b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff46035d5ed987374c4c0b8a70d58beb5cac15e7247dace558a72c473e9701b0","first_computed_at":"2026-05-18T00:43:45.060817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:45.060817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DDJ/V7dI9knShbihyIdmvZWvzAUaQvJ+y/4sHtIj578F4rWicyPPtGVW3qaUNRvt+f6L6n2X6eXamK4h4YZYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:45.061488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05456","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f94c358bccb05d8e3e6e2d369e6824d1f0ad0a151d9ec29e352ac70a9ef1a8","sha256:a7b28b37ecbb4d6e8116563fa835cd170e2197c3dda37ffa0ccb512e0eac7bd2"],"state_sha256":"a45fdac9201d48cd26713ce9275bd741bf1730d2211d0132417c463f830e8236"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxuQ7DYv8SUqhcskcMNo86q9xSgC2pmpqeHguItSq9Cr3N5LUKxPvjFHyoXZE0lWuteHWoUzK4xuNPh4+wGJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:00:16.728979Z","bundle_sha256":"a3c4c287c8a2216f4b20fa32f695b47fc136c0d794bed9d2759cb1c4ef19d2e3"}}