{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J3VSTU24BJVLXQUKIUTE5IDCOH","short_pith_number":"pith:J3VSTU24","schema_version":"1.0","canonical_sha256":"4eeb29d35c0a6abbc28a45264ea06271de73623512156ee21a69f954af8d9c0a","source":{"kind":"arxiv","id":"1407.6178","version":1},"attestation_state":"computed","paper":{"title":"Computing the $2$-blocks of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2014-07-23T11:20:24Z","abstract_excerpt":"Let $G$ be a directed graph. A \\textit{$2$-directed block} in $G$ is a maximal vertex set $C^{2d}\\subseteq V$ with $|C^{2d}|\\geq 2$ such that for each pair of distinct vertices $x,y \\in C^{2d}$, there exist two vertex-disjoint paths from $x$ to $y$ and two vertex-disjoint paths from $y$ to $x$ in $G$. In contrast to the $2$-vertex-connected components of $G$, the subgraphs induced by the $2$-directed blocks may consist of few or no edges. In this paper we present two algorithms for computing the $2$-directed blocks of $G$ in $O(\\min\\lbrace m,(t_{sap}+t_{sb})n\\rbrace n)$ time, where $t_{sap}$ i"},"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":"1407.6178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-23T11:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"30e3fea125c199db02a775e4a700036fce4fb85a36d097f44ccb3d3e50d09af7","abstract_canon_sha256":"d171e0bcc6ed95786861e68d992b84b2c1f80a3fe62a4e734cc17c4e0d9d93bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:58.770371Z","signature_b64":"RjHH1kjIuoF/7C0fj9A/jq6NylZD9OtG5xcxxdidNe7YpfLqN1UQItCf1uop4rlMXbuyWLte/RMFaollmeBCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eeb29d35c0a6abbc28a45264ea06271de73623512156ee21a69f954af8d9c0a","last_reissued_at":"2026-05-18T02:46:58.768948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:58.768948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the $2$-blocks of directed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raed Jaberi","submitted_at":"2014-07-23T11:20:24Z","abstract_excerpt":"Let $G$ be a directed graph. A \\textit{$2$-directed block} in $G$ is a maximal vertex set $C^{2d}\\subseteq V$ with $|C^{2d}|\\geq 2$ such that for each pair of distinct vertices $x,y \\in C^{2d}$, there exist two vertex-disjoint paths from $x$ to $y$ and two vertex-disjoint paths from $y$ to $x$ in $G$. In contrast to the $2$-vertex-connected components of $G$, the subgraphs induced by the $2$-directed blocks may consist of few or no edges. In this paper we present two algorithms for computing the $2$-directed blocks of $G$ in $O(\\min\\lbrace m,(t_{sap}+t_{sb})n\\rbrace n)$ time, where $t_{sap}$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6178","kind":"arxiv","version":1},"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":"1407.6178","created_at":"2026-05-18T02:46:58.769053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6178v1","created_at":"2026-05-18T02:46:58.769053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6178","created_at":"2026-05-18T02:46:58.769053+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3VSTU24BJVL","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3VSTU24BJVLXQUK","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3VSTU24","created_at":"2026-05-18T12:28:33.132498+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/J3VSTU24BJVLXQUKIUTE5IDCOH","json":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH.json","graph_json":"https://pith.science/api/pith-number/J3VSTU24BJVLXQUKIUTE5IDCOH/graph.json","events_json":"https://pith.science/api/pith-number/J3VSTU24BJVLXQUKIUTE5IDCOH/events.json","paper":"https://pith.science/paper/J3VSTU24"},"agent_actions":{"view_html":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH","download_json":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH.json","view_paper":"https://pith.science/paper/J3VSTU24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6178&json=true","fetch_graph":"https://pith.science/api/pith-number/J3VSTU24BJVLXQUKIUTE5IDCOH/graph.json","fetch_events":"https://pith.science/api/pith-number/J3VSTU24BJVLXQUKIUTE5IDCOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH/action/storage_attestation","attest_author":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH/action/author_attestation","sign_citation":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH/action/citation_signature","submit_replication":"https://pith.science/pith/J3VSTU24BJVLXQUKIUTE5IDCOH/action/replication_record"}},"created_at":"2026-05-18T02:46:58.769053+00:00","updated_at":"2026-05-18T02:46:58.769053+00:00"}