{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TV3VHI3GHRB4ZPG3NCZ64FEIKD","short_pith_number":"pith:TV3VHI3G","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"},"canonical_sha256":"9d7753a3663c43ccbcdb68b3ee148850cc05109a930a00f375ce5c349d5968ef","source":{"kind":"arxiv","id":"1906.10275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10275","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10275v1","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10275","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"pith_short_12","alias_value":"TV3VHI3GHRB4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TV3VHI3GHRB4ZPG3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TV3VHI3G","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TV3VHI3GHRB4ZPG3NCZ64FEIKD","target":"record","payload":{"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"},"canonical_sha256":"9d7753a3663c43ccbcdb68b3ee148850cc05109a930a00f375ce5c349d5968ef","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"},"source_kind":"arxiv","source_id":"1906.10275","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3WKcVRyCFhI2BrYTtzZHbS4fjSUwp3L6Qwi2BvJlgQGRSN1Lrqcr16litJ1esddr4fV7zh9JZr7kMXviQenAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:51:34.899560Z"},"content_sha256":"ebd6d18f2f5bc0227520e1c24ae9ca7a6035ff7f7f5e7d9583d9b0c77039c064","schema_version":"1.0","event_id":"sha256:ebd6d18f2f5bc0227520e1c24ae9ca7a6035ff7f7f5e7d9583d9b0c77039c064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TV3VHI3GHRB4ZPG3NCZ64FEIKD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yvuhxb8rE463pAyMxYj10SqoxngrCtebS2KR2gZ4UWkHh6iOLJ/m8P7ZReypxbMh95zg6MDHE9clOGZ/R/dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:51:34.899909Z"},"content_sha256":"a95d49fdcb87252ae0a42a1192992b2436fc80d11f67c03d95f4f5f1773ea189","schema_version":"1.0","event_id":"sha256:a95d49fdcb87252ae0a42a1192992b2436fc80d11f67c03d95f4f5f1773ea189"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/bundle.json","state_url":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T10:51:34Z","links":{"resolver":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD","bundle":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/bundle.json","state":"https://pith.science/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV3VHI3GHRB4ZPG3NCZ64FEIKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TV3VHI3GHRB4ZPG3NCZ64FEIKD","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":"f018ac764b4d76f0e32374e58e37a08bc83e19c82a8fb380fdd5d450c4773a40","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-22T20:55:18Z","title_canon_sha256":"04471272570f8f8eda49086e2d9a8252899db4f48c4650396a403e1eb0bb2e83"},"schema_version":"1.0","source":{"id":"1906.10275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10275","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10275v1","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10275","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"pith_short_12","alias_value":"TV3VHI3GHRB4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TV3VHI3GHRB4ZPG3","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TV3VHI3G","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:a95d49fdcb87252ae0a42a1192992b2436fc80d11f67c03d95f4f5f1773ea189","target":"graph","created_at":"2026-05-17T23:42:31Z","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":"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","authors_text":"Abusayeed Saifullah","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-22T20:55:18Z","title":"2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10275","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:ebd6d18f2f5bc0227520e1c24ae9ca7a6035ff7f7f5e7d9583d9b0c77039c064","target":"record","created_at":"2026-05-17T23:42:31Z","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":"f018ac764b4d76f0e32374e58e37a08bc83e19c82a8fb380fdd5d450c4773a40","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-22T20:55:18Z","title_canon_sha256":"04471272570f8f8eda49086e2d9a8252899db4f48c4650396a403e1eb0bb2e83"},"schema_version":"1.0","source":{"id":"1906.10275","kind":"arxiv","version":1}},"canonical_sha256":"9d7753a3663c43ccbcdb68b3ee148850cc05109a930a00f375ce5c349d5968ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d7753a3663c43ccbcdb68b3ee148850cc05109a930a00f375ce5c349d5968ef","first_computed_at":"2026-05-17T23:42:31.760912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:31.760912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jSGW0ExfSMLhYqfL+tY9K2SGERmWkjNqIVUItnSoPWzTOqysdtFf7UqpIQScM98g3jfOEO+YzZXIZFANP3uOBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:31.761576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebd6d18f2f5bc0227520e1c24ae9ca7a6035ff7f7f5e7d9583d9b0c77039c064","sha256:a95d49fdcb87252ae0a42a1192992b2436fc80d11f67c03d95f4f5f1773ea189"],"state_sha256":"58bdc04cbbe42986086e2578534ba55c90c35484cb196bdbee4407acf51d34f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DEU1XiC+yj7kNqHkfXpBGDyBQ0FWpWDUh6EyblSY5D1A47uT3hKaXAsO1Vyhjg45124vQLUUtiTTMQNtGmjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T10:51:34.901850Z","bundle_sha256":"4d78bf931eebef79793251239276e7b0c08772a30d444adddb2bc70faf4f6fac"}}