{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z6GNUDZ7YJRDISBDLQ4BONDBEY","short_pith_number":"pith:Z6GNUDZ7","canonical_record":{"source":{"id":"1805.04776","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-12T20:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"dfb19aeeb6bc539bfa28894893e42ed92567dde5ca174845c8cf60f7f8bb148b","abstract_canon_sha256":"173bd56da59253c8e95b02cd9b3341414598ef7ee2064aaa43a0ca105ed1f2b8"},"schema_version":"1.0"},"canonical_sha256":"cf8cda0f3fc2623448235c38173461263933bd636bb35b8e5420ecbaf34d2981","source":{"kind":"arxiv","id":"1805.04776","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04776","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04776v3","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04776","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"Z6GNUDZ7YJRD","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"pith_short_16","alias_value":"Z6GNUDZ7YJRDISBD","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"pith_short_8","alias_value":"Z6GNUDZ7","created_at":"2026-07-05T00:50:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z6GNUDZ7YJRDISBDLQ4BONDBEY","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04776","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-12T20:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"dfb19aeeb6bc539bfa28894893e42ed92567dde5ca174845c8cf60f7f8bb148b","abstract_canon_sha256":"173bd56da59253c8e95b02cd9b3341414598ef7ee2064aaa43a0ca105ed1f2b8"},"schema_version":"1.0"},"canonical_sha256":"cf8cda0f3fc2623448235c38173461263933bd636bb35b8e5420ecbaf34d2981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:23.615675Z","signature_b64":"7NYBZfCPoKJXH198awERt1/fG9tWE9tddCHd7NQZLD082SBsYT0Jaru72Bxr6UD6zGudaU8rB8hR5PNaD/RlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf8cda0f3fc2623448235c38173461263933bd636bb35b8e5420ecbaf34d2981","last_reissued_at":"2026-07-05T00:50:23.615290Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:23.615290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04776","source_version":3,"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-07-05T00:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGCo4SEHS0tGnVBClPWukraZsv6m5CjDGz8LWFqKKwJSF3RBZsGa+8nEwNfH+TmEMgcBVBp88zEgO6owpTPwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T06:29:12.396089Z"},"content_sha256":"a69e7099b6389a8fcd754de1938c53436a75b597e5be5a9ff74c5296d5724507","schema_version":"1.0","event_id":"sha256:a69e7099b6389a8fcd754de1938c53436a75b597e5be5a9ff74c5296d5724507"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z6GNUDZ7YJRDISBDLQ4BONDBEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Global Problems in the LOCAL Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alkida Balliu, Dennis Olivetti, Jukka Suomela, Sebastian Brandt","submitted_at":"2018-05-12T20:25:59Z","abstract_excerpt":"The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the LOCAL model and locally checkable problems (LCLs) in bounded-degree graphs, the following picture emerges:\n  - There are lots of problems with time complexities of $\\Theta(\\log^* n)$ or $\\Theta(\\log n)$.\n  - It is not possible to have a problem with complexity between $\\omega(\\log^* n)$ and $o(\\log n)$.\n  - In general graphs, we can construct LCL problems with infinitely many complexities between $\\omega(\\log n)$ and $n^{o(1)}$.\n  - In tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04776","kind":"arxiv","version":3},"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/1805.04776/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"},"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-07-05T00:50:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c7GrFC09aHph0gMzlEcOJmuNgcr/G/d9dBTbDP7mxurhsQAruoI70iK5Z0qMJyTu553pxNNGhmN939faX+00DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T06:29:12.396614Z"},"content_sha256":"12fe143b7db1085d17062d254e0ade943aaf21e628706565853d089de36f6846","schema_version":"1.0","event_id":"sha256:12fe143b7db1085d17062d254e0ade943aaf21e628706565853d089de36f6846"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/bundle.json","state_url":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/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-08-12T06:29:12Z","links":{"resolver":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY","bundle":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/bundle.json","state":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z6GNUDZ7YJRDISBDLQ4BONDBEY","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":"173bd56da59253c8e95b02cd9b3341414598ef7ee2064aaa43a0ca105ed1f2b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-12T20:25:59Z","title_canon_sha256":"dfb19aeeb6bc539bfa28894893e42ed92567dde5ca174845c8cf60f7f8bb148b"},"schema_version":"1.0","source":{"id":"1805.04776","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04776","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04776v3","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04776","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"Z6GNUDZ7YJRD","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"pith_short_16","alias_value":"Z6GNUDZ7YJRDISBD","created_at":"2026-07-05T00:50:23Z"},{"alias_kind":"pith_short_8","alias_value":"Z6GNUDZ7","created_at":"2026-07-05T00:50:23Z"}],"graph_snapshots":[{"event_id":"sha256:12fe143b7db1085d17062d254e0ade943aaf21e628706565853d089de36f6846","target":"graph","created_at":"2026-07-05T00:50:23Z","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/1805.04776/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the LOCAL model and locally checkable problems (LCLs) in bounded-degree graphs, the following picture emerges:\n  - There are lots of problems with time complexities of $\\Theta(\\log^* n)$ or $\\Theta(\\log n)$.\n  - It is not possible to have a problem with complexity between $\\omega(\\log^* n)$ and $o(\\log n)$.\n  - In general graphs, we can construct LCL problems with infinitely many complexities between $\\omega(\\log n)$ and $n^{o(1)}$.\n  - In tre","authors_text":"Alkida Balliu, Dennis Olivetti, Jukka Suomela, Sebastian Brandt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-12T20:25:59Z","title":"Almost Global Problems in the LOCAL Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04776","kind":"arxiv","version":3},"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:a69e7099b6389a8fcd754de1938c53436a75b597e5be5a9ff74c5296d5724507","target":"record","created_at":"2026-07-05T00:50:23Z","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":"173bd56da59253c8e95b02cd9b3341414598ef7ee2064aaa43a0ca105ed1f2b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-12T20:25:59Z","title_canon_sha256":"dfb19aeeb6bc539bfa28894893e42ed92567dde5ca174845c8cf60f7f8bb148b"},"schema_version":"1.0","source":{"id":"1805.04776","kind":"arxiv","version":3}},"canonical_sha256":"cf8cda0f3fc2623448235c38173461263933bd636bb35b8e5420ecbaf34d2981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf8cda0f3fc2623448235c38173461263933bd636bb35b8e5420ecbaf34d2981","first_computed_at":"2026-07-05T00:50:23.615290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:50:23.615290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7NYBZfCPoKJXH198awERt1/fG9tWE9tddCHd7NQZLD082SBsYT0Jaru72Bxr6UD6zGudaU8rB8hR5PNaD/RlDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:50:23.615675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04776","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a69e7099b6389a8fcd754de1938c53436a75b597e5be5a9ff74c5296d5724507","sha256:12fe143b7db1085d17062d254e0ade943aaf21e628706565853d089de36f6846"],"state_sha256":"fbfb9b30856b347a7b01a97e5bda386d0b132e4de5eecd84894c38277c44e0e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5o1+GNrtCBrMXuISq7YpPhSgzJfAxUydoEjDwhb7fMT4tJorElehKWMH3K1JJ+OFTOL0gQEsLTBvVQejbP4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T06:29:12.401327Z","bundle_sha256":"3c05fc881377a67093474c12246c36fc9aec9f2e56b38f96f85c3669fdff7ec9"}}