{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DVUUGUOYKBRVQO2ZJKDQUSJOYC","short_pith_number":"pith:DVUUGUOY","canonical_record":{"source":{"id":"2604.06158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-07T17:55:56Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"f3f046c280204c59391e561e30df558ea484f99d0d2f824e73f00127c29aa6e8","abstract_canon_sha256":"266fde08a4b667fd6ec81f68ed10352a7a437a4db0be6efcc1e863ea6e64e3d8"},"schema_version":"1.0"},"canonical_sha256":"1d694351d85063583b594a870a492ec08fcd3b343912a8787573b878ac81a7b2","source":{"kind":"arxiv","id":"2604.06158","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.06158","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"2604.06158v2","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.06158","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"DVUUGUOYKBRV","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"DVUUGUOYKBRVQO2Z","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"DVUUGUOY","created_at":"2026-08-11T01:24:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DVUUGUOYKBRVQO2ZJKDQUSJOYC","target":"record","payload":{"canonical_record":{"source":{"id":"2604.06158","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-07T17:55:56Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"f3f046c280204c59391e561e30df558ea484f99d0d2f824e73f00127c29aa6e8","abstract_canon_sha256":"266fde08a4b667fd6ec81f68ed10352a7a437a4db0be6efcc1e863ea6e64e3d8"},"schema_version":"1.0"},"canonical_sha256":"1d694351d85063583b594a870a492ec08fcd3b343912a8787573b878ac81a7b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:24:44.119831Z","signature_b64":"wdrM22+a2K2OJJQjH3XtT0PHlxb7rs2krMVljSzTaBpM/MSJSQGxWOqQ3OjVXW1DGBwt0Gjeg4c/3vUd8MgLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d694351d85063583b594a870a492ec08fcd3b343912a8787573b878ac81a7b2","last_reissued_at":"2026-08-11T01:24:44.117344Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:24:44.117344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.06158","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-08-11T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFMsukvwUqV8JwLGhJfDZr1nLxrWEfIRNb9u/XGmCyThltlz5VGCSYWUGSuNmXflVUDMREG3QoSCPfQk1sVbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:20:47.938931Z"},"content_sha256":"50617c41175069fcc866ac4058a7349d6a3a9d14854facc803cb7d1dfabec6ca","schema_version":"1.0","event_id":"sha256:50617c41175069fcc866ac4058a7349d6a3a9d14854facc803cb7d1dfabec6ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DVUUGUOYKBRVQO2ZJKDQUSJOYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributionally Robust Regret Optimal LQR with Common Stage-Law Ambiguity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Multistage distributionally robust regret-optimal LQR under common stage-law ambiguity admits an exact SDP reformulation over linear disturbance-feedback policies.","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Jose Blanchet, Lukas-Benedikt Fiechtner","submitted_at":"2026-04-07T17:55:56Z","abstract_excerpt":"We study, to our knowledge, the first tractable multistage ex-ante distributionally robust regret optimization (DRRO) formulation for stochastic control. We consider finite-horizon LQR under common stage-law ambiguity: disturbances are independent across time but share an unknown stage law whose mean and covariance lie in a Gelbrich ball around nominal parameters. Unlike the single-stage quadratic case, the nominal certainty-equivalent (CE) controller is generally not regret-optimal, because reuse of the stage law makes past disturbances informative for future decisions. Despite the general NP"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that over linear disturbance-feedback policies the resulting multistage DRRO-LQR problem admits an exact semidefinite programming reformulation. The optimal controller is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The restriction to linear disturbance-feedback policies is sufficient to achieve both tractability and optimality, together with the common stage-law ambiguity model using a Gelbrich ball.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The multistage DRRO-LQR problem over linear disturbance-feedback policies admits an exact SDP reformulation whose solution is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Multistage distributionally robust regret-optimal LQR under common stage-law ambiguity admits an exact SDP reformulation over linear disturbance-feedback policies.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"03dd003a19b958b81dee44188120ecc6101f19c60d0579f20f96d4902540e1d5"},"source":{"id":"2604.06158","kind":"arxiv","version":2},"verdict":{"id":"b63e8081-1961-4114-843e-5e08d24a9e3c","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T18:44:45.215300Z","strongest_claim":"We show that over linear disturbance-feedback policies the resulting multistage DRRO-LQR problem admits an exact semidefinite programming reformulation. The optimal controller is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction.","one_line_summary":"The multistage DRRO-LQR problem over linear disturbance-feedback policies admits an exact SDP reformulation whose solution is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The restriction to linear disturbance-feedback policies is sufficient to achieve both tractability and optimality, together with the common stage-law ambiguity model using a Gelbrich ball.","pith_extraction_headline":"Multistage distributionally robust regret-optimal LQR under common stage-law ambiguity admits an exact SDP reformulation over linear disturbance-feedback policies."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.06158/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"},"verdict_id":"b63e8081-1961-4114-843e-5e08d24a9e3c"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PoCc2t0z9txdrzD3wdHPKD6cjiyMg8ilxG4lqI4F2MqMZrhoH3bep1cdFvSYpUePJwp+4v9cwoorFUY8ADDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:20:47.939608Z"},"content_sha256":"23b7455c6e67b825a3105f7637c77a5524f3a148bb47c9ee379492f6a92fefc7","schema_version":"1.0","event_id":"sha256:23b7455c6e67b825a3105f7637c77a5524f3a148bb47c9ee379492f6a92fefc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC/bundle.json","state_url":"https://pith.science/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC/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-08-21T10:20:47Z","links":{"resolver":"https://pith.science/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC","bundle":"https://pith.science/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC/bundle.json","state":"https://pith.science/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVUUGUOYKBRVQO2ZJKDQUSJOYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DVUUGUOYKBRVQO2ZJKDQUSJOYC","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":"266fde08a4b667fd6ec81f68ed10352a7a437a4db0be6efcc1e863ea6e64e3d8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-07T17:55:56Z","title_canon_sha256":"f3f046c280204c59391e561e30df558ea484f99d0d2f824e73f00127c29aa6e8"},"schema_version":"1.0","source":{"id":"2604.06158","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.06158","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"2604.06158v2","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.06158","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"DVUUGUOYKBRV","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"DVUUGUOYKBRVQO2Z","created_at":"2026-08-11T01:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"DVUUGUOY","created_at":"2026-08-11T01:24:44Z"}],"graph_snapshots":[{"event_id":"sha256:23b7455c6e67b825a3105f7637c77a5524f3a148bb47c9ee379492f6a92fefc7","target":"graph","created_at":"2026-08-11T01:24:44Z","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 show that over linear disturbance-feedback policies the resulting multistage DRRO-LQR problem admits an exact semidefinite programming reformulation. The optimal controller is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The restriction to linear disturbance-feedback policies is sufficient to achieve both tractability and optimality, together with the common stage-law ambiguity model using a Gelbrich ball."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The multistage DRRO-LQR problem over linear disturbance-feedback policies admits an exact SDP reformulation whose solution is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Multistage distributionally robust regret-optimal LQR under common stage-law ambiguity admits an exact SDP reformulation over linear disturbance-feedback policies."}],"snapshot_sha256":"03dd003a19b958b81dee44188120ecc6101f19c60d0579f20f96d4902540e1d5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.06158/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study, to our knowledge, the first tractable multistage ex-ante distributionally robust regret optimization (DRRO) formulation for stochastic control. We consider finite-horizon LQR under common stage-law ambiguity: disturbances are independent across time but share an unknown stage law whose mean and covariance lie in a Gelbrich ball around nominal parameters. Unlike the single-stage quadratic case, the nominal certainty-equivalent (CE) controller is generally not regret-optimal, because reuse of the stage law makes past disturbances informative for future decisions. Despite the general NP","authors_text":"Jose Blanchet, Lukas-Benedikt Fiechtner","cross_cats":["cs.SY","eess.SY"],"headline":"Multistage distributionally robust regret-optimal LQR under common stage-law ambiguity admits an exact SDP reformulation over linear disturbance-feedback policies.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-07T17:55:56Z","title":"Distributionally Robust Regret Optimal LQR with Common Stage-Law Ambiguity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.06158","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T18:44:45.215300Z","id":"b63e8081-1961-4114-843e-5e08d24a9e3c","model_set":{"reader":"grok-4.3"},"one_line_summary":"The multistage DRRO-LQR problem over linear disturbance-feedback policies admits an exact SDP reformulation whose solution is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Multistage distributionally robust regret-optimal LQR under common stage-law ambiguity admits an exact SDP reformulation over linear disturbance-feedback policies.","strongest_claim":"We show that over linear disturbance-feedback policies the resulting multistage DRRO-LQR problem admits an exact semidefinite programming reformulation. The optimal controller is the nominal certainty-equivalent LQR law plus a strictly causal empirical-mean correction.","weakest_assumption":"The restriction to linear disturbance-feedback policies is sufficient to achieve both tractability and optimality, together with the common stage-law ambiguity model using a Gelbrich ball."}},"verdict_id":"b63e8081-1961-4114-843e-5e08d24a9e3c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:50617c41175069fcc866ac4058a7349d6a3a9d14854facc803cb7d1dfabec6ca","target":"record","created_at":"2026-08-11T01:24:44Z","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":"266fde08a4b667fd6ec81f68ed10352a7a437a4db0be6efcc1e863ea6e64e3d8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-07T17:55:56Z","title_canon_sha256":"f3f046c280204c59391e561e30df558ea484f99d0d2f824e73f00127c29aa6e8"},"schema_version":"1.0","source":{"id":"2604.06158","kind":"arxiv","version":2}},"canonical_sha256":"1d694351d85063583b594a870a492ec08fcd3b343912a8787573b878ac81a7b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d694351d85063583b594a870a492ec08fcd3b343912a8787573b878ac81a7b2","first_computed_at":"2026-08-11T01:24:44.117344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:24:44.117344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wdrM22+a2K2OJJQjH3XtT0PHlxb7rs2krMVljSzTaBpM/MSJSQGxWOqQ3OjVXW1DGBwt0Gjeg4c/3vUd8MgLDw==","signature_status":"signed_v1","signed_at":"2026-08-11T01:24:44.119831Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.06158","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50617c41175069fcc866ac4058a7349d6a3a9d14854facc803cb7d1dfabec6ca","sha256:23b7455c6e67b825a3105f7637c77a5524f3a148bb47c9ee379492f6a92fefc7"],"state_sha256":"f3497226779d2ece811abf2b6ab4c9d82788af02374cc7f9e4dcdb2e585974ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiGQvjyw7wBXIvubIujE3d7BaVmYOF9/sngLgxcm4KFLX7taEqsSCBJzZvGo04IskIBvuJwHLuccF2rznwn+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T10:20:47.944912Z","bundle_sha256":"7569f1fcfc6ec650ba6a229f2b73d754cb09ea7a18ae333a5752b5e4fb9c47c0"}}