{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZVUDRXQL75CAP3OMPJKFPOOT3S","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":"5e512a0989fc74269a675e63b3df4baa8f8f4e6ebfcd24a93ce16ee5ae4edfd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T20:27:46Z","title_canon_sha256":"4265d138bdc95969a0fa76ed8f9b0fa831aa7ea7e25d7a71a17142a9f56c69ef"},"schema_version":"1.0","source":{"id":"1810.07259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07259","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07259v1","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07259","created_at":"2026-05-18T00:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZVUDRXQL75CA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZVUDRXQL75CAP3OM","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZVUDRXQL","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f1e976dcac1a2e990fe22a01d0e9a830a47be65aeadd33a3d7dd3445b41c444c","target":"graph","created_at":"2026-05-18T00:02:59Z","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":"We design a space-efficient algorithm for performing depth-first search traversal(DFS) of a graph in $O(m+n\\log^* n)$ time using $O(n)$ bits of space. While a normal DFS algorithm results in a DFS-tree (in case the graph is connected), our space bounds do not permit us even to store such a tree. However, our algorithm correctly outputs all edges of the DFS-tree.\n  The previous best algorithm (which used $O(n)$ working space) took $O(m \\log n)$ time (Asano, Izumi, Kiyomi, Konagaya, Ono, Otachi, Schweitzer, Tarui, Uehara (ISAAC 2014) and Elmasry, Hagerup, Krammer (STACS 2015)). The main open que","authors_text":"Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T20:27:46Z","title":"Nearly Optimal Space Efficient Algorithm for Depth First Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07259","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:476a9304e35bfe8da1b49149b8fb7322ee3b364ff7b113cddd067f327cb028a8","target":"record","created_at":"2026-05-18T00:02:59Z","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":"5e512a0989fc74269a675e63b3df4baa8f8f4e6ebfcd24a93ce16ee5ae4edfd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T20:27:46Z","title_canon_sha256":"4265d138bdc95969a0fa76ed8f9b0fa831aa7ea7e25d7a71a17142a9f56c69ef"},"schema_version":"1.0","source":{"id":"1810.07259","kind":"arxiv","version":1}},"canonical_sha256":"cd6838de0bff4407edcc7a5457b9d3dc99a568c6be236d6a6fec8ed94bab724a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd6838de0bff4407edcc7a5457b9d3dc99a568c6be236d6a6fec8ed94bab724a","first_computed_at":"2026-05-18T00:02:59.018354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:59.018354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1nCvBb2KV7wFOFfX41j4y53faHX/x+lNwX+vgxBvG7OEdkgWqZEfOy1VjpC97nhYHuuSFFk1nFeKR14z576bDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:59.018845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:476a9304e35bfe8da1b49149b8fb7322ee3b364ff7b113cddd067f327cb028a8","sha256:f1e976dcac1a2e990fe22a01d0e9a830a47be65aeadd33a3d7dd3445b41c444c"],"state_sha256":"779f968025b1c27a456467e8d637c268675a33f185d5232c986a3b473aa0a714"}