{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NQI47J2CI4CYADWZ4XET4TJCXM","short_pith_number":"pith:NQI47J2C","schema_version":"1.0","canonical_sha256":"6c11cfa7424705800ed9e5c93e4d22bb3a9b1200c7b036c8d0ddaae2c79c3494","source":{"kind":"arxiv","id":"1907.10803","version":1},"attestation_state":"computed","paper":{"title":"A Self-Stabilizing Minimal k-Grouping Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo","submitted_at":"2019-07-25T02:23:58Z","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"},"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.10803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-25T02:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"9e74c9ba90157e87c96957e953ca61ca728dcd67cde367445148877ec74d0235","abstract_canon_sha256":"f59b37cc4f8daf9df3b1f10e65916d6aab61437ceaf500eff0f66ebcac0974a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:34.447905Z","signature_b64":"ZdPYE93CoVfSB3tV9USjuFe/2+cbxSgdwHSALcGwd8fACTjvprYJi9TKjwecwkG7p+s1hdYgneQB+pjkZgS0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c11cfa7424705800ed9e5c93e4d22bb3a9b1200c7b036c8d0ddaae2c79c3494","last_reissued_at":"2026-05-17T23:39:34.447306Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:34.447306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Self-Stabilizing Minimal k-Grouping Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo","submitted_at":"2019-07-25T02:23:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10803","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":""},"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.10803","created_at":"2026-05-17T23:39:34.447403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10803v1","created_at":"2026-05-17T23:39:34.447403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10803","created_at":"2026-05-17T23:39:34.447403+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQI47J2CI4CY","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQI47J2CI4CYADWZ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQI47J2C","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM","json":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM.json","graph_json":"https://pith.science/api/pith-number/NQI47J2CI4CYADWZ4XET4TJCXM/graph.json","events_json":"https://pith.science/api/pith-number/NQI47J2CI4CYADWZ4XET4TJCXM/events.json","paper":"https://pith.science/paper/NQI47J2C"},"agent_actions":{"view_html":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM","download_json":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM.json","view_paper":"https://pith.science/paper/NQI47J2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10803&json=true","fetch_graph":"https://pith.science/api/pith-number/NQI47J2CI4CYADWZ4XET4TJCXM/graph.json","fetch_events":"https://pith.science/api/pith-number/NQI47J2CI4CYADWZ4XET4TJCXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM/action/storage_attestation","attest_author":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM/action/author_attestation","sign_citation":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM/action/citation_signature","submit_replication":"https://pith.science/pith/NQI47J2CI4CYADWZ4XET4TJCXM/action/replication_record"}},"created_at":"2026-05-17T23:39:34.447403+00:00","updated_at":"2026-05-17T23:39:34.447403+00:00"}