{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LAE34QAMGFN6JHRHEZCOZS3633","short_pith_number":"pith:LAE34QAM","schema_version":"1.0","canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","source":{"kind":"arxiv","id":"2312.16415","version":2},"attestation_state":"computed","paper":{"title":"Deterministic Minimum Steiner Cut in Maximum Flow Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jason Li, Matthew Ding","submitted_at":"2023-12-27T05:27:22Z","abstract_excerpt":"We devise a deterministic algorithm for minimum Steiner cut, which uses $(\\log n)^{O(1)}$ maximum flow calls and additional near-linear time. This algorithm improves on Li and Panigrahi's (FOCS 2020) algorithm, which uses $(\\log n)^{O(1/\\epsilon^4)}$ maximum flow calls and additional $O(m^{1+\\epsilon})$ time, for $\\epsilon > 0$. Our algorithm thus shows that deterministic minimum Steiner cut can be solved in maximum flow time up to polylogarithmic factors, given any black-box deterministic maximum flow algorithm. Our main technical contribution is a novel deterministic graph decomposition meth"},"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":"2312.16415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-12-27T05:27:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"02b01a2ed59bc366a819f8721d77e0b2db4ac7f5b880ef46a80631c502f173ab","abstract_canon_sha256":"b0fe3183f53d2ff014c1d697453a765fa4324c2cd85d2f756ced8d54d334565b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:38:56.087161Z","signature_b64":"1IqbdcKh8Sa8JgqWmZxTPaypygOWkV0lDqxKrAeNezOczm40U8wMwsLubLelMxpOu3AaDouZGVo4DgK80asCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5809be400c315be49e272644eccb7ededf6e503de7553489e1577cd3ff979c1f","last_reissued_at":"2026-07-05T08:38:56.086814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:38:56.086814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Minimum Steiner Cut in Maximum Flow Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jason Li, Matthew Ding","submitted_at":"2023-12-27T05:27:22Z","abstract_excerpt":"We devise a deterministic algorithm for minimum Steiner cut, which uses $(\\log n)^{O(1)}$ maximum flow calls and additional near-linear time. This algorithm improves on Li and Panigrahi's (FOCS 2020) algorithm, which uses $(\\log n)^{O(1/\\epsilon^4)}$ maximum flow calls and additional $O(m^{1+\\epsilon})$ time, for $\\epsilon > 0$. Our algorithm thus shows that deterministic minimum Steiner cut can be solved in maximum flow time up to polylogarithmic factors, given any black-box deterministic maximum flow algorithm. Our main technical contribution is a novel deterministic graph decomposition meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.16415","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.16415/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.16415","created_at":"2026-07-05T08:38:56.086870+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.16415v2","created_at":"2026-07-05T08:38:56.086870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.16415","created_at":"2026-07-05T08:38:56.086870+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAE34QAMGFN6","created_at":"2026-07-05T08:38:56.086870+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAE34QAMGFN6JHRH","created_at":"2026-07-05T08:38:56.086870+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAE34QAM","created_at":"2026-07-05T08:38:56.086870+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/LAE34QAMGFN6JHRHEZCOZS3633","json":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633.json","graph_json":"https://pith.science/api/pith-number/LAE34QAMGFN6JHRHEZCOZS3633/graph.json","events_json":"https://pith.science/api/pith-number/LAE34QAMGFN6JHRHEZCOZS3633/events.json","paper":"https://pith.science/paper/LAE34QAM"},"agent_actions":{"view_html":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633","download_json":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633.json","view_paper":"https://pith.science/paper/LAE34QAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.16415&json=true","fetch_graph":"https://pith.science/api/pith-number/LAE34QAMGFN6JHRHEZCOZS3633/graph.json","fetch_events":"https://pith.science/api/pith-number/LAE34QAMGFN6JHRHEZCOZS3633/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/action/storage_attestation","attest_author":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/action/author_attestation","sign_citation":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/action/citation_signature","submit_replication":"https://pith.science/pith/LAE34QAMGFN6JHRHEZCOZS3633/action/replication_record"}},"created_at":"2026-07-05T08:38:56.086870+00:00","updated_at":"2026-07-05T08:38:56.086870+00:00"}