{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OW642RZE6WOIX47KZNOJR4LBLB","short_pith_number":"pith:OW642RZE","schema_version":"1.0","canonical_sha256":"75bdcd4724f59c8bf3eacb5c98f16158586864eb37073bf37867b51ea366c8be","source":{"kind":"arxiv","id":"1612.01193","version":3},"attestation_state":"computed","paper":{"title":"Optimal transport over nonlinear systems via infinitesimal generators on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","nlin.CD"],"primary_cat":"math.DS","authors_text":"Karthik Elamvazhuthi, Piyush Grover","submitted_at":"2016-12-04T22:09:35Z","abstract_excerpt":"We present a set-oriented graph-based computational framework for continuous-time optimal transport over nonlinear dynamical systems. We recover provably optimal control laws for steering a given initial distribution in phase space to a final distribution in prescribed finite time for the case of non-autonomous nonlinear control-affine systems, while minimizing a quadratic control cost. The resulting control law can be used to obtain approximate feedback laws for individual agents in a swarm control application. Using infinitesimal generators, the optimal control problem is reduced to a modifi"},"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":"1612.01193","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-12-04T22:09:35Z","cross_cats_sorted":["cs.SY","math.OC","nlin.CD"],"title_canon_sha256":"8ae051b9c72cc6f6cf5ce2187d37a3b2df79f1c829b066e39d6b865183c97bd8","abstract_canon_sha256":"31c95177d2964a8a758c95412b40b396dbacfa2b4452030c6c950cfbb036cf2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.401770Z","signature_b64":"Z//Xl147X3FB2vG9B0NvsndTvrCYrcyC8hjz+kpMdXBLwRuKV8/6ts+cviQCEu0yiUlYWgRBgO89s5e8Wl/aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75bdcd4724f59c8bf3eacb5c98f16158586864eb37073bf37867b51ea366c8be","last_reissued_at":"2026-05-17T23:57:54.401075Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.401075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal transport over nonlinear systems via infinitesimal generators on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","nlin.CD"],"primary_cat":"math.DS","authors_text":"Karthik Elamvazhuthi, Piyush Grover","submitted_at":"2016-12-04T22:09:35Z","abstract_excerpt":"We present a set-oriented graph-based computational framework for continuous-time optimal transport over nonlinear dynamical systems. We recover provably optimal control laws for steering a given initial distribution in phase space to a final distribution in prescribed finite time for the case of non-autonomous nonlinear control-affine systems, while minimizing a quadratic control cost. The resulting control law can be used to obtain approximate feedback laws for individual agents in a swarm control application. Using infinitesimal generators, the optimal control problem is reduced to a modifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01193","kind":"arxiv","version":3},"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":"1612.01193","created_at":"2026-05-17T23:57:54.401157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01193v3","created_at":"2026-05-17T23:57:54.401157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01193","created_at":"2026-05-17T23:57:54.401157+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW642RZE6WOI","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW642RZE6WOIX47K","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW642RZE","created_at":"2026-05-18T12:30:36.002864+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/OW642RZE6WOIX47KZNOJR4LBLB","json":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB.json","graph_json":"https://pith.science/api/pith-number/OW642RZE6WOIX47KZNOJR4LBLB/graph.json","events_json":"https://pith.science/api/pith-number/OW642RZE6WOIX47KZNOJR4LBLB/events.json","paper":"https://pith.science/paper/OW642RZE"},"agent_actions":{"view_html":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB","download_json":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB.json","view_paper":"https://pith.science/paper/OW642RZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01193&json=true","fetch_graph":"https://pith.science/api/pith-number/OW642RZE6WOIX47KZNOJR4LBLB/graph.json","fetch_events":"https://pith.science/api/pith-number/OW642RZE6WOIX47KZNOJR4LBLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB/action/storage_attestation","attest_author":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB/action/author_attestation","sign_citation":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB/action/citation_signature","submit_replication":"https://pith.science/pith/OW642RZE6WOIX47KZNOJR4LBLB/action/replication_record"}},"created_at":"2026-05-17T23:57:54.401157+00:00","updated_at":"2026-05-17T23:57:54.401157+00:00"}