{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5EPRE3JL2VFK24FNDL6SWFTFY4","short_pith_number":"pith:5EPRE3JL","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"},"canonical_sha256":"e91f126d2bd54aad70ad1afd2b1665c727492e6ba8aa1022a2c809582cd7db42","source":{"kind":"arxiv","id":"2501.17996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17996","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17996v2","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17996","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"5EPRE3JL2VFK","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"5EPRE3JL2VFK24FN","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"5EPRE3JL","created_at":"2026-07-05T10:43:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5EPRE3JL2VFK24FNDL6SWFTFY4","target":"record","payload":{"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"},"canonical_sha256":"e91f126d2bd54aad70ad1afd2b1665c727492e6ba8aa1022a2c809582cd7db42","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"},"source_kind":"arxiv","source_id":"2501.17996","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLlUB3wA3coUm6Lutr+9CwEZbBnOFzKC7jLGjdj2rVSYgBG4a+23zBLVJG9zikRWjRbEuTIVO+1ZmkDQNSbBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:43:39.908296Z"},"content_sha256":"a48486d073abad0d9d07b7fcc22ebe0af8b82ce01b2ce6374a6909012312bf81","schema_version":"1.0","event_id":"sha256:a48486d073abad0d9d07b7fcc22ebe0af8b82ce01b2ce6374a6909012312bf81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5EPRE3JL2VFK24FNDL6SWFTFY4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l93w0t2fnqUXp1Te8xCyYS6HhaUqc85zmUprZW37jUUcQGgh2cJNfe6oLkkf1VAsGkXRekpoBDbp5lskGX5hBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:43:39.909235Z"},"content_sha256":"bc4dd474c2083791484b7837c6451e014d68c553ebea82c6bec1f2a49a4845de","schema_version":"1.0","event_id":"sha256:bc4dd474c2083791484b7837c6451e014d68c553ebea82c6bec1f2a49a4845de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/bundle.json","state_url":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T07:43:39Z","links":{"resolver":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4","bundle":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/bundle.json","state":"https://pith.science/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EPRE3JL2VFK24FNDL6SWFTFY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5EPRE3JL2VFK24FNDL6SWFTFY4","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":"b64232199636be09372eaf36e47669c0f890adf7e7195437ed7bba13acb51584","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T21:07:29Z","title_canon_sha256":"778def32d3eead5676c1c0f61a7c391f50861bf33505e17d760708bffc760d6f"},"schema_version":"1.0","source":{"id":"2501.17996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17996","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17996v2","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17996","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"5EPRE3JL2VFK","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"5EPRE3JL2VFK24FN","created_at":"2026-07-05T10:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"5EPRE3JL","created_at":"2026-07-05T10:43:43Z"}],"graph_snapshots":[{"event_id":"sha256:bc4dd474c2083791484b7837c6451e014d68c553ebea82c6bec1f2a49a4845de","target":"graph","created_at":"2026-07-05T10:43:43Z","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/2501.17996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fangzhao Zhang, Stephen Boyd","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T21:07:29Z","title":"Solving Large Multicommodity Network Flow Problems on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17996","kind":"arxiv","version":2},"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:a48486d073abad0d9d07b7fcc22ebe0af8b82ce01b2ce6374a6909012312bf81","target":"record","created_at":"2026-07-05T10:43:43Z","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":"b64232199636be09372eaf36e47669c0f890adf7e7195437ed7bba13acb51584","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-29T21:07:29Z","title_canon_sha256":"778def32d3eead5676c1c0f61a7c391f50861bf33505e17d760708bffc760d6f"},"schema_version":"1.0","source":{"id":"2501.17996","kind":"arxiv","version":2}},"canonical_sha256":"e91f126d2bd54aad70ad1afd2b1665c727492e6ba8aa1022a2c809582cd7db42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e91f126d2bd54aad70ad1afd2b1665c727492e6ba8aa1022a2c809582cd7db42","first_computed_at":"2026-07-05T10:43:43.190002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:43.190002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mg+5sp91nQhDLHQCY2aUTaRGE2sIEL6k8ajE0PUoaGbQQ7o12+iGWRe0h7x/Y2sO+sjrQeeOpgRZdU/C2kIqBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:43.190484Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.17996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a48486d073abad0d9d07b7fcc22ebe0af8b82ce01b2ce6374a6909012312bf81","sha256:bc4dd474c2083791484b7837c6451e014d68c553ebea82c6bec1f2a49a4845de"],"state_sha256":"445db54726980b9e6dc2545ac9a90c4a226865dcea03cdd1d261dc18025aeee0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQlHm6EwZbYCKo0ArJ9f7FJId4sTqhWJi6nGDFfbbm0dYF/CfCL8w+tSG0GUQIiV4v/tVviEhgNpOYGHabyBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:43:39.914902Z","bundle_sha256":"e562919b9438f59864214b1a6dbd62ff0672efef2a9d47ad072d9cd5e7c002e3"}}