{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YSEFBGOIB57LB4XZONFFRBNLGZ","short_pith_number":"pith:YSEFBGOI","schema_version":"1.0","canonical_sha256":"c4885099c80f7eb0f2f9734a5885ab3656f0d84fa557aab240dc357f5459f0c8","source":{"kind":"arxiv","id":"1807.05803","version":2},"attestation_state":"computed","paper":{"title":"Faster Algorithms for All-Pairs Bounded Min-Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Daniel Wolleb-Graf, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Ohad Trabelsi, Przemys{\\l}aw Uzna\\'nski, Robert Krauthgamer","submitted_at":"2018-07-16T11:45:29Z","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"},"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":"1807.05803","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-16T11:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"8d3b2c17e709399546fd8425084392e0e0b7435d263c652d9cd0338de3470e62","abstract_canon_sha256":"2195027ed4e0d7b556166b657cd8aa9c092402a3dbe0739e67b2e01a9ceb99c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:59.039866Z","signature_b64":"4GylCaT7m4RLziBeAThOBOpKprRiw7Z/KMCVuSGZEUsKWCrdSSCsdafCBTqAX+6hlqKBuhB2uwsWSBZ4GrEdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4885099c80f7eb0f2f9734a5885ab3656f0d84fa557aab240dc357f5459f0c8","last_reissued_at":"2026-05-17T23:52:59.039285Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:59.039285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for All-Pairs Bounded Min-Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Daniel Wolleb-Graf, Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Ohad Trabelsi, Przemys{\\l}aw Uzna\\'nski, Robert Krauthgamer","submitted_at":"2018-07-16T11:45:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05803","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":"1807.05803","created_at":"2026-05-17T23:52:59.039390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05803v2","created_at":"2026-05-17T23:52:59.039390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05803","created_at":"2026-05-17T23:52:59.039390+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSEFBGOIB57L","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSEFBGOIB57LB4XZ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSEFBGOI","created_at":"2026-05-18T12:33:04.347982+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/YSEFBGOIB57LB4XZONFFRBNLGZ","json":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ.json","graph_json":"https://pith.science/api/pith-number/YSEFBGOIB57LB4XZONFFRBNLGZ/graph.json","events_json":"https://pith.science/api/pith-number/YSEFBGOIB57LB4XZONFFRBNLGZ/events.json","paper":"https://pith.science/paper/YSEFBGOI"},"agent_actions":{"view_html":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ","download_json":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ.json","view_paper":"https://pith.science/paper/YSEFBGOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05803&json=true","fetch_graph":"https://pith.science/api/pith-number/YSEFBGOIB57LB4XZONFFRBNLGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YSEFBGOIB57LB4XZONFFRBNLGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ/action/storage_attestation","attest_author":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ/action/author_attestation","sign_citation":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ/action/citation_signature","submit_replication":"https://pith.science/pith/YSEFBGOIB57LB4XZONFFRBNLGZ/action/replication_record"}},"created_at":"2026-05-17T23:52:59.039390+00:00","updated_at":"2026-05-17T23:52:59.039390+00:00"}