{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NQI47J2CI4CYADWZ4XET4TJCXM","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":"f59b37cc4f8daf9df3b1f10e65916d6aab61437ceaf500eff0f66ebcac0974a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-25T02:23:58Z","title_canon_sha256":"9e74c9ba90157e87c96957e953ca61ca728dcd67cde367445148877ec74d0235"},"schema_version":"1.0","source":{"id":"1907.10803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10803","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10803v1","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10803","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"pith_short_12","alias_value":"NQI47J2CI4CY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQI47J2CI4CYADWZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQI47J2C","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:eceb44260918dbdd0f532342d5b7a777844eba4fe4f431efe01ffc8d642fefce","target":"graph","created_at":"2026-05-17T23:39:34Z","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"},"paper":{"abstract_excerpt":"We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent self-stabilizing asynchronous distributed algorithm for this problem in the composite atomicity model of computation, assuming the network has unique process identifiers. Our algorithm works under the weakly-fair daemon. The time complexity (i.e., the number of rounds to reach a legitimate configuration) of our algorithm is O(nD/k) where n is the number of processes in","authors_text":"Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-25T02:23:58Z","title":"A Self-Stabilizing Minimal k-Grouping Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10803","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:4866fcd7ac72e959a5c49a4fe4354a508809fecf656eb42b1158ca5fc125adac","target":"record","created_at":"2026-05-17T23:39:34Z","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":"f59b37cc4f8daf9df3b1f10e65916d6aab61437ceaf500eff0f66ebcac0974a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-25T02:23:58Z","title_canon_sha256":"9e74c9ba90157e87c96957e953ca61ca728dcd67cde367445148877ec74d0235"},"schema_version":"1.0","source":{"id":"1907.10803","kind":"arxiv","version":1}},"canonical_sha256":"6c11cfa7424705800ed9e5c93e4d22bb3a9b1200c7b036c8d0ddaae2c79c3494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c11cfa7424705800ed9e5c93e4d22bb3a9b1200c7b036c8d0ddaae2c79c3494","first_computed_at":"2026-05-17T23:39:34.447306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:34.447306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZdPYE93CoVfSB3tV9USjuFe/2+cbxSgdwHSALcGwd8fACTjvprYJi9TKjwecwkG7p+s1hdYgneQB+pjkZgS0Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:34.447905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4866fcd7ac72e959a5c49a4fe4354a508809fecf656eb42b1158ca5fc125adac","sha256:eceb44260918dbdd0f532342d5b7a777844eba4fe4f431efe01ffc8d642fefce"],"state_sha256":"851957d0490d72d8568ce3a2c38a9dc5455a4525eae0ff01538245be1b8a7fbe"}