{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DG3QQC5ZR2LLFNHXJEQLJJ6SAZ","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":"3247f2fda8fbae389e653f8844c49b8ec654d1efb73c2fb5dfcfa239e883b879","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-04T21:44:25Z","title_canon_sha256":"1e49bc8cee06f3ca9389527b3d32ccc1df0eba04212c40bd2eb3fd42f4d259eb"},"schema_version":"1.0","source":{"id":"1908.01404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01404","created_at":"2026-07-04T23:51:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01404v1","created_at":"2026-07-04T23:51:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01404","created_at":"2026-07-04T23:51:30Z"},{"alias_kind":"pith_short_12","alias_value":"DG3QQC5ZR2LL","created_at":"2026-07-04T23:51:30Z"},{"alias_kind":"pith_short_16","alias_value":"DG3QQC5ZR2LLFNHX","created_at":"2026-07-04T23:51:30Z"},{"alias_kind":"pith_short_8","alias_value":"DG3QQC5Z","created_at":"2026-07-04T23:51:30Z"}],"graph_snapshots":[{"event_id":"sha256:2273951da4d776ad87d55e259fbb9ab632f561e496409341e712657064112520","target":"graph","created_at":"2026-07-04T23:51:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01404/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Originating in the artificial intelligence literature, optimistic planning (OP) is an algorithm that generates near-optimal control inputs for generic nonlinear discrete-time systems whose input set is finite. This technique is therefore relevant for the near-optimal control of nonlinear switched systems, for which the switching signal is the control. However, OP exhibits several limitations, which prevent its application in a standard control context. First, it requires the stage cost to take values in [0,1], an unnatural prerequisite as it excludes, for instance, quadratic stage costs. Secon","authors_text":"Dragan Ne\\v{s}i\\'c, Jamal Daafouz, Lucian Bu\\c{s}oniu, Mathieu Granzotto, Romain Postoyan","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-04T21:44:25Z","title":"Optimistic planning for the near-optimal control of nonlinear switched discrete-time systems with stability guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01404","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:95403a72256d76b57e11f965fcd9b8cd72fdb04ad7547b985993b5d2b712376c","target":"record","created_at":"2026-07-04T23:51:30Z","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":"3247f2fda8fbae389e653f8844c49b8ec654d1efb73c2fb5dfcfa239e883b879","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-04T21:44:25Z","title_canon_sha256":"1e49bc8cee06f3ca9389527b3d32ccc1df0eba04212c40bd2eb3fd42f4d259eb"},"schema_version":"1.0","source":{"id":"1908.01404","kind":"arxiv","version":1}},"canonical_sha256":"19b7080bb98e96b2b4f74920b4a7d2064b2df884f4391bc0fb7082a1588d828f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19b7080bb98e96b2b4f74920b4a7d2064b2df884f4391bc0fb7082a1588d828f","first_computed_at":"2026-07-04T23:51:30.093660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:30.093660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4p2isOIpo1ncBiWGXYKFDuibGgp4BpmW7DrUs53sEVtzz3SwcTJ838B3B6iK9pz+Jb34mInz2ltRpEbiJ8WpAg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:30.094114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95403a72256d76b57e11f965fcd9b8cd72fdb04ad7547b985993b5d2b712376c","sha256:2273951da4d776ad87d55e259fbb9ab632f561e496409341e712657064112520"],"state_sha256":"1522cf9cb40265fa0296bedf69320e7c4cef28c6374369eb657109f6f6e6fd3f"}