{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EJRGMWPPFLR3P4XVAYJVYV5ZPS","short_pith_number":"pith:EJRGMWPP","schema_version":"1.0","canonical_sha256":"22626659ef2ae3b7f2f506135c57b97cb929fc4b5d0da89bebee84d04852e554","source":{"kind":"arxiv","id":"2303.16321","version":2},"attestation_state":"computed","paper":{"title":"Worst-Case Control and Learning Using Partial Observations Over an Infinite Time-Horizon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Aditya Dave, Andreas A. Malikopoulos, Ioannis Faros, Nishanth Venkatesh","submitted_at":"2023-03-28T21:40:06Z","abstract_excerpt":"Safety-critical cyber-physical systems require control strategies whose worst-case performance is robust against adversarial disturbances and modeling uncertainties. In this paper, we present a framework for approximate control and learning in partially observed systems to minimize the worst-case discounted cost over an infinite time horizon. We model disturbances to the system as finite-valued uncertain variables with unknown probability distributions. For problems with known system dynamics, we construct a dynamic programming (DP) decomposition to compute the optimal control strategy. Our fi"},"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":"2303.16321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-28T21:40:06Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY"],"title_canon_sha256":"1814b2a386a40aa63247c65036baed2d4dc3b542ae05ba290755b950eaecadc7","abstract_canon_sha256":"d8ddebe168b8050592243185ef71035bd1537f8b7077e69d203cb7fd433ee056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:56.737260Z","signature_b64":"AAnOt/p1ubl8Zkrek4J3gWD6ilYLk2ZBnkDJxUHQtX4qLH0zp2phHhTHKGKFzpLrxt1NxQ2B5I03IobY9tvBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22626659ef2ae3b7f2f506135c57b97cb929fc4b5d0da89bebee84d04852e554","last_reissued_at":"2026-07-05T05:56:56.736790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:56.736790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-Case Control and Learning Using Partial Observations Over an Infinite Time-Horizon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Aditya Dave, Andreas A. Malikopoulos, Ioannis Faros, Nishanth Venkatesh","submitted_at":"2023-03-28T21:40:06Z","abstract_excerpt":"Safety-critical cyber-physical systems require control strategies whose worst-case performance is robust against adversarial disturbances and modeling uncertainties. In this paper, we present a framework for approximate control and learning in partially observed systems to minimize the worst-case discounted cost over an infinite time horizon. We model disturbances to the system as finite-valued uncertain variables with unknown probability distributions. For problems with known system dynamics, we construct a dynamic programming (DP) decomposition to compute the optimal control strategy. Our fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16321","kind":"arxiv","version":2},"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/2303.16321/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":"2303.16321","created_at":"2026-07-05T05:56:56.736858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16321v2","created_at":"2026-07-05T05:56:56.736858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16321","created_at":"2026-07-05T05:56:56.736858+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJRGMWPPFLR3","created_at":"2026-07-05T05:56:56.736858+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJRGMWPPFLR3P4XV","created_at":"2026-07-05T05:56:56.736858+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJRGMWPP","created_at":"2026-07-05T05:56:56.736858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.25515","citing_title":"Spatiotemporal Forecasting of Incidents and Congestion with Implications for Sustainable Traffic Control","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS","json":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS.json","graph_json":"https://pith.science/api/pith-number/EJRGMWPPFLR3P4XVAYJVYV5ZPS/graph.json","events_json":"https://pith.science/api/pith-number/EJRGMWPPFLR3P4XVAYJVYV5ZPS/events.json","paper":"https://pith.science/paper/EJRGMWPP"},"agent_actions":{"view_html":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS","download_json":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS.json","view_paper":"https://pith.science/paper/EJRGMWPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16321&json=true","fetch_graph":"https://pith.science/api/pith-number/EJRGMWPPFLR3P4XVAYJVYV5ZPS/graph.json","fetch_events":"https://pith.science/api/pith-number/EJRGMWPPFLR3P4XVAYJVYV5ZPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS/action/storage_attestation","attest_author":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS/action/author_attestation","sign_citation":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS/action/citation_signature","submit_replication":"https://pith.science/pith/EJRGMWPPFLR3P4XVAYJVYV5ZPS/action/replication_record"}},"created_at":"2026-07-05T05:56:56.736858+00:00","updated_at":"2026-07-05T05:56:56.736858+00:00"}