{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4U4SE37PWNPUSVQOHOHA7ETAC3","short_pith_number":"pith:4U4SE37P","schema_version":"1.0","canonical_sha256":"e539226fefb35f49560e3b8e0f926016e4635bd8d9318a1875c31aae055420e5","source":{"kind":"arxiv","id":"1004.0763","version":2},"attestation_state":"computed","paper":{"title":"Symbolic Approximate Time-Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Manuel Mazo Jr., Paulo Tabuada","submitted_at":"2010-04-06T03:40:49Z","abstract_excerpt":"There is an increasing demand for controller design techniques capable of addressing the complex requirements of todays embedded applications. This demand has sparked the interest in symbolic control where lower complexity models of control systems are used to cater for complex specifications given by temporal logics, regular languages, or automata. These specification mechanisms can be regarded as qualitative since they divide the trajectories of the plant into bad trajectories (those that need to be avoided) and good trajectories. However, many applications require also the optimization of q"},"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":"1004.0763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-04-06T03:40:49Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"046da44fea8c64c418a0ae8dfa551f8020aa7c45392df18f481117a88cf4049d","abstract_canon_sha256":"2ed6fb5c13286165d42f32ebee385452605a2919c685188793b7b74c921ef0ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:17.475002Z","signature_b64":"huPEZwtIbBg7fCfQU1ChNgMGpt/1C1JZMVkn38iIgSRADdpsX5Rhax31YIIVR7LQPLfM9/BmiCxEGuGbS1EgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e539226fefb35f49560e3b8e0f926016e4635bd8d9318a1875c31aae055420e5","last_reissued_at":"2026-05-18T02:24:17.474366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:17.474366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symbolic Approximate Time-Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Manuel Mazo Jr., Paulo Tabuada","submitted_at":"2010-04-06T03:40:49Z","abstract_excerpt":"There is an increasing demand for controller design techniques capable of addressing the complex requirements of todays embedded applications. This demand has sparked the interest in symbolic control where lower complexity models of control systems are used to cater for complex specifications given by temporal logics, regular languages, or automata. These specification mechanisms can be regarded as qualitative since they divide the trajectories of the plant into bad trajectories (those that need to be avoided) and good trajectories. However, many applications require also the optimization of q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0763","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":"1004.0763","created_at":"2026-05-18T02:24:17.474470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.0763v2","created_at":"2026-05-18T02:24:17.474470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0763","created_at":"2026-05-18T02:24:17.474470+00:00"},{"alias_kind":"pith_short_12","alias_value":"4U4SE37PWNPU","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4U4SE37PWNPUSVQO","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4U4SE37P","created_at":"2026-05-18T12:26:04.259169+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/4U4SE37PWNPUSVQOHOHA7ETAC3","json":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3.json","graph_json":"https://pith.science/api/pith-number/4U4SE37PWNPUSVQOHOHA7ETAC3/graph.json","events_json":"https://pith.science/api/pith-number/4U4SE37PWNPUSVQOHOHA7ETAC3/events.json","paper":"https://pith.science/paper/4U4SE37P"},"agent_actions":{"view_html":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3","download_json":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3.json","view_paper":"https://pith.science/paper/4U4SE37P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.0763&json=true","fetch_graph":"https://pith.science/api/pith-number/4U4SE37PWNPUSVQOHOHA7ETAC3/graph.json","fetch_events":"https://pith.science/api/pith-number/4U4SE37PWNPUSVQOHOHA7ETAC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3/action/storage_attestation","attest_author":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3/action/author_attestation","sign_citation":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3/action/citation_signature","submit_replication":"https://pith.science/pith/4U4SE37PWNPUSVQOHOHA7ETAC3/action/replication_record"}},"created_at":"2026-05-18T02:24:17.474470+00:00","updated_at":"2026-05-18T02:24:17.474470+00:00"}