{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AH5J6OJLCQQTOPATUMESV6ADML","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":"8b6eba1d1389ce7305bc0e9ad09750650d243b88f57ae5db926a1ded787947f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-13T10:20:51Z","title_canon_sha256":"e782608b5f060cb385e3961f8bc32a0867d3c413a863f101b2c6d68740d706b2"},"schema_version":"1.0","source":{"id":"1610.04010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04010","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04010v2","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04010","created_at":"2026-05-18T00:45:54Z"},{"alias_kind":"pith_short_12","alias_value":"AH5J6OJLCQQT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AH5J6OJLCQQTOPAT","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AH5J6OJL","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:f32216e93cb0a77c894d51441bba8fcc395c93d598d3fa03f808003c79a3304e","target":"graph","created_at":"2026-05-18T00:45:54Z","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 study the problem of maintaining the strongly connected components of a graph in the presence of failures. In particular, we show that given a directed graph $G=(V,E)$ with $n=|V|$ and $m=|E|$, and an integer value $k\\geq 1$, there is an algorithm that computes in $O(2^{k}n\\log^2 n)$ time for any set $F$ of size at most $k$ the strongly connected components of the graph $G\\setminus F$. The running time of our algorithm is almost optimal since the time for outputting the SCCs of $G\\setminus F$ is at least $\\Omega(n)$. The algorithm uses a data structure that is computed in a pr","authors_text":"Keerti Choudhary, Liam Roditty, Surender Baswana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-13T10:20:51Z","title":"An efficient strongly connected components algorithm in the fault tolerant model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04010","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:ed1818a087c16b0a83a9906d1ed6f884a9f3ae12c0065aa6728f00616148f4a9","target":"record","created_at":"2026-05-18T00:45:54Z","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":"8b6eba1d1389ce7305bc0e9ad09750650d243b88f57ae5db926a1ded787947f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-13T10:20:51Z","title_canon_sha256":"e782608b5f060cb385e3961f8bc32a0867d3c413a863f101b2c6d68740d706b2"},"schema_version":"1.0","source":{"id":"1610.04010","kind":"arxiv","version":2}},"canonical_sha256":"01fa9f392b1421373c13a3092af80362c93ba8f9ee4c00ede32f8875963e36a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01fa9f392b1421373c13a3092af80362c93ba8f9ee4c00ede32f8875963e36a2","first_computed_at":"2026-05-18T00:45:54.149562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:54.149562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oRTGblSGZvMFipebe4Kezx98/TgB6WUafP78S6J8ajCyDzDa2TBPwQGMb6F+Xh3VdKKCOnB0zzBeL1q2aGpKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:54.150207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed1818a087c16b0a83a9906d1ed6f884a9f3ae12c0065aa6728f00616148f4a9","sha256:f32216e93cb0a77c894d51441bba8fcc395c93d598d3fa03f808003c79a3304e"],"state_sha256":"21fd06c6133cb5be3549efa794abf6de14ee304632b22c2d61ddae49a13cc383"}