{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UXSYWR6L5CY5D42GIDSYBEMVXK","short_pith_number":"pith:UXSYWR6L","schema_version":"1.0","canonical_sha256":"a5e58b47cbe8b1d1f34640e5809195baaa22a9f81baf3e1dd277d5afb7ead23f","source":{"kind":"arxiv","id":"2006.09178","version":1},"attestation_state":"computed","paper":{"title":"Policy Gradient-based Algorithms for Continuous-time Linear Quadratic Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Afshin Mesbahi, Jingjing Bu, Mehran Mesbahi","submitted_at":"2020-06-12T23:23:50Z","abstract_excerpt":"We consider the continuous-time Linear-Quadratic-Regulator (LQR) problem in terms of optimizing a real-valued matrix function over the set of feedback gains. The results developed are in parallel to those in Bu et al. [1] for discrete-time LTI systems. In this direction, we characterize several analytical properties (smoothness, coerciveness, quadratic growth) that are crucial in the analysis of gradient-based algorithms. We also point out similarities and distinctive features of the continuous time setup in comparison with its discrete time analogue. First, we examine three types of well-pose"},"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":"2006.09178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-06-12T23:23:50Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"88fe13a858c3ac441ca266653626e4958c831b5d39d1cef4af2580473c17a54a","abstract_canon_sha256":"088c8d94f1febd1d95abd269e9bd9a4d10569d051ec5a3a291604d5b867b7f94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:47.048556Z","signature_b64":"euTksaZOeQaK0oTklNTe4Frc7RSppLYJvVrSWztcHKHIRhR4hbN/99Y7l28R2KRKTVNiWDyiou7K2yq6TnuJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5e58b47cbe8b1d1f34640e5809195baaa22a9f81baf3e1dd277d5afb7ead23f","last_reissued_at":"2026-07-05T01:10:47.048149Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:47.048149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Policy Gradient-based Algorithms for Continuous-time Linear Quadratic Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Afshin Mesbahi, Jingjing Bu, Mehran Mesbahi","submitted_at":"2020-06-12T23:23:50Z","abstract_excerpt":"We consider the continuous-time Linear-Quadratic-Regulator (LQR) problem in terms of optimizing a real-valued matrix function over the set of feedback gains. The results developed are in parallel to those in Bu et al. [1] for discrete-time LTI systems. In this direction, we characterize several analytical properties (smoothness, coerciveness, quadratic growth) that are crucial in the analysis of gradient-based algorithms. We also point out similarities and distinctive features of the continuous time setup in comparison with its discrete time analogue. First, we examine three types of well-pose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09178","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.09178/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.09178","created_at":"2026-07-05T01:10:47.048200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.09178v1","created_at":"2026-07-05T01:10:47.048200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09178","created_at":"2026-07-05T01:10:47.048200+00:00"},{"alias_kind":"pith_short_12","alias_value":"UXSYWR6L5CY5","created_at":"2026-07-05T01:10:47.048200+00:00"},{"alias_kind":"pith_short_16","alias_value":"UXSYWR6L5CY5D42G","created_at":"2026-07-05T01:10:47.048200+00:00"},{"alias_kind":"pith_short_8","alias_value":"UXSYWR6L","created_at":"2026-07-05T01:10:47.048200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08204","citing_title":"Data-Driven Critic-Free Policy Iteration for Continuous-Time Linear Quadratic Regulation","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2506.09685","citing_title":"Bridging Continuous-time LQR and Reinforcement Learning via Gradient Flow of the Bellman Error","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27922","citing_title":"Data-Driven Continuous-Time Linear Quadratic Regulator via Closed-Loop and Reinforcement Learning Parameterizations","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05071","citing_title":"Learning Kalman Policy for Singular Unknown Covariances via Riemannian Regularization","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14854","citing_title":"Towards Optimal Passive Feedback Control of LTI Systems under LQR Performance","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14905","citing_title":"Data-driven Linear Quadratic Integral Control: A Convex Formulation and Policy Gradient Approach","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK","json":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK.json","graph_json":"https://pith.science/api/pith-number/UXSYWR6L5CY5D42GIDSYBEMVXK/graph.json","events_json":"https://pith.science/api/pith-number/UXSYWR6L5CY5D42GIDSYBEMVXK/events.json","paper":"https://pith.science/paper/UXSYWR6L"},"agent_actions":{"view_html":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK","download_json":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK.json","view_paper":"https://pith.science/paper/UXSYWR6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.09178&json=true","fetch_graph":"https://pith.science/api/pith-number/UXSYWR6L5CY5D42GIDSYBEMVXK/graph.json","fetch_events":"https://pith.science/api/pith-number/UXSYWR6L5CY5D42GIDSYBEMVXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK/action/storage_attestation","attest_author":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK/action/author_attestation","sign_citation":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK/action/citation_signature","submit_replication":"https://pith.science/pith/UXSYWR6L5CY5D42GIDSYBEMVXK/action/replication_record"}},"created_at":"2026-07-05T01:10:47.048200+00:00","updated_at":"2026-07-05T01:10:47.048200+00:00"}