{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EPXNN3R5RZEQTQEQEW4FAXXQQI","short_pith_number":"pith:EPXNN3R5","schema_version":"1.0","canonical_sha256":"23eed6ee3d8e4909c09025b8505ef0822ce003571db07b9a19bfbd54b5c88001","source":{"kind":"arxiv","id":"1302.4406","version":1},"attestation_state":"computed","paper":{"title":"Optimal Scheduling for Linear-Rate Multi-Mode Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.FL","authors_text":"Dominik Wojtczak","submitted_at":"2013-02-18T20:06:59Z","abstract_excerpt":"Linear-Rate Multi-Mode Systems is a model that can be seen both as a subclass of switched linear systems with imposed global safety constraints and as hybrid automata with no guards on transitions. We study the existence and design of a controller for this model that keeps the state of the system within a given safe set for the whole time. A sufficient and necessary condition is given for such a controller to exist as well as an algorithm that finds one in polynomial time. We further generalise the model by adding costs on modes and present an algorithm that constructs a safe controller which "},"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":"1302.4406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-18T20:06:59Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"78d0546bbc05195a5f13e638342b60340f04c3f789f1fab9e4c0546010ad147a","abstract_canon_sha256":"8039c90b7b43be30f33ed650481dcc7805b38eb9bcb43346e8165d3b82408f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:14.652537Z","signature_b64":"htqVwXLRC09EFRUvIqHktRvPKqvks07cyyVFRNrpwxyferoLeZG3kWRKLBiowDbTE/sbrI4Ae7cqYcZJ6ykvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23eed6ee3d8e4909c09025b8505ef0822ce003571db07b9a19bfbd54b5c88001","last_reissued_at":"2026-05-18T03:33:14.651690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:14.651690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Scheduling for Linear-Rate Multi-Mode Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.FL","authors_text":"Dominik Wojtczak","submitted_at":"2013-02-18T20:06:59Z","abstract_excerpt":"Linear-Rate Multi-Mode Systems is a model that can be seen both as a subclass of switched linear systems with imposed global safety constraints and as hybrid automata with no guards on transitions. We study the existence and design of a controller for this model that keeps the state of the system within a given safe set for the whole time. A sufficient and necessary condition is given for such a controller to exist as well as an algorithm that finds one in polynomial time. We further generalise the model by adding costs on modes and present an algorithm that constructs a safe controller which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4406","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":"1302.4406","created_at":"2026-05-18T03:33:14.651826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4406v1","created_at":"2026-05-18T03:33:14.651826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4406","created_at":"2026-05-18T03:33:14.651826+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPXNN3R5RZEQ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPXNN3R5RZEQTQEQ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPXNN3R5","created_at":"2026-05-18T12:27:43.054852+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/EPXNN3R5RZEQTQEQEW4FAXXQQI","json":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI.json","graph_json":"https://pith.science/api/pith-number/EPXNN3R5RZEQTQEQEW4FAXXQQI/graph.json","events_json":"https://pith.science/api/pith-number/EPXNN3R5RZEQTQEQEW4FAXXQQI/events.json","paper":"https://pith.science/paper/EPXNN3R5"},"agent_actions":{"view_html":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI","download_json":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI.json","view_paper":"https://pith.science/paper/EPXNN3R5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4406&json=true","fetch_graph":"https://pith.science/api/pith-number/EPXNN3R5RZEQTQEQEW4FAXXQQI/graph.json","fetch_events":"https://pith.science/api/pith-number/EPXNN3R5RZEQTQEQEW4FAXXQQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI/action/storage_attestation","attest_author":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI/action/author_attestation","sign_citation":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI/action/citation_signature","submit_replication":"https://pith.science/pith/EPXNN3R5RZEQTQEQEW4FAXXQQI/action/replication_record"}},"created_at":"2026-05-18T03:33:14.651826+00:00","updated_at":"2026-05-18T03:33:14.651826+00:00"}