{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PX7PFIOSOJG3SDFLYESCWDJGVG","short_pith_number":"pith:PX7PFIOS","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"},"canonical_sha256":"7dfef2a1d2724db90cabc1242b0d26a9812ddf8c8256de7f1d49f1fa1d9cd174","source":{"kind":"arxiv","id":"1511.02913","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02913","created_at":"2026-05-17T23:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02913v2","created_at":"2026-05-17T23:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02913","created_at":"2026-05-17T23:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"PX7PFIOSOJG3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PX7PFIOSOJG3SDFL","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PX7PFIOS","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PX7PFIOSOJG3SDFLYESCWDJGVG","target":"record","payload":{"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"},"canonical_sha256":"7dfef2a1d2724db90cabc1242b0d26a9812ddf8c8256de7f1d49f1fa1d9cd174","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"},"source_kind":"arxiv","source_id":"1511.02913","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-17T23:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npRb5cNsU/Sh0csWFGO43+xGrbbNkgZ0o8pnHvajq92xJtH5xzWpd3vAiqnfb7bTn6OwqZOq54DA9IJuWZdUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:24:58.214945Z"},"content_sha256":"12c36e36bed4527a50f2aaa0434e62a03c17dc25da24aeb44a0c7c626862ae81","schema_version":"1.0","event_id":"sha256:12c36e36bed4527a50f2aaa0434e62a03c17dc25da24aeb44a0c7c626862ae81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PX7PFIOSOJG3SDFLYESCWDJGVG","target":"graph","payload":{"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"},"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-17T23:46:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xqx0zl74iGES0ebTL2PYnZbNrLY/MIj65Y06rBw+GS998j9kdCefYcuXeQJvZW1XSacV8PRPbd2SbLr9+ns/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:24:58.215300Z"},"content_sha256":"6d643366c570d131d7c104e7e6dbc02d0bf9d9847d29aa11427da852f6bd0a05","schema_version":"1.0","event_id":"sha256:6d643366c570d131d7c104e7e6dbc02d0bf9d9847d29aa11427da852f6bd0a05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/bundle.json","state_url":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/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-23T15:24:58Z","links":{"resolver":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG","bundle":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/bundle.json","state":"https://pith.science/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PX7PFIOSOJG3SDFLYESCWDJGVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PX7PFIOSOJG3SDFLYESCWDJGVG","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":"9d8cb5f6854da2d349e5d24e9d71de9f4a205f9a04330939f818b24c4952cffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T22:20:08Z","title_canon_sha256":"8b0c2a31217373783b03671bbb68f8a63ba313ff5173dc0c131b6c50343017a3"},"schema_version":"1.0","source":{"id":"1511.02913","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02913","created_at":"2026-05-17T23:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02913v2","created_at":"2026-05-17T23:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02913","created_at":"2026-05-17T23:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"PX7PFIOSOJG3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PX7PFIOSOJG3SDFL","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PX7PFIOS","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:6d643366c570d131d7c104e7e6dbc02d0bf9d9847d29aa11427da852f6bd0a05","target":"graph","created_at":"2026-05-17T23:46:55Z","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":"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","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T22:20:08Z","title":"Strong Connectivity in Directed Graphs under Failures, with Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02913","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:12c36e36bed4527a50f2aaa0434e62a03c17dc25da24aeb44a0c7c626862ae81","target":"record","created_at":"2026-05-17T23:46:55Z","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":"9d8cb5f6854da2d349e5d24e9d71de9f4a205f9a04330939f818b24c4952cffd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-09T22:20:08Z","title_canon_sha256":"8b0c2a31217373783b03671bbb68f8a63ba313ff5173dc0c131b6c50343017a3"},"schema_version":"1.0","source":{"id":"1511.02913","kind":"arxiv","version":2}},"canonical_sha256":"7dfef2a1d2724db90cabc1242b0d26a9812ddf8c8256de7f1d49f1fa1d9cd174","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dfef2a1d2724db90cabc1242b0d26a9812ddf8c8256de7f1d49f1fa1d9cd174","first_computed_at":"2026-05-17T23:46:55.936049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:55.936049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sY0W3+XqXj15rQCnLQRPtMQ10l0vlV3EVLpQN+lUaiV7CRgNH33dMEhheXvLT6STGYXSd/O7SRfjtX8z+4ZlAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:55.936774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02913","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12c36e36bed4527a50f2aaa0434e62a03c17dc25da24aeb44a0c7c626862ae81","sha256:6d643366c570d131d7c104e7e6dbc02d0bf9d9847d29aa11427da852f6bd0a05"],"state_sha256":"35eb1fea57f1f2cb2f9d451eaa0074cffea6be4ad7a42691f8a5e50ff776853f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEVWclbYC9XWlAOBTpIP+yq0gbvHnUJKFoIo7GpYLiR6tMu63Blxrj+7vRX2y8K5lelC4HRuE0js4CDJequABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:24:58.217299Z","bundle_sha256":"652ec7e0f1a3f5f98593be466caca28527da160c587854cb85bf5a0f4f82fc46"}}