{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IUMBEMBOO43WK777EKDN5VQGMY","short_pith_number":"pith:IUMBEMBO","schema_version":"1.0","canonical_sha256":"451812302e7737657fff2286ded6066629f67864eac5791247faca78722ac134","source":{"kind":"arxiv","id":"1805.06424","version":3},"attestation_state":"computed","paper":{"title":"A Theoretical Difficulty in Approximate Dynamic Programming with Input Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nitin Sharma, Xuefeng Bao, Zhi-Hong Mao","submitted_at":"2018-05-16T16:55:05Z","abstract_excerpt":"Equipping approximate dynamic programming (ADP) with inputconstraints has a tremendous significance. This enables ADP to be applied tothe systems with actuator limitations, which is quite common for dynamicalsystems. In a conventional constrained ADP framework, the optimal control issearched via a policy iteration algorithm, where the value under a constrainedcontrol is solved from a Hamilton-Jacobi-Bellman (HJB) equation while theconstrained control policy is improved based on the current estimated value.This concise and applicable method has been widely-used. However, the con-vergence of the"},"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":"1805.06424","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2018-05-16T16:55:05Z","cross_cats_sorted":[],"title_canon_sha256":"e6c4237e4873f1e441b5821425ae79caa116d9eaa531f84c818c2a6825115578","abstract_canon_sha256":"e8bf48e9c47df29648f06318f5e88ee99979ba0bf923534f17c367a13b71e51a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:09.468590Z","signature_b64":"ur63FGvwwI8BHgt1NM3yuWG1cy3fkBWR4SjQtfM5dZl81LbJNJDkPa3xs4mWDemlVPSdy9WTIi2xRCyctuqJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"451812302e7737657fff2286ded6066629f67864eac5791247faca78722ac134","last_reissued_at":"2026-05-18T00:15:09.468165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:09.468165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theoretical Difficulty in Approximate Dynamic Programming with Input Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nitin Sharma, Xuefeng Bao, Zhi-Hong Mao","submitted_at":"2018-05-16T16:55:05Z","abstract_excerpt":"Equipping approximate dynamic programming (ADP) with inputconstraints has a tremendous significance. This enables ADP to be applied tothe systems with actuator limitations, which is quite common for dynamicalsystems. In a conventional constrained ADP framework, the optimal control issearched via a policy iteration algorithm, where the value under a constrainedcontrol is solved from a Hamilton-Jacobi-Bellman (HJB) equation while theconstrained control policy is improved based on the current estimated value.This concise and applicable method has been widely-used. However, the con-vergence of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06424","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":"1805.06424","created_at":"2026-05-18T00:15:09.468225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06424v3","created_at":"2026-05-18T00:15:09.468225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06424","created_at":"2026-05-18T00:15:09.468225+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUMBEMBOO43W","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUMBEMBOO43WK777","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUMBEMBO","created_at":"2026-05-18T12:32:31.084164+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/IUMBEMBOO43WK777EKDN5VQGMY","json":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY.json","graph_json":"https://pith.science/api/pith-number/IUMBEMBOO43WK777EKDN5VQGMY/graph.json","events_json":"https://pith.science/api/pith-number/IUMBEMBOO43WK777EKDN5VQGMY/events.json","paper":"https://pith.science/paper/IUMBEMBO"},"agent_actions":{"view_html":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY","download_json":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY.json","view_paper":"https://pith.science/paper/IUMBEMBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06424&json=true","fetch_graph":"https://pith.science/api/pith-number/IUMBEMBOO43WK777EKDN5VQGMY/graph.json","fetch_events":"https://pith.science/api/pith-number/IUMBEMBOO43WK777EKDN5VQGMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY/action/storage_attestation","attest_author":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY/action/author_attestation","sign_citation":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY/action/citation_signature","submit_replication":"https://pith.science/pith/IUMBEMBOO43WK777EKDN5VQGMY/action/replication_record"}},"created_at":"2026-05-18T00:15:09.468225+00:00","updated_at":"2026-05-18T00:15:09.468225+00:00"}