{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YCDVV6FU36MFCCSPWW4IOUTDDY","short_pith_number":"pith:YCDVV6FU","schema_version":"1.0","canonical_sha256":"c0875af8b4df98510a4fb5b88752631e08ed8590477f6431515647f8f013c2e8","source":{"kind":"arxiv","id":"1107.3099","version":1},"attestation_state":"computed","paper":{"title":"Algorithm for Optimal Mode Scheduling in Switched Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Magnus Egerstedt, Yorai Wardi","submitted_at":"2011-07-15T16:11:12Z","abstract_excerpt":"This paper considers the problem of computing the schedule of modes in a switched dynamical system, that minimizes a cost functional defined on the trajectory of the system's continuous state variable. A recent approach to such optimal control problems consists of algorithms that alternate between computing the optimal switching times between modes in a given sequence, and updating the mode-sequence by inserting to it a finite number of new modes.\n  These algorithms have an inherent inefficiency due to their sparse update of the mode-sequences, while spending most of the computing times on opt"},"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":"1107.3099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-07-15T16:11:12Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c4260348196a33927e88a1292b4b65b1937adeef66b70a0ae86169266865bc1d","abstract_canon_sha256":"717af853923e47a21e13d7ff25bb7cbe5e428d7f6d60f47d58d5d1cc4609f57b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:14.746020Z","signature_b64":"qYZvrEu/0YRoUwZlb8f6rASstT4jGtVLCOY9cNivbMog5iTuyUGKQ+3wnNENsz56obFj1cHG2K/T/Uo0itVzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0875af8b4df98510a4fb5b88752631e08ed8590477f6431515647f8f013c2e8","last_reissued_at":"2026-05-18T04:18:14.745450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:14.745450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for Optimal Mode Scheduling in Switched Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Magnus Egerstedt, Yorai Wardi","submitted_at":"2011-07-15T16:11:12Z","abstract_excerpt":"This paper considers the problem of computing the schedule of modes in a switched dynamical system, that minimizes a cost functional defined on the trajectory of the system's continuous state variable. A recent approach to such optimal control problems consists of algorithms that alternate between computing the optimal switching times between modes in a given sequence, and updating the mode-sequence by inserting to it a finite number of new modes.\n  These algorithms have an inherent inefficiency due to their sparse update of the mode-sequences, while spending most of the computing times on opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3099","kind":"arxiv","version":1},"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":"1107.3099","created_at":"2026-05-18T04:18:14.745536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3099v1","created_at":"2026-05-18T04:18:14.745536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3099","created_at":"2026-05-18T04:18:14.745536+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCDVV6FU36MF","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCDVV6FU36MFCCSP","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCDVV6FU","created_at":"2026-05-18T12:26:47.523578+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/YCDVV6FU36MFCCSPWW4IOUTDDY","json":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY.json","graph_json":"https://pith.science/api/pith-number/YCDVV6FU36MFCCSPWW4IOUTDDY/graph.json","events_json":"https://pith.science/api/pith-number/YCDVV6FU36MFCCSPWW4IOUTDDY/events.json","paper":"https://pith.science/paper/YCDVV6FU"},"agent_actions":{"view_html":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY","download_json":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY.json","view_paper":"https://pith.science/paper/YCDVV6FU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3099&json=true","fetch_graph":"https://pith.science/api/pith-number/YCDVV6FU36MFCCSPWW4IOUTDDY/graph.json","fetch_events":"https://pith.science/api/pith-number/YCDVV6FU36MFCCSPWW4IOUTDDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/action/storage_attestation","attest_author":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/action/author_attestation","sign_citation":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/action/citation_signature","submit_replication":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/action/replication_record"}},"created_at":"2026-05-18T04:18:14.745536+00:00","updated_at":"2026-05-18T04:18:14.745536+00:00"}