{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4YJ2NV2RRHYKHCVX6DRXRBHGW5","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":"897c1e21d735cbb9dc8ecd7c4883598bc43a1ac9c5098054d1ba59dd6ff19058","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-07T12:57:40Z","title_canon_sha256":"7cc83278f6d1abe4c69b57f5089e60053fef19558dda237e61ee5d11fa1ab59c"},"schema_version":"1.0","source":{"id":"1705.02613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02613","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02613v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02613","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"4YJ2NV2RRHYK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4YJ2NV2RRHYKHCVX","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4YJ2NV2R","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:4bdd625672629acbf44b424520f86d582dfa1a1be61634d709c4c5a50068d448","target":"graph","created_at":"2026-05-18T00:44:56Z","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 DFS tree of a graph $G$ with $n$ vertices and $m$ edges can be built in $O(m+n)$ time. Till date, only a few algorithms have been designed for maintaining incremental DFS. For undirected graphs, the two algorithms, namely, ADFS1 and ADFS2 [ICALP14] achieve total $O(n^{3/2}\\sqrt{m})$ and $O(n^2)$ time respectively. For DAGs, the only non-trivial algorithm, namely, FDFS [IPL97] requires total $O(mn)$ time.\n  In this paper, we carry out extensive experimental and theoretical evaluation of existing increm","authors_text":"Ayush Goel, Shahbaz Khan, Surender Baswana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-07T12:57:40Z","title":"Incremental DFS algorithms: a theoretical and experimental study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02613","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:9de8e34255c818137dba9693943479ed5e25c7d0aee36b57293610c2704a4170","target":"record","created_at":"2026-05-18T00:44:56Z","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":"897c1e21d735cbb9dc8ecd7c4883598bc43a1ac9c5098054d1ba59dd6ff19058","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-07T12:57:40Z","title_canon_sha256":"7cc83278f6d1abe4c69b57f5089e60053fef19558dda237e61ee5d11fa1ab59c"},"schema_version":"1.0","source":{"id":"1705.02613","kind":"arxiv","version":1}},"canonical_sha256":"e613a6d75189f0a38ab7f0e37884e6b77ab2b024ab61e84a533214faeb5f3d76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e613a6d75189f0a38ab7f0e37884e6b77ab2b024ab61e84a533214faeb5f3d76","first_computed_at":"2026-05-18T00:44:56.053579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:56.053579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YkKdQGghrTgTIczxRIUuxxvKZa/qVmvj0F2mM9PId1fC25p10IoZ/XjUjA8G7nomLq7yO8gQyikv7yPt124zAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:56.054098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9de8e34255c818137dba9693943479ed5e25c7d0aee36b57293610c2704a4170","sha256:4bdd625672629acbf44b424520f86d582dfa1a1be61634d709c4c5a50068d448"],"state_sha256":"10b3e52efc5534709244e39580fdb0bced93cdaebebc93fd71262673eba7ba2d"}