{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:35ZVGUUPICGYYRKHGGHZPSSOC4","short_pith_number":"pith:35ZVGUUP","schema_version":"1.0","canonical_sha256":"df7353528f408d8c4547318f97ca4e172aa051df03e604342cd489ceba62e036","source":{"kind":"arxiv","id":"1606.08645","version":3},"attestation_state":"computed","paper":{"title":"Biconnectivity, $st$-numbering and other applications of DFS using $O(n)$ bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","submitted_at":"2016-06-28T10:48:51Z","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"},"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":"1606.08645","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-28T10:48:51Z","cross_cats_sorted":[],"title_canon_sha256":"cac2b408a58d4b598c13495bc7e33abd5b4e0d08948fb3be2d75accc479f9cf1","abstract_canon_sha256":"b5bf7aca012479e4d7c44a54c4a1758e07db71b9afcf658123916e41e91de792"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.086669Z","signature_b64":"dTM1Pa6OgwYMA+ux9sprzPi++ZYTc2YcnA1/IR3cF709DnmHLaiploGh7uzfJtxUX58a4cpRPPGxYlVn3qQLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7353528f408d8c4547318f97ca4e172aa051df03e604342cd489ceba62e036","last_reissued_at":"2026-05-18T00:39:23.085826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.085826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Biconnectivity, $st$-numbering and other applications of DFS using $O(n)$ bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sankardeep Chakraborty, Srinivasa Rao Satti, Venkatesh Raman","submitted_at":"2016-06-28T10:48:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08645","kind":"arxiv","version":3},"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":"1606.08645","created_at":"2026-05-18T00:39:23.085978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08645v3","created_at":"2026-05-18T00:39:23.085978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08645","created_at":"2026-05-18T00:39:23.085978+00:00"},{"alias_kind":"pith_short_12","alias_value":"35ZVGUUPICGY","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"35ZVGUUPICGYYRKH","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"35ZVGUUP","created_at":"2026-05-18T12:29:55.572404+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/35ZVGUUPICGYYRKHGGHZPSSOC4","json":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4.json","graph_json":"https://pith.science/api/pith-number/35ZVGUUPICGYYRKHGGHZPSSOC4/graph.json","events_json":"https://pith.science/api/pith-number/35ZVGUUPICGYYRKHGGHZPSSOC4/events.json","paper":"https://pith.science/paper/35ZVGUUP"},"agent_actions":{"view_html":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4","download_json":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4.json","view_paper":"https://pith.science/paper/35ZVGUUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08645&json=true","fetch_graph":"https://pith.science/api/pith-number/35ZVGUUPICGYYRKHGGHZPSSOC4/graph.json","fetch_events":"https://pith.science/api/pith-number/35ZVGUUPICGYYRKHGGHZPSSOC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/action/storage_attestation","attest_author":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/action/author_attestation","sign_citation":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/action/citation_signature","submit_replication":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/action/replication_record"}},"created_at":"2026-05-18T00:39:23.085978+00:00","updated_at":"2026-05-18T00:39:23.085978+00:00"}