{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MAHK2EUYSV4OH3VCDWMVI6UWPV","short_pith_number":"pith:MAHK2EUY","schema_version":"1.0","canonical_sha256":"600ead12989578e3eea21d99547a967d5e918f330d0fd864e5a8c94cacd405c0","source":{"kind":"arxiv","id":"1401.6000","version":1},"attestation_state":"computed","paper":{"title":"On computing the $2$-vertex-connected components of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2014-01-23T15:22:23Z","abstract_excerpt":"In this paper we consider the problem of computing the $2$-vertex-connected components ($2$-vccs) of directed graphs. We present two new algorithms for solving this problem. The first algorithm runs in $O(mn^{2})$ time, the second in $O(nm)$ time. Furthermore, we show that the old algorithm of Erusalimskii and Svetlov runs in $O(nm^{2})$ time. In this paper, we investigate the relationship between $2$-vccs and dominator trees. We also present an algorithm for computing the $3$-vertex-connected components ($3$-vccs) of a directed graph in $O(n^{3}m)$ time, and we show that the $k$-vertex-connec"},"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":"1401.6000","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-23T15:22:23Z","cross_cats_sorted":[],"title_canon_sha256":"8324a3043b34e7aff2f8c6cd84a5d8b1011cedd875e8519605cc33167745a632","abstract_canon_sha256":"d387df13c1bed55ce1458b52d3483262b7c1378a8cf8e5f8432439df983ef337"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.187528Z","signature_b64":"fWptPWQp36EiJLbfei9L4ZHN1gMzKywkzyaw+N65+dELU2Gmy6VTucWgHRt+ScxoYYFp8Ug0dLojQWhXCvYmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"600ead12989578e3eea21d99547a967d5e918f330d0fd864e5a8c94cacd405c0","last_reissued_at":"2026-05-18T03:01:23.186759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.186759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On computing the $2$-vertex-connected components of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2014-01-23T15:22:23Z","abstract_excerpt":"In this paper we consider the problem of computing the $2$-vertex-connected components ($2$-vccs) of directed graphs. We present two new algorithms for solving this problem. The first algorithm runs in $O(mn^{2})$ time, the second in $O(nm)$ time. Furthermore, we show that the old algorithm of Erusalimskii and Svetlov runs in $O(nm^{2})$ time. In this paper, we investigate the relationship between $2$-vccs and dominator trees. We also present an algorithm for computing the $3$-vertex-connected components ($3$-vccs) of a directed graph in $O(n^{3}m)$ time, and we show that the $k$-vertex-connec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6000","kind":"arxiv","version":1},"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":"1401.6000","created_at":"2026-05-18T03:01:23.186882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6000v1","created_at":"2026-05-18T03:01:23.186882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6000","created_at":"2026-05-18T03:01:23.186882+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAHK2EUYSV4O","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAHK2EUYSV4OH3VC","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAHK2EUY","created_at":"2026-05-18T12:28:38.356838+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/MAHK2EUYSV4OH3VCDWMVI6UWPV","json":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV.json","graph_json":"https://pith.science/api/pith-number/MAHK2EUYSV4OH3VCDWMVI6UWPV/graph.json","events_json":"https://pith.science/api/pith-number/MAHK2EUYSV4OH3VCDWMVI6UWPV/events.json","paper":"https://pith.science/paper/MAHK2EUY"},"agent_actions":{"view_html":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV","download_json":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV.json","view_paper":"https://pith.science/paper/MAHK2EUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6000&json=true","fetch_graph":"https://pith.science/api/pith-number/MAHK2EUYSV4OH3VCDWMVI6UWPV/graph.json","fetch_events":"https://pith.science/api/pith-number/MAHK2EUYSV4OH3VCDWMVI6UWPV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV/action/storage_attestation","attest_author":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV/action/author_attestation","sign_citation":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV/action/citation_signature","submit_replication":"https://pith.science/pith/MAHK2EUYSV4OH3VCDWMVI6UWPV/action/replication_record"}},"created_at":"2026-05-18T03:01:23.186882+00:00","updated_at":"2026-05-18T03:01:23.186882+00:00"}