{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5JSJDPVX4XZGTCTVGW7UGI5O37","short_pith_number":"pith:5JSJDPVX","schema_version":"1.0","canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","source":{"kind":"arxiv","id":"1705.10709","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Nikos Parotsidis, Shiri Chechik, Thomas Dueholm Hansen, Veronika Loitzenbauer","submitted_at":"2017-05-30T15:46:20Z","abstract_excerpt":"Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especially for directed graphs. A directed graph is 2-edge-connected (resp., 2-vertex-connected) if the removal of any edge (resp., vertex) leaves the graph strongly connected. In this paper we present improved algorithms for computing the maximal 2-edge- and 2-vertex-connected subgraphs of a given directed graph. These problems were first studied more than 35 years ago, with $\\widetilde{O}(mn)$ time algorithms for graphs wit"},"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":"1705.10709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-30T15:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"aecaf729cf165925e5247cf33b940e1f298923db19243afe83433e7588805f52","abstract_canon_sha256":"de8b2bd88738144ad3f3236c31825041f75ed6f72a9c9d22ef1399ef7ec97f9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.720895Z","signature_b64":"w4SNllEkO6qfDwjt7TD5gX4aQwf05/oSWYYt9L9fNrymwliBEGSzYWD0MJlwSKwXaZ4zMygCDcD2uO4fQmlWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb","last_reissued_at":"2026-05-18T00:43:23.720297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.720297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Nikos Parotsidis, Shiri Chechik, Thomas Dueholm Hansen, Veronika Loitzenbauer","submitted_at":"2017-05-30T15:46:20Z","abstract_excerpt":"Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especially for directed graphs. A directed graph is 2-edge-connected (resp., 2-vertex-connected) if the removal of any edge (resp., vertex) leaves the graph strongly connected. In this paper we present improved algorithms for computing the maximal 2-edge- and 2-vertex-connected subgraphs of a given directed graph. These problems were first studied more than 35 years ago, with $\\widetilde{O}(mn)$ time algorithms for graphs wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10709","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":"1705.10709","created_at":"2026-05-18T00:43:23.720402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10709v1","created_at":"2026-05-18T00:43:23.720402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10709","created_at":"2026-05-18T00:43:23.720402+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JSJDPVX4XZG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JSJDPVX4XZGTCTV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JSJDPVX","created_at":"2026-05-18T12:31:00.734936+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/5JSJDPVX4XZGTCTVGW7UGI5O37","json":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37.json","graph_json":"https://pith.science/api/pith-number/5JSJDPVX4XZGTCTVGW7UGI5O37/graph.json","events_json":"https://pith.science/api/pith-number/5JSJDPVX4XZGTCTVGW7UGI5O37/events.json","paper":"https://pith.science/paper/5JSJDPVX"},"agent_actions":{"view_html":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37","download_json":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37.json","view_paper":"https://pith.science/paper/5JSJDPVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10709&json=true","fetch_graph":"https://pith.science/api/pith-number/5JSJDPVX4XZGTCTVGW7UGI5O37/graph.json","fetch_events":"https://pith.science/api/pith-number/5JSJDPVX4XZGTCTVGW7UGI5O37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/action/storage_attestation","attest_author":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/action/author_attestation","sign_citation":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/action/citation_signature","submit_replication":"https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37/action/replication_record"}},"created_at":"2026-05-18T00:43:23.720402+00:00","updated_at":"2026-05-18T00:43:23.720402+00:00"}