{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AH5J6OJLCQQTOPATUMESV6ADML","short_pith_number":"pith:AH5J6OJL","schema_version":"1.0","canonical_sha256":"01fa9f392b1421373c13a3092af80362c93ba8f9ee4c00ede32f8875963e36a2","source":{"kind":"arxiv","id":"1610.04010","version":2},"attestation_state":"computed","paper":{"title":"An efficient strongly connected components algorithm in the fault tolerant model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keerti Choudhary, Liam Roditty, Surender Baswana","submitted_at":"2016-10-13T10:20:51Z","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"},"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":"1610.04010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-13T10:20:51Z","cross_cats_sorted":[],"title_canon_sha256":"e782608b5f060cb385e3961f8bc32a0867d3c413a863f101b2c6d68740d706b2","abstract_canon_sha256":"8b6eba1d1389ce7305bc0e9ad09750650d243b88f57ae5db926a1ded787947f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:54.150207Z","signature_b64":"oRTGblSGZvMFipebe4Kezx98/TgB6WUafP78S6J8ajCyDzDa2TBPwQGMb6F+Xh3VdKKCOnB0zzBeL1q2aGpKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01fa9f392b1421373c13a3092af80362c93ba8f9ee4c00ede32f8875963e36a2","last_reissued_at":"2026-05-18T00:45:54.149562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:54.149562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient strongly connected components algorithm in the fault tolerant model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Keerti Choudhary, Liam Roditty, Surender Baswana","submitted_at":"2016-10-13T10:20:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04010","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":"1610.04010","created_at":"2026-05-18T00:45:54.149656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04010v2","created_at":"2026-05-18T00:45:54.149656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04010","created_at":"2026-05-18T00:45:54.149656+00:00"},{"alias_kind":"pith_short_12","alias_value":"AH5J6OJLCQQT","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AH5J6OJLCQQTOPAT","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AH5J6OJL","created_at":"2026-05-18T12:30:07.202191+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/AH5J6OJLCQQTOPATUMESV6ADML","json":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML.json","graph_json":"https://pith.science/api/pith-number/AH5J6OJLCQQTOPATUMESV6ADML/graph.json","events_json":"https://pith.science/api/pith-number/AH5J6OJLCQQTOPATUMESV6ADML/events.json","paper":"https://pith.science/paper/AH5J6OJL"},"agent_actions":{"view_html":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML","download_json":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML.json","view_paper":"https://pith.science/paper/AH5J6OJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04010&json=true","fetch_graph":"https://pith.science/api/pith-number/AH5J6OJLCQQTOPATUMESV6ADML/graph.json","fetch_events":"https://pith.science/api/pith-number/AH5J6OJLCQQTOPATUMESV6ADML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML/action/storage_attestation","attest_author":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML/action/author_attestation","sign_citation":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML/action/citation_signature","submit_replication":"https://pith.science/pith/AH5J6OJLCQQTOPATUMESV6ADML/action/replication_record"}},"created_at":"2026-05-18T00:45:54.149656+00:00","updated_at":"2026-05-18T00:45:54.149656+00:00"}