{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PX7PFIOSOJG3SDFLYESCWDJGVG","short_pith_number":"pith:PX7PFIOS","schema_version":"1.0","canonical_sha256":"7dfef2a1d2724db90cabc1242b0d26a9812ddf8c8256de7f1d49f1fa1d9cd174","source":{"kind":"arxiv","id":"1511.02913","version":2},"attestation_state":"computed","paper":{"title":"Strong Connectivity in Directed Graphs under Failures, with Application","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":"2015-11-09T22:20:08Z","abstract_excerpt":"In this paper, we investigate some basic connectivity problems in directed graphs (digraphs). Let $G$ be a digraph with $m$ edges and $n$ vertices, and let $G\\setminus e$ be the digraph obtained after deleting edge $e$ from $G$. As a first result, we show how to compute in $O(m+n)$ worst-case time: $(i)$ The total number of strongly connected components in $G\\setminus e$, for all edges $e$ in $G$. $(ii)$ The size of the largest and of the smallest strongly connected components in $G\\setminus e$, for all edges $e$ in $G$.\n  Let $G$ be strongly connected. We say that edge $e$ separates two verti"},"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":"1511.02913","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T22:20:08Z","cross_cats_sorted":[],"title_canon_sha256":"8b0c2a31217373783b03671bbb68f8a63ba313ff5173dc0c131b6c50343017a3","abstract_canon_sha256":"9d8cb5f6854da2d349e5d24e9d71de9f4a205f9a04330939f818b24c4952cffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:55.936774Z","signature_b64":"sY0W3+XqXj15rQCnLQRPtMQ10l0vlV3EVLpQN+lUaiV7CRgNH33dMEhheXvLT6STGYXSd/O7SRfjtX8z+4ZlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dfef2a1d2724db90cabc1242b0d26a9812ddf8c8256de7f1d49f1fa1d9cd174","last_reissued_at":"2026-05-17T23:46:55.936049Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:55.936049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Connectivity in Directed Graphs under Failures, with Application","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":"2015-11-09T22:20:08Z","abstract_excerpt":"In this paper, we investigate some basic connectivity problems in directed graphs (digraphs). Let $G$ be a digraph with $m$ edges and $n$ vertices, and let $G\\setminus e$ be the digraph obtained after deleting edge $e$ from $G$. As a first result, we show how to compute in $O(m+n)$ worst-case time: $(i)$ The total number of strongly connected components in $G\\setminus e$, for all edges $e$ in $G$. $(ii)$ The size of the largest and of the smallest strongly connected components in $G\\setminus e$, for all edges $e$ in $G$.\n  Let $G$ be strongly connected. We say that edge $e$ separates two verti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02913","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":"1511.02913","created_at":"2026-05-17T23:46:55.936159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02913v2","created_at":"2026-05-17T23:46:55.936159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02913","created_at":"2026-05-17T23:46:55.936159+00:00"},{"alias_kind":"pith_short_12","alias_value":"PX7PFIOSOJG3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PX7PFIOSOJG3SDFL","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PX7PFIOS","created_at":"2026-05-18T12:29:37.295048+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/PX7PFIOSOJG3SDFLYESCWDJGVG","json":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG.json","graph_json":"https://pith.science/api/pith-number/PX7PFIOSOJG3SDFLYESCWDJGVG/graph.json","events_json":"https://pith.science/api/pith-number/PX7PFIOSOJG3SDFLYESCWDJGVG/events.json","paper":"https://pith.science/paper/PX7PFIOS"},"agent_actions":{"view_html":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG","download_json":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG.json","view_paper":"https://pith.science/paper/PX7PFIOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02913&json=true","fetch_graph":"https://pith.science/api/pith-number/PX7PFIOSOJG3SDFLYESCWDJGVG/graph.json","fetch_events":"https://pith.science/api/pith-number/PX7PFIOSOJG3SDFLYESCWDJGVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/action/storage_attestation","attest_author":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/action/author_attestation","sign_citation":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/action/citation_signature","submit_replication":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/action/replication_record"}},"created_at":"2026-05-17T23:46:55.936159+00:00","updated_at":"2026-05-17T23:46:55.936159+00:00"}