{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YECA7DEMJ3MOACHUWEPI5DMGCY","short_pith_number":"pith:YECA7DEM","schema_version":"1.0","canonical_sha256":"c1040f8c8c4ed8e008f4b11e8e8d86163d931caadc8ce79041c0d09bf2c3fb7f","source":{"kind":"arxiv","id":"1602.08931","version":1},"attestation_state":"computed","paper":{"title":"Infinite horizon sparse optimal control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dante Kalise, Karl Kunisch, Zhiping Rao","submitted_at":"2016-02-29T12:21:50Z","abstract_excerpt":"A class of infinite horizon optimal control problems involving $L^p$-type cost functionals with $0<p\\leq 1$ is discussed. The existence of optimal controls is studied for both the convex case with $p=1$ and the nonconvex case with $0<p<1$, and the sparsity structure of the optimal controls promoted by the $L^p$-type penalties is analyzed. A dynamic programming approach is proposed to numerically approximate the corresponding sparse optimal controllers."},"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":"1602.08931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-29T12:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"db968c67f30c9812b0b68ea216dd5299f192c6f189e689ef23c8133a3220e37b","abstract_canon_sha256":"837aac9b550bb0b0bb47210a48eb86fb668f12d498f7aad474f878a5ba18dac8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:27.406767Z","signature_b64":"drJYH6vhiwKFgiSoIk6OxpjhkzKhDMCCa7AODdiQkd4bKsfmhRtRsHD0XondRUUwysNY6dHdixpx/7kqgWQ9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1040f8c8c4ed8e008f4b11e8e8d86163d931caadc8ce79041c0d09bf2c3fb7f","last_reissued_at":"2026-05-18T00:08:27.406198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:27.406198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite horizon sparse optimal control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dante Kalise, Karl Kunisch, Zhiping Rao","submitted_at":"2016-02-29T12:21:50Z","abstract_excerpt":"A class of infinite horizon optimal control problems involving $L^p$-type cost functionals with $0<p\\leq 1$ is discussed. The existence of optimal controls is studied for both the convex case with $p=1$ and the nonconvex case with $0<p<1$, and the sparsity structure of the optimal controls promoted by the $L^p$-type penalties is analyzed. A dynamic programming approach is proposed to numerically approximate the corresponding sparse optimal controllers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08931","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":"1602.08931","created_at":"2026-05-18T00:08:27.406296+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08931v1","created_at":"2026-05-18T00:08:27.406296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08931","created_at":"2026-05-18T00:08:27.406296+00:00"},{"alias_kind":"pith_short_12","alias_value":"YECA7DEMJ3MO","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YECA7DEMJ3MOACHU","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YECA7DEM","created_at":"2026-05-18T12:30:53.716459+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/YECA7DEMJ3MOACHUWEPI5DMGCY","json":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY.json","graph_json":"https://pith.science/api/pith-number/YECA7DEMJ3MOACHUWEPI5DMGCY/graph.json","events_json":"https://pith.science/api/pith-number/YECA7DEMJ3MOACHUWEPI5DMGCY/events.json","paper":"https://pith.science/paper/YECA7DEM"},"agent_actions":{"view_html":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY","download_json":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY.json","view_paper":"https://pith.science/paper/YECA7DEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08931&json=true","fetch_graph":"https://pith.science/api/pith-number/YECA7DEMJ3MOACHUWEPI5DMGCY/graph.json","fetch_events":"https://pith.science/api/pith-number/YECA7DEMJ3MOACHUWEPI5DMGCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY/action/storage_attestation","attest_author":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY/action/author_attestation","sign_citation":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY/action/citation_signature","submit_replication":"https://pith.science/pith/YECA7DEMJ3MOACHUWEPI5DMGCY/action/replication_record"}},"created_at":"2026-05-18T00:08:27.406296+00:00","updated_at":"2026-05-18T00:08:27.406296+00:00"}