{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VHOUEKTOF4BYAHSHHGPDJIS2VZ","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":"270fbb07f8f3106c9ad02854ce29ab99949308891c629df0ab812ee7617c1ad3","cross_cats_sorted":["cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-07-30T20:13:37Z","title_canon_sha256":"46662e6d27ea58306f8879b819663c17fe083e2811b70f06cd2db8b264be3a1c"},"schema_version":"1.0","source":{"id":"1807.11553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11553","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11553v1","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11553","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"VHOUEKTOF4BY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VHOUEKTOF4BYAHSH","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VHOUEKTO","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:ab5752deb35b69a28636e9b5e965c308c4bb3451ab494e9b189360b8330a6749","target":"graph","created_at":"2026-05-18T00:09:21Z","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":"Reach-avoid problems involve driving a system to a set of desirable configurations while keeping it away from undesirable ones. Providing mathematical guarantees for such scenarios is challenging but have numerous potential practical applications. Due to the challenges, analysis of reach-avoid problems involves making trade-offs between generality of system dynamics, generality of problem setups, optimality of solutions, and computational complexity. In this paper, we combine sum-of-squares optimization and dynamic programming to address the reach-avoid problem, and provide a conservative solu","authors_text":"Benoit Landry, Marco Pavone, Mo Chen, Scott Hemley","cross_cats":["cs.RO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-07-30T20:13:37Z","title":"Reach-Avoid Problems via Sum-of-Squares Optimization and Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11553","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:efecbdf20ba1296433f3957217e846871e38e5025106bc6f4003298017dab247","target":"record","created_at":"2026-05-18T00:09:21Z","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":"270fbb07f8f3106c9ad02854ce29ab99949308891c629df0ab812ee7617c1ad3","cross_cats_sorted":["cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-07-30T20:13:37Z","title_canon_sha256":"46662e6d27ea58306f8879b819663c17fe083e2811b70f06cd2db8b264be3a1c"},"schema_version":"1.0","source":{"id":"1807.11553","kind":"arxiv","version":1}},"canonical_sha256":"a9dd422a6e2f03801e47399e34a25aae6e01ec85eff88727f647163dd7f7c3db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9dd422a6e2f03801e47399e34a25aae6e01ec85eff88727f647163dd7f7c3db","first_computed_at":"2026-05-18T00:09:21.908890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:21.908890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hG96PnyEu7Tvv7wEJIJo8MO6UEkShxpsHJAF+fiWFJ8vDb2mbxklEkxeYe0NDpYXw/Zu7mEp3J6lYqNIj+PfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:21.909375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efecbdf20ba1296433f3957217e846871e38e5025106bc6f4003298017dab247","sha256:ab5752deb35b69a28636e9b5e965c308c4bb3451ab494e9b189360b8330a6749"],"state_sha256":"6e22c2a276e8a2ef7aa322a68161bd626cbb57e7f01f7a99d8270caaa67cb673"}