{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4IFNOLYADUI5MMOOLNRQCA6GLY","short_pith_number":"pith:4IFNOLYA","schema_version":"1.0","canonical_sha256":"e20ad72f001d11d631ce5b630103c65e2034e80b66f9843eee100727f21c114b","source":{"kind":"arxiv","id":"1611.06278","version":2},"attestation_state":"computed","paper":{"title":"Optimal perturbations for nonlinear systems using graph-based optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Karthik Elamvazhuthi, Piyush Grover","submitted_at":"2016-11-18T23:55:45Z","abstract_excerpt":"We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on the phase space to a final measure in finite time. The measure is propagated under system dynamics in between the perturbations via the associated transfer operator. Each perturbation is described by a deterministic map in the measure space that implements a version of Monge-Kantorovich optimal transport with quadratic cost. Hence, the optimal solution minimi"},"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":"1611.06278","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-11-18T23:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"be228549dee63abaf5ee4366de827893db852788cf91b62e63dee7fb2686df1a","abstract_canon_sha256":"31ced30624ee908d0f7e298418a6baa34001a9c1bf256f7900e1dc8ab785b9bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:06.315299Z","signature_b64":"Pjo6roD9vnk9gLd9ZC5MYzkc3qCpfkSYiRoV/viP/uLyEm7clcoHHC2ymuuLutenCN/4pTBkow657HP2S1SSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e20ad72f001d11d631ce5b630103c65e2034e80b66f9843eee100727f21c114b","last_reissued_at":"2026-05-18T00:30:06.314719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:06.314719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal perturbations for nonlinear systems using graph-based optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Karthik Elamvazhuthi, Piyush Grover","submitted_at":"2016-11-18T23:55:45Z","abstract_excerpt":"We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on the phase space to a final measure in finite time. The measure is propagated under system dynamics in between the perturbations via the associated transfer operator. Each perturbation is described by a deterministic map in the measure space that implements a version of Monge-Kantorovich optimal transport with quadratic cost. Hence, the optimal solution minimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06278","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":"1611.06278","created_at":"2026-05-18T00:30:06.314801+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06278v2","created_at":"2026-05-18T00:30:06.314801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06278","created_at":"2026-05-18T00:30:06.314801+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IFNOLYADUI5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IFNOLYADUI5MMOO","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IFNOLYA","created_at":"2026-05-18T12:29:58.707656+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/4IFNOLYADUI5MMOOLNRQCA6GLY","json":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY.json","graph_json":"https://pith.science/api/pith-number/4IFNOLYADUI5MMOOLNRQCA6GLY/graph.json","events_json":"https://pith.science/api/pith-number/4IFNOLYADUI5MMOOLNRQCA6GLY/events.json","paper":"https://pith.science/paper/4IFNOLYA"},"agent_actions":{"view_html":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY","download_json":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY.json","view_paper":"https://pith.science/paper/4IFNOLYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06278&json=true","fetch_graph":"https://pith.science/api/pith-number/4IFNOLYADUI5MMOOLNRQCA6GLY/graph.json","fetch_events":"https://pith.science/api/pith-number/4IFNOLYADUI5MMOOLNRQCA6GLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY/action/storage_attestation","attest_author":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY/action/author_attestation","sign_citation":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY/action/citation_signature","submit_replication":"https://pith.science/pith/4IFNOLYADUI5MMOOLNRQCA6GLY/action/replication_record"}},"created_at":"2026-05-18T00:30:06.314801+00:00","updated_at":"2026-05-18T00:30:06.314801+00:00"}