{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6MZT6RRCROPYLCGLP7ZOUC6Y3L","short_pith_number":"pith:6MZT6RRC","schema_version":"1.0","canonical_sha256":"f3333f46228b9f8588cb7ff2ea0bd8daea29bb7ae74302660a5d0c586bd218db","source":{"kind":"arxiv","id":"1412.6466","version":2},"attestation_state":"computed","paper":{"title":"Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer","submitted_at":"2014-12-19T18:02:46Z","abstract_excerpt":"We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple $O(m n)$-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time $O(n^2)$. For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an"},"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":"1412.6466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-19T18:02:46Z","cross_cats_sorted":[],"title_canon_sha256":"98e08fdfa1c840e12a4707f2bf716453118ac39246b1547a3484571b7b11b68d","abstract_canon_sha256":"4f9478cf9281dcc2d0c0396697fcc4817ad2bcc7d2e7a5ff98474ca1b5681894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.638134Z","signature_b64":"5/cA0kNSkABCgMSHcL96VYhX5eI/k0/cesnThp7UVzi9NvrPw3EN8u4k3tbr8ZJEotKnMKFfjpZYCIhpkfi4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3333f46228b9f8588cb7ff2ea0bd8daea29bb7ae74302660a5d0c586bd218db","last_reissued_at":"2026-05-18T00:22:16.637545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.637545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer","submitted_at":"2014-12-19T18:02:46Z","abstract_excerpt":"We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple $O(m n)$-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time $O(n^2)$. For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6466","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":"1412.6466","created_at":"2026-05-18T00:22:16.637631+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6466v2","created_at":"2026-05-18T00:22:16.637631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6466","created_at":"2026-05-18T00:22:16.637631+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MZT6RRCROPY","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MZT6RRCROPYLCGL","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MZT6RRC","created_at":"2026-05-18T12:28:16.859392+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/6MZT6RRCROPYLCGLP7ZOUC6Y3L","json":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L.json","graph_json":"https://pith.science/api/pith-number/6MZT6RRCROPYLCGLP7ZOUC6Y3L/graph.json","events_json":"https://pith.science/api/pith-number/6MZT6RRCROPYLCGLP7ZOUC6Y3L/events.json","paper":"https://pith.science/paper/6MZT6RRC"},"agent_actions":{"view_html":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L","download_json":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L.json","view_paper":"https://pith.science/paper/6MZT6RRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6466&json=true","fetch_graph":"https://pith.science/api/pith-number/6MZT6RRCROPYLCGLP7ZOUC6Y3L/graph.json","fetch_events":"https://pith.science/api/pith-number/6MZT6RRCROPYLCGLP7ZOUC6Y3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L/action/storage_attestation","attest_author":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L/action/author_attestation","sign_citation":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L/action/citation_signature","submit_replication":"https://pith.science/pith/6MZT6RRCROPYLCGLP7ZOUC6Y3L/action/replication_record"}},"created_at":"2026-05-18T00:22:16.637631+00:00","updated_at":"2026-05-18T00:22:16.637631+00:00"}