{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NEMMTJFVPGGEWFZKR6HFVRJU5Y","short_pith_number":"pith:NEMMTJFV","schema_version":"1.0","canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","source":{"kind":"arxiv","id":"1607.07073","version":1},"attestation_state":"computed","paper":{"title":"Incremental $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, Nikos Parotsidis","submitted_at":"2016-07-24T17:47:11Z","abstract_excerpt":"In this paper, we initiate the study of the dynamic maintenance of $2$-edge-connectivity relationships in directed graphs. We present an algorithm that can update the $2$-edge-connected blocks of a directed graph with $n$ vertices through a sequence of $m$ edge insertions in a total of $O(mn)$ time. After each insertion, we can answer the following queries in asymptotically optimal time: (i) Test in constant time if two query vertices $v$ and $w$ are $2$-edge-connected. Moreover, if $v$ and $w$ are not $2$-edge-connected, we can produce in constant time a \"witness\" of this property, by exhibit"},"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":"1607.07073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-24T17:47:11Z","cross_cats_sorted":[],"title_canon_sha256":"277b4add4d3c1e47e0da87daf8765ae2f9ed9c62a8a57789e90852078859163e","abstract_canon_sha256":"ac2d58517849af1aa8c54c5eed698c2f6cafbbc3fb730e8c5c0b4c41fe44a93a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:34.893372Z","signature_b64":"cbo13fNUBU8w2PIJFDqbF4NeT69BPzzUS8ihhlkpF47MJO8qBYZDMU/65jfQVTi4EtVke6oKeJqY5PdP2eO4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6918c9a4b5798c4b172a8f8e5ac534ee075a59b8250692287acff3be2385fe44","last_reissued_at":"2026-05-18T01:10:34.892833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:34.892833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental $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, Nikos Parotsidis","submitted_at":"2016-07-24T17:47:11Z","abstract_excerpt":"In this paper, we initiate the study of the dynamic maintenance of $2$-edge-connectivity relationships in directed graphs. We present an algorithm that can update the $2$-edge-connected blocks of a directed graph with $n$ vertices through a sequence of $m$ edge insertions in a total of $O(mn)$ time. After each insertion, we can answer the following queries in asymptotically optimal time: (i) Test in constant time if two query vertices $v$ and $w$ are $2$-edge-connected. Moreover, if $v$ and $w$ are not $2$-edge-connected, we can produce in constant time a \"witness\" of this property, by exhibit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07073","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":"1607.07073","created_at":"2026-05-18T01:10:34.892924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07073v1","created_at":"2026-05-18T01:10:34.892924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07073","created_at":"2026-05-18T01:10:34.892924+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEMMTJFVPGGE","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEMMTJFVPGGEWFZK","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEMMTJFV","created_at":"2026-05-18T12:30:32.724797+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/NEMMTJFVPGGEWFZKR6HFVRJU5Y","json":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y.json","graph_json":"https://pith.science/api/pith-number/NEMMTJFVPGGEWFZKR6HFVRJU5Y/graph.json","events_json":"https://pith.science/api/pith-number/NEMMTJFVPGGEWFZKR6HFVRJU5Y/events.json","paper":"https://pith.science/paper/NEMMTJFV"},"agent_actions":{"view_html":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y","download_json":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y.json","view_paper":"https://pith.science/paper/NEMMTJFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07073&json=true","fetch_graph":"https://pith.science/api/pith-number/NEMMTJFVPGGEWFZKR6HFVRJU5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/NEMMTJFVPGGEWFZKR6HFVRJU5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/action/storage_attestation","attest_author":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/action/author_attestation","sign_citation":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/action/citation_signature","submit_replication":"https://pith.science/pith/NEMMTJFVPGGEWFZKR6HFVRJU5Y/action/replication_record"}},"created_at":"2026-05-18T01:10:34.892924+00:00","updated_at":"2026-05-18T01:10:34.892924+00:00"}