{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YCDVV6FU36MFCCSPWW4IOUTDDY","short_pith_number":"pith:YCDVV6FU","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"},"canonical_sha256":"c0875af8b4df98510a4fb5b88752631e08ed8590477f6431515647f8f013c2e8","source":{"kind":"arxiv","id":"1107.3099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3099","created_at":"2026-05-18T04:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3099v1","created_at":"2026-05-18T04:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3099","created_at":"2026-05-18T04:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"YCDVV6FU36MF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YCDVV6FU36MFCCSP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YCDVV6FU","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YCDVV6FU36MFCCSPWW4IOUTDDY","target":"record","payload":{"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"},"canonical_sha256":"c0875af8b4df98510a4fb5b88752631e08ed8590477f6431515647f8f013c2e8","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"},"source_kind":"arxiv","source_id":"1107.3099","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zEG3omAZTgEW/+EiX0XHusY/aOTHf1XO8S1jKTUXTi3S9/OJ7CMegWeyF5U0O6b7i96sxkWCxOCrs8/uHeADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:39:01.430246Z"},"content_sha256":"8f35010f6bc3f5b085585a4ce4d0315348876ca79fd02a8efddad67715f986c7","schema_version":"1.0","event_id":"sha256:8f35010f6bc3f5b085585a4ce4d0315348876ca79fd02a8efddad67715f986c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YCDVV6FU36MFCCSPWW4IOUTDDY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNkD/DoTPkl7JR0aBH7ncHSu6ydiTY2yw4SUWg8tBUNpCoLDIsVWS5PQb/CyNl4+2nkLpeUUlMnWN+W9uu1cDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:39:01.430981Z"},"content_sha256":"1ae0385d771b828f5cbeec800c4c572754e773e15d8c98eb5e1159ea089b25d6","schema_version":"1.0","event_id":"sha256:1ae0385d771b828f5cbeec800c4c572754e773e15d8c98eb5e1159ea089b25d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/bundle.json","state_url":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T22:39:01Z","links":{"resolver":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY","bundle":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/bundle.json","state":"https://pith.science/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCDVV6FU36MFCCSPWW4IOUTDDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YCDVV6FU36MFCCSPWW4IOUTDDY","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":"717af853923e47a21e13d7ff25bb7cbe5e428d7f6d60f47d58d5d1cc4609f57b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-07-15T16:11:12Z","title_canon_sha256":"c4260348196a33927e88a1292b4b65b1937adeef66b70a0ae86169266865bc1d"},"schema_version":"1.0","source":{"id":"1107.3099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3099","created_at":"2026-05-18T04:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3099v1","created_at":"2026-05-18T04:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3099","created_at":"2026-05-18T04:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"YCDVV6FU36MF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YCDVV6FU36MFCCSP","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YCDVV6FU","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:1ae0385d771b828f5cbeec800c4c572754e773e15d8c98eb5e1159ea089b25d6","target":"graph","created_at":"2026-05-18T04:18:14Z","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":"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","authors_text":"Magnus Egerstedt, Yorai Wardi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-07-15T16:11:12Z","title":"Algorithm for Optimal Mode Scheduling in Switched Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3099","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:8f35010f6bc3f5b085585a4ce4d0315348876ca79fd02a8efddad67715f986c7","target":"record","created_at":"2026-05-18T04:18:14Z","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":"717af853923e47a21e13d7ff25bb7cbe5e428d7f6d60f47d58d5d1cc4609f57b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2011-07-15T16:11:12Z","title_canon_sha256":"c4260348196a33927e88a1292b4b65b1937adeef66b70a0ae86169266865bc1d"},"schema_version":"1.0","source":{"id":"1107.3099","kind":"arxiv","version":1}},"canonical_sha256":"c0875af8b4df98510a4fb5b88752631e08ed8590477f6431515647f8f013c2e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0875af8b4df98510a4fb5b88752631e08ed8590477f6431515647f8f013c2e8","first_computed_at":"2026-05-18T04:18:14.745450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:14.745450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qYZvrEu/0YRoUwZlb8f6rASstT4jGtVLCOY9cNivbMog5iTuyUGKQ+3wnNENsz56obFj1cHG2K/T/Uo0itVzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:14.746020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f35010f6bc3f5b085585a4ce4d0315348876ca79fd02a8efddad67715f986c7","sha256:1ae0385d771b828f5cbeec800c4c572754e773e15d8c98eb5e1159ea089b25d6"],"state_sha256":"1ee0c51af27fc67ff131bc00b153a0d84da2b1a6e595d743ead6ac5ecc44f6f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"faK2fPxzRE0B2n+SP3883ojvV/d3RCW0iNTrQE4m9SzsPlzih6M+FOvdnb9op8Qa0Ekm/yw0qXw2G5lPMnTfAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:39:01.434979Z","bundle_sha256":"41dadb58d27a239fd4507e5073d250e5a5642a62848f510ff0d739ba8b26e5db"}}