{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XPIMM73VY6VJWWG7QAH2STEWMU","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":"28d181ede04147789441405575637e0385c536e3959134c7f15916771f6cde47","cross_cats_sorted":["cs.DC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T10:01:49Z","title_canon_sha256":"5cda4fed2c78bd50ae1065880b3b7cd2aae41335f44408c0e0d3dcfbfca060fa"},"schema_version":"1.0","source":{"id":"1907.10937","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10937","created_at":"2026-07-05T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10937v2","created_at":"2026-07-05T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10937","created_at":"2026-07-05T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"XPIMM73VY6VJ","created_at":"2026-07-05T01:01:35Z"},{"alias_kind":"pith_short_16","alias_value":"XPIMM73VY6VJWWG7","created_at":"2026-07-05T01:01:35Z"},{"alias_kind":"pith_short_8","alias_value":"XPIMM73V","created_at":"2026-07-05T01:01:35Z"}],"graph_snapshots":[{"event_id":"sha256:56c5c6768d8f1bb720ed422f4e7accc7e6c6290a5252c8e98c52f68dab5e966d","target":"graph","created_at":"2026-07-05T01:01:35Z","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/1907.10937/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a simple polylogarithmic-time deterministic distributed algorithm for network decomposition. This improves on a celebrated $2^{O(\\sqrt{\\log n})}$-time algorithm of Panconesi and Srinivasan [STOC'92] and settles a central and long-standing question in distributed graph algorithms. It also leads to the first polylogarithmic-time deterministic distributed algorithms for numerous other problems, hence resolving several well-known and decades-old open problems, including Linial's question about the deterministic complexity of maximal independent set [FOCS'87; SICOMP'92]---which had been ","authors_text":"Mohsen Ghaffari, V\\'aclav Rozho\\v{n}","cross_cats":["cs.DC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T10:01:49Z","title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10937","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:c01eeb23c3b9efbbccfe7006c913d627d1c08887bec6b0c43cf8a5acbeaae1dc","target":"record","created_at":"2026-07-05T01:01:35Z","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":"28d181ede04147789441405575637e0385c536e3959134c7f15916771f6cde47","cross_cats_sorted":["cs.DC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T10:01:49Z","title_canon_sha256":"5cda4fed2c78bd50ae1065880b3b7cd2aae41335f44408c0e0d3dcfbfca060fa"},"schema_version":"1.0","source":{"id":"1907.10937","kind":"arxiv","version":2}},"canonical_sha256":"bbd0c67f75c7aa9b58df800fa94c966532968170fb1b2843df49151c6b3a8da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbd0c67f75c7aa9b58df800fa94c966532968170fb1b2843df49151c6b3a8da1","first_computed_at":"2026-07-05T01:01:35.411487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:01:35.411487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7m+ecjb6asbnjARC/Yb1nben9jaWUPh77/UyBlk9p/HM1TbEcULUJbcFjY263jix3evP8wINH027gDV25RbuDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:01:35.412019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10937","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c01eeb23c3b9efbbccfe7006c913d627d1c08887bec6b0c43cf8a5acbeaae1dc","sha256:56c5c6768d8f1bb720ed422f4e7accc7e6c6290a5252c8e98c52f68dab5e966d"],"state_sha256":"687fb7c1ee08575853bbaaf93c52209e08a704cb913853508f83a87e644b5dc5"}