{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TV3VHI3GHRB4ZPG3NCZ64FEIKD","short_pith_number":"pith:TV3VHI3G","schema_version":"1.0","canonical_sha256":"9d7753a3663c43ccbcdb68b3ee148850cc05109a930a00f375ce5c349d5968ef","source":{"kind":"arxiv","id":"1906.10275","version":1},"attestation_state":"computed","paper":{"title":"2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Abusayeed Saifullah","submitted_at":"2019-06-22T20:55:18Z","abstract_excerpt":"Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity of an asynchronous distributed computer network. It is based on a self-stabilizing depth-first search, and is not a composite algorithm in the sense that it is not composed of a number of self-stabilizing algorithms that run concurrently. The time and space complexities of the algorithm are the same as those of the underlying self-stabilizing depth-first sea"},"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":"1906.10275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-22T20:55:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"04471272570f8f8eda49086e2d9a8252899db4f48c4650396a403e1eb0bb2e83","abstract_canon_sha256":"f018ac764b4d76f0e32374e58e37a08bc83e19c82a8fb380fdd5d450c4773a40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:31.761576Z","signature_b64":"jSGW0ExfSMLhYqfL+tY9K2SGERmWkjNqIVUItnSoPWzTOqysdtFf7UqpIQScM98g3jfOEO+YzZXIZFANP3uOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7753a3663c43ccbcdb68b3ee148850cc05109a930a00f375ce5c349d5968ef","last_reissued_at":"2026-05-17T23:42:31.760912Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:31.760912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Abusayeed Saifullah","submitted_at":"2019-06-22T20:55:18Z","abstract_excerpt":"Self-stabilization for non-masking fault-tolerant distributed system has received considerable research interest over the last decade. In this paper, we propose a self-stabilizing algorithm for 2-edge-connectivity and 2-vertex-connectivity of an asynchronous distributed computer network. It is based on a self-stabilizing depth-first search, and is not a composite algorithm in the sense that it is not composed of a number of self-stabilizing algorithms that run concurrently. The time and space complexities of the algorithm are the same as those of the underlying self-stabilizing depth-first sea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10275","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":"1906.10275","created_at":"2026-05-17T23:42:31.761029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10275v1","created_at":"2026-05-17T23:42:31.761029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10275","created_at":"2026-05-17T23:42:31.761029+00:00"},{"alias_kind":"pith_short_12","alias_value":"TV3VHI3GHRB4","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TV3VHI3GHRB4ZPG3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TV3VHI3G","created_at":"2026-05-18T12:33:30.264802+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/TV3VHI3GHRB4ZPG3NCZ64FEIKD","json":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD.json","graph_json":"https://pith.science/api/pith-number/TV3VHI3GHRB4ZPG3NCZ64FEIKD/graph.json","events_json":"https://pith.science/api/pith-number/TV3VHI3GHRB4ZPG3NCZ64FEIKD/events.json","paper":"https://pith.science/paper/TV3VHI3G"},"agent_actions":{"view_html":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD","download_json":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD.json","view_paper":"https://pith.science/paper/TV3VHI3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10275&json=true","fetch_graph":"https://pith.science/api/pith-number/TV3VHI3GHRB4ZPG3NCZ64FEIKD/graph.json","fetch_events":"https://pith.science/api/pith-number/TV3VHI3GHRB4ZPG3NCZ64FEIKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/action/storage_attestation","attest_author":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/action/author_attestation","sign_citation":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/action/citation_signature","submit_replication":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/action/replication_record"}},"created_at":"2026-05-17T23:42:31.761029+00:00","updated_at":"2026-05-17T23:42:31.761029+00:00"}