{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HEFHCN5HFXYEP5HWU4MYRKXVH6","short_pith_number":"pith:HEFHCN5H","schema_version":"1.0","canonical_sha256":"390a7137a72df047f4f6a71988aaf53f9033297a57a8c68fd858b991ace19e3d","source":{"kind":"arxiv","id":"1710.03723","version":1},"attestation_state":"computed","paper":{"title":"A Convex Optimization Approach for Backstepping PDE Design: Volterra and Fredholm Operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alessandro Astolfi, Pedro Ascencio, Thomas Parisini","submitted_at":"2017-10-10T16:48:43Z","abstract_excerpt":"Backstepping design for boundary linear PDE is formulated as a convex optimization problem. Some classes of parabolic PDEs and a first-order hyperbolic PDE are studied, with particular attention to non-strict feedback structures. Based on the compactness of the Volterra and Fredholm type operators involved, their Kernels are approximated via polynomial functions. The resulting Kernel-PDEs are optimized using Sum-of-Squares(SOS) decomposition and solved via semidefinite programming, with sufficient precision to guarantee the stability of the system in the L2-norm. The effectiveness and limitati"},"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":"1710.03723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-10T16:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"e7818b154dad0415eb6c52dd5dbd0a0217e24d0078bba46f887631cd744cc7a4","abstract_canon_sha256":"174dbb38046fbe0ab62f662be93c7f5647c888d14b2641247aef014824fe121b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:10.875565Z","signature_b64":"T0uACkHzn3xgyBU9iathLKYbJp2EEhI+QYQcGIEJJADkADI7WzEzbiieAjAPpujMAzAbZ7PuAhedcpKI3ldyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"390a7137a72df047f4f6a71988aaf53f9033297a57a8c68fd858b991ace19e3d","last_reissued_at":"2026-05-18T00:33:10.874898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:10.874898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convex Optimization Approach for Backstepping PDE Design: Volterra and Fredholm Operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Alessandro Astolfi, Pedro Ascencio, Thomas Parisini","submitted_at":"2017-10-10T16:48:43Z","abstract_excerpt":"Backstepping design for boundary linear PDE is formulated as a convex optimization problem. Some classes of parabolic PDEs and a first-order hyperbolic PDE are studied, with particular attention to non-strict feedback structures. Based on the compactness of the Volterra and Fredholm type operators involved, their Kernels are approximated via polynomial functions. The resulting Kernel-PDEs are optimized using Sum-of-Squares(SOS) decomposition and solved via semidefinite programming, with sufficient precision to guarantee the stability of the system in the L2-norm. The effectiveness and limitati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03723","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":"1710.03723","created_at":"2026-05-18T00:33:10.875008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03723v1","created_at":"2026-05-18T00:33:10.875008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03723","created_at":"2026-05-18T00:33:10.875008+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEFHCN5HFXYE","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEFHCN5HFXYEP5HW","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEFHCN5H","created_at":"2026-05-18T12:31:18.294218+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/HEFHCN5HFXYEP5HWU4MYRKXVH6","json":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6.json","graph_json":"https://pith.science/api/pith-number/HEFHCN5HFXYEP5HWU4MYRKXVH6/graph.json","events_json":"https://pith.science/api/pith-number/HEFHCN5HFXYEP5HWU4MYRKXVH6/events.json","paper":"https://pith.science/paper/HEFHCN5H"},"agent_actions":{"view_html":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6","download_json":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6.json","view_paper":"https://pith.science/paper/HEFHCN5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03723&json=true","fetch_graph":"https://pith.science/api/pith-number/HEFHCN5HFXYEP5HWU4MYRKXVH6/graph.json","fetch_events":"https://pith.science/api/pith-number/HEFHCN5HFXYEP5HWU4MYRKXVH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6/action/storage_attestation","attest_author":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6/action/author_attestation","sign_citation":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6/action/citation_signature","submit_replication":"https://pith.science/pith/HEFHCN5HFXYEP5HWU4MYRKXVH6/action/replication_record"}},"created_at":"2026-05-18T00:33:10.875008+00:00","updated_at":"2026-05-18T00:33:10.875008+00:00"}