{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QA2RCIBVEN2PM232AXQEFFPNY3","short_pith_number":"pith:QA2RCIBV","schema_version":"1.0","canonical_sha256":"80351120352374f66b7a05e04295edc6dce8cdec93b8954ad3414bac0c512144","source":{"kind":"arxiv","id":"2501.10632","version":2},"attestation_state":"computed","paper":{"title":"Local Sherman's Algorithm for Multi-commodity Flow","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jason Li, Thatchaphol Saranurak","submitted_at":"2025-01-18T02:21:24Z","abstract_excerpt":"We give the first local algorithm for computing multi-commodity flow and apply it to obtain a $(1+\\epsilon)$-approximate algorithm for computing a $k$-commodity flow on an expander with $m$ edges in $(m+\\epsilon^{-3}k^3D)n^{o(1)}$ time, where $D$ is the total demand. This is the first $(1+\\epsilon)$-approximate algorithm that breaks the $km$ multi-commodity flow barrier, albeit only on expanders. All previous algorithms either require $\\Omega(km)$ time or a big constant approximation.\n  Our approach is by localizing Sherman's flow algorithm when put into the Multiplicative Weight Update (MWU) "},"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":"2501.10632","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-18T02:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"3d52bd48ceeff35d6fc0c7154829e384a1ee7c3e55302bb1eb89ddced3a23c35","abstract_canon_sha256":"8bcfd15eeab4db3eff704ccf67c22912ccf9736152a2adbbd36ac22a2d437c61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:48.038638Z","signature_b64":"b53JN9F4cqJEzvHtjsvLyh3lqkrjk9mw5TY1H2HkgsmqkFO2I58/a/oOfTAq2EFaRy/3MfIBVgUY++cSkqudDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80351120352374f66b7a05e04295edc6dce8cdec93b8954ad3414bac0c512144","last_reissued_at":"2026-07-05T10:10:48.038168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:48.038168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Sherman's Algorithm for Multi-commodity Flow","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jason Li, Thatchaphol Saranurak","submitted_at":"2025-01-18T02:21:24Z","abstract_excerpt":"We give the first local algorithm for computing multi-commodity flow and apply it to obtain a $(1+\\epsilon)$-approximate algorithm for computing a $k$-commodity flow on an expander with $m$ edges in $(m+\\epsilon^{-3}k^3D)n^{o(1)}$ time, where $D$ is the total demand. This is the first $(1+\\epsilon)$-approximate algorithm that breaks the $km$ multi-commodity flow barrier, albeit only on expanders. All previous algorithms either require $\\Omega(km)$ time or a big constant approximation.\n  Our approach is by localizing Sherman's flow algorithm when put into the Multiplicative Weight Update (MWU) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10632","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/2501.10632/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":"2501.10632","created_at":"2026-07-05T10:10:48.038224+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10632v2","created_at":"2026-07-05T10:10:48.038224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10632","created_at":"2026-07-05T10:10:48.038224+00:00"},{"alias_kind":"pith_short_12","alias_value":"QA2RCIBVEN2P","created_at":"2026-07-05T10:10:48.038224+00:00"},{"alias_kind":"pith_short_16","alias_value":"QA2RCIBVEN2PM232","created_at":"2026-07-05T10:10:48.038224+00:00"},{"alias_kind":"pith_short_8","alias_value":"QA2RCIBV","created_at":"2026-07-05T10:10:48.038224+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/QA2RCIBVEN2PM232AXQEFFPNY3","json":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3.json","graph_json":"https://pith.science/api/pith-number/QA2RCIBVEN2PM232AXQEFFPNY3/graph.json","events_json":"https://pith.science/api/pith-number/QA2RCIBVEN2PM232AXQEFFPNY3/events.json","paper":"https://pith.science/paper/QA2RCIBV"},"agent_actions":{"view_html":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3","download_json":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3.json","view_paper":"https://pith.science/paper/QA2RCIBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10632&json=true","fetch_graph":"https://pith.science/api/pith-number/QA2RCIBVEN2PM232AXQEFFPNY3/graph.json","fetch_events":"https://pith.science/api/pith-number/QA2RCIBVEN2PM232AXQEFFPNY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3/action/storage_attestation","attest_author":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3/action/author_attestation","sign_citation":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3/action/citation_signature","submit_replication":"https://pith.science/pith/QA2RCIBVEN2PM232AXQEFFPNY3/action/replication_record"}},"created_at":"2026-07-05T10:10:48.038224+00:00","updated_at":"2026-07-05T10:10:48.038224+00:00"}