{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4FE7L3D2VI2VQNRN5VV2USL26R","short_pith_number":"pith:4FE7L3D2","schema_version":"1.0","canonical_sha256":"e149f5ec7aaa3558362ded6baa497af45bf2bdbe843ea64dd5e74c8c4481d5f7","source":{"kind":"arxiv","id":"1801.00516","version":2},"attestation_state":"computed","paper":{"title":"Exploiting symmetry for discrete-time reachability computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"John Maidens, Murat Arcak","submitted_at":"2018-01-01T21:47:01Z","abstract_excerpt":"We present a method of computing backward reachable sets for nonlinear discrete-time control systems possessing continuous symmetries. The starting point is a dynamic game formulation of reachability analysis where control inputs aim to maintain the state variables within a target tube despite disturbances. Our method exploits symmetry to compute the reachable sets in a lower-dimensional space, enabling a significant computational speedup. To achieve this, we present a general method for symmetry reduction based on the Cartan frame, which simplifies the dynamic programming iteration without al"},"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":"1801.00516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-01T21:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"1811965933f424cb4de931e7022aef21254e9811d8b7ad257d4001084debc474","abstract_canon_sha256":"3e419aa3dafa1f2f3355bed167ef95f8674827c681eb64785708677b5bfb31e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:59.239095Z","signature_b64":"OMwc0L6tF6YwYMEyWGFkUEoUCjxFKbmPlu5yXP1swho05162F2QUvMbBBr5wxTeMrRFRnAZ/cJSE26CVCdm4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e149f5ec7aaa3558362ded6baa497af45bf2bdbe843ea64dd5e74c8c4481d5f7","last_reissued_at":"2026-05-18T00:24:59.238513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:59.238513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting symmetry for discrete-time reachability computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"John Maidens, Murat Arcak","submitted_at":"2018-01-01T21:47:01Z","abstract_excerpt":"We present a method of computing backward reachable sets for nonlinear discrete-time control systems possessing continuous symmetries. The starting point is a dynamic game formulation of reachability analysis where control inputs aim to maintain the state variables within a target tube despite disturbances. Our method exploits symmetry to compute the reachable sets in a lower-dimensional space, enabling a significant computational speedup. To achieve this, we present a general method for symmetry reduction based on the Cartan frame, which simplifies the dynamic programming iteration without al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00516","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":"1801.00516","created_at":"2026-05-18T00:24:59.238613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00516v2","created_at":"2026-05-18T00:24:59.238613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00516","created_at":"2026-05-18T00:24:59.238613+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FE7L3D2VI2V","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FE7L3D2VI2VQNRN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FE7L3D2","created_at":"2026-05-18T12:32:05.422762+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/4FE7L3D2VI2VQNRN5VV2USL26R","json":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R.json","graph_json":"https://pith.science/api/pith-number/4FE7L3D2VI2VQNRN5VV2USL26R/graph.json","events_json":"https://pith.science/api/pith-number/4FE7L3D2VI2VQNRN5VV2USL26R/events.json","paper":"https://pith.science/paper/4FE7L3D2"},"agent_actions":{"view_html":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R","download_json":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R.json","view_paper":"https://pith.science/paper/4FE7L3D2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00516&json=true","fetch_graph":"https://pith.science/api/pith-number/4FE7L3D2VI2VQNRN5VV2USL26R/graph.json","fetch_events":"https://pith.science/api/pith-number/4FE7L3D2VI2VQNRN5VV2USL26R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R/action/storage_attestation","attest_author":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R/action/author_attestation","sign_citation":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R/action/citation_signature","submit_replication":"https://pith.science/pith/4FE7L3D2VI2VQNRN5VV2USL26R/action/replication_record"}},"created_at":"2026-05-18T00:24:59.238613+00:00","updated_at":"2026-05-18T00:24:59.238613+00:00"}