{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GXVVAQQHGFXQMTT2EPEEV2JFH7","short_pith_number":"pith:GXVVAQQH","schema_version":"1.0","canonical_sha256":"35eb504207316f064e7a23c84ae9253fc7afe9c448a124794a0c4c78f8c186a6","source":{"kind":"arxiv","id":"1804.07565","version":1},"attestation_state":"computed","paper":{"title":"Moments and convex optimization for analysis and control of nonlinear partial differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"CVUT), Didier Henrion (LAAS-MAC, IMT), Jean-Bernard Lasserre (LAAS-MAC, Milan Korda (UCSB)","submitted_at":"2018-04-20T11:57:20Z","abstract_excerpt":"This work presents a convex-optimization-based framework for analysis and control of nonlinear partial differential equations. The approach uses a particular weak embedding of the nonlinear PDE, resulting in a linear equation in the space of Borel measures. This equation is then used as a constraint of an infinite-dimensional linear programming problem (LP). This LP is then approximated by a hierarchy of convex, finite-dimensional, semidefinite programming problems (SDPs). In the case of analysis of uncontrolled PDEs, the solutions to these SDPs provide bounds on a specified, possibly nonlinea"},"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":"1804.07565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-20T11:57:20Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"26130d7608073b785ac87914fe1427e908928ae9637fcaf6a931cd81b1206e44","abstract_canon_sha256":"8d569c6718b660ed721e357097e14a85f7f593c633514d6497b4a6d009f950f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:58.452832Z","signature_b64":"nqOYKEDFTJXjXssH1EFrbZeLG3vwZl/iCHfmFyjI4LTvHdREKSK+9bGdoXw6VmDIH2PAoYj35hi43epCQEBWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35eb504207316f064e7a23c84ae9253fc7afe9c448a124794a0c4c78f8c186a6","last_reissued_at":"2026-05-18T00:17:58.452301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:58.452301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Moments and convex optimization for analysis and control of nonlinear partial differential equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"CVUT), Didier Henrion (LAAS-MAC, IMT), Jean-Bernard Lasserre (LAAS-MAC, Milan Korda (UCSB)","submitted_at":"2018-04-20T11:57:20Z","abstract_excerpt":"This work presents a convex-optimization-based framework for analysis and control of nonlinear partial differential equations. The approach uses a particular weak embedding of the nonlinear PDE, resulting in a linear equation in the space of Borel measures. This equation is then used as a constraint of an infinite-dimensional linear programming problem (LP). This LP is then approximated by a hierarchy of convex, finite-dimensional, semidefinite programming problems (SDPs). In the case of analysis of uncontrolled PDEs, the solutions to these SDPs provide bounds on a specified, possibly nonlinea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07565","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":""},"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":"1804.07565","created_at":"2026-05-18T00:17:58.452403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07565v1","created_at":"2026-05-18T00:17:58.452403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07565","created_at":"2026-05-18T00:17:58.452403+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXVVAQQHGFXQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXVVAQQHGFXQMTT2","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXVVAQQH","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.12136","citing_title":"Duality of convex relaxations for constrained variational problems","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7","json":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7.json","graph_json":"https://pith.science/api/pith-number/GXVVAQQHGFXQMTT2EPEEV2JFH7/graph.json","events_json":"https://pith.science/api/pith-number/GXVVAQQHGFXQMTT2EPEEV2JFH7/events.json","paper":"https://pith.science/paper/GXVVAQQH"},"agent_actions":{"view_html":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7","download_json":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7.json","view_paper":"https://pith.science/paper/GXVVAQQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07565&json=true","fetch_graph":"https://pith.science/api/pith-number/GXVVAQQHGFXQMTT2EPEEV2JFH7/graph.json","fetch_events":"https://pith.science/api/pith-number/GXVVAQQHGFXQMTT2EPEEV2JFH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7/action/storage_attestation","attest_author":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7/action/author_attestation","sign_citation":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7/action/citation_signature","submit_replication":"https://pith.science/pith/GXVVAQQHGFXQMTT2EPEEV2JFH7/action/replication_record"}},"created_at":"2026-05-18T00:17:58.452403+00:00","updated_at":"2026-05-18T00:17:58.452403+00:00"}