{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IGJ4H3KKFZQ7TW4TL2WAOJ7OOI","short_pith_number":"pith:IGJ4H3KK","schema_version":"1.0","canonical_sha256":"4193c3ed4a2e61f9db935eac0727ee720ed9a1345183ff013c3db5abe9b37277","source":{"kind":"arxiv","id":"1907.08921","version":2},"attestation_state":"computed","paper":{"title":"LQR through the Lens of First Order Methods: Discrete-time Case","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, Maryam Fazel, Mehran Mesbahi","submitted_at":"2019-07-21T06:36:43Z","abstract_excerpt":"We consider the Linear-Quadratic-Regulator (LQR) problem in terms of optimizing a real-valued matrix function over the set of feedback gains. Such a setup facilitates examining the implications of a natural initial-state independent formulation of LQR in designing first order algorithms. It is shown that this cost function is smooth and coercive, and provide an alternate means of noting its gradient dominated property. In the process, we provide a number of analytic observations on the LQR cost when directly analyzed in terms of the feedback gain. We then examine three types of well-posed flow"},"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":"1907.08921","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-07-21T06:36:43Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"68cc904ccffe7bb418d2dbfe1791788cbaa4d138902ca6c0c87038341af6e632","abstract_canon_sha256":"0a11651ef80a3729bb91405af253470fa80050a1f17573381b2da25dba1468d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:21.446832Z","signature_b64":"IxzqCYx8HpZcIHsZuYGwARGr+OP9CPtswehPQhboBBaR02uWRG8WtpphDpRSWKFu2UbKbW89NyOrV9K5MgjjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4193c3ed4a2e61f9db935eac0727ee720ed9a1345183ff013c3db5abe9b37277","last_reissued_at":"2026-07-04T23:50:21.446362Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:21.446362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LQR through the Lens of First Order Methods: Discrete-time Case","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, Maryam Fazel, Mehran Mesbahi","submitted_at":"2019-07-21T06:36:43Z","abstract_excerpt":"We consider the Linear-Quadratic-Regulator (LQR) problem in terms of optimizing a real-valued matrix function over the set of feedback gains. Such a setup facilitates examining the implications of a natural initial-state independent formulation of LQR in designing first order algorithms. It is shown that this cost function is smooth and coercive, and provide an alternate means of noting its gradient dominated property. In the process, we provide a number of analytic observations on the LQR cost when directly analyzed in terms of the feedback gain. We then examine three types of well-posed flow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08921","kind":"arxiv","version":2},"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/1907.08921/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":"1907.08921","created_at":"2026-07-04T23:50:21.446419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08921v2","created_at":"2026-07-04T23:50:21.446419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08921","created_at":"2026-07-04T23:50:21.446419+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGJ4H3KKFZQ7","created_at":"2026-07-04T23:50:21.446419+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGJ4H3KKFZQ7TW4T","created_at":"2026-07-04T23:50:21.446419+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGJ4H3KK","created_at":"2026-07-04T23:50:21.446419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24939","citing_title":"Global linear convergence of entropy-regularized softmax policy gradient beyond tabular MDPs","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26640","citing_title":"Sample Complexity of Policy Gradient for Log-Growth Control","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2403.05367","citing_title":"Stability-Certified On-Policy Data-Driven LQR via Recursive Learning and Policy Gradient","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05088","citing_title":"Scalar Federated Learning for Linear Quadratic Regulator","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05071","citing_title":"Learning Kalman Policy for Singular Unknown Covariances via Riemannian Regularization","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI","json":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI.json","graph_json":"https://pith.science/api/pith-number/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/graph.json","events_json":"https://pith.science/api/pith-number/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/events.json","paper":"https://pith.science/paper/IGJ4H3KK"},"agent_actions":{"view_html":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI","download_json":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI.json","view_paper":"https://pith.science/paper/IGJ4H3KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08921&json=true","fetch_graph":"https://pith.science/api/pith-number/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/graph.json","fetch_events":"https://pith.science/api/pith-number/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/action/storage_attestation","attest_author":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/action/author_attestation","sign_citation":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/action/citation_signature","submit_replication":"https://pith.science/pith/IGJ4H3KKFZQ7TW4TL2WAOJ7OOI/action/replication_record"}},"created_at":"2026-07-04T23:50:21.446419+00:00","updated_at":"2026-07-04T23:50:21.446419+00:00"}