{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WJJ6ACQMR3BIQWKMMKGGZIL33R","short_pith_number":"pith:WJJ6ACQM","schema_version":"1.0","canonical_sha256":"b253e00a0c8ec288594c628c6ca17bdc4fae46515c640d260fe1185704dff064","source":{"kind":"arxiv","id":"1709.07333","version":2},"attestation_state":"computed","paper":{"title":"Symbolic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Gunther Reissig, Matthias Rungger","submitted_at":"2017-09-21T14:04:26Z","abstract_excerpt":"We present novel results on the solution of a class of leavable, undiscounted optimal control problems in the minimax sense for nonlinear, continuous-state, discrete-time plants. The problem class includes entry-(exit-)time problems as well as minimum time, pursuit-evasion and reach-avoid games as special cases. We utilize auxiliary optimal control problems (`abstractions') to compute both upper bounds of the value function, i.e., of the achievable closed-loop performance, and symbolic feedback controllers realizing those bounds. The abstractions are obtained from discretizing the problem data"},"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":"1709.07333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-21T14:04:26Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"9a90567a58d97af36acc96f7106faa1a2cbe79841111bed42bb7cbd329887454","abstract_canon_sha256":"8c59e7f23b2e5b4c5b7a58ee43fba309d27cadc9e06c821e3ec35cce4523ef4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:41.455564Z","signature_b64":"pOd+NAjIjbYssaPMx1i94cFYjd1jjaPHGkiwWOxAzhNI1QXy4Jo95zxg+avLGjNMsZ25oKb4NDJBxSeDcGNdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b253e00a0c8ec288594c628c6ca17bdc4fae46515c640d260fe1185704dff064","last_reissued_at":"2026-05-18T00:06:41.455105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:41.455105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Gunther Reissig, Matthias Rungger","submitted_at":"2017-09-21T14:04:26Z","abstract_excerpt":"We present novel results on the solution of a class of leavable, undiscounted optimal control problems in the minimax sense for nonlinear, continuous-state, discrete-time plants. The problem class includes entry-(exit-)time problems as well as minimum time, pursuit-evasion and reach-avoid games as special cases. We utilize auxiliary optimal control problems (`abstractions') to compute both upper bounds of the value function, i.e., of the achievable closed-loop performance, and symbolic feedback controllers realizing those bounds. The abstractions are obtained from discretizing the problem data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07333","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":""},"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":"1709.07333","created_at":"2026-05-18T00:06:41.455176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07333v2","created_at":"2026-05-18T00:06:41.455176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07333","created_at":"2026-05-18T00:06:41.455176+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJJ6ACQMR3BI","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJJ6ACQMR3BIQWKM","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJJ6ACQM","created_at":"2026-05-18T12:31:53.515858+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/WJJ6ACQMR3BIQWKMMKGGZIL33R","json":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R.json","graph_json":"https://pith.science/api/pith-number/WJJ6ACQMR3BIQWKMMKGGZIL33R/graph.json","events_json":"https://pith.science/api/pith-number/WJJ6ACQMR3BIQWKMMKGGZIL33R/events.json","paper":"https://pith.science/paper/WJJ6ACQM"},"agent_actions":{"view_html":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R","download_json":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R.json","view_paper":"https://pith.science/paper/WJJ6ACQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07333&json=true","fetch_graph":"https://pith.science/api/pith-number/WJJ6ACQMR3BIQWKMMKGGZIL33R/graph.json","fetch_events":"https://pith.science/api/pith-number/WJJ6ACQMR3BIQWKMMKGGZIL33R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R/action/storage_attestation","attest_author":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R/action/author_attestation","sign_citation":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R/action/citation_signature","submit_replication":"https://pith.science/pith/WJJ6ACQMR3BIQWKMMKGGZIL33R/action/replication_record"}},"created_at":"2026-05-18T00:06:41.455176+00:00","updated_at":"2026-05-18T00:06:41.455176+00:00"}