{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3PWW4YR753Q4QDTFUKES2YYRQE","short_pith_number":"pith:3PWW4YR7","canonical_record":{"source":{"id":"2605.12787","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T22:02:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf806363e2b0a63f0582bd7d0592b931ea7e4090373e1e6d2ac319190273dab6","abstract_canon_sha256":"4a8b727b09f7809da3db20732dab69abbab2252ab1eb1c08728f62b8e7e3085d"},"schema_version":"1.0"},"canonical_sha256":"dbed6e623feee1c80e65a2892d63118139caa72395e743fcaf7ca61692cbae33","source":{"kind":"arxiv","id":"2605.12787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12787","created_at":"2026-05-18T03:09:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12787v1","created_at":"2026-05-18T03:09:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12787","created_at":"2026-05-18T03:09:13Z"},{"alias_kind":"pith_short_12","alias_value":"3PWW4YR753Q4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3PWW4YR753Q4QDTF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3PWW4YR7","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3PWW4YR753Q4QDTFUKES2YYRQE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12787","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T22:02:21Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf806363e2b0a63f0582bd7d0592b931ea7e4090373e1e6d2ac319190273dab6","abstract_canon_sha256":"4a8b727b09f7809da3db20732dab69abbab2252ab1eb1c08728f62b8e7e3085d"},"schema_version":"1.0"},"canonical_sha256":"dbed6e623feee1c80e65a2892d63118139caa72395e743fcaf7ca61692cbae33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:13.010922Z","signature_b64":"4Xh4PMyAu3vJyer0hJJvchc+Q/0ZhcEPLxQXcgpqsHZQJBRBdn3r3BWj0vNoRBBNV/nhYpnhumCi9YCFvQT4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbed6e623feee1c80e65a2892d63118139caa72395e743fcaf7ca61692cbae33","last_reissued_at":"2026-05-18T03:09:13.010336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:13.010336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12787","source_version":1,"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-18T03:09:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2EVd/uDXaplFWS/fiNzTmSEhg/2O6A5Wf+O/K+dtBXO0I2qrBHUrAxqlusYYND4KB3FmdwjoZSyfRVvLe13WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:12:43.414745Z"},"content_sha256":"629924e90464217d83fa31f6db2c1b664e689912be45fcf12db3ed38c2d9671d","schema_version":"1.0","event_id":"sha256:629924e90464217d83fa31f6db2c1b664e689912be45fcf12db3ed38c2d9671d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3PWW4YR753Q4QDTFUKES2YYRQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The complexity of LCLs on trees changes when nodes lack exact knowledge of network size n.","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Dennis Olivetti, Fabian Kuhn, Gustav Schmid, Sebastian Brandt, Timoth\\'e Picavet","submitted_at":"2026-05-12T22:02:21Z","abstract_excerpt":"One of the central models in distributed computing is Linial's LOCAL model [SIAM J. Comp. 1992]. Over time, researchers have studied distributed graph problems in the LOCAL model under slightly different assumptions, such as whether nodes know the exact network size $n$, only a polynomial upper bound on $n$, or nothing at all. We ask whether these differences are merely technical or fundamentally affect the theory of Locally Checkable Labelings (LCLs), one of the most studied problem classes.\n  LCLs are graph problems whose valid solutions can be characterized by a finite set of allowed consta"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"If nodes are oblivious to n, or know only a polynomial upper bound on it, then even on trees, the theory of LCLs changes significantly: randomness helps in more cases; some problems have very unnatural complexities; and some have a lower bound that depends on which definition of Ω we use!","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the prior classifications of LCL complexity on trees, which relied on nodes knowing n, can be directly compared or extended without re-deriving the entire landscape under the new knowledge assumptions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Knowledge of network size n alters the distributed complexity of LCL problems on trees, making randomness useful in more cases and creating unnatural complexity classes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The complexity of LCLs on trees changes when nodes lack exact knowledge of network size n.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"84070cf500d0df2ed0b782bbded2c24c2a4175b27438f8533b15047b78890a19"},"source":{"id":"2605.12787","kind":"arxiv","version":1},"verdict":{"id":"f8fda1bf-7c6e-4572-954d-922683aa72f4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:29:47.963976Z","strongest_claim":"If nodes are oblivious to n, or know only a polynomial upper bound on it, then even on trees, the theory of LCLs changes significantly: randomness helps in more cases; some problems have very unnatural complexities; and some have a lower bound that depends on which definition of Ω we use!","one_line_summary":"Knowledge of network size n alters the distributed complexity of LCL problems on trees, making randomness useful in more cases and creating unnatural complexity classes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the prior classifications of LCL complexity on trees, which relied on nodes knowing n, can be directly compared or extended without re-deriving the entire landscape under the new knowledge assumptions.","pith_extraction_headline":"The complexity of LCLs on trees changes when nodes lack exact knowledge of network size n."},"references":{"count":35,"sample":[{"doi":"","year":2023,"title":"Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms","work_id":"67a9945e-32ee-46a4-b669-f62d1260d2e3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"The distributed complexity of locally checkable problems on paths is decidable","work_id":"04fafa05-6e17-43d6-85bd-5800cecc27a9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Effi- cient classification of locally checkable problems in regular trees","work_id":"6cc1c945-d11c-4796-a874-a26a08eeddbe","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Classification of distributed binary labeling problems","work_id":"267a30c3-1b0c-4c84-8915-850083ea5a6f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Exponential speedup over locality in MPC with optimal memory","work_id":"0530c653-fb7b-4844-b7c7-9665910aa110","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"a7cf2cf6e1727330f8e91cf10b89833bf27ee6e125fd51edc954d7189ab80424","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d716c9c4d4b3626994bf00aa89d3995af14d45add856c9fe915c7fadf0e6b893"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f8fda1bf-7c6e-4572-954d-922683aa72f4"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3P7D3nuNrLqLVf+Jf/gt10woX3kJEAOigVT9iRaiiODBn/qi/J+Geilo0H4QJ2eao13gPF+IkgW24KCiH5qVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:12:43.415894Z"},"content_sha256":"bbb672b9a7dc8b7d784809232ec4b2c6568af489ceaaac5efcb9582dfdd6d352","schema_version":"1.0","event_id":"sha256:bbb672b9a7dc8b7d784809232ec4b2c6568af489ceaaac5efcb9582dfdd6d352"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PWW4YR753Q4QDTFUKES2YYRQE/bundle.json","state_url":"https://pith.science/pith/3PWW4YR753Q4QDTFUKES2YYRQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PWW4YR753Q4QDTFUKES2YYRQE/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-22T15:12:43Z","links":{"resolver":"https://pith.science/pith/3PWW4YR753Q4QDTFUKES2YYRQE","bundle":"https://pith.science/pith/3PWW4YR753Q4QDTFUKES2YYRQE/bundle.json","state":"https://pith.science/pith/3PWW4YR753Q4QDTFUKES2YYRQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PWW4YR753Q4QDTFUKES2YYRQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3PWW4YR753Q4QDTFUKES2YYRQE","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":"4a8b727b09f7809da3db20732dab69abbab2252ab1eb1c08728f62b8e7e3085d","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T22:02:21Z","title_canon_sha256":"cf806363e2b0a63f0582bd7d0592b931ea7e4090373e1e6d2ac319190273dab6"},"schema_version":"1.0","source":{"id":"2605.12787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12787","created_at":"2026-05-18T03:09:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12787v1","created_at":"2026-05-18T03:09:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12787","created_at":"2026-05-18T03:09:13Z"},{"alias_kind":"pith_short_12","alias_value":"3PWW4YR753Q4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"3PWW4YR753Q4QDTF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"3PWW4YR7","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:bbb672b9a7dc8b7d784809232ec4b2c6568af489ceaaac5efcb9582dfdd6d352","target":"graph","created_at":"2026-05-18T03:09:13Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"If nodes are oblivious to n, or know only a polynomial upper bound on it, then even on trees, the theory of LCLs changes significantly: randomness helps in more cases; some problems have very unnatural complexities; and some have a lower bound that depends on which definition of Ω we use!"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the prior classifications of LCL complexity on trees, which relied on nodes knowing n, can be directly compared or extended without re-deriving the entire landscape under the new knowledge assumptions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Knowledge of network size n alters the distributed complexity of LCL problems on trees, making randomness useful in more cases and creating unnatural complexity classes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The complexity of LCLs on trees changes when nodes lack exact knowledge of network size n."}],"snapshot_sha256":"84070cf500d0df2ed0b782bbded2c24c2a4175b27438f8533b15047b78890a19"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d716c9c4d4b3626994bf00aa89d3995af14d45add856c9fe915c7fadf0e6b893"},"paper":{"abstract_excerpt":"One of the central models in distributed computing is Linial's LOCAL model [SIAM J. Comp. 1992]. Over time, researchers have studied distributed graph problems in the LOCAL model under slightly different assumptions, such as whether nodes know the exact network size $n$, only a polynomial upper bound on $n$, or nothing at all. We ask whether these differences are merely technical or fundamentally affect the theory of Locally Checkable Labelings (LCLs), one of the most studied problem classes.\n  LCLs are graph problems whose valid solutions can be characterized by a finite set of allowed consta","authors_text":"Alkida Balliu, Dennis Olivetti, Fabian Kuhn, Gustav Schmid, Sebastian Brandt, Timoth\\'e Picavet","cross_cats":["cs.CC"],"headline":"The complexity of LCLs on trees changes when nodes lack exact knowledge of network size n.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T22:02:21Z","title":"The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size"},"references":{"count":35,"internal_anchors":0,"resolved_work":35,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms","work_id":"67a9945e-32ee-46a4-b669-f62d1260d2e3","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The distributed complexity of locally checkable problems on paths is decidable","work_id":"04fafa05-6e17-43d6-85bd-5800cecc27a9","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Effi- cient classification of locally checkable problems in regular trees","work_id":"6cc1c945-d11c-4796-a874-a26a08eeddbe","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Classification of distributed binary labeling problems","work_id":"267a30c3-1b0c-4c84-8915-850083ea5a6f","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Exponential speedup over locality in MPC with optimal memory","work_id":"0530c653-fb7b-4844-b7c7-9665910aa110","year":2022}],"snapshot_sha256":"a7cf2cf6e1727330f8e91cf10b89833bf27ee6e125fd51edc954d7189ab80424"},"source":{"id":"2605.12787","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:29:47.963976Z","id":"f8fda1bf-7c6e-4572-954d-922683aa72f4","model_set":{"reader":"grok-4.3"},"one_line_summary":"Knowledge of network size n alters the distributed complexity of LCL problems on trees, making randomness useful in more cases and creating unnatural complexity classes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The complexity of LCLs on trees changes when nodes lack exact knowledge of network size n.","strongest_claim":"If nodes are oblivious to n, or know only a polynomial upper bound on it, then even on trees, the theory of LCLs changes significantly: randomness helps in more cases; some problems have very unnatural complexities; and some have a lower bound that depends on which definition of Ω we use!","weakest_assumption":"That the prior classifications of LCL complexity on trees, which relied on nodes knowing n, can be directly compared or extended without re-deriving the entire landscape under the new knowledge assumptions."}},"verdict_id":"f8fda1bf-7c6e-4572-954d-922683aa72f4"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:629924e90464217d83fa31f6db2c1b664e689912be45fcf12db3ed38c2d9671d","target":"record","created_at":"2026-05-18T03:09:13Z","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":"4a8b727b09f7809da3db20732dab69abbab2252ab1eb1c08728f62b8e7e3085d","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-12T22:02:21Z","title_canon_sha256":"cf806363e2b0a63f0582bd7d0592b931ea7e4090373e1e6d2ac319190273dab6"},"schema_version":"1.0","source":{"id":"2605.12787","kind":"arxiv","version":1}},"canonical_sha256":"dbed6e623feee1c80e65a2892d63118139caa72395e743fcaf7ca61692cbae33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbed6e623feee1c80e65a2892d63118139caa72395e743fcaf7ca61692cbae33","first_computed_at":"2026-05-18T03:09:13.010336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:13.010336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Xh4PMyAu3vJyer0hJJvchc+Q/0ZhcEPLxQXcgpqsHZQJBRBdn3r3BWj0vNoRBBNV/nhYpnhumCi9YCFvQT4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:13.010922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:629924e90464217d83fa31f6db2c1b664e689912be45fcf12db3ed38c2d9671d","sha256:bbb672b9a7dc8b7d784809232ec4b2c6568af489ceaaac5efcb9582dfdd6d352"],"state_sha256":"e09d8f569467d802fa2ae81160b42868491a6e9be4e0c966aa316b1dcc3d6dbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOVuKXCgkEf24bsVW/yfPoyyhCqyRUxzhj2GFpiBUA07EzERYnOLj2RBEOhdSMLa8p1JmgPvRm6l5P9gx6s4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:12:43.420392Z","bundle_sha256":"d85da5d58f7bdf9c6736184d43064b8615d769554a8f05e0bc50bc55180305de"}}