{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UAQ2IGCCO4IEX4J6ILTD7IX7GF","short_pith_number":"pith:UAQ2IGCC","schema_version":"1.0","canonical_sha256":"a021a4184277104bf13e42e63fa2ff316a61be75d725c217b332f6cf319aecc0","source":{"kind":"arxiv","id":"2106.14485","version":1},"attestation_state":"computed","paper":{"title":"Scalable computation of dynamic flow problems via multi-marginal graph-structured optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel Ringh, Isabel Haasler, Johan Karlsson, Yongxin Chen","submitted_at":"2021-06-28T08:55:12Z","abstract_excerpt":"In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport problem, where the cost function and the constraints on the marginals are associated with a graph structure. By exploiting these structures and building on recent advances in optimal transport theory, we develop an efficient method for such entropy-regularized optimal transport problems. In particular, the graph structure is utilized to efficiently compute "},"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":"2106.14485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-28T08:55:12Z","cross_cats_sorted":[],"title_canon_sha256":"5765c0a0837547639a934ce2f943207db6bf22464d1f8661d0bcf2561a8c8d44","abstract_canon_sha256":"3af10e5db3b23250c7e59819745304778863fa08685df4d4fdfaf359128e64d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:51.307074Z","signature_b64":"PZNvrWoYPAEcwe5552PEi+1jleL9FiR0IJPo3lIyp7YTTMH0IamDv7oY28fJVFQM6TYutD87vYlgqMijEuIWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a021a4184277104bf13e42e63fa2ff316a61be75d725c217b332f6cf319aecc0","last_reissued_at":"2026-07-05T02:52:51.306737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:51.306737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable computation of dynamic flow problems via multi-marginal graph-structured optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel Ringh, Isabel Haasler, Johan Karlsson, Yongxin Chen","submitted_at":"2021-06-28T08:55:12Z","abstract_excerpt":"In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport problem, where the cost function and the constraints on the marginals are associated with a graph structure. By exploiting these structures and building on recent advances in optimal transport theory, we develop an efficient method for such entropy-regularized optimal transport problems. In particular, the graph structure is utilized to efficiently compute "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14485","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/2106.14485/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":"2106.14485","created_at":"2026-07-05T02:52:51.306788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.14485v1","created_at":"2026-07-05T02:52:51.306788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14485","created_at":"2026-07-05T02:52:51.306788+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAQ2IGCCO4IE","created_at":"2026-07-05T02:52:51.306788+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAQ2IGCCO4IEX4J6","created_at":"2026-07-05T02:52:51.306788+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAQ2IGCC","created_at":"2026-07-05T02:52:51.306788+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09659","citing_title":"Fokker-Planck to Callan-Symanzik: evolution of weight matrices under training","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF","json":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF.json","graph_json":"https://pith.science/api/pith-number/UAQ2IGCCO4IEX4J6ILTD7IX7GF/graph.json","events_json":"https://pith.science/api/pith-number/UAQ2IGCCO4IEX4J6ILTD7IX7GF/events.json","paper":"https://pith.science/paper/UAQ2IGCC"},"agent_actions":{"view_html":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF","download_json":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF.json","view_paper":"https://pith.science/paper/UAQ2IGCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.14485&json=true","fetch_graph":"https://pith.science/api/pith-number/UAQ2IGCCO4IEX4J6ILTD7IX7GF/graph.json","fetch_events":"https://pith.science/api/pith-number/UAQ2IGCCO4IEX4J6ILTD7IX7GF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF/action/storage_attestation","attest_author":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF/action/author_attestation","sign_citation":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF/action/citation_signature","submit_replication":"https://pith.science/pith/UAQ2IGCCO4IEX4J6ILTD7IX7GF/action/replication_record"}},"created_at":"2026-07-05T02:52:51.306788+00:00","updated_at":"2026-07-05T02:52:51.306788+00:00"}