{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZTHTLSHN27WI3WHOO2BNP3DRMV","short_pith_number":"pith:ZTHTLSHN","schema_version":"1.0","canonical_sha256":"cccf35c8edd7ec8dd8ee7682d7ec71655f2ec4e2b897542e00cca106c2d0e059","source":{"kind":"arxiv","id":"1705.03637","version":1},"attestation_state":"computed","paper":{"title":"Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shahbaz Khan","submitted_at":"2017-05-10T07:35:17Z","abstract_excerpt":"Depth first search (DFS) tree is a fundamental data structure for solving graph problems. The classical algorithm [SiComp74] for building a DFS tree requires $O(m+n)$ time for a given graph $G$ having $n$ vertices and $m$ edges. Recently, Baswana et al. [SODA16] presented a simple algorithm for updating DFS tree of an undirected graph after an edge/vertex update in $\\tilde{O}(n)$ time. However, their algorithm is strictly sequential. We present an algorithm achieving similar bounds, that can be adopted easily to the parallel environment.\n  In the parallel model, a DFS tree can be computed from"},"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":"1705.03637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T07:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"ebeb504e0f31c9725321be08321b6fef5d3798a3f74515806577a5113dac02d5","abstract_canon_sha256":"afc725f04bc19e863b281e4aaa8df0f2b66f5089ea22d1482f9c7e2816f8c205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.383511Z","signature_b64":"cVmiEQDCypa5ZnUYxshB44EGkR5Wgvc8ujX6a24P7ng81FPiPko1PDO5FuJHwlpOl7cZ+4zQo6BH/4A9ZlXoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cccf35c8edd7ec8dd8ee7682d7ec71655f2ec4e2b897542e00cca106c2d0e059","last_reissued_at":"2026-05-18T00:44:43.382918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.382918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shahbaz Khan","submitted_at":"2017-05-10T07:35:17Z","abstract_excerpt":"Depth first search (DFS) tree is a fundamental data structure for solving graph problems. The classical algorithm [SiComp74] for building a DFS tree requires $O(m+n)$ time for a given graph $G$ having $n$ vertices and $m$ edges. Recently, Baswana et al. [SODA16] presented a simple algorithm for updating DFS tree of an undirected graph after an edge/vertex update in $\\tilde{O}(n)$ time. However, their algorithm is strictly sequential. We present an algorithm achieving similar bounds, that can be adopted easily to the parallel environment.\n  In the parallel model, a DFS tree can be computed from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03637","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":"1705.03637","created_at":"2026-05-18T00:44:43.382995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03637v1","created_at":"2026-05-18T00:44:43.382995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03637","created_at":"2026-05-18T00:44:43.382995+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTHTLSHN27WI","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTHTLSHN27WI3WHO","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTHTLSHN","created_at":"2026-05-18T12:31:59.375834+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/ZTHTLSHN27WI3WHOO2BNP3DRMV","json":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV.json","graph_json":"https://pith.science/api/pith-number/ZTHTLSHN27WI3WHOO2BNP3DRMV/graph.json","events_json":"https://pith.science/api/pith-number/ZTHTLSHN27WI3WHOO2BNP3DRMV/events.json","paper":"https://pith.science/paper/ZTHTLSHN"},"agent_actions":{"view_html":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV","download_json":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV.json","view_paper":"https://pith.science/paper/ZTHTLSHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03637&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTHTLSHN27WI3WHOO2BNP3DRMV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTHTLSHN27WI3WHOO2BNP3DRMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/action/storage_attestation","attest_author":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/action/author_attestation","sign_citation":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/action/citation_signature","submit_replication":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/action/replication_record"}},"created_at":"2026-05-18T00:44:43.382995+00:00","updated_at":"2026-05-18T00:44:43.382995+00:00"}