{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZTHTLSHN27WI3WHOO2BNP3DRMV","short_pith_number":"pith:ZTHTLSHN","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"},"canonical_sha256":"cccf35c8edd7ec8dd8ee7682d7ec71655f2ec4e2b897542e00cca106c2d0e059","source":{"kind":"arxiv","id":"1705.03637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03637","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03637v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03637","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZTHTLSHN27WI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTHTLSHN27WI3WHO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTHTLSHN","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZTHTLSHN27WI3WHOO2BNP3DRMV","target":"record","payload":{"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"},"canonical_sha256":"cccf35c8edd7ec8dd8ee7682d7ec71655f2ec4e2b897542e00cca106c2d0e059","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"},"source_kind":"arxiv","source_id":"1705.03637","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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKC2wA6HkxP+J6yGoXVAddZ4mCT89kI9nR09uJ/ToQrfhGhWzWrm6OALmp2Lu2rqK2NOUbbHTOjCW5tKVnlLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:11:59.365557Z"},"content_sha256":"7d9c77d404df40668a49c6fc6a251a5905d7767449cbe656978fb75b7b80649d","schema_version":"1.0","event_id":"sha256:7d9c77d404df40668a49c6fc6a251a5905d7767449cbe656978fb75b7b80649d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZTHTLSHN27WI3WHOO2BNP3DRMV","target":"graph","payload":{"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"},"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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+CAtFgyEB1tCl/x/yQi8hSQ5upU8Reh9cUmai9f2oS28qLgihzZx77nTkCY4ECr5FqXip3AQUes4+rLYFjvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:11:59.365902Z"},"content_sha256":"f0c095103b73c43813249549dff138c56815d9d5a307e1b3dbcf02c74e1cbd10","schema_version":"1.0","event_id":"sha256:f0c095103b73c43813249549dff138c56815d9d5a307e1b3dbcf02c74e1cbd10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/bundle.json","state_url":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/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-28T12:11:59Z","links":{"resolver":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV","bundle":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/bundle.json","state":"https://pith.science/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTHTLSHN27WI3WHOO2BNP3DRMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZTHTLSHN27WI3WHOO2BNP3DRMV","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":"afc725f04bc19e863b281e4aaa8df0f2b66f5089ea22d1482f9c7e2816f8c205","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T07:35:17Z","title_canon_sha256":"ebeb504e0f31c9725321be08321b6fef5d3798a3f74515806577a5113dac02d5"},"schema_version":"1.0","source":{"id":"1705.03637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03637","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03637v1","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03637","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZTHTLSHN27WI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTHTLSHN27WI3WHO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTHTLSHN","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:f0c095103b73c43813249549dff138c56815d9d5a307e1b3dbcf02c74e1cbd10","target":"graph","created_at":"2026-05-18T00:44:43Z","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":"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","authors_text":"Shahbaz Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T07:35:17Z","title":"Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03637","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:7d9c77d404df40668a49c6fc6a251a5905d7767449cbe656978fb75b7b80649d","target":"record","created_at":"2026-05-18T00:44:43Z","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":"afc725f04bc19e863b281e4aaa8df0f2b66f5089ea22d1482f9c7e2816f8c205","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-10T07:35:17Z","title_canon_sha256":"ebeb504e0f31c9725321be08321b6fef5d3798a3f74515806577a5113dac02d5"},"schema_version":"1.0","source":{"id":"1705.03637","kind":"arxiv","version":1}},"canonical_sha256":"cccf35c8edd7ec8dd8ee7682d7ec71655f2ec4e2b897542e00cca106c2d0e059","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cccf35c8edd7ec8dd8ee7682d7ec71655f2ec4e2b897542e00cca106c2d0e059","first_computed_at":"2026-05-18T00:44:43.382918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.382918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cVmiEQDCypa5ZnUYxshB44EGkR5Wgvc8ujX6a24P7ng81FPiPko1PDO5FuJHwlpOl7cZ+4zQo6BH/4A9ZlXoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.383511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d9c77d404df40668a49c6fc6a251a5905d7767449cbe656978fb75b7b80649d","sha256:f0c095103b73c43813249549dff138c56815d9d5a307e1b3dbcf02c74e1cbd10"],"state_sha256":"ee6e7747a3ad75b21f4988d2fe7ed80a33f3dae5a7da233454f53d0bc985f88f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0l7bI1yisyzUjYm+lXggXOzYF22cggcCjGU1ftGLHoFmavUCXsXhJCRk7Pz9NFbA7Xu+htyTo4kA8xQvjAQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:11:59.367751Z","bundle_sha256":"dccd45623964b0907ae1d4fd2fbd49c4a94cdf86affa3b3d126b8374546ef638"}}