{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:T44B5PH3QQCWOGB77PX3LEXPIG","short_pith_number":"pith:T44B5PH3","canonical_record":{"source":{"id":"1811.01672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-05T13:37:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3a32713a07159dec0f08cb14452089d954f50e19af36263fe4542d6027538b3","abstract_canon_sha256":"688e1376ac778e52cc4cdf2957b5356f1d950295d50550c36d8146f1cd8943fe"},"schema_version":"1.0"},"canonical_sha256":"9f381ebcfb840567183ffbefb592ef41b137f484323fa0be8b1f2c211bf6823b","source":{"kind":"arxiv","id":"1811.01672","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01672","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01672v2","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01672","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"T44B5PH3QQCW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T44B5PH3QQCWOGB7","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T44B5PH3","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:T44B5PH3QQCWOGB77PX3LEXPIG","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-05T13:37:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3a32713a07159dec0f08cb14452089d954f50e19af36263fe4542d6027538b3","abstract_canon_sha256":"688e1376ac778e52cc4cdf2957b5356f1d950295d50550c36d8146f1cd8943fe"},"schema_version":"1.0"},"canonical_sha256":"9f381ebcfb840567183ffbefb592ef41b137f484323fa0be8b1f2c211bf6823b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:50.315536Z","signature_b64":"zF1v2ySxtFD0wdvP5ObR4lMBzqqVCBD5TAKmCxnk5DpF3L5SrhM4vpySeiEo+6+6FEKPkl9bk7JOyAAfj1TMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f381ebcfb840567183ffbefb592ef41b137f484323fa0be8b1f2c211bf6823b","last_reissued_at":"2026-05-17T23:53:50.314765Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:50.314765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01672","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-17T23:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTgpeJpMcIQwgUIGUioWbOaqx9byB9yyfQ1CaaDqKUUUnc12ZUhN37AYP4KfQmvSgmtpVrXMowz7h4UMXP+OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:46:45.736686Z"},"content_sha256":"d227ecc9a039733aaed8273c8a5eb362e15c247378271e32c54a18e193106364","schema_version":"1.0","event_id":"sha256:d227ecc9a039733aaed8273c8a5eb362e15c247378271e32c54a18e193106364"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:T44B5PH3QQCWOGB77PX3LEXPIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The distributed complexity of locally checkable problems on paths is decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Dennis Olivetti, Jukka Suomela, Mika\\\"el Rabie, Sebastian Brandt, Yi-Jun Chang","submitted_at":"2018-11-05T13:37:30Z","abstract_excerpt":"Consider a computer network that consists of a path with $n$ nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more formally, we have an LCL (locally checkable labeling) problem. How many communication rounds are needed (in the standard LOCAL model of computing) to solve this problem?\n  It is well known that the answer is always either $O(1)$ rounds, or $\\Theta(\\log^* n)$ rounds, or $\\Theta(n)$ rounds. In this work we show that this question is decidable (albeit PSPACE-hard): w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01672","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-17T23:53:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ashVHi4nGSZgMva0Rdl2gWiva4gH7AvwKL5vZk5JOboW3UCGUds0CwMqRDsMIMIOjfVVH+KWXk3CdeZrdMtaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:46:45.737367Z"},"content_sha256":"4f3afa909c71c11061fb2b891ecf595105bb52b8357ef63e4d64ef9bbebba1b2","schema_version":"1.0","event_id":"sha256:4f3afa909c71c11061fb2b891ecf595105bb52b8357ef63e4d64ef9bbebba1b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T44B5PH3QQCWOGB77PX3LEXPIG/bundle.json","state_url":"https://pith.science/pith/T44B5PH3QQCWOGB77PX3LEXPIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T44B5PH3QQCWOGB77PX3LEXPIG/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-05-26T23:46:45Z","links":{"resolver":"https://pith.science/pith/T44B5PH3QQCWOGB77PX3LEXPIG","bundle":"https://pith.science/pith/T44B5PH3QQCWOGB77PX3LEXPIG/bundle.json","state":"https://pith.science/pith/T44B5PH3QQCWOGB77PX3LEXPIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T44B5PH3QQCWOGB77PX3LEXPIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T44B5PH3QQCWOGB77PX3LEXPIG","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":"688e1376ac778e52cc4cdf2957b5356f1d950295d50550c36d8146f1cd8943fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-05T13:37:30Z","title_canon_sha256":"d3a32713a07159dec0f08cb14452089d954f50e19af36263fe4542d6027538b3"},"schema_version":"1.0","source":{"id":"1811.01672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01672","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01672v2","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01672","created_at":"2026-05-17T23:53:50Z"},{"alias_kind":"pith_short_12","alias_value":"T44B5PH3QQCW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T44B5PH3QQCWOGB7","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T44B5PH3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:4f3afa909c71c11061fb2b891ecf595105bb52b8357ef63e4d64ef9bbebba1b2","target":"graph","created_at":"2026-05-17T23:53:50Z","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":"Consider a computer network that consists of a path with $n$ nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more formally, we have an LCL (locally checkable labeling) problem. How many communication rounds are needed (in the standard LOCAL model of computing) to solve this problem?\n  It is well known that the answer is always either $O(1)$ rounds, or $\\Theta(\\log^* n)$ rounds, or $\\Theta(n)$ rounds. In this work we show that this question is decidable (albeit PSPACE-hard): w","authors_text":"Alkida Balliu, Dennis Olivetti, Jukka Suomela, Mika\\\"el Rabie, Sebastian Brandt, Yi-Jun Chang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-05T13:37:30Z","title":"The distributed complexity of locally checkable problems on paths is decidable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01672","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:d227ecc9a039733aaed8273c8a5eb362e15c247378271e32c54a18e193106364","target":"record","created_at":"2026-05-17T23:53:50Z","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":"688e1376ac778e52cc4cdf2957b5356f1d950295d50550c36d8146f1cd8943fe","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-05T13:37:30Z","title_canon_sha256":"d3a32713a07159dec0f08cb14452089d954f50e19af36263fe4542d6027538b3"},"schema_version":"1.0","source":{"id":"1811.01672","kind":"arxiv","version":2}},"canonical_sha256":"9f381ebcfb840567183ffbefb592ef41b137f484323fa0be8b1f2c211bf6823b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f381ebcfb840567183ffbefb592ef41b137f484323fa0be8b1f2c211bf6823b","first_computed_at":"2026-05-17T23:53:50.314765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:50.314765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zF1v2ySxtFD0wdvP5ObR4lMBzqqVCBD5TAKmCxnk5DpF3L5SrhM4vpySeiEo+6+6FEKPkl9bk7JOyAAfj1TMCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:50.315536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d227ecc9a039733aaed8273c8a5eb362e15c247378271e32c54a18e193106364","sha256:4f3afa909c71c11061fb2b891ecf595105bb52b8357ef63e4d64ef9bbebba1b2"],"state_sha256":"6f50f970143dadb4324232b47204f3448cd4f723d476a123334184db5a0f5eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uC0OUQEa2yLneAagJECAv30C/b/d0aqxw9HR2Mm21lU+jY5VW5SfgVAlNNyD07IyljzZC7t4a8JHe2vVGJaNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:46:45.740753Z","bundle_sha256":"cd5d15bdc8650c8642bafa1155b0bbea7b2059130c58334f941db1d5077e307a"}}