{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VPC64WNFGVYIDWWLPNL2V5UMED","short_pith_number":"pith:VPC64WNF","schema_version":"1.0","canonical_sha256":"abc5ee59a5357081dacb7b57aaf68c20c2b885dc3522dd9d4a67c69de27cd1ad","source":{"kind":"arxiv","id":"1512.04887","version":1},"attestation_state":"computed","paper":{"title":"Deciding the boundedness and dead-beat stability of constrained switching systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.DS","authors_text":"Gilles Millerioux, Matthew Philippe, Rapha\\\"el M. Jungers","submitted_at":"2015-12-15T18:24:54Z","abstract_excerpt":"We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the maximal exponential growth rate equals one. The condition generalizes the notion of the irreducibility of a matrix set, which is a well known sufficient condition for boundedness in the arbitrary switching (i.e. unconstrained) case. Second, we provide a polynomial time algorithm for deciding the dead-beat stability of a system, i.e. that all trajectories vanish"},"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":"1512.04887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-12-15T18:24:54Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"7b0fa15c34887cacf3db5582a998ffa64150ce1241b4f3652c45462a18fc028b","abstract_canon_sha256":"ec9d05061c8d242e63fa25574e082a0d67f97d83ff5abd7f34dcec0b3a3ae45f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:15.177585Z","signature_b64":"zPsPDB2sOtjqkGu4SKPAdM21Iv8aoWU41h7z5i/KO/B9s6+i7+Xb2U77D8brWp44i2mYz1Ctxgz93Azu0DGSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abc5ee59a5357081dacb7b57aaf68c20c2b885dc3522dd9d4a67c69de27cd1ad","last_reissued_at":"2026-05-18T01:24:15.176940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:15.176940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding the boundedness and dead-beat stability of constrained switching systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.DS","authors_text":"Gilles Millerioux, Matthew Philippe, Rapha\\\"el M. Jungers","submitted_at":"2015-12-15T18:24:54Z","abstract_excerpt":"We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the maximal exponential growth rate equals one. The condition generalizes the notion of the irreducibility of a matrix set, which is a well known sufficient condition for boundedness in the arbitrary switching (i.e. unconstrained) case. Second, we provide a polynomial time algorithm for deciding the dead-beat stability of a system, i.e. that all trajectories vanish"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04887","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":"1512.04887","created_at":"2026-05-18T01:24:15.177066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04887v1","created_at":"2026-05-18T01:24:15.177066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04887","created_at":"2026-05-18T01:24:15.177066+00:00"},{"alias_kind":"pith_short_12","alias_value":"VPC64WNFGVYI","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VPC64WNFGVYIDWWL","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VPC64WNF","created_at":"2026-05-18T12:29:47.479230+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/VPC64WNFGVYIDWWLPNL2V5UMED","json":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED.json","graph_json":"https://pith.science/api/pith-number/VPC64WNFGVYIDWWLPNL2V5UMED/graph.json","events_json":"https://pith.science/api/pith-number/VPC64WNFGVYIDWWLPNL2V5UMED/events.json","paper":"https://pith.science/paper/VPC64WNF"},"agent_actions":{"view_html":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED","download_json":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED.json","view_paper":"https://pith.science/paper/VPC64WNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04887&json=true","fetch_graph":"https://pith.science/api/pith-number/VPC64WNFGVYIDWWLPNL2V5UMED/graph.json","fetch_events":"https://pith.science/api/pith-number/VPC64WNFGVYIDWWLPNL2V5UMED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED/action/storage_attestation","attest_author":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED/action/author_attestation","sign_citation":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED/action/citation_signature","submit_replication":"https://pith.science/pith/VPC64WNFGVYIDWWLPNL2V5UMED/action/replication_record"}},"created_at":"2026-05-18T01:24:15.177066+00:00","updated_at":"2026-05-18T01:24:15.177066+00:00"}