{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3DIZZN4KNI7PJK2LCS4I2AL33O","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":"9d5828d2cef409723451e227f684e949dc959d53b79227673377885f969f306d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-28T17:35:22Z","title_canon_sha256":"cd15077134f6a0ef1dfd136f660fd9c08981fbbf42dce8971a0391d05b6a5192"},"schema_version":"1.0","source":{"id":"2309.16629","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.16629","created_at":"2026-07-05T06:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"2309.16629v1","created_at":"2026-07-05T06:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.16629","created_at":"2026-07-05T06:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"3DIZZN4KNI7P","created_at":"2026-07-05T06:55:19Z"},{"alias_kind":"pith_short_16","alias_value":"3DIZZN4KNI7PJK2L","created_at":"2026-07-05T06:55:19Z"},{"alias_kind":"pith_short_8","alias_value":"3DIZZN4K","created_at":"2026-07-05T06:55:19Z"}],"graph_snapshots":[{"event_id":"sha256:41816e5a74cd810690dcd14d7af1e770518a1a6627d92db7b330e055abbf5b1b","target":"graph","created_at":"2026-07-05T06:55:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.16629/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aaron Sidford, Jan van den Brand, Li Chen, Maximilian Probst Gutenberg, Rasmus Kyng, Richard Peng, Sushant Sachdeva, Yang P. Liu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-28T17:35:22Z","title":"A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.16629","kind":"arxiv","version":1},"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:f9895179b7d996b3aae78170ae6236c8ee98b4b08acbda9df05117609cfe93e9","target":"record","created_at":"2026-07-05T06:55:19Z","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":"9d5828d2cef409723451e227f684e949dc959d53b79227673377885f969f306d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-09-28T17:35:22Z","title_canon_sha256":"cd15077134f6a0ef1dfd136f660fd9c08981fbbf42dce8971a0391d05b6a5192"},"schema_version":"1.0","source":{"id":"2309.16629","kind":"arxiv","version":1}},"canonical_sha256":"d8d19cb78a6a3ef4ab4b14b88d017bdba1c12032e800bcb8a01c53375d427d68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8d19cb78a6a3ef4ab4b14b88d017bdba1c12032e800bcb8a01c53375d427d68","first_computed_at":"2026-07-05T06:55:19.223213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:55:19.223213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LKCz84X2kCVXQMSlW7MGUrpiOQZff/i6YyDn+0JIW4zFxwqvA/AGAwvCQ0vIA57zxZBaPBx/GAju7+cTaSwXDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:55:19.223708Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.16629","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9895179b7d996b3aae78170ae6236c8ee98b4b08acbda9df05117609cfe93e9","sha256:41816e5a74cd810690dcd14d7af1e770518a1a6627d92db7b330e055abbf5b1b"],"state_sha256":"8916d3588bc44d081e3af551bcaba6e9aae9832e439807156f24e56fc1bf0c1e"}