{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G3BEYNWEPTCDQKDOQRBYSFOZYH","short_pith_number":"pith:G3BEYNWE","schema_version":"1.0","canonical_sha256":"36c24c36c47cc438286e84438915d9c1eaa8e0b47ac24fe58444b775f24d6695","source":{"kind":"arxiv","id":"1407.3041","version":2},"attestation_state":"computed","paper":{"title":"2-Edge 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-07-11T06:58:07Z","abstract_excerpt":"Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study $2$-edge connectivity problems in directed graphs and, in particular, we consider the computation of the following natural relation: We say that two vertices $v$ and $w$ are $2$-edge-connected if there are two edge-disjoint paths from $v$ to $w$ and two edge-disjoint paths from $w$ to $v$. This relation partitions the vertices into blocks such that all vertices in "},"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":"1407.3041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-11T06:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"df53adbe4bcca2421f5e19e8803d85283913bba7cfb37f2826e78a7609a4339b","abstract_canon_sha256":"7b61943d21589b0fdd8d40d19bf71291444e115b32cf8080eb30f25638797e2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:05.750678Z","signature_b64":"8UYx1acKm+p9kCGHz2zZ/3wYq0MEkqgo7S84hP1kyZO5baDpH5n98iOz9C8X/wtuGJHyV162gKeJ+FD20yWOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36c24c36c47cc438286e84438915d9c1eaa8e0b47ac24fe58444b775f24d6695","last_reissued_at":"2026-05-18T02:46:05.750156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:05.750156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-Edge 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-07-11T06:58:07Z","abstract_excerpt":"Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study $2$-edge connectivity problems in directed graphs and, in particular, we consider the computation of the following natural relation: We say that two vertices $v$ and $w$ are $2$-edge-connected if there are two edge-disjoint paths from $v$ to $w$ and two edge-disjoint paths from $w$ to $v$. This relation partitions the vertices into blocks such that all vertices in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3041","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":"1407.3041","created_at":"2026-05-18T02:46:05.750239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3041v2","created_at":"2026-05-18T02:46:05.750239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3041","created_at":"2026-05-18T02:46:05.750239+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3BEYNWEPTCD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3BEYNWEPTCDQKDO","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3BEYNWE","created_at":"2026-05-18T12:28:28.263976+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/G3BEYNWEPTCDQKDOQRBYSFOZYH","json":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH.json","graph_json":"https://pith.science/api/pith-number/G3BEYNWEPTCDQKDOQRBYSFOZYH/graph.json","events_json":"https://pith.science/api/pith-number/G3BEYNWEPTCDQKDOQRBYSFOZYH/events.json","paper":"https://pith.science/paper/G3BEYNWE"},"agent_actions":{"view_html":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH","download_json":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH.json","view_paper":"https://pith.science/paper/G3BEYNWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3041&json=true","fetch_graph":"https://pith.science/api/pith-number/G3BEYNWEPTCDQKDOQRBYSFOZYH/graph.json","fetch_events":"https://pith.science/api/pith-number/G3BEYNWEPTCDQKDOQRBYSFOZYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH/action/storage_attestation","attest_author":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH/action/author_attestation","sign_citation":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH/action/citation_signature","submit_replication":"https://pith.science/pith/G3BEYNWEPTCDQKDOQRBYSFOZYH/action/replication_record"}},"created_at":"2026-05-18T02:46:05.750239+00:00","updated_at":"2026-05-18T02:46:05.750239+00:00"}