{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OYHBLBEBJXGRBETLEMQSPVHIOA","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":"f7f5c2e6b27133a6f587c6fad0b51c5e63075d7b2aee321cf7e60aeeac340b05","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-25T12:41:04Z","title_canon_sha256":"b0d88af84bcc80735bedf8463056d7e15973d1c68b5a14b4a0e72b12fdd85e10"},"schema_version":"1.0","source":{"id":"2410.19516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.19516","created_at":"2026-07-05T09:25:57Z"},{"alias_kind":"arxiv_version","alias_value":"2410.19516v1","created_at":"2026-07-05T09:25:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19516","created_at":"2026-07-05T09:25:57Z"},{"alias_kind":"pith_short_12","alias_value":"OYHBLBEBJXGR","created_at":"2026-07-05T09:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"OYHBLBEBJXGRBETL","created_at":"2026-07-05T09:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"OYHBLBEB","created_at":"2026-07-05T09:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:63b5bccda7ed1057b14497bc7ba234cd9ef8cdbe6595edf945072dba705ce446","target":"graph","created_at":"2026-07-05T09:25:57Z","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/2410.19516/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper improves and in two cases nearly settles, up to logarithmically lower-order factors, the deterministic complexity of some of the most central problems in distributed graph algorithms, which have been studied for over three decades:\n  Near-Optimal Network Decomposition: We present a deterministic distributed algorithm that computes a network decomposition in approximately O(log^2 n) rounds, with O(log n) diameter and O(log n) colors. This round complexity is near-optimal in the following sense: even given an ideal network decomposition, using it (in the standard way) requires round c","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":"2024-10-25T12:41:04Z","title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19516","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:62ce7343c06d5e81e8f47ce2c54a86721a9eab657c00ff50b8e74f6504e8d040","target":"record","created_at":"2026-07-05T09:25:57Z","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":"f7f5c2e6b27133a6f587c6fad0b51c5e63075d7b2aee321cf7e60aeeac340b05","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-25T12:41:04Z","title_canon_sha256":"b0d88af84bcc80735bedf8463056d7e15973d1c68b5a14b4a0e72b12fdd85e10"},"schema_version":"1.0","source":{"id":"2410.19516","kind":"arxiv","version":1}},"canonical_sha256":"760e1584814dcd10926b232127d4e8701986daf86c15e164ad734ecef0e389e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"760e1584814dcd10926b232127d4e8701986daf86c15e164ad734ecef0e389e7","first_computed_at":"2026-07-05T09:25:57.750278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:57.750278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vnkFoPa794knGfKoc6575lCnmvy14PrhuAarOijX9bBJHjd6qn1sfO4DTT5R/Atb2I1gvLMFg+e1kDz0PWhPCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:57.750732Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.19516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62ce7343c06d5e81e8f47ce2c54a86721a9eab657c00ff50b8e74f6504e8d040","sha256:63b5bccda7ed1057b14497bc7ba234cd9ef8cdbe6595edf945072dba705ce446"],"state_sha256":"7fc3d5b64fc5c82333d7fa1499aefc6bef8bed08b04215674a690c8ed655765d"}