{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5UAJFMUHXCHFSZO24Q3AA45WZ2","short_pith_number":"pith:5UAJFMUH","schema_version":"1.0","canonical_sha256":"ed0092b287b88e5965dae4360073b6ce9afd6ef2ada3ea233c1616783407dfee","source":{"kind":"arxiv","id":"2403.13730","version":2},"attestation_state":"computed","paper":{"title":"Projection-free computation of robust controllable sets with constrained zonotopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Abraham P. Vinod, Avishai Weiss, Stefano Di Cairano","submitted_at":"2024-03-20T16:39:48Z","abstract_excerpt":"We study the problem of computing robust controllable sets for discrete-time linear systems with additive uncertainty. We propose a tractable and scalable approach to inner- and outer-approximate robust controllable sets using constrained zonotopes, when the additive uncertainty set is a symmetric, convex, and compact set. Our least-squares-based approach uses novel closed-form approximations of the Pontryagin difference between a constrained zonotopic minuend and a symmetric, convex, and compact subtrahend. Unlike existing approaches, our approach does not rely on convex optimization solvers,"},"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":"2403.13730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-20T16:39:48Z","cross_cats_sorted":["cs.RO","cs.SY","eess.SY"],"title_canon_sha256":"6e7fdc91546939146c2b7e690ffe80ecab6b6cf875daecae0d871803974abe9f","abstract_canon_sha256":"fda9f843a6d5f607226ff21e7d1e9da3c360e3df80f9634ff3abd0c9084cc54e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:44.395998Z","signature_b64":"gl4MUJQ3fIrBRLiLz9iHTMNyPi1cM6Jmk0MMim3Ud4Sunl1+uaoOBzI8t0/7OHsa8dtileXpenOH17d2oAeyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed0092b287b88e5965dae4360073b6ce9afd6ef2ada3ea233c1616783407dfee","last_reissued_at":"2026-07-05T10:02:44.395589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:44.395589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection-free computation of robust controllable sets with constrained zonotopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Abraham P. Vinod, Avishai Weiss, Stefano Di Cairano","submitted_at":"2024-03-20T16:39:48Z","abstract_excerpt":"We study the problem of computing robust controllable sets for discrete-time linear systems with additive uncertainty. We propose a tractable and scalable approach to inner- and outer-approximate robust controllable sets using constrained zonotopes, when the additive uncertainty set is a symmetric, convex, and compact set. Our least-squares-based approach uses novel closed-form approximations of the Pontryagin difference between a constrained zonotopic minuend and a symmetric, convex, and compact subtrahend. Unlike existing approaches, our approach does not rely on convex optimization solvers,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13730","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/2403.13730/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":"2403.13730","created_at":"2026-07-05T10:02:44.395646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13730v2","created_at":"2026-07-05T10:02:44.395646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13730","created_at":"2026-07-05T10:02:44.395646+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UAJFMUHXCHF","created_at":"2026-07-05T10:02:44.395646+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UAJFMUHXCHFSZO2","created_at":"2026-07-05T10:02:44.395646+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UAJFMUH","created_at":"2026-07-05T10:02:44.395646+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06033","citing_title":"TextPixs: Glyph-Conditioned Diffusion with Character-Aware Attention and OCR-Guided Supervision","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2","json":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2.json","graph_json":"https://pith.science/api/pith-number/5UAJFMUHXCHFSZO24Q3AA45WZ2/graph.json","events_json":"https://pith.science/api/pith-number/5UAJFMUHXCHFSZO24Q3AA45WZ2/events.json","paper":"https://pith.science/paper/5UAJFMUH"},"agent_actions":{"view_html":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2","download_json":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2.json","view_paper":"https://pith.science/paper/5UAJFMUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13730&json=true","fetch_graph":"https://pith.science/api/pith-number/5UAJFMUHXCHFSZO24Q3AA45WZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/5UAJFMUHXCHFSZO24Q3AA45WZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2/action/storage_attestation","attest_author":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2/action/author_attestation","sign_citation":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2/action/citation_signature","submit_replication":"https://pith.science/pith/5UAJFMUHXCHFSZO24Q3AA45WZ2/action/replication_record"}},"created_at":"2026-07-05T10:02:44.395646+00:00","updated_at":"2026-07-05T10:02:44.395646+00:00"}