{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UIG63BZXITPJHLSBLCM7NLZ6P4","short_pith_number":"pith:UIG63BZX","schema_version":"1.0","canonical_sha256":"a20ded873744de93ae415899f6af3e7f21beac83daa91aa2b1e9c20e6bc4a7b0","source":{"kind":"arxiv","id":"2103.02136","version":4},"attestation_state":"computed","paper":{"title":"Toward a Scalable Upper Bound for a CVaR-LQ Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Laurent Lessard, Margaret P. Chapman","submitted_at":"2021-03-03T02:34:28Z","abstract_excerpt":"We study a linear-quadratic, optimal control problem on a discrete, finite time horizon with distributional ambiguity, in which the cost is assessed via Conditional Value-at-Risk (CVaR). We take steps toward deriving a scalable dynamic programming approach to upper-bound the optimal value function for this problem. This dynamic program yields a novel, tunable risk-averse control policy, which we compare to existing state-of-the-art methods."},"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":"2103.02136","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-03-03T02:34:28Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4c6dbefcbdd97e8faab2803d94ba27a452217bafa733cb76aae35aa03fe2d66e","abstract_canon_sha256":"83d68c98c99820ea9633fe5a05c73c9421c53e7872ae6a0944bf0645ba1308f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:45.026071Z","signature_b64":"x6bc85e5ub5yhULZ08TYSJlm67j/z58vhq/PWZifXirHkpElIUBQxaLurM2LYWo43z+1TSSTZ6jBCKTjyxEGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20ded873744de93ae415899f6af3e7f21beac83daa91aa2b1e9c20e6bc4a7b0","last_reissued_at":"2026-07-05T04:34:45.025558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:45.025558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a Scalable Upper Bound for a CVaR-LQ Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Laurent Lessard, Margaret P. Chapman","submitted_at":"2021-03-03T02:34:28Z","abstract_excerpt":"We study a linear-quadratic, optimal control problem on a discrete, finite time horizon with distributional ambiguity, in which the cost is assessed via Conditional Value-at-Risk (CVaR). We take steps toward deriving a scalable dynamic programming approach to upper-bound the optimal value function for this problem. This dynamic program yields a novel, tunable risk-averse control policy, which we compare to existing state-of-the-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.02136","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/2103.02136/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":"2103.02136","created_at":"2026-07-05T04:34:45.025630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.02136v4","created_at":"2026-07-05T04:34:45.025630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.02136","created_at":"2026-07-05T04:34:45.025630+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIG63BZXITPJ","created_at":"2026-07-05T04:34:45.025630+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIG63BZXITPJHLSB","created_at":"2026-07-05T04:34:45.025630+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIG63BZX","created_at":"2026-07-05T04:34:45.025630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4","json":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4.json","graph_json":"https://pith.science/api/pith-number/UIG63BZXITPJHLSBLCM7NLZ6P4/graph.json","events_json":"https://pith.science/api/pith-number/UIG63BZXITPJHLSBLCM7NLZ6P4/events.json","paper":"https://pith.science/paper/UIG63BZX"},"agent_actions":{"view_html":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4","download_json":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4.json","view_paper":"https://pith.science/paper/UIG63BZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.02136&json=true","fetch_graph":"https://pith.science/api/pith-number/UIG63BZXITPJHLSBLCM7NLZ6P4/graph.json","fetch_events":"https://pith.science/api/pith-number/UIG63BZXITPJHLSBLCM7NLZ6P4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4/action/storage_attestation","attest_author":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4/action/author_attestation","sign_citation":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4/action/citation_signature","submit_replication":"https://pith.science/pith/UIG63BZXITPJHLSBLCM7NLZ6P4/action/replication_record"}},"created_at":"2026-07-05T04:34:45.025630+00:00","updated_at":"2026-07-05T04:34:45.025630+00:00"}