{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ME3UDD6V23ETYSAM6BEXLMUKTM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"60edbd8e92a318d9a826f404a67887346491805dc247ec6b9779d30006f22780","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2019-10-31T14:30:25Z","title_canon_sha256":"af8a64ecebc697c00a7ae1b260f334eae6f46148b540cb16ea0efae2bb20fa8d"},"schema_version":"1.0","source":{"id":"1910.14492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.14492","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1910.14492v2","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.14492","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"ME3UDD6V23ET","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_16","alias_value":"ME3UDD6V23ETYSAM","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_8","alias_value":"ME3UDD6V","created_at":"2026-07-05T02:30:40Z"}],"graph_snapshots":[{"event_id":"sha256:56689abf3780f7d16b54031742eebcc00c17c1a0319d3d6d8a8f637fbabfb4f8","target":"graph","created_at":"2026-07-05T02:30:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.14492/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a novel approach to synthesize dual controllers for unknown linear time-invariant systems with the tasks of optimizing a quadratic cost while reducing the uncertainty. To this end, a synthesis problem is defined where the feedback law has to simultaneously gain knowledge of the system and robustly optimize the cost. By framing the problem in a finite horizon setting, the trade-offs arising when the tasks include both identification and control are formally captured in the optimization problem. Results show that efficient exploration strategies are achieved when the structur","authors_text":"Andrea Iannelli, Mohammad Khosravi, Roy S. Smith","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2019-10-31T14:30:25Z","title":"Structured exploration in the finite horizon linear quadratic dual control problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.14492","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a2fd0bab66fb71c59af8654e118f9f2553f47dc2fe37b19e5f2a77298205c315","target":"record","created_at":"2026-07-05T02:30:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"60edbd8e92a318d9a826f404a67887346491805dc247ec6b9779d30006f22780","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2019-10-31T14:30:25Z","title_canon_sha256":"af8a64ecebc697c00a7ae1b260f334eae6f46148b540cb16ea0efae2bb20fa8d"},"schema_version":"1.0","source":{"id":"1910.14492","kind":"arxiv","version":2}},"canonical_sha256":"6137418fd5d6c93c480cf04975b28a9b1d563defc6c1a061605fd6b8d212f887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6137418fd5d6c93c480cf04975b28a9b1d563defc6c1a061605fd6b8d212f887","first_computed_at":"2026-07-05T02:30:40.851599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:40.851599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRg/gZRfrIGTZAmSt1roSsnsmwIE37p8/TDbQ3O9+x4I53yuNJMkIKLvswQI3SlVtKN57rSnvEemIrLinkigCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:40.852175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.14492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2fd0bab66fb71c59af8654e118f9f2553f47dc2fe37b19e5f2a77298205c315","sha256:56689abf3780f7d16b54031742eebcc00c17c1a0319d3d6d8a8f637fbabfb4f8"],"state_sha256":"a1436a0263a8de674bb923dd5ffa6ed513bf288c2dd90f31a204f4ba0239ead6"}