{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RAFFIZMDCFQXERC7QWFGEPDOPS","short_pith_number":"pith:RAFFIZMD","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"},"canonical_sha256":"880a546583116172445f858a623c6e7c9d08b37e9cfde426289a4b9fe71404ba","source":{"kind":"arxiv","id":"1409.6277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6277","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6277v2","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6277","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"RAFFIZMDCFQX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RAFFIZMDCFQXERC7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RAFFIZMD","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RAFFIZMDCFQXERC7QWFGEPDOPS","target":"record","payload":{"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"},"canonical_sha256":"880a546583116172445f858a623c6e7c9d08b37e9cfde426289a4b9fe71404ba","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"},"source_kind":"arxiv","source_id":"1409.6277","source_version":2,"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-18T02:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATsUWOkWrDnmh677JpPcZ6D2T08ROVO1RfIV3yHWtwZLdSJ29d0coH4QoeuZ9hFQxxiGyg95Hv/Gofnk9UXzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:34:10.447273Z"},"content_sha256":"9f6ed9f9064befcffa0a215093eedc3396c9f7c0e0c7632bf900fa028268e809","schema_version":"1.0","event_id":"sha256:9f6ed9f9064befcffa0a215093eedc3396c9f7c0e0c7632bf900fa028268e809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RAFFIZMDCFQXERC7QWFGEPDOPS","target":"graph","payload":{"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"},"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-18T02:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCgR40Fm/0OxPD8g0x7Y6bMt9gcoWjjbSt9jFekbvSwdhLXbm4xkLqGNgWoGC/rijfSW1v+x7gCyYCK/dWZyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:34:10.447645Z"},"content_sha256":"931af79beef5daa0a7d4524720031674714ce1b6a429c5af97f4d014ddcba4d4","schema_version":"1.0","event_id":"sha256:931af79beef5daa0a7d4524720031674714ce1b6a429c5af97f4d014ddcba4d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/bundle.json","state_url":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/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-06-03T05:34:10Z","links":{"resolver":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS","bundle":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/bundle.json","state":"https://pith.science/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAFFIZMDCFQXERC7QWFGEPDOPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RAFFIZMDCFQXERC7QWFGEPDOPS","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":"a5e770930d33ebba2b969cdca3785d213ef5c0c557840cccbeb87aec36d9a062","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-22T18:48:27Z","title_canon_sha256":"a93579c796f4c367e652e782ae468af44b2723ac45419cb04fb59b99efb9b266"},"schema_version":"1.0","source":{"id":"1409.6277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6277","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6277v2","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6277","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"RAFFIZMDCFQX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RAFFIZMDCFQXERC7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RAFFIZMD","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:931af79beef5daa0a7d4524720031674714ce1b6a429c5af97f4d014ddcba4d4","target":"graph","created_at":"2026-05-18T02:26:51Z","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 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","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Luigi Laura, Nikos Parotsidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-22T18:48:27Z","title":"2-Vertex Connectivity in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6277","kind":"arxiv","version":2},"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:9f6ed9f9064befcffa0a215093eedc3396c9f7c0e0c7632bf900fa028268e809","target":"record","created_at":"2026-05-18T02:26:51Z","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":"a5e770930d33ebba2b969cdca3785d213ef5c0c557840cccbeb87aec36d9a062","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-22T18:48:27Z","title_canon_sha256":"a93579c796f4c367e652e782ae468af44b2723ac45419cb04fb59b99efb9b266"},"schema_version":"1.0","source":{"id":"1409.6277","kind":"arxiv","version":2}},"canonical_sha256":"880a546583116172445f858a623c6e7c9d08b37e9cfde426289a4b9fe71404ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"880a546583116172445f858a623c6e7c9d08b37e9cfde426289a4b9fe71404ba","first_computed_at":"2026-05-18T02:26:51.449752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:51.449752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OAOwr4mqEVZOoCkEpo2k+4OLOtfar1cUzaDDSi5T0gFmfnIhe0cUdmC03Jf18TZaQcxsxG0FCwpfEFDCAXaNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:51.450117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f6ed9f9064befcffa0a215093eedc3396c9f7c0e0c7632bf900fa028268e809","sha256:931af79beef5daa0a7d4524720031674714ce1b6a429c5af97f4d014ddcba4d4"],"state_sha256":"f035cf6fd7014d40e9a87f09bc97db8ebb28176861337a4b083a13f62b9e78c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGhSMwh6kzunqdNC+YfyLwhLaEqW9Es+xNdmPQPXbMBA09lmWzpL9fcp9QUv0BsQ6kh0w53Kzg7YFryeMi4gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:34:10.449603Z","bundle_sha256":"40495c0336ec1998417eb797610f0846ab884b53a247d052ca07cc0798a06a9f"}}