{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JAMWEKK5PYPXYONKOA7ROSNHR6","short_pith_number":"pith:JAMWEKK5","schema_version":"1.0","canonical_sha256":"481962295d7e1f7c39aa703f1749a78f9ea9a48b6293bac71d95d86150df8c44","source":{"kind":"arxiv","id":"1502.02481","version":4},"attestation_state":"computed","paper":{"title":"Dynamic DFS Tree in Undirected Graphs: breaking the $O(m)$ barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keerti Choudhary, Shahbaz Khan, Shreejit Ray Chaudhury, Surender Baswana","submitted_at":"2015-02-09T13:36:20Z","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"},"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":"1502.02481","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-09T13:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"c244ade61b80e4fc5189833902152d453868bfc82e3800795113b33f29ed8ee6","abstract_canon_sha256":"da5f7e9495c42c0eb423befc6323e118eaa138167c3955538e8c197e6b0996fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:10.633074Z","signature_b64":"eBSBFFw6WFRTvsb+KxLU5LOMOiKQVwt+orUhR1lj6FCdkNW48+5ibzvxQW0Qf21uS19wzgJpbBytcFcQcvFRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"481962295d7e1f7c39aa703f1749a78f9ea9a48b6293bac71d95d86150df8c44","last_reissued_at":"2026-05-18T00:24:10.632591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:10.632591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic DFS Tree in Undirected Graphs: breaking the $O(m)$ barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keerti Choudhary, Shahbaz Khan, Shreejit Ray Chaudhury, Surender Baswana","submitted_at":"2015-02-09T13:36:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02481","kind":"arxiv","version":4},"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":"1502.02481","created_at":"2026-05-18T00:24:10.632672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02481v4","created_at":"2026-05-18T00:24:10.632672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02481","created_at":"2026-05-18T00:24:10.632672+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAMWEKK5PYPX","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAMWEKK5PYPXYONK","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAMWEKK5","created_at":"2026-05-18T12:29:27.538025+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/JAMWEKK5PYPXYONKOA7ROSNHR6","json":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6.json","graph_json":"https://pith.science/api/pith-number/JAMWEKK5PYPXYONKOA7ROSNHR6/graph.json","events_json":"https://pith.science/api/pith-number/JAMWEKK5PYPXYONKOA7ROSNHR6/events.json","paper":"https://pith.science/paper/JAMWEKK5"},"agent_actions":{"view_html":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6","download_json":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6.json","view_paper":"https://pith.science/paper/JAMWEKK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02481&json=true","fetch_graph":"https://pith.science/api/pith-number/JAMWEKK5PYPXYONKOA7ROSNHR6/graph.json","fetch_events":"https://pith.science/api/pith-number/JAMWEKK5PYPXYONKOA7ROSNHR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6/action/storage_attestation","attest_author":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6/action/author_attestation","sign_citation":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6/action/citation_signature","submit_replication":"https://pith.science/pith/JAMWEKK5PYPXYONKOA7ROSNHR6/action/replication_record"}},"created_at":"2026-05-18T00:24:10.632672+00:00","updated_at":"2026-05-18T00:24:10.632672+00:00"}