{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RAFFIZMDCFQXERC7QWFGEPDOPS","short_pith_number":"pith:RAFFIZMD","schema_version":"1.0","canonical_sha256":"880a546583116172445f858a623c6e7c9d08b37e9cfde426289a4b9fe71404ba","source":{"kind":"arxiv","id":"1409.6277","version":2},"attestation_state":"computed","paper":{"title":"2-Vertex Connectivity in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Luigi Laura, Nikos Parotsidis","submitted_at":"2014-09-22T18:48:27Z","abstract_excerpt":"We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex different from v and w leaves v and w in the same strongly connected component. We show how to compute the above relations in linear time so that we can report in constant time if two vertices are 2-vertex-conn"},"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":"1409.6277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-22T18:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"a93579c796f4c367e652e782ae468af44b2723ac45419cb04fb59b99efb9b266","abstract_canon_sha256":"a5e770930d33ebba2b969cdca3785d213ef5c0c557840cccbeb87aec36d9a062"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:51.450117Z","signature_b64":"OAOwr4mqEVZOoCkEpo2k+4OLOtfar1cUzaDDSi5T0gFmfnIhe0cUdmC03Jf18TZaQcxsxG0FCwpfEFDCAXaNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"880a546583116172445f858a623c6e7c9d08b37e9cfde426289a4b9fe71404ba","last_reissued_at":"2026-05-18T02:26:51.449752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:51.449752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-Vertex Connectivity in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Luigi Laura, Nikos Parotsidis","submitted_at":"2014-09-22T18:48:27Z","abstract_excerpt":"We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex different from v and w leaves v and w in the same strongly connected component. We show how to compute the above relations in linear time so that we can report in constant time if two vertices are 2-vertex-conn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6277","kind":"arxiv","version":2},"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":"1409.6277","created_at":"2026-05-18T02:26:51.449808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6277v2","created_at":"2026-05-18T02:26:51.449808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6277","created_at":"2026-05-18T02:26:51.449808+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAFFIZMDCFQX","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAFFIZMDCFQXERC7","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAFFIZMD","created_at":"2026-05-18T12:28:46.137349+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/RAFFIZMDCFQXERC7QWFGEPDOPS","json":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS.json","graph_json":"https://pith.science/api/pith-number/RAFFIZMDCFQXERC7QWFGEPDOPS/graph.json","events_json":"https://pith.science/api/pith-number/RAFFIZMDCFQXERC7QWFGEPDOPS/events.json","paper":"https://pith.science/paper/RAFFIZMD"},"agent_actions":{"view_html":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS","download_json":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS.json","view_paper":"https://pith.science/paper/RAFFIZMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6277&json=true","fetch_graph":"https://pith.science/api/pith-number/RAFFIZMDCFQXERC7QWFGEPDOPS/graph.json","fetch_events":"https://pith.science/api/pith-number/RAFFIZMDCFQXERC7QWFGEPDOPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/action/storage_attestation","attest_author":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/action/author_attestation","sign_citation":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/action/citation_signature","submit_replication":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/action/replication_record"}},"created_at":"2026-05-18T02:26:51.449808+00:00","updated_at":"2026-05-18T02:26:51.449808+00:00"}