{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YSEFBGOIB57LB4XZONFFRBNLGZ","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":"2195027ed4e0d7b556166b657cd8aa9c092402a3dbe0739e67b2e01a9ceb99c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-16T11:45:29Z","title_canon_sha256":"8d3b2c17e709399546fd8425084392e0e0b7435d263c652d9cd0338de3470e62"},"schema_version":"1.0","source":{"id":"1807.05803","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05803","created_at":"2026-05-17T23:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05803v2","created_at":"2026-05-17T23:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05803","created_at":"2026-05-17T23:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"YSEFBGOIB57L","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YSEFBGOIB57LB4XZ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YSEFBGOI","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:a4d6ab8a3ec68f3b79a3d7dd5993663fc20349d2dd3c71144fc6c0b9d973357d","target":"graph","created_at":"2026-05-17T23:52:59Z","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":"The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum $s$-$t$ cut (or just its value) for all pairs of vertices $s,t$. We study this problem in directed graphs with unit edge/vertex capacities (corresponding to edge/vertex connectivity). Our focus is on the $k$-bounded case, where the algorithm has to find all pairs with min-cut value less than $k$, and report only those. The most basic case $k=1$ is the Transitive Closure (TC) problem, which can be solved in graphs with $n$ vertices and $m$ edges in time $O(mn)$ combinatorially, and in time $O(n^{\\omega})$ where $\\o","authors_text":"Amir Abboud, Daniel Wolleb-Graf, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Ohad Trabelsi, Przemys{\\l}aw Uzna\\'nski, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-16T11:45:29Z","title":"Faster Algorithms for All-Pairs Bounded Min-Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05803","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:48ab92b3714f73ade6f05d4cabed91e8ca5b35479b43403a0e525f2a8bf9b691","target":"record","created_at":"2026-05-17T23:52:59Z","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":"2195027ed4e0d7b556166b657cd8aa9c092402a3dbe0739e67b2e01a9ceb99c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-16T11:45:29Z","title_canon_sha256":"8d3b2c17e709399546fd8425084392e0e0b7435d263c652d9cd0338de3470e62"},"schema_version":"1.0","source":{"id":"1807.05803","kind":"arxiv","version":2}},"canonical_sha256":"c4885099c80f7eb0f2f9734a5885ab3656f0d84fa557aab240dc357f5459f0c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4885099c80f7eb0f2f9734a5885ab3656f0d84fa557aab240dc357f5459f0c8","first_computed_at":"2026-05-17T23:52:59.039285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:59.039285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GylCaT7m4RLziBeAThOBOpKprRiw7Z/KMCVuSGZEUsKWCrdSSCsdafCBTqAX+6hlqKBuhB2uwsWSBZ4GrEdDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:59.039866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05803","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48ab92b3714f73ade6f05d4cabed91e8ca5b35479b43403a0e525f2a8bf9b691","sha256:a4d6ab8a3ec68f3b79a3d7dd5993663fc20349d2dd3c71144fc6c0b9d973357d"],"state_sha256":"16374cab2afc09737911ce18aa4b4a9e4aa0d728b480eb780bea16edea094c8d"}