{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TR4ZE24UTBYULQPCL2XLYD4JDL","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":"fdb8b24cfc7168f5b1212d5b7c17f8db74ccd0090a205dfde7eea71f2c5dbb44","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-17T09:39:26Z","title_canon_sha256":"e65645eec16694d9e2c9f9014d5bde636f54153ccd10da39cfb26966087d526d"},"schema_version":"1.0","source":{"id":"2202.08544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.08544","created_at":"2026-07-05T04:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"2202.08544v2","created_at":"2026-07-05T04:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.08544","created_at":"2026-07-05T04:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"TR4ZE24UTBYU","created_at":"2026-07-05T04:54:02Z"},{"alias_kind":"pith_short_16","alias_value":"TR4ZE24UTBYULQPC","created_at":"2026-07-05T04:54:02Z"},{"alias_kind":"pith_short_8","alias_value":"TR4ZE24U","created_at":"2026-07-05T04:54:02Z"}],"graph_snapshots":[{"event_id":"sha256:5db37cf602eeae84eb8a099b2dbde90656f5600c2e6fe1b2d697b28baf9c46b0","target":"graph","created_at":"2026-07-05T04:54:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.08544/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\\Theta(\\log n), \\Theta(n)]$ region, in two settings. We present one algorithm for unrooted regular trees and another algorithm for rooted regular trees. The algorithms take the description of a locally checkable labeling problem as input, and the running time is polynomial in the size of the problem description. The algorithms decide if the problem is solvable in $O(\\log n)$ rounds. If not, it is known that the complexity has to be","authors_text":"Alkida Balliu, Dennis Olivetti, Jan Studen\\'y, Jukka Suomela, 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":"2022-02-17T09:39:26Z","title":"Efficient Classification of Locally Checkable Problems in Regular Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.08544","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:5d488a4f4231b672ceefe1b2f2685ee11f82569d3839b2c02d0ca2a70745bba9","target":"record","created_at":"2026-07-05T04:54:02Z","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":"fdb8b24cfc7168f5b1212d5b7c17f8db74ccd0090a205dfde7eea71f2c5dbb44","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-17T09:39:26Z","title_canon_sha256":"e65645eec16694d9e2c9f9014d5bde636f54153ccd10da39cfb26966087d526d"},"schema_version":"1.0","source":{"id":"2202.08544","kind":"arxiv","version":2}},"canonical_sha256":"9c79926b94987145c1e25eaebc0f891ac9c50f3eafad24489f84fcd2f1262442","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c79926b94987145c1e25eaebc0f891ac9c50f3eafad24489f84fcd2f1262442","first_computed_at":"2026-07-05T04:54:02.268260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:54:02.268260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SGygBaMgloQJKfY3I4zSm+KG3KpwOeAijfhrPOu6mH1uj+gqRkzflH/S8ECbGQwFwi3h/uWGNTxTfkZO4yrCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:54:02.268666Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.08544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d488a4f4231b672ceefe1b2f2685ee11f82569d3839b2c02d0ca2a70745bba9","sha256:5db37cf602eeae84eb8a099b2dbde90656f5600c2e6fe1b2d697b28baf9c46b0"],"state_sha256":"0f08b04960416eb259da83982eb7ae6effe93e7c14cb9c834f7fdf9a0a7af1c6"}