{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MT3GXSK5UNFWCSLFYSZQ6MK74I","short_pith_number":"pith:MT3GXSK5","schema_version":"1.0","canonical_sha256":"64f66bc95da34b614965c4b30f315fe21a040ce173f5f377f6990de047825340","source":{"kind":"arxiv","id":"2311.06726","version":1},"attestation_state":"computed","paper":{"title":"The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Yi-Jun Chang","submitted_at":"2023-11-12T03:57:22Z","abstract_excerpt":"We consider locally checkable labeling LCL problems in the LOCAL model of distributed computing. Since 2016, there has been a substantial body of work examining the possible complexities of LCL problems. For example, it has been established that there are no LCL problems exhibiting deterministic complexities falling between $\\omega(\\log^* n)$ and $o(\\log n)$. This line of inquiry has yielded a wealth of algorithmic techniques and insights that are useful for algorithm designers.\n  While the complexity landscape of LCL problems on general graphs, trees, and paths is now well understood, graph c"},"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":"2311.06726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-11-12T03:57:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0a0dcfa839995e4b95919949f634583ce747acaed23fc8e3bbe900bf087d0bc4","abstract_canon_sha256":"7e27ffb23623584d30dae3301949a82b735090c7c2f0e39e423259dd86440961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:02.603051Z","signature_b64":"kTdfnT6aHcJ+7cWcyBraXi+lUmfKXfmUFp/FVNrelN3z1OIORPUazD/2DVL3koMFMFK39Euzw0f3uh/Qp59NDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f66bc95da34b614965c4b30f315fe21a040ce173f5f377f6990de047825340","last_reissued_at":"2026-07-05T07:12:02.602627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:02.602627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Yi-Jun Chang","submitted_at":"2023-11-12T03:57:22Z","abstract_excerpt":"We consider locally checkable labeling LCL problems in the LOCAL model of distributed computing. Since 2016, there has been a substantial body of work examining the possible complexities of LCL problems. For example, it has been established that there are no LCL problems exhibiting deterministic complexities falling between $\\omega(\\log^* n)$ and $o(\\log n)$. This line of inquiry has yielded a wealth of algorithmic techniques and insights that are useful for algorithm designers.\n  While the complexity landscape of LCL problems on general graphs, trees, and paths is now well understood, graph c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06726","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.06726/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.06726","created_at":"2026-07-05T07:12:02.602685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06726v1","created_at":"2026-07-05T07:12:02.602685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06726","created_at":"2026-07-05T07:12:02.602685+00:00"},{"alias_kind":"pith_short_12","alias_value":"MT3GXSK5UNFW","created_at":"2026-07-05T07:12:02.602685+00:00"},{"alias_kind":"pith_short_16","alias_value":"MT3GXSK5UNFWCSLF","created_at":"2026-07-05T07:12:02.602685+00:00"},{"alias_kind":"pith_short_8","alias_value":"MT3GXSK5","created_at":"2026-07-05T07:12:02.602685+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/MT3GXSK5UNFWCSLFYSZQ6MK74I","json":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I.json","graph_json":"https://pith.science/api/pith-number/MT3GXSK5UNFWCSLFYSZQ6MK74I/graph.json","events_json":"https://pith.science/api/pith-number/MT3GXSK5UNFWCSLFYSZQ6MK74I/events.json","paper":"https://pith.science/paper/MT3GXSK5"},"agent_actions":{"view_html":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I","download_json":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I.json","view_paper":"https://pith.science/paper/MT3GXSK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06726&json=true","fetch_graph":"https://pith.science/api/pith-number/MT3GXSK5UNFWCSLFYSZQ6MK74I/graph.json","fetch_events":"https://pith.science/api/pith-number/MT3GXSK5UNFWCSLFYSZQ6MK74I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I/action/storage_attestation","attest_author":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I/action/author_attestation","sign_citation":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I/action/citation_signature","submit_replication":"https://pith.science/pith/MT3GXSK5UNFWCSLFYSZQ6MK74I/action/replication_record"}},"created_at":"2026-07-05T07:12:02.602685+00:00","updated_at":"2026-07-05T07:12:02.602685+00:00"}