{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CG7GDPCSHFKHSQQJZOT5TEXEM2","short_pith_number":"pith:CG7GDPCS","schema_version":"1.0","canonical_sha256":"11be61bc523954794209cba7d992e4669232af4dd7a5cbbcd23833288d99bf39","source":{"kind":"arxiv","id":"2410.09801","version":1},"attestation_state":"computed","paper":{"title":"Duality-based Dynamical Optimal Transport of Discrete Time Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Rantzer, Dongjun Wu","submitted_at":"2024-10-13T11:10:18Z","abstract_excerpt":"We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces thi"},"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":"2410.09801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-13T11:10:18Z","cross_cats_sorted":[],"title_canon_sha256":"45d0a5fec6d0a0aa944bc14a0d4ca53dd9156b563ee8340de10167654d6dfdae","abstract_canon_sha256":"ccb8d799eee3951d6da117ae70e8023e096b197472b16fea2b1f7b2c43957d74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:44.260687Z","signature_b64":"sw53/uPRqzkFZtA9IpjnRBO4n/xCV0rjYAFjSsKvcJwSexVrojln2hhsKrSOM7CnbTDIezKHNB5uzdQLg1noDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11be61bc523954794209cba7d992e4669232af4dd7a5cbbcd23833288d99bf39","last_reissued_at":"2026-07-05T09:19:44.260212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:44.260212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duality-based Dynamical Optimal Transport of Discrete Time Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Rantzer, Dongjun Wu","submitted_at":"2024-10-13T11:10:18Z","abstract_excerpt":"We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.09801","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/2410.09801/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":"2410.09801","created_at":"2026-07-05T09:19:44.260268+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.09801v1","created_at":"2026-07-05T09:19:44.260268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.09801","created_at":"2026-07-05T09:19:44.260268+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG7GDPCSHFKH","created_at":"2026-07-05T09:19:44.260268+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG7GDPCSHFKHSQQJ","created_at":"2026-07-05T09:19:44.260268+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG7GDPCS","created_at":"2026-07-05T09:19:44.260268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.02706","citing_title":"Flow Matching for Measure Transport and Feedback Stabilization of Control-Affine Systems","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2","json":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2.json","graph_json":"https://pith.science/api/pith-number/CG7GDPCSHFKHSQQJZOT5TEXEM2/graph.json","events_json":"https://pith.science/api/pith-number/CG7GDPCSHFKHSQQJZOT5TEXEM2/events.json","paper":"https://pith.science/paper/CG7GDPCS"},"agent_actions":{"view_html":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2","download_json":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2.json","view_paper":"https://pith.science/paper/CG7GDPCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.09801&json=true","fetch_graph":"https://pith.science/api/pith-number/CG7GDPCSHFKHSQQJZOT5TEXEM2/graph.json","fetch_events":"https://pith.science/api/pith-number/CG7GDPCSHFKHSQQJZOT5TEXEM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2/action/storage_attestation","attest_author":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2/action/author_attestation","sign_citation":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2/action/citation_signature","submit_replication":"https://pith.science/pith/CG7GDPCSHFKHSQQJZOT5TEXEM2/action/replication_record"}},"created_at":"2026-07-05T09:19:44.260268+00:00","updated_at":"2026-07-05T09:19:44.260268+00:00"}