{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GPMBMTWMT7I7VNR47GRCN7QI5M","short_pith_number":"pith:GPMBMTWM","canonical_record":{"source":{"id":"2604.24442","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-04-27T13:06:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"43722b0a0966a10c36009e17182fa6d6d4a4bd6075e0491da54c2a17a12d12e2","abstract_canon_sha256":"df9997c556a36aea71b3600fbc3a90b42f11e352a92654049524297d226c5d82"},"schema_version":"1.0"},"canonical_sha256":"33d8164ecc9fd1fab63cf9a226fe08eb15e0573c7759ef85e961178e53605910","source":{"kind":"arxiv","id":"2604.24442","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24442","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24442v2","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24442","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"GPMBMTWMT7I7","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"GPMBMTWMT7I7VNR4","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"GPMBMTWM","created_at":"2026-05-20T00:05:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GPMBMTWMT7I7VNR47GRCN7QI5M","target":"record","payload":{"canonical_record":{"source":{"id":"2604.24442","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-04-27T13:06:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"43722b0a0966a10c36009e17182fa6d6d4a4bd6075e0491da54c2a17a12d12e2","abstract_canon_sha256":"df9997c556a36aea71b3600fbc3a90b42f11e352a92654049524297d226c5d82"},"schema_version":"1.0"},"canonical_sha256":"33d8164ecc9fd1fab63cf9a226fe08eb15e0573c7759ef85e961178e53605910","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:45.205222Z","signature_b64":"gzsoqm2M4em6q94c9FMvckKcnrHcMkPSxH1y5i4Pur/DxTUdcq/JqZqT1mVZ86imNFMx8XVgbmcS378oCDPWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d8164ecc9fd1fab63cf9a226fe08eb15e0573c7759ef85e961178e53605910","last_reissued_at":"2026-05-20T00:05:45.204725Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:45.204725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.24442","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJP+x0Y6nYjqSX7f6ikWLdj3lzohx1bgLPMJkXBBvZkUzToaq/rAt4w+G3AQsic+e5tFFcSgEcpRBjFF5W1mBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:06:47.333155Z"},"content_sha256":"d1a7220f69940f1e2052e7c6e6148c8191051533901d462e700c798bb4593681","schema_version":"1.0","event_id":"sha256:d1a7220f69940f1e2052e7c6e6148c8191051533901d462e700c798bb4593681"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GPMBMTWMT7I7VNR47GRCN7QI5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Fragility of Learning LQG Controllers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Any algorithm turning offline trajectories into a stabilizing LQG controller faces an information-theoretic excess-cost lower bound set by the cost Hessian and the exploration policy's Fisher information.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Anastasios Tsiamis, Bruce D. Lee, John Lygeros, Manfred Morari, Nikolai Matni","submitted_at":"2026-04-27T13:06:48Z","abstract_excerpt":"Learning methods are increasingly used to synthesize controllers from data, yet existing sample-complexity characterizations for continuous control are sharp only in the fully observed setting. This paper studies the partially observed case by deriving information-theoretic lower bounds for learning Linear Quadratic Gaussian (LQG) controllers from offline trajectories generated by a (linear) exploration policy. We prove an $\\varepsilon$-local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove an ε-local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in terms of the Hessian of the LQG cost with respect to model parameters and the inverse Fisher Information induced by the exploration policy.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes linear dynamics, quadratic cost, and that all trajectories are generated offline by a known linear exploration policy; if the true system is nonlinear or the policy is nonlinear or adaptive, the bound may not apply.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proves an ε-local minimax excess-cost lower bound for any algorithm learning a stabilizing linear controller from offline data, expressed via the LQG cost Hessian and inverse Fisher information of the exploration policy, with high complexity for fragile systems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Any algorithm turning offline trajectories into a stabilizing LQG controller faces an information-theoretic excess-cost lower bound set by the cost Hessian and the exploration policy's Fisher information.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9e62df69f3e131d758ba7daac36f850fc259b36fd90db0a19a6d2a8a8370c6d4"},"source":{"id":"2604.24442","kind":"arxiv","version":2},"verdict":{"id":"e1f7dbcc-b774-4c55-990d-45ad65925be8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T01:52:13.321190Z","strongest_claim":"We prove an ε-local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in terms of the Hessian of the LQG cost with respect to model parameters and the inverse Fisher Information induced by the exploration policy.","one_line_summary":"Proves an ε-local minimax excess-cost lower bound for any algorithm learning a stabilizing linear controller from offline data, expressed via the LQG cost Hessian and inverse Fisher information of the exploration policy, with high complexity for fragile systems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes linear dynamics, quadratic cost, and that all trajectories are generated offline by a known linear exploration policy; if the true system is nonlinear or the policy is nonlinear or adaptive, the bound may not apply.","pith_extraction_headline":"Any algorithm turning offline trajectories into a stabilizing LQG controller faces an information-theoretic excess-cost lower bound set by the cost Hessian and the exploration policy's Fisher information."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.24442/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T22:05:19.547182Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"37384a63196cdfcab1cfd9085428ef8775f7a36d9a2044a21e1253d29a4c86fa"},"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"},"verdict_id":"e1f7dbcc-b774-4c55-990d-45ad65925be8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efavqCpR8N1w4PCoM4bjUvfEGX1Nf1ULNiHuBBIir/fTAMU4Ypa1EnHHOHS9svGC8SmaJsxlQ1lQIQWtLeE8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:06:47.333835Z"},"content_sha256":"aba6d88af7d462330a8e72be292f5e5272ffd80e82702fde4da3c09f2bfbcd12","schema_version":"1.0","event_id":"sha256:aba6d88af7d462330a8e72be292f5e5272ffd80e82702fde4da3c09f2bfbcd12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPMBMTWMT7I7VNR47GRCN7QI5M/bundle.json","state_url":"https://pith.science/pith/GPMBMTWMT7I7VNR47GRCN7QI5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPMBMTWMT7I7VNR47GRCN7QI5M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T20:06:47Z","links":{"resolver":"https://pith.science/pith/GPMBMTWMT7I7VNR47GRCN7QI5M","bundle":"https://pith.science/pith/GPMBMTWMT7I7VNR47GRCN7QI5M/bundle.json","state":"https://pith.science/pith/GPMBMTWMT7I7VNR47GRCN7QI5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPMBMTWMT7I7VNR47GRCN7QI5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GPMBMTWMT7I7VNR47GRCN7QI5M","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":"df9997c556a36aea71b3600fbc3a90b42f11e352a92654049524297d226c5d82","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-04-27T13:06:48Z","title_canon_sha256":"43722b0a0966a10c36009e17182fa6d6d4a4bd6075e0491da54c2a17a12d12e2"},"schema_version":"1.0","source":{"id":"2604.24442","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24442","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24442v2","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24442","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"GPMBMTWMT7I7","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"GPMBMTWMT7I7VNR4","created_at":"2026-05-20T00:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"GPMBMTWM","created_at":"2026-05-20T00:05:45Z"}],"graph_snapshots":[{"event_id":"sha256:aba6d88af7d462330a8e72be292f5e5272ffd80e82702fde4da3c09f2bfbcd12","target":"graph","created_at":"2026-05-20T00:05:45Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove an ε-local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in terms of the Hessian of the LQG cost with respect to model parameters and the inverse Fisher Information induced by the exploration policy."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes linear dynamics, quadratic cost, and that all trajectories are generated offline by a known linear exploration policy; if the true system is nonlinear or the policy is nonlinear or adaptive, the bound may not apply."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proves an ε-local minimax excess-cost lower bound for any algorithm learning a stabilizing linear controller from offline data, expressed via the LQG cost Hessian and inverse Fisher information of the exploration policy, with high complexity for fragile systems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Any algorithm turning offline trajectories into a stabilizing LQG controller faces an information-theoretic excess-cost lower bound set by the cost Hessian and the exploration policy's Fisher information."}],"snapshot_sha256":"9e62df69f3e131d758ba7daac36f850fc259b36fd90db0a19a6d2a8a8370c6d4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:05:19.547182Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.24442/integrity.json","findings":[],"snapshot_sha256":"37384a63196cdfcab1cfd9085428ef8775f7a36d9a2044a21e1253d29a4c86fa","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning methods are increasingly used to synthesize controllers from data, yet existing sample-complexity characterizations for continuous control are sharp only in the fully observed setting. This paper studies the partially observed case by deriving information-theoretic lower bounds for learning Linear Quadratic Gaussian (LQG) controllers from offline trajectories generated by a (linear) exploration policy. We prove an $\\varepsilon$-local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in t","authors_text":"Anastasios Tsiamis, Bruce D. Lee, John Lygeros, Manfred Morari, Nikolai Matni","cross_cats":["cs.SY"],"headline":"Any algorithm turning offline trajectories into a stabilizing LQG controller faces an information-theoretic excess-cost lower bound set by the cost Hessian and the exploration policy's Fisher information.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-04-27T13:06:48Z","title":"The Fragility of Learning LQG Controllers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.24442","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T01:52:13.321190Z","id":"e1f7dbcc-b774-4c55-990d-45ad65925be8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proves an ε-local minimax excess-cost lower bound for any algorithm learning a stabilizing linear controller from offline data, expressed via the LQG cost Hessian and inverse Fisher information of the exploration policy, with high complexity for fragile systems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Any algorithm turning offline trajectories into a stabilizing LQG controller faces an information-theoretic excess-cost lower bound set by the cost Hessian and the exploration policy's Fisher information.","strongest_claim":"We prove an ε-local minimax excess-cost lower bound that applies to any algorithm mapping the offline dataset to a stabilizing linear controller. The bound is expressed in terms of the Hessian of the LQG cost with respect to model parameters and the inverse Fisher Information induced by the exploration policy.","weakest_assumption":"The analysis assumes linear dynamics, quadratic cost, and that all trajectories are generated offline by a known linear exploration policy; if the true system is nonlinear or the policy is nonlinear or adaptive, the bound may not apply."}},"verdict_id":"e1f7dbcc-b774-4c55-990d-45ad65925be8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d1a7220f69940f1e2052e7c6e6148c8191051533901d462e700c798bb4593681","target":"record","created_at":"2026-05-20T00:05:45Z","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":"df9997c556a36aea71b3600fbc3a90b42f11e352a92654049524297d226c5d82","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2026-04-27T13:06:48Z","title_canon_sha256":"43722b0a0966a10c36009e17182fa6d6d4a4bd6075e0491da54c2a17a12d12e2"},"schema_version":"1.0","source":{"id":"2604.24442","kind":"arxiv","version":2}},"canonical_sha256":"33d8164ecc9fd1fab63cf9a226fe08eb15e0573c7759ef85e961178e53605910","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d8164ecc9fd1fab63cf9a226fe08eb15e0573c7759ef85e961178e53605910","first_computed_at":"2026-05-20T00:05:45.204725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:45.204725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gzsoqm2M4em6q94c9FMvckKcnrHcMkPSxH1y5i4Pur/DxTUdcq/JqZqT1mVZ86imNFMx8XVgbmcS378oCDPWAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:45.205222Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.24442","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1a7220f69940f1e2052e7c6e6148c8191051533901d462e700c798bb4593681","sha256:aba6d88af7d462330a8e72be292f5e5272ffd80e82702fde4da3c09f2bfbcd12"],"state_sha256":"8c8d3a46cdeb04438b825d78a5ce1cc9cd817a394031c508d6d6bd0f5df28a6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pnOzx3pnrvhR8oP1wWjqm9Ya5xJ+vTBsz7y+07Q5rbfLYQyKkyzvR3pwgRwIGn981XbF9CedQCOOI4B9ypJBCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:06:47.336445Z","bundle_sha256":"3900fc50cbb84ea2aac9877e8e0ea270a9bee7afb042d659282cc019aa20723d"}}