{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z6GNUDZ7YJRDISBDLQ4BONDBEY","short_pith_number":"pith:Z6GNUDZ7","schema_version":"1.0","canonical_sha256":"cf8cda0f3fc2623448235c38173461263933bd636bb35b8e5420ecbaf34d2981","source":{"kind":"arxiv","id":"1805.04776","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.04776","created_at":"2026-07-05T00:50:23.615363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04776v3","created_at":"2026-07-05T00:50:23.615363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04776","created_at":"2026-07-05T00:50:23.615363+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6GNUDZ7YJRD","created_at":"2026-07-05T00:50:23.615363+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6GNUDZ7YJRDISBD","created_at":"2026-07-05T00:50:23.615363+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6GNUDZ7","created_at":"2026-07-05T00:50:23.615363+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/Z6GNUDZ7YJRDISBDLQ4BONDBEY","json":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY.json","graph_json":"https://pith.science/api/pith-number/Z6GNUDZ7YJRDISBDLQ4BONDBEY/graph.json","events_json":"https://pith.science/api/pith-number/Z6GNUDZ7YJRDISBDLQ4BONDBEY/events.json","paper":"https://pith.science/paper/Z6GNUDZ7"},"agent_actions":{"view_html":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY","download_json":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY.json","view_paper":"https://pith.science/paper/Z6GNUDZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04776&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6GNUDZ7YJRDISBDLQ4BONDBEY/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6GNUDZ7YJRDISBDLQ4BONDBEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/action/storage_attestation","attest_author":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/action/author_attestation","sign_citation":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/action/citation_signature","submit_replication":"https://pith.science/pith/Z6GNUDZ7YJRDISBDLQ4BONDBEY/action/replication_record"}},"created_at":"2026-07-05T00:50:23.615363+00:00","updated_at":"2026-07-05T00:50:23.615363+00:00"}