{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5EPRE3JL2VFK24FNDL6SWFTFY4","short_pith_number":"pith:5EPRE3JL","schema_version":"1.0","canonical_sha256":"e91f126d2bd54aad70ad1afd2b1665c727492e6ba8aa1022a2c809582cd7db42","source":{"kind":"arxiv","id":"2501.17996","version":2},"attestation_state":"computed","paper":{"title":"Solving Large Multicommodity Network Flow Problems on GPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fangzhao Zhang, Stephen Boyd","submitted_at":"2025-01-29T21:07:29Z","abstract_excerpt":"We consider the all-pairs multicommodity network flow problem on a network with capacitated edges. The usual treatment keeps track of a separate flow for each source-destination pair on each edge; we rely on a more efficient formulation in which flows with the same destination are aggregated, reducing the number of variables by a factor equal to the size of the network. Problems with hundreds of nodes, with a total number of variables on the order of a million, can be solved using standard generic interior-point methods on CPUs; we focus on GPU-compatible algorithms that can solve such problem"},"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.17996","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T21:07:29Z","cross_cats_sorted":[],"title_canon_sha256":"778def32d3eead5676c1c0f61a7c391f50861bf33505e17d760708bffc760d6f","abstract_canon_sha256":"b64232199636be09372eaf36e47669c0f890adf7e7195437ed7bba13acb51584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:43.190484Z","signature_b64":"mg+5sp91nQhDLHQCY2aUTaRGE2sIEL6k8ajE0PUoaGbQQ7o12+iGWRe0h7x/Y2sO+sjrQeeOpgRZdU/C2kIqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e91f126d2bd54aad70ad1afd2b1665c727492e6ba8aa1022a2c809582cd7db42","last_reissued_at":"2026-07-05T10:43:43.190002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:43.190002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Large Multicommodity Network Flow Problems on GPUs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fangzhao Zhang, Stephen Boyd","submitted_at":"2025-01-29T21:07:29Z","abstract_excerpt":"We consider the all-pairs multicommodity network flow problem on a network with capacitated edges. The usual treatment keeps track of a separate flow for each source-destination pair on each edge; we rely on a more efficient formulation in which flows with the same destination are aggregated, reducing the number of variables by a factor equal to the size of the network. Problems with hundreds of nodes, with a total number of variables on the order of a million, can be solved using standard generic interior-point methods on CPUs; we focus on GPU-compatible algorithms that can solve such problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17996","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.17996/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.17996","created_at":"2026-07-05T10:43:43.190060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17996v2","created_at":"2026-07-05T10:43:43.190060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17996","created_at":"2026-07-05T10:43:43.190060+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EPRE3JL2VFK","created_at":"2026-07-05T10:43:43.190060+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EPRE3JL2VFK24FN","created_at":"2026-07-05T10:43:43.190060+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EPRE3JL","created_at":"2026-07-05T10:43:43.190060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17883","citing_title":"On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2601.07628","citing_title":"D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04605","citing_title":"Computational acceleration strategies for large-scale energy system optimization: a comparative study of GPU-accelerated and distributed-memory solvers","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4","json":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4.json","graph_json":"https://pith.science/api/pith-number/5EPRE3JL2VFK24FNDL6SWFTFY4/graph.json","events_json":"https://pith.science/api/pith-number/5EPRE3JL2VFK24FNDL6SWFTFY4/events.json","paper":"https://pith.science/paper/5EPRE3JL"},"agent_actions":{"view_html":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4","download_json":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4.json","view_paper":"https://pith.science/paper/5EPRE3JL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17996&json=true","fetch_graph":"https://pith.science/api/pith-number/5EPRE3JL2VFK24FNDL6SWFTFY4/graph.json","fetch_events":"https://pith.science/api/pith-number/5EPRE3JL2VFK24FNDL6SWFTFY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/action/storage_attestation","attest_author":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/action/author_attestation","sign_citation":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/action/citation_signature","submit_replication":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/action/replication_record"}},"created_at":"2026-07-05T10:43:43.190060+00:00","updated_at":"2026-07-05T10:43:43.190060+00:00"}