{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:35ZVGUUPICGYYRKHGGHZPSSOC4","short_pith_number":"pith:35ZVGUUP","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"},"canonical_sha256":"df7353528f408d8c4547318f97ca4e172aa051df03e604342cd489ceba62e036","source":{"kind":"arxiv","id":"1606.08645","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:35ZVGUUPICGYYRKHGGHZPSSOC4","target":"record","payload":{"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"},"canonical_sha256":"df7353528f408d8c4547318f97ca4e172aa051df03e604342cd489ceba62e036","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"},"source_kind":"arxiv","source_id":"1606.08645","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIm5LqeED9+rFupgSHNliKECHPSsH/T/Lvoikkr2yzhb3WDaPrVcuv7mDLC651X4lHl2o7Ka36yWLLzyP5BVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:46:54.434175Z"},"content_sha256":"2aed3001eb39b7b5265b5df5d64c3088a157621505469f90c781dc0c4729abd3","schema_version":"1.0","event_id":"sha256:2aed3001eb39b7b5265b5df5d64c3088a157621505469f90c781dc0c4729abd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:35ZVGUUPICGYYRKHGGHZPSSOC4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alb6PgiOHATTXmyasWMZfrsqd42+vkT/6if3P92tHdWVWwHgUKjYPST5uvgvewFVgfg9fVNB/aexXyECKfAuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T13:46:54.434637Z"},"content_sha256":"ea03a2734035e6a81a4fcbc432aa8e3df623a7a1776e2173495b36f252f99264","schema_version":"1.0","event_id":"sha256:ea03a2734035e6a81a4fcbc432aa8e3df623a7a1776e2173495b36f252f99264"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/bundle.json","state_url":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T13:46:54Z","links":{"resolver":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4","bundle":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/bundle.json","state":"https://pith.science/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35ZVGUUPICGYYRKHGGHZPSSOC4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHiiOyoRezkPuz8r+VGSqOn8qs7i6Jnkm42gWSQIcA50LQRnoV/9Ma0ufTZxT79nirv8EUcH8cHjglsmlcVUDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T13:46:54.437480Z","bundle_sha256":"7547dfe32bc09a6ada1f34dbe0c18cf4446739002864161ee3a556caf7b6a069"}}