{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MUEAMUQ653AX2XLWPF4LGTZZGO","short_pith_number":"pith:MUEAMUQ6","schema_version":"1.0","canonical_sha256":"650806521eeec17d5d767978b34f3933813e63b23c81e5fcf4e132800dfe53e1","source":{"kind":"arxiv","id":"1702.04890","version":1},"attestation_state":"computed","paper":{"title":"Self-triggered control for constrained systems: a contractive set-based approach (Technical report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimos V. Dimarogonas, Kazumune Hashimoto, Shuichi Adachi","submitted_at":"2017-02-16T08:41:04Z","abstract_excerpt":"In this paper, a self-triggered control scheme for constrained discrete-time control systems is presented. The key idea of our approach is to construct a transition system or a graph structure from a collection of polyhedral sets, which are generated based on the notion of {set-invariance theory}. The inter-event time steps are then determined through a standard graph search algorithm to obtain the minimal total cost to a terminal state. The proposed strategy is illustrated through a numerical example."},"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":"1702.04890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-16T08:41:04Z","cross_cats_sorted":[],"title_canon_sha256":"99718752f48b001aa1864c379e0e0867b297fc7e91a8f1712e83e8c98f33d76c","abstract_canon_sha256":"2c863d6b1e16d302c4ab3f37fb406c4bfa619b78c9cea1b7163bf0b0021798f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:36.881617Z","signature_b64":"D0rdaXSFVd/JJPv/S0gMxNw+29ySbmUxAoq+0E+3lURUYcHosQ/IQlVaHAneAc9LnJ6ubUk/RIaZhn0Ft7TrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650806521eeec17d5d767978b34f3933813e63b23c81e5fcf4e132800dfe53e1","last_reissued_at":"2026-05-18T00:50:36.880950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:36.880950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-triggered control for constrained systems: a contractive set-based approach (Technical report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimos V. Dimarogonas, Kazumune Hashimoto, Shuichi Adachi","submitted_at":"2017-02-16T08:41:04Z","abstract_excerpt":"In this paper, a self-triggered control scheme for constrained discrete-time control systems is presented. The key idea of our approach is to construct a transition system or a graph structure from a collection of polyhedral sets, which are generated based on the notion of {set-invariance theory}. The inter-event time steps are then determined through a standard graph search algorithm to obtain the minimal total cost to a terminal state. The proposed strategy is illustrated through a numerical example."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04890","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":"1702.04890","created_at":"2026-05-18T00:50:36.881058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04890v1","created_at":"2026-05-18T00:50:36.881058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04890","created_at":"2026-05-18T00:50:36.881058+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUEAMUQ653AX","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUEAMUQ653AX2XLW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUEAMUQ6","created_at":"2026-05-18T12:31:31.346846+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/MUEAMUQ653AX2XLWPF4LGTZZGO","json":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO.json","graph_json":"https://pith.science/api/pith-number/MUEAMUQ653AX2XLWPF4LGTZZGO/graph.json","events_json":"https://pith.science/api/pith-number/MUEAMUQ653AX2XLWPF4LGTZZGO/events.json","paper":"https://pith.science/paper/MUEAMUQ6"},"agent_actions":{"view_html":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO","download_json":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO.json","view_paper":"https://pith.science/paper/MUEAMUQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04890&json=true","fetch_graph":"https://pith.science/api/pith-number/MUEAMUQ653AX2XLWPF4LGTZZGO/graph.json","fetch_events":"https://pith.science/api/pith-number/MUEAMUQ653AX2XLWPF4LGTZZGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO/action/storage_attestation","attest_author":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO/action/author_attestation","sign_citation":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO/action/citation_signature","submit_replication":"https://pith.science/pith/MUEAMUQ653AX2XLWPF4LGTZZGO/action/replication_record"}},"created_at":"2026-05-18T00:50:36.881058+00:00","updated_at":"2026-05-18T00:50:36.881058+00:00"}