{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CXY2QH2ON2CDD7VZFYEQSABPWY","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":"a6ea67bc97cf4a9b1a1e9df8d2bc63c6c818f5a355a7d3576a412affd4c64c53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T20:05:32Z","title_canon_sha256":"a785a90490557ba1046cc387e7f8e53027578d07e01d878a6dc7fe82a5f42031"},"schema_version":"1.0","source":{"id":"1612.08075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08075","created_at":"2026-05-18T00:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08075v2","created_at":"2026-05-18T00:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08075","created_at":"2026-05-18T00:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"CXY2QH2ON2CD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CXY2QH2ON2CDD7VZ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CXY2QH2O","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:81fd1179c3e3002da85b26cef9997662f360a19a36affc1e71563ecafeb2629f","target":"graph","created_at":"2026-05-18T00:39:28Z","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 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","authors_text":"Daniel Graf, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T20:05:32Z","title":"All-Pairs 2-Reachability in $\\mathcal{O}(n^{\\omega}\\log n)$ Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08075","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:e2ed7eef2d9d51afbd4c312d806b67f6e5927e86baa89545fc2e53e63b84fb7e","target":"record","created_at":"2026-05-18T00:39:28Z","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":"a6ea67bc97cf4a9b1a1e9df8d2bc63c6c818f5a355a7d3576a412affd4c64c53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T20:05:32Z","title_canon_sha256":"a785a90490557ba1046cc387e7f8e53027578d07e01d878a6dc7fe82a5f42031"},"schema_version":"1.0","source":{"id":"1612.08075","kind":"arxiv","version":2}},"canonical_sha256":"15f1a81f4e6e8431feb92e0909002fb603b80de31c6b6f292675e4590c81e5cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15f1a81f4e6e8431feb92e0909002fb603b80de31c6b6f292675e4590c81e5cc","first_computed_at":"2026-05-18T00:39:28.805401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:28.805401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrIp5A+JjeDoS9FYSF5OvUQSK1Yi4ELdFOrbYl9Hplv0+gB0ld21iUreJzYL6liTMraVIaYLln8mna0Es3iaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:28.806042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2ed7eef2d9d51afbd4c312d806b67f6e5927e86baa89545fc2e53e63b84fb7e","sha256:81fd1179c3e3002da85b26cef9997662f360a19a36affc1e71563ecafeb2629f"],"state_sha256":"d8b4a8cf463449c270136694ecbe7b5b3576a37a8315bbe86904c2a0fa7ec0de"}