{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JAMWEKK5PYPXYONKOA7ROSNHR6","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":"da5f7e9495c42c0eb423befc6323e118eaa138167c3955538e8c197e6b0996fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T13:36:20Z","title_canon_sha256":"c244ade61b80e4fc5189833902152d453868bfc82e3800795113b33f29ed8ee6"},"schema_version":"1.0","source":{"id":"1502.02481","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02481","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02481v4","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02481","created_at":"2026-05-18T00:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"JAMWEKK5PYPX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JAMWEKK5PYPXYONK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JAMWEKK5","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:6ffdfa06f23e0f5453d6a7319fc8b11f1e6ea234a6f1ded4fee756fe718abde2","target":"graph","created_at":"2026-05-18T00:24:10Z","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 various problems in graphs. It is well known that it takes $O(m+n)$ time to build a DFS tree for a given undirected graph $G=(V,E)$ on $n$ vertices and $m$ edges. We address the problem of maintaining a DFS tree when the graph is undergoing {\\em updates} (insertion and deletion of vertices or edges). We present the following results for this problem.\n  (a) Fault tolerant DFS tree: There exists a data structure of size ${O}(m ~polylog~ n)$ such that given any set ${\\cal F}$ of failed vertices or edges, a DFS tree of the g","authors_text":"Keerti Choudhary, Shahbaz Khan, Shreejit Ray Chaudhury, Surender Baswana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T13:36:20Z","title":"Dynamic DFS Tree in Undirected Graphs: breaking the $O(m)$ barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02481","kind":"arxiv","version":4},"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:c3ddfb46f6fe087278966d442e7c8eb8e6787d1286edbddec99e769198bcdda6","target":"record","created_at":"2026-05-18T00:24:10Z","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":"da5f7e9495c42c0eb423befc6323e118eaa138167c3955538e8c197e6b0996fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T13:36:20Z","title_canon_sha256":"c244ade61b80e4fc5189833902152d453868bfc82e3800795113b33f29ed8ee6"},"schema_version":"1.0","source":{"id":"1502.02481","kind":"arxiv","version":4}},"canonical_sha256":"481962295d7e1f7c39aa703f1749a78f9ea9a48b6293bac71d95d86150df8c44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"481962295d7e1f7c39aa703f1749a78f9ea9a48b6293bac71d95d86150df8c44","first_computed_at":"2026-05-18T00:24:10.632591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:10.632591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eBSBFFw6WFRTvsb+KxLU5LOMOiKQVwt+orUhR1lj6FCdkNW48+5ibzvxQW0Qf21uS19wzgJpbBytcFcQcvFRCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:10.633074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02481","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3ddfb46f6fe087278966d442e7c8eb8e6787d1286edbddec99e769198bcdda6","sha256:6ffdfa06f23e0f5453d6a7319fc8b11f1e6ea234a6f1ded4fee756fe718abde2"],"state_sha256":"b075441b4211405951063ab9cfa7e156f23ef642cb7875599e4af85ab4d324a8"}