{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3U74FXU3WGKKYTGFYL5BBL3353","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":"bbf2cc3f9a1d6c348f2fe3fa9e59fb8ea458f7cee289399d2f8c9572ed20203d","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-03-28T15:18:57Z","title_canon_sha256":"acad2b9158236fd7889f8618b0d83606d4f1455ebeadfe09519fdae82d606a3a"},"schema_version":"1.0","source":{"id":"2303.16043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16043","created_at":"2026-07-05T05:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16043v1","created_at":"2026-07-05T05:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16043","created_at":"2026-07-05T05:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"3U74FXU3WGKK","created_at":"2026-07-05T05:55:31Z"},{"alias_kind":"pith_short_16","alias_value":"3U74FXU3WGKKYTGF","created_at":"2026-07-05T05:55:31Z"},{"alias_kind":"pith_short_8","alias_value":"3U74FXU3","created_at":"2026-07-05T05:55:31Z"}],"graph_snapshots":[{"event_id":"sha256:a469366502e36f7a7181a3201af8149a026170aa7e0c3005370072be4880a6bf","target":"graph","created_at":"2026-07-05T05:55:31Z","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/2303.16043/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"$ \\renewcommand{\\tilde}{\\widetilde} $We present an $\\tilde{O}(\\log^2 n)$ round deterministic distributed algorithm for the maximal independent set problem. By known reductions, this round complexity extends also to maximal matching, $\\Delta+1$ vertex coloring, and $2\\Delta-1$ edge coloring. These four problems are among the most central problems in distributed graph algorithms and have been studied extensively for the past four decades. This improved round complexity comes closer to the $\\tilde{\\Omega}(\\log n)$ lower bound of maximal independent set and maximal matching [Balliu et al. FOCS '19","authors_text":"Christoph Grunau, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-03-28T15:18:57Z","title":"Faster Deterministic Distributed MIS and Approximate Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16043","kind":"arxiv","version":1},"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:21e0c87b41a07473e2feff55b7f9fd6b360fc08fcc12d1ac4ce847a74a3843a1","target":"record","created_at":"2026-07-05T05:55:31Z","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":"bbf2cc3f9a1d6c348f2fe3fa9e59fb8ea458f7cee289399d2f8c9572ed20203d","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-03-28T15:18:57Z","title_canon_sha256":"acad2b9158236fd7889f8618b0d83606d4f1455ebeadfe09519fdae82d606a3a"},"schema_version":"1.0","source":{"id":"2303.16043","kind":"arxiv","version":1}},"canonical_sha256":"dd3fc2de9bb194ac4cc5c2fa10af7beee0433db7ffd6e5c629df7c107ccfc70f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd3fc2de9bb194ac4cc5c2fa10af7beee0433db7ffd6e5c629df7c107ccfc70f","first_computed_at":"2026-07-05T05:55:31.135038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:55:31.135038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7s5OKaMx7lpmDLJ9CFa7yiT94LNeR8gXhBFwKofgmYKUzzv6s5qBbLpy3NqMYr/vLP0kVDnWO9GspLIjQG5BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:55:31.135513Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.16043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21e0c87b41a07473e2feff55b7f9fd6b360fc08fcc12d1ac4ce847a74a3843a1","sha256:a469366502e36f7a7181a3201af8149a026170aa7e0c3005370072be4880a6bf"],"state_sha256":"f981eefede42824d03794febb4c98a9aeb81f00bc2b2184da7baa511f66469f4"}