{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XPIMM73VY6VJWWG7QAH2STEWMU","short_pith_number":"pith:XPIMM73V","schema_version":"1.0","canonical_sha256":"bbd0c67f75c7aa9b58df800fa94c966532968170fb1b2843df49151c6b3a8da1","source":{"kind":"arxiv","id":"1907.10937","version":2},"attestation_state":"computed","paper":{"title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Mohsen Ghaffari, V\\'aclav Rozho\\v{n}","submitted_at":"2019-07-25T10:01:49Z","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 "},"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":"1907.10937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T10:01:49Z","cross_cats_sorted":["cs.DC","cs.DM","math.CO"],"title_canon_sha256":"5cda4fed2c78bd50ae1065880b3b7cd2aae41335f44408c0e0d3dcfbfca060fa","abstract_canon_sha256":"28d181ede04147789441405575637e0385c536e3959134c7f15916771f6cde47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:01:35.412019Z","signature_b64":"7m+ecjb6asbnjARC/Yb1nben9jaWUPh77/UyBlk9p/HM1TbEcULUJbcFjY263jix3evP8wINH027gDV25RbuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd0c67f75c7aa9b58df800fa94c966532968170fb1b2843df49151c6b3a8da1","last_reissued_at":"2026-07-05T01:01:35.411487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:01:35.411487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Mohsen Ghaffari, V\\'aclav Rozho\\v{n}","submitted_at":"2019-07-25T10:01:49Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10937","kind":"arxiv","version":2},"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/1907.10937/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":"1907.10937","created_at":"2026-07-05T01:01:35.411558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10937v2","created_at":"2026-07-05T01:01:35.411558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10937","created_at":"2026-07-05T01:01:35.411558+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPIMM73VY6VJ","created_at":"2026-07-05T01:01:35.411558+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPIMM73VY6VJWWG7","created_at":"2026-07-05T01:01:35.411558+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPIMM73V","created_at":"2026-07-05T01:01:35.411558+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11558","citing_title":"Measurable matchings in unbalanced graphs","ref_index":130,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11558","citing_title":"Measurable matchings in unbalanced graphs","ref_index":131,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU","json":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU.json","graph_json":"https://pith.science/api/pith-number/XPIMM73VY6VJWWG7QAH2STEWMU/graph.json","events_json":"https://pith.science/api/pith-number/XPIMM73VY6VJWWG7QAH2STEWMU/events.json","paper":"https://pith.science/paper/XPIMM73V"},"agent_actions":{"view_html":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU","download_json":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU.json","view_paper":"https://pith.science/paper/XPIMM73V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10937&json=true","fetch_graph":"https://pith.science/api/pith-number/XPIMM73VY6VJWWG7QAH2STEWMU/graph.json","fetch_events":"https://pith.science/api/pith-number/XPIMM73VY6VJWWG7QAH2STEWMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU/action/storage_attestation","attest_author":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU/action/author_attestation","sign_citation":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU/action/citation_signature","submit_replication":"https://pith.science/pith/XPIMM73VY6VJWWG7QAH2STEWMU/action/replication_record"}},"created_at":"2026-07-05T01:01:35.411558+00:00","updated_at":"2026-07-05T01:01:35.411558+00:00"}