{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XM7IGDXBPQ3SCJQZRW2R5LR35U","short_pith_number":"pith:XM7IGDXB","schema_version":"1.0","canonical_sha256":"bb3e830ee17c372126198db51eae3bed0dedbf677f7b4c10876400572ec293a3","source":{"kind":"arxiv","id":"2406.07746","version":4},"attestation_state":"computed","paper":{"title":"Any-Time Regret-Guaranteed Algorithm for Control of Linear Quadratic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"stat.ML","authors_text":"Cedric Langbort, Jafar Abbaszadeh Chekan","submitted_at":"2024-06-11T22:04:59Z","abstract_excerpt":"We propose a computationally efficient algorithm that achieves anytime regret of order $\\mathcal{O}(\\sqrt{t})$, with explicit dependence on the system dimensions and on the solution of the Discrete Algebraic Riccati Equation (DARE). Our approach builds on the SDP-based framework of \\cite{cohen2019learning}, using an appropriately tuned regularization and a sufficiently accurate initial estimate to construct confidence ellipsoids for control design. A carefully designed input-perturbation mechanism is incorporated to ensure anytime performance. We develop two variants of the algorithm. The firs"},"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":"2406.07746","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-11T22:04:59Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"8c1c699cf7a0952ea632ea28a9640c352b0c5eed54e53b99a404ae636dafb554","abstract_canon_sha256":"b8b59d1100be53acddba631b6d06618e07f09084525c25f2e93b770e52085ce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:12.943507Z","signature_b64":"p8O3MPukpjvjqXT+9Yz4IEmb/zlcDCzIDCepD4lYtSgQw7iPsp0DSvJABZiBcGA7rDku8qtOpWzRXm56aP7ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3e830ee17c372126198db51eae3bed0dedbf677f7b4c10876400572ec293a3","last_reissued_at":"2026-07-23T01:24:12.942357Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:12.942357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Any-Time Regret-Guaranteed Algorithm for Control of Linear Quadratic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"stat.ML","authors_text":"Cedric Langbort, Jafar Abbaszadeh Chekan","submitted_at":"2024-06-11T22:04:59Z","abstract_excerpt":"We propose a computationally efficient algorithm that achieves anytime regret of order $\\mathcal{O}(\\sqrt{t})$, with explicit dependence on the system dimensions and on the solution of the Discrete Algebraic Riccati Equation (DARE). Our approach builds on the SDP-based framework of \\cite{cohen2019learning}, using an appropriately tuned regularization and a sufficiently accurate initial estimate to construct confidence ellipsoids for control design. A carefully designed input-perturbation mechanism is incorporated to ensure anytime performance. We develop two variants of the algorithm. The firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07746","kind":"arxiv","version":4},"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/2406.07746/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":"2406.07746","created_at":"2026-07-23T01:24:12.942805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07746v4","created_at":"2026-07-23T01:24:12.942805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07746","created_at":"2026-07-23T01:24:12.942805+00:00"},{"alias_kind":"pith_short_12","alias_value":"XM7IGDXBPQ3S","created_at":"2026-07-23T01:24:12.942805+00:00"},{"alias_kind":"pith_short_16","alias_value":"XM7IGDXBPQ3SCJQZ","created_at":"2026-07-23T01:24:12.942805+00:00"},{"alias_kind":"pith_short_8","alias_value":"XM7IGDXB","created_at":"2026-07-23T01:24:12.942805+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.22223","citing_title":"Regret-Guaranteed Safe Switching: LQR Setting with Unknown Dynamics","ref_index":89,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U","json":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U.json","graph_json":"https://pith.science/api/pith-number/XM7IGDXBPQ3SCJQZRW2R5LR35U/graph.json","events_json":"https://pith.science/api/pith-number/XM7IGDXBPQ3SCJQZRW2R5LR35U/events.json","paper":"https://pith.science/paper/XM7IGDXB"},"agent_actions":{"view_html":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U","download_json":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U.json","view_paper":"https://pith.science/paper/XM7IGDXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07746&json=true","fetch_graph":"https://pith.science/api/pith-number/XM7IGDXBPQ3SCJQZRW2R5LR35U/graph.json","fetch_events":"https://pith.science/api/pith-number/XM7IGDXBPQ3SCJQZRW2R5LR35U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U/action/storage_attestation","attest_author":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U/action/author_attestation","sign_citation":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U/action/citation_signature","submit_replication":"https://pith.science/pith/XM7IGDXBPQ3SCJQZRW2R5LR35U/action/replication_record"}},"created_at":"2026-07-23T01:24:12.942805+00:00","updated_at":"2026-07-23T01:24:12.942805+00:00"}