{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FZ233ULNA236WGGRRNFLUNA6X2","short_pith_number":"pith:FZ233ULN","schema_version":"1.0","canonical_sha256":"2e75bdd16d06b7eb18d18b4aba341ebe909c5cfba421bf955a8c19d4c1c7c700","source":{"kind":"arxiv","id":"1807.00937","version":2},"attestation_state":"computed","paper":{"title":"Constrained dynamical optimal transport and its Lagrangian formulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stanley Osher, Wuchen Li","submitted_at":"2018-07-03T00:49:19Z","abstract_excerpt":"We propose dynamical optimal transport (OT) problems constrained in a parameterized probability subset. In application problems such as deep learning, the probability distribution is often generated by a parameterized mapping function. In this case, we derive a simple formulation for the constrained dynamical OT."},"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":"1807.00937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-03T00:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"67db9fc476fea33caf3a474c4abf962a6c7009c93dc23cebcf3e664e20f77f4c","abstract_canon_sha256":"afa48b8e8b8a379675fb38cb0baea85ba04d9851b715a9c1c263af047c291682"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:01.410227Z","signature_b64":"kKB0ngQAT42mT6AH0RDdQvDSbfGyEmuSA1dLkL5MrdMUk+nVURfjA6UMcU0H6g2ndSHM7sxLL5H4dVyxLR8zAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e75bdd16d06b7eb18d18b4aba341ebe909c5cfba421bf955a8c19d4c1c7c700","last_reissued_at":"2026-05-18T00:06:01.409825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:01.409825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained dynamical optimal transport and its Lagrangian formulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Stanley Osher, Wuchen Li","submitted_at":"2018-07-03T00:49:19Z","abstract_excerpt":"We propose dynamical optimal transport (OT) problems constrained in a parameterized probability subset. In application problems such as deep learning, the probability distribution is often generated by a parameterized mapping function. In this case, we derive a simple formulation for the constrained dynamical OT."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00937","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":""},"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":"1807.00937","created_at":"2026-05-18T00:06:01.409891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00937v2","created_at":"2026-05-18T00:06:01.409891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00937","created_at":"2026-05-18T00:06:01.409891+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZ233ULNA236","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZ233ULNA236WGGR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZ233ULN","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2","json":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2.json","graph_json":"https://pith.science/api/pith-number/FZ233ULNA236WGGRRNFLUNA6X2/graph.json","events_json":"https://pith.science/api/pith-number/FZ233ULNA236WGGRRNFLUNA6X2/events.json","paper":"https://pith.science/paper/FZ233ULN"},"agent_actions":{"view_html":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2","download_json":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2.json","view_paper":"https://pith.science/paper/FZ233ULN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00937&json=true","fetch_graph":"https://pith.science/api/pith-number/FZ233ULNA236WGGRRNFLUNA6X2/graph.json","fetch_events":"https://pith.science/api/pith-number/FZ233ULNA236WGGRRNFLUNA6X2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2/action/storage_attestation","attest_author":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2/action/author_attestation","sign_citation":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2/action/citation_signature","submit_replication":"https://pith.science/pith/FZ233ULNA236WGGRRNFLUNA6X2/action/replication_record"}},"created_at":"2026-05-18T00:06:01.409891+00:00","updated_at":"2026-05-18T00:06:01.409891+00:00"}