{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CXY2QH2ON2CDD7VZFYEQSABPWY","short_pith_number":"pith:CXY2QH2O","schema_version":"1.0","canonical_sha256":"15f1a81f4e6e8431feb92e0909002fb603b80de31c6b6f292675e4590c81e5cc","source":{"kind":"arxiv","id":"1612.08075","version":2},"attestation_state":"computed","paper":{"title":"All-Pairs 2-Reachability in $\\mathcal{O}(n^{\\omega}\\log n)$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Graf, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2016-12-23T20:05:32Z","abstract_excerpt":"In the $2$-reachability problem we are given a directed graph $G$ and we wish to determine if there are two (edge or vertex) disjoint paths from $u$ to $v$, for a given pair of vertices $u$ and $v$. In this paper, we present an algorithm that computes $2$-reachability information for all pairs of vertices in $\\mathcal{O}(n^{\\omega}\\log n)$ time, where $n$ is the number of vertices and $\\omega$ is the matrix multiplication exponent. Hence, we show that the running time of all-pairs $2$-reachability is only within a $\\log$ factor of transitive closure.\n  Moreover, our algorithm produces a witnes"},"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":"1612.08075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T20:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"a785a90490557ba1046cc387e7f8e53027578d07e01d878a6dc7fe82a5f42031","abstract_canon_sha256":"a6ea67bc97cf4a9b1a1e9df8d2bc63c6c818f5a355a7d3576a412affd4c64c53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:28.806042Z","signature_b64":"MrIp5A+JjeDoS9FYSF5OvUQSK1Yi4ELdFOrbYl9Hplv0+gB0ld21iUreJzYL6liTMraVIaYLln8mna0Es3iaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15f1a81f4e6e8431feb92e0909002fb603b80de31c6b6f292675e4590c81e5cc","last_reissued_at":"2026-05-18T00:39:28.805401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:28.805401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-Pairs 2-Reachability in $\\mathcal{O}(n^{\\omega}\\log n)$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Graf, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2016-12-23T20:05:32Z","abstract_excerpt":"In the $2$-reachability problem we are given a directed graph $G$ and we wish to determine if there are two (edge or vertex) disjoint paths from $u$ to $v$, for a given pair of vertices $u$ and $v$. In this paper, we present an algorithm that computes $2$-reachability information for all pairs of vertices in $\\mathcal{O}(n^{\\omega}\\log n)$ time, where $n$ is the number of vertices and $\\omega$ is the matrix multiplication exponent. Hence, we show that the running time of all-pairs $2$-reachability is only within a $\\log$ factor of transitive closure.\n  Moreover, our algorithm produces a witnes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08075","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":"1612.08075","created_at":"2026-05-18T00:39:28.805507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.08075v2","created_at":"2026-05-18T00:39:28.805507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08075","created_at":"2026-05-18T00:39:28.805507+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXY2QH2ON2CD","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXY2QH2ON2CDD7VZ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXY2QH2O","created_at":"2026-05-18T12:30:09.641336+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/CXY2QH2ON2CDD7VZFYEQSABPWY","json":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY.json","graph_json":"https://pith.science/api/pith-number/CXY2QH2ON2CDD7VZFYEQSABPWY/graph.json","events_json":"https://pith.science/api/pith-number/CXY2QH2ON2CDD7VZFYEQSABPWY/events.json","paper":"https://pith.science/paper/CXY2QH2O"},"agent_actions":{"view_html":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY","download_json":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY.json","view_paper":"https://pith.science/paper/CXY2QH2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.08075&json=true","fetch_graph":"https://pith.science/api/pith-number/CXY2QH2ON2CDD7VZFYEQSABPWY/graph.json","fetch_events":"https://pith.science/api/pith-number/CXY2QH2ON2CDD7VZFYEQSABPWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY/action/storage_attestation","attest_author":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY/action/author_attestation","sign_citation":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY/action/citation_signature","submit_replication":"https://pith.science/pith/CXY2QH2ON2CDD7VZFYEQSABPWY/action/replication_record"}},"created_at":"2026-05-18T00:39:28.805507+00:00","updated_at":"2026-05-18T00:39:28.805507+00:00"}