{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FMVDBHLP73LWCCV2BOFKM67UZP","short_pith_number":"pith:FMVDBHLP","schema_version":"1.0","canonical_sha256":"2b2a309d6ffed7610aba0b8aa67bf4cbced2f1952e987902df63ee14dc60aeb9","source":{"kind":"arxiv","id":"1304.3477","version":1},"attestation_state":"computed","paper":{"title":"Concurrent learning-based approximate optimal regulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Patrick Walters, Rushikesh Kamalapurkar, Warren Dixon","submitted_at":"2013-04-11T20:23:47Z","abstract_excerpt":"In deterministic systems, reinforcement learning-based online approximate optimal control methods typically require a restrictive persistence of excitation (PE) condition for convergence. This paper presents a concurrent learning-based solution to the online approximate optimal regulation problem that eliminates the need for PE. The development is based on the observation that given a model of the system, the Bellman error, which quantifies the deviation of the system Hamiltonian from the optimal Hamiltonian, can be evaluated at any point in the state space. Further, a concurrent learning-base"},"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":"1304.3477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-04-11T20:23:47Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"939bc65930822e84328f1b93278d74eb45db740a5871a8e31f4e0e5a5ca51346","abstract_canon_sha256":"203452e63b8744d4d3569c2d062d12f4f9f04e80b7d62f7cbccca364ea24f319"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:48.472501Z","signature_b64":"BA3+MP+q2OhZESFOzexx36WMdMVP6GTxylb+2cLJIRvpRTifltWQmX9VAQnz70zxjdtLoycGTIsv4py74iZnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b2a309d6ffed7610aba0b8aa67bf4cbced2f1952e987902df63ee14dc60aeb9","last_reissued_at":"2026-05-18T00:39:48.471776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:48.471776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concurrent learning-based approximate optimal regulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Patrick Walters, Rushikesh Kamalapurkar, Warren Dixon","submitted_at":"2013-04-11T20:23:47Z","abstract_excerpt":"In deterministic systems, reinforcement learning-based online approximate optimal control methods typically require a restrictive persistence of excitation (PE) condition for convergence. This paper presents a concurrent learning-based solution to the online approximate optimal regulation problem that eliminates the need for PE. The development is based on the observation that given a model of the system, the Bellman error, which quantifies the deviation of the system Hamiltonian from the optimal Hamiltonian, can be evaluated at any point in the state space. Further, a concurrent learning-base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3477","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":"1304.3477","created_at":"2026-05-18T00:39:48.471890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3477v1","created_at":"2026-05-18T00:39:48.471890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3477","created_at":"2026-05-18T00:39:48.471890+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMVDBHLP73LW","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMVDBHLP73LWCCV2","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMVDBHLP","created_at":"2026-05-18T12:27:45.050594+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/FMVDBHLP73LWCCV2BOFKM67UZP","json":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP.json","graph_json":"https://pith.science/api/pith-number/FMVDBHLP73LWCCV2BOFKM67UZP/graph.json","events_json":"https://pith.science/api/pith-number/FMVDBHLP73LWCCV2BOFKM67UZP/events.json","paper":"https://pith.science/paper/FMVDBHLP"},"agent_actions":{"view_html":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP","download_json":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP.json","view_paper":"https://pith.science/paper/FMVDBHLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3477&json=true","fetch_graph":"https://pith.science/api/pith-number/FMVDBHLP73LWCCV2BOFKM67UZP/graph.json","fetch_events":"https://pith.science/api/pith-number/FMVDBHLP73LWCCV2BOFKM67UZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP/action/storage_attestation","attest_author":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP/action/author_attestation","sign_citation":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP/action/citation_signature","submit_replication":"https://pith.science/pith/FMVDBHLP73LWCCV2BOFKM67UZP/action/replication_record"}},"created_at":"2026-05-18T00:39:48.471890+00:00","updated_at":"2026-05-18T00:39:48.471890+00:00"}