{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:35ZVGUUPICGYYRKHGGHZPSSOC4","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":"b5bf7aca012479e4d7c44a54c4a1758e07db71b9afcf658123916e41e91de792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-28T10:48:51Z","title_canon_sha256":"cac2b408a58d4b598c13495bc7e33abd5b4e0d08948fb3be2d75accc479f9cf1"},"schema_version":"1.0","source":{"id":"1606.08645","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08645","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08645v3","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08645","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"35ZVGUUPICGY","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"35ZVGUUPICGYYRKH","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"35ZVGUUP","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:ea03a2734035e6a81a4fcbc432aa8e3df623a7a1776e2173495b36f252f99264","target":"graph","created_at":"2026-05-18T00:39:23Z","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 consider space efficient implementations of some classical applications of DFS including the problem of testing biconnectivity and $2$-edge connectivity, finding cut vertices and cut edges, computing chain decomposition and $st$-numbering of a given undirected graph $G$ on $n$ vertices and $m$ edges. Classical algorithms for them typically use DFS and some $\\Omega (\\lg n)$ bits\\footnote{We use $\\lg$ to denote logarithm to the base $2$.} of information at each vertex. Building on a recent $O(n)$-bits implementation of DFS due to Elmasry et al. (STACS 2015) we provide $O(n)$-bit implementatio","authors_text":"Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-28T10:48:51Z","title":"Biconnectivity, $st$-numbering and other applications of DFS using $O(n)$ bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08645","kind":"arxiv","version":3},"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:2aed3001eb39b7b5265b5df5d64c3088a157621505469f90c781dc0c4729abd3","target":"record","created_at":"2026-05-18T00:39:23Z","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":"b5bf7aca012479e4d7c44a54c4a1758e07db71b9afcf658123916e41e91de792","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-28T10:48:51Z","title_canon_sha256":"cac2b408a58d4b598c13495bc7e33abd5b4e0d08948fb3be2d75accc479f9cf1"},"schema_version":"1.0","source":{"id":"1606.08645","kind":"arxiv","version":3}},"canonical_sha256":"df7353528f408d8c4547318f97ca4e172aa051df03e604342cd489ceba62e036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df7353528f408d8c4547318f97ca4e172aa051df03e604342cd489ceba62e036","first_computed_at":"2026-05-18T00:39:23.085826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:23.085826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dTM1Pa6OgwYMA+ux9sprzPi++ZYTc2YcnA1/IR3cF709DnmHLaiploGh7uzfJtxUX58a4cpRPPGxYlVn3qQLAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:23.086669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08645","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aed3001eb39b7b5265b5df5d64c3088a157621505469f90c781dc0c4729abd3","sha256:ea03a2734035e6a81a4fcbc432aa8e3df623a7a1776e2173495b36f252f99264"],"state_sha256":"e0b09da48c9b506174392a22972d1f019999c1897fb178e74aee8c16878c98ed"}