{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3DIZZN4KNI7PJK2LCS4I2AL33O","short_pith_number":"pith:3DIZZN4K","schema_version":"1.0","canonical_sha256":"d8d19cb78a6a3ef4ab4b14b88d017bdba1c12032e800bcb8a01c53375d427d68","source":{"kind":"arxiv","id":"2309.16629","version":1},"attestation_state":"computed","paper":{"title":"A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Jan van den Brand, Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yang P. Liu","submitted_at":"2023-09-28T17:35:22Z","abstract_excerpt":"We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the first running time improvement for deterministic algorithms that compute maximum-flow in graphs with polynomial bounded capacities since the work of Goldberg-Rao [J.ACM '98].\n  Our algorithm builds on the framework of Chen-Kyng-Liu-Peng-Gutenberg-Sachdeva [FOCS '22] that computes an optimal flow by computing a sequence of $m^{1+o(1)}$-approximate undirected"},"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":"2309.16629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-28T17:35:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"cd15077134f6a0ef1dfd136f660fd9c08981fbbf42dce8971a0391d05b6a5192","abstract_canon_sha256":"9d5828d2cef409723451e227f684e949dc959d53b79227673377885f969f306d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:19.223708Z","signature_b64":"LKCz84X2kCVXQMSlW7MGUrpiOQZff/i6YyDn+0JIW4zFxwqvA/AGAwvCQ0vIA57zxZBaPBx/GAju7+cTaSwXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d19cb78a6a3ef4ab4b14b88d017bdba1c12032e800bcb8a01c53375d427d68","last_reissued_at":"2026-07-05T06:55:19.223213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:19.223213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Jan van den Brand, Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yang P. Liu","submitted_at":"2023-09-28T17:35:22Z","abstract_excerpt":"We give a deterministic $m^{1+o(1)}$ time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with $m$ edges and polynomially bounded integral demands, costs, and capacities. As a consequence, we obtain the first running time improvement for deterministic algorithms that compute maximum-flow in graphs with polynomial bounded capacities since the work of Goldberg-Rao [J.ACM '98].\n  Our algorithm builds on the framework of Chen-Kyng-Liu-Peng-Gutenberg-Sachdeva [FOCS '22] that computes an optimal flow by computing a sequence of $m^{1+o(1)}$-approximate undirected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.16629","kind":"arxiv","version":1},"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/2309.16629/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":"2309.16629","created_at":"2026-07-05T06:55:19.223273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.16629v1","created_at":"2026-07-05T06:55:19.223273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.16629","created_at":"2026-07-05T06:55:19.223273+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DIZZN4KNI7P","created_at":"2026-07-05T06:55:19.223273+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DIZZN4KNI7PJK2L","created_at":"2026-07-05T06:55:19.223273+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DIZZN4K","created_at":"2026-07-05T06:55:19.223273+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.15849","citing_title":"Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O","json":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O.json","graph_json":"https://pith.science/api/pith-number/3DIZZN4KNI7PJK2LCS4I2AL33O/graph.json","events_json":"https://pith.science/api/pith-number/3DIZZN4KNI7PJK2LCS4I2AL33O/events.json","paper":"https://pith.science/paper/3DIZZN4K"},"agent_actions":{"view_html":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O","download_json":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O.json","view_paper":"https://pith.science/paper/3DIZZN4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.16629&json=true","fetch_graph":"https://pith.science/api/pith-number/3DIZZN4KNI7PJK2LCS4I2AL33O/graph.json","fetch_events":"https://pith.science/api/pith-number/3DIZZN4KNI7PJK2LCS4I2AL33O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O/action/storage_attestation","attest_author":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O/action/author_attestation","sign_citation":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O/action/citation_signature","submit_replication":"https://pith.science/pith/3DIZZN4KNI7PJK2LCS4I2AL33O/action/replication_record"}},"created_at":"2026-07-05T06:55:19.223273+00:00","updated_at":"2026-07-05T06:55:19.223273+00:00"}