{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6SY3NRYCPH77PEW6TXO67UUZP7","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":"c979ec96eee489fb250bd72d9df279c5b022455d1d4197a8944f27c452598b3e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T13:05:30Z","title_canon_sha256":"0b91e5067d774fd3a11f1483d38dba7c334f6b6a74d385e9e643abd55372b7bf"},"schema_version":"1.0","source":{"id":"1711.01871","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01871","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01871v2","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01871","created_at":"2026-05-18T00:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"6SY3NRYCPH77","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6SY3NRYCPH77PEW6","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6SY3NRYC","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:ed9ea0faa13a7813d4aaa37c06bd1cf0c570619b476ad5662bf1e3a8597f2217","target":"graph","created_at":"2026-05-18T00:19: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) -- have advanced our understanding of one of the most fundamental questions in theory of distributed computing: what are the possible time complexity classes of LCL problems in the LOCAL model? In essence, we have a graph problem $\\Pi$ in which a solution can be verified by checking all radius-$O(1)$ neighbourhoods, and the question is what is the smallest $T$ such that a solution can be computed so that each node chooses it","authors_text":"Alkida Balliu, Dennis Olivetti, Janne H. Korhonen, Juho Hirvonen, Jukka Suomela, Tuomo Lempi\\\"ainen","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T13:05:30Z","title":"New Classes of Distributed Time Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01871","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:043043e651ae6766dd5f5ff206a379a0f60d590690ac8fccab6e3d6bd09b3534","target":"record","created_at":"2026-05-18T00:19: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":"c979ec96eee489fb250bd72d9df279c5b022455d1d4197a8944f27c452598b3e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T13:05:30Z","title_canon_sha256":"0b91e5067d774fd3a11f1483d38dba7c334f6b6a74d385e9e643abd55372b7bf"},"schema_version":"1.0","source":{"id":"1711.01871","kind":"arxiv","version":2}},"canonical_sha256":"f4b1b6c70279fff792de9dddefd2997fd47b629f779292518b932a38fb66ff24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4b1b6c70279fff792de9dddefd2997fd47b629f779292518b932a38fb66ff24","first_computed_at":"2026-05-18T00:19:13.629088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:13.629088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b/Gi8ntAG5RwftvBF4QXaClAjTWUvdtengZF+HCz/poZ8S84IDvGR6F0DxTGz/Qg+GRCnf/9C/g3uH/eZD+mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:13.629706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01871","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:043043e651ae6766dd5f5ff206a379a0f60d590690ac8fccab6e3d6bd09b3534","sha256:ed9ea0faa13a7813d4aaa37c06bd1cf0c570619b476ad5662bf1e3a8597f2217"],"state_sha256":"d5c2853c1d229f851bbc6134c1cff2c1c13f764cc15c6a49be9b11d31edf0de9"}