{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OFU4F2VVI6CFYKEJ2FGE2SP3YK","short_pith_number":"pith:OFU4F2VV","canonical_record":{"source":{"id":"2304.11252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-21T21:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"448e505230f94a620c742686baed7ff03c8831d9e510ba1dc989d258ae416aeb","abstract_canon_sha256":"d725b4fcdfd5d9fb7085b27b330ee388f16a37926ad7645236c98006353dd6bd"},"schema_version":"1.0"},"canonical_sha256":"7169c2eab547845c2889d14c4d49fbc2923ba0485034240e93d16dd4ad5a9663","source":{"kind":"arxiv","id":"2304.11252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.11252","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"2304.11252v1","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11252","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"OFU4F2VVI6CF","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"pith_short_16","alias_value":"OFU4F2VVI6CFYKEJ","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"pith_short_8","alias_value":"OFU4F2VV","created_at":"2026-07-05T06:03:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OFU4F2VVI6CFYKEJ2FGE2SP3YK","target":"record","payload":{"canonical_record":{"source":{"id":"2304.11252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-21T21:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"448e505230f94a620c742686baed7ff03c8831d9e510ba1dc989d258ae416aeb","abstract_canon_sha256":"d725b4fcdfd5d9fb7085b27b330ee388f16a37926ad7645236c98006353dd6bd"},"schema_version":"1.0"},"canonical_sha256":"7169c2eab547845c2889d14c4d49fbc2923ba0485034240e93d16dd4ad5a9663","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:30.365770Z","signature_b64":"c2Q5qmjCUAC9o4/zwBiL4Ko1SywLskoDTAupa4ohJ6uGOSoJp+OQVR9PBW7jhiB+zyPLeoHFjARcjmV9J8YXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7169c2eab547845c2889d14c4d49fbc2923ba0485034240e93d16dd4ad5a9663","last_reissued_at":"2026-07-05T06:03:30.365371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:30.365371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.11252","source_version":1,"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-05T06:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlK0M4bF1VJiC213iNjEzjzzb44cKAKDOJSTeUiEJwKByMco64I70i7A0MSdNfHdLwgQqr+QBH77fy4xWCysBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T20:22:26.744053Z"},"content_sha256":"620cf0029cb0de1c7a47c98cf10de5ee2e34d51f9c17c53a8ace2ac177ab8f6e","schema_version":"1.0","event_id":"sha256:620cf0029cb0de1c7a47c98cf10de5ee2e34d51f9c17c53a8ace2ac177ab8f6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OFU4F2VVI6CFYKEJ2FGE2SP3YK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Accuracy Multicommodity Flows via Iterative Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Li Chen, Mingquan Ye","submitted_at":"2023-04-21T21:07:52Z","abstract_excerpt":"The multicommodity flow problem is a classic problem in network flow and combinatorial optimization, with applications in transportation, communication, logistics, and supply chain management, etc. Existing algorithms often focus on low-accuracy approximate solutions, while high-accuracy algorithms typically rely on general linear program solvers. In this paper, we present efficient high-accuracy algorithms for a broad family of multicommodity flow problems on undirected graphs, demonstrating improved running times compared to general linear program solvers. Our main result shows that we can s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11252","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/2304.11252/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-05T06:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgfkd4WnCmE1Uu/07YRmiyU0w1rqSCG+D1VGzHQ8C8GXdYJHIXyUuWrxhVd2BmtZgblxfLdq8Unm01THeJfvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T20:22:26.744440Z"},"content_sha256":"e6c2398291eca86c9f161506699af05189101fffed8941d611c4cfbf9fa8e525","schema_version":"1.0","event_id":"sha256:e6c2398291eca86c9f161506699af05189101fffed8941d611c4cfbf9fa8e525"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK/bundle.json","state_url":"https://pith.science/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK/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-07-13T20:22:26Z","links":{"resolver":"https://pith.science/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK","bundle":"https://pith.science/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK/bundle.json","state":"https://pith.science/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFU4F2VVI6CFYKEJ2FGE2SP3YK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OFU4F2VVI6CFYKEJ2FGE2SP3YK","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":"d725b4fcdfd5d9fb7085b27b330ee388f16a37926ad7645236c98006353dd6bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-21T21:07:52Z","title_canon_sha256":"448e505230f94a620c742686baed7ff03c8831d9e510ba1dc989d258ae416aeb"},"schema_version":"1.0","source":{"id":"2304.11252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.11252","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"2304.11252v1","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.11252","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"OFU4F2VVI6CF","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"pith_short_16","alias_value":"OFU4F2VVI6CFYKEJ","created_at":"2026-07-05T06:03:30Z"},{"alias_kind":"pith_short_8","alias_value":"OFU4F2VV","created_at":"2026-07-05T06:03:30Z"}],"graph_snapshots":[{"event_id":"sha256:e6c2398291eca86c9f161506699af05189101fffed8941d611c4cfbf9fa8e525","target":"graph","created_at":"2026-07-05T06:03:30Z","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/2304.11252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The multicommodity flow problem is a classic problem in network flow and combinatorial optimization, with applications in transportation, communication, logistics, and supply chain management, etc. Existing algorithms often focus on low-accuracy approximate solutions, while high-accuracy algorithms typically rely on general linear program solvers. In this paper, we present efficient high-accuracy algorithms for a broad family of multicommodity flow problems on undirected graphs, demonstrating improved running times compared to general linear program solvers. Our main result shows that we can s","authors_text":"Li Chen, Mingquan Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-21T21:07:52Z","title":"High-Accuracy Multicommodity Flows via Iterative Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.11252","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:620cf0029cb0de1c7a47c98cf10de5ee2e34d51f9c17c53a8ace2ac177ab8f6e","target":"record","created_at":"2026-07-05T06:03:30Z","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":"d725b4fcdfd5d9fb7085b27b330ee388f16a37926ad7645236c98006353dd6bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-21T21:07:52Z","title_canon_sha256":"448e505230f94a620c742686baed7ff03c8831d9e510ba1dc989d258ae416aeb"},"schema_version":"1.0","source":{"id":"2304.11252","kind":"arxiv","version":1}},"canonical_sha256":"7169c2eab547845c2889d14c4d49fbc2923ba0485034240e93d16dd4ad5a9663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7169c2eab547845c2889d14c4d49fbc2923ba0485034240e93d16dd4ad5a9663","first_computed_at":"2026-07-05T06:03:30.365371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:03:30.365371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2Q5qmjCUAC9o4/zwBiL4Ko1SywLskoDTAupa4ohJ6uGOSoJp+OQVR9PBW7jhiB+zyPLeoHFjARcjmV9J8YXDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:03:30.365770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.11252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:620cf0029cb0de1c7a47c98cf10de5ee2e34d51f9c17c53a8ace2ac177ab8f6e","sha256:e6c2398291eca86c9f161506699af05189101fffed8941d611c4cfbf9fa8e525"],"state_sha256":"baebea32236007be2a93a3c1f904271dbf4a7aa4b1cff690d4c8af572952e3c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjksczJtRPVWtlyfz63EbzPUXqSeaRqzUy5w3IPDcXlvsSpnAwc1kyKD+ohUP6iBgHMGtaDID3jwdrOkG7D+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T20:22:26.746545Z","bundle_sha256":"997d07eb6a33d5855aea8632f6534b96efce8ae2adc59ee981a676907202fdd9"}}