{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NSRA5GLDKLNFRB6OCFJNMYXWSF","short_pith_number":"pith:NSRA5GLD","canonical_record":{"source":{"id":"1404.0413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-01T22:21:46Z","cross_cats_sorted":[],"title_canon_sha256":"8e26d2d55b84325fe703e25c02e357693a45d87b81b778936aca83991caafd90","abstract_canon_sha256":"408c080d506364934478a25cdb0313078e6405078d166884d58cc0efebb41854"},"schema_version":"1.0"},"canonical_sha256":"6ca20e996352da5887ce1152d662f69161bf23cf7454c66b6d35fca4a5feaf3e","source":{"kind":"arxiv","id":"1404.0413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0413","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0413v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0413","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"NSRA5GLDKLNF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NSRA5GLDKLNFRB6O","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NSRA5GLD","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NSRA5GLDKLNFRB6OCFJNMYXWSF","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-01T22:21:46Z","cross_cats_sorted":[],"title_canon_sha256":"8e26d2d55b84325fe703e25c02e357693a45d87b81b778936aca83991caafd90","abstract_canon_sha256":"408c080d506364934478a25cdb0313078e6405078d166884d58cc0efebb41854"},"schema_version":"1.0"},"canonical_sha256":"6ca20e996352da5887ce1152d662f69161bf23cf7454c66b6d35fca4a5feaf3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:03.413337Z","signature_b64":"523jn3+rT7VchL1JBRnD1MGYQ3Z0GJpdt0tWjuJ5jx8UE7XzNgCbGPKP/YiHqzlf6cHCMNZqFPF7RTIOf9QfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca20e996352da5887ce1152d662f69161bf23cf7454c66b6d35fca4a5feaf3e","last_reissued_at":"2026-05-18T02:55:03.412669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:03.412669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0413","source_version":1,"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-18T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbK5mTdvfJnkdiQtbKD+hY2fHxPlp/7fW/h+bGbhF+l1ZVIH0fmScsv0X4QJJfAAy7MnIcsqFnADRiC9dp5ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:09:54.268662Z"},"content_sha256":"27c4e9da40d07312aecbf6242417c3b047a06df9d59913c9ed0878246d53cb6b","schema_version":"1.0","event_id":"sha256:27c4e9da40d07312aecbf6242417c3b047a06df9d59913c9ed0878246d53cb6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NSRA5GLDKLNFRB6OCFJNMYXWSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimality of certainty equivalence in expected value problems for uncertain linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claus Danielson, Francesco Borrelli, Frank Chuang","submitted_at":"2014-04-01T22:21:46Z","abstract_excerpt":"In this paper we study the optimality of the certainty equivalence approximation in robust finite-horizon optimization problems with expected cost. We provide an algorithm for determining the subset of the state-space for which the certainty equivalence technique is optimal. In the second part of the paper we show how patterns in the problem structure called symmetries can be used to reduce the computational complexity of the previous algorithm. Finally we demonstrate our technique through numerical examples. In particular we examine networked battery systems and radiant slab building control,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0413","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:55:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2xgH3n83tT7RvxchNIS2fY55fneN/W59zvG/5bARNqRzu4kSR4Lhghc2Q3Yf6sawN/C2T3JVi8nRQ9yaBvmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:09:54.268999Z"},"content_sha256":"a4f015b84d0496e770147fab58aeaefbc19d1c991959c4e7cc6034d4f845a9d9","schema_version":"1.0","event_id":"sha256:a4f015b84d0496e770147fab58aeaefbc19d1c991959c4e7cc6034d4f845a9d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF/bundle.json","state_url":"https://pith.science/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF/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-01T21:09:54Z","links":{"resolver":"https://pith.science/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF","bundle":"https://pith.science/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF/bundle.json","state":"https://pith.science/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSRA5GLDKLNFRB6OCFJNMYXWSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NSRA5GLDKLNFRB6OCFJNMYXWSF","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":"408c080d506364934478a25cdb0313078e6405078d166884d58cc0efebb41854","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-01T22:21:46Z","title_canon_sha256":"8e26d2d55b84325fe703e25c02e357693a45d87b81b778936aca83991caafd90"},"schema_version":"1.0","source":{"id":"1404.0413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0413","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0413v1","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0413","created_at":"2026-05-18T02:55:03Z"},{"alias_kind":"pith_short_12","alias_value":"NSRA5GLDKLNF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NSRA5GLDKLNFRB6O","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NSRA5GLD","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:a4f015b84d0496e770147fab58aeaefbc19d1c991959c4e7cc6034d4f845a9d9","target":"graph","created_at":"2026-05-18T02:55:03Z","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"},"paper":{"abstract_excerpt":"In this paper we study the optimality of the certainty equivalence approximation in robust finite-horizon optimization problems with expected cost. We provide an algorithm for determining the subset of the state-space for which the certainty equivalence technique is optimal. In the second part of the paper we show how patterns in the problem structure called symmetries can be used to reduce the computational complexity of the previous algorithm. Finally we demonstrate our technique through numerical examples. In particular we examine networked battery systems and radiant slab building control,","authors_text":"Claus Danielson, Francesco Borrelli, Frank Chuang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-01T22:21:46Z","title":"Optimality of certainty equivalence in expected value problems for uncertain linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0413","kind":"arxiv","version":1},"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:27c4e9da40d07312aecbf6242417c3b047a06df9d59913c9ed0878246d53cb6b","target":"record","created_at":"2026-05-18T02:55:03Z","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":"408c080d506364934478a25cdb0313078e6405078d166884d58cc0efebb41854","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-01T22:21:46Z","title_canon_sha256":"8e26d2d55b84325fe703e25c02e357693a45d87b81b778936aca83991caafd90"},"schema_version":"1.0","source":{"id":"1404.0413","kind":"arxiv","version":1}},"canonical_sha256":"6ca20e996352da5887ce1152d662f69161bf23cf7454c66b6d35fca4a5feaf3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ca20e996352da5887ce1152d662f69161bf23cf7454c66b6d35fca4a5feaf3e","first_computed_at":"2026-05-18T02:55:03.412669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:03.412669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"523jn3+rT7VchL1JBRnD1MGYQ3Z0GJpdt0tWjuJ5jx8UE7XzNgCbGPKP/YiHqzlf6cHCMNZqFPF7RTIOf9QfBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:03.413337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27c4e9da40d07312aecbf6242417c3b047a06df9d59913c9ed0878246d53cb6b","sha256:a4f015b84d0496e770147fab58aeaefbc19d1c991959c4e7cc6034d4f845a9d9"],"state_sha256":"b3cd1add74ce76bed66b4312e8914e7e4fb513b9431a88c6ae4da56248feb97f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TunEDczz0qq8xQu6uO2Ykb2sLeCZe4sC1vPqMeb/nBF2PP3dtnEoY1GpQvscz+daFWY68rlmcHEhdO07zR4uCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:09:54.271085Z","bundle_sha256":"fc5f2628a82538e0d5a192a4347989f0d4aea7507039e08d61590c758795411a"}}