{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OYHBLBEBJXGRBETLEMQSPVHIOA","short_pith_number":"pith:OYHBLBEB","schema_version":"1.0","canonical_sha256":"760e1584814dcd10926b232127d4e8701986daf86c15e164ad734ecef0e389e7","source":{"kind":"arxiv","id":"2410.19516","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christoph Grunau, Mohsen Ghaffari","submitted_at":"2024-10-25T12:41:04Z","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"},"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":"2410.19516","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-10-25T12:41:04Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b0d88af84bcc80735bedf8463056d7e15973d1c68b5a14b4a0e72b12fdd85e10","abstract_canon_sha256":"f7f5c2e6b27133a6f587c6fad0b51c5e63075d7b2aee321cf7e60aeeac340b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:57.750732Z","signature_b64":"vnkFoPa794knGfKoc6575lCnmvy14PrhuAarOijX9bBJHjd6qn1sfO4DTT5R/Atb2I1gvLMFg+e1kDz0PWhPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"760e1584814dcd10926b232127d4e8701986daf86c15e164ad734ecef0e389e7","last_reissued_at":"2026-07-05T09:25:57.750278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:57.750278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christoph Grunau, Mohsen Ghaffari","submitted_at":"2024-10-25T12:41:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19516","kind":"arxiv","version":1},"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/2410.19516/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":"2410.19516","created_at":"2026-07-05T09:25:57.750348+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.19516v1","created_at":"2026-07-05T09:25:57.750348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19516","created_at":"2026-07-05T09:25:57.750348+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYHBLBEBJXGR","created_at":"2026-07-05T09:25:57.750348+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYHBLBEBJXGRBETL","created_at":"2026-07-05T09:25:57.750348+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYHBLBEB","created_at":"2026-07-05T09:25:57.750348+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":60,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11558","citing_title":"Measurable matchings in unbalanced graphs","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA","json":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA.json","graph_json":"https://pith.science/api/pith-number/OYHBLBEBJXGRBETLEMQSPVHIOA/graph.json","events_json":"https://pith.science/api/pith-number/OYHBLBEBJXGRBETLEMQSPVHIOA/events.json","paper":"https://pith.science/paper/OYHBLBEB"},"agent_actions":{"view_html":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA","download_json":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA.json","view_paper":"https://pith.science/paper/OYHBLBEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.19516&json=true","fetch_graph":"https://pith.science/api/pith-number/OYHBLBEBJXGRBETLEMQSPVHIOA/graph.json","fetch_events":"https://pith.science/api/pith-number/OYHBLBEBJXGRBETLEMQSPVHIOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA/action/storage_attestation","attest_author":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA/action/author_attestation","sign_citation":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA/action/citation_signature","submit_replication":"https://pith.science/pith/OYHBLBEBJXGRBETLEMQSPVHIOA/action/replication_record"}},"created_at":"2026-07-05T09:25:57.750348+00:00","updated_at":"2026-07-05T09:25:57.750348+00:00"}