{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M22FBDE4F46E2FVBHDB4OK7SUA","short_pith_number":"pith:M22FBDE4","schema_version":"1.0","canonical_sha256":"66b4508c9c2f3c4d16a138c3c72bf2a03b5aea59327af6aee6580c5c561d3804","source":{"kind":"arxiv","id":"1405.1857","version":2},"attestation_state":"computed","paper":{"title":"Deterministic and probabilistic algorithms for stabilizing discrete-time switched linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Atreyee Kundu, Debasish Chatterjee, Niranjan Balachandran","submitted_at":"2014-05-08T09:48:00Z","abstract_excerpt":"In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the switching signal is expressed as an infinite walk on this weighted digraph. We employ graph-theoretic tools and discuss different algorithms for designing walks whose corresponding switching signals satisfy the stabilizing switching conditions proposed in [12]. We also address the issue of how likely/generic it is for a family of systems to admit stabilizing switch"},"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":"1405.1857","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-05-08T09:48:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1202b593f368d6908a3db74f06a7357677e73c4e286746e9c85a1331806e9cd5","abstract_canon_sha256":"3f488225194e2dfb475a3155119d1d0f76d717e35781f059ae45756123560d23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.927465Z","signature_b64":"b3swhPIXGgEmggXaEwD5ueK3WCKhA2JPY2gO3Edi/4m5OkJKbbmuMdBoFZo/CWDGJVHK+/kGnGbXs4galmy1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66b4508c9c2f3c4d16a138c3c72bf2a03b5aea59327af6aee6580c5c561d3804","last_reissued_at":"2026-05-17T23:45:15.926792Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.926792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic and probabilistic algorithms for stabilizing discrete-time switched linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Atreyee Kundu, Debasish Chatterjee, Niranjan Balachandran","submitted_at":"2014-05-08T09:48:00Z","abstract_excerpt":"In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the switching signal is expressed as an infinite walk on this weighted digraph. We employ graph-theoretic tools and discuss different algorithms for designing walks whose corresponding switching signals satisfy the stabilizing switching conditions proposed in [12]. We also address the issue of how likely/generic it is for a family of systems to admit stabilizing switch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1857","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":"1405.1857","created_at":"2026-05-17T23:45:15.926886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1857v2","created_at":"2026-05-17T23:45:15.926886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1857","created_at":"2026-05-17T23:45:15.926886+00:00"},{"alias_kind":"pith_short_12","alias_value":"M22FBDE4F46E","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M22FBDE4F46E2FVB","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M22FBDE4","created_at":"2026-05-18T12:28:38.356838+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/M22FBDE4F46E2FVBHDB4OK7SUA","json":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA.json","graph_json":"https://pith.science/api/pith-number/M22FBDE4F46E2FVBHDB4OK7SUA/graph.json","events_json":"https://pith.science/api/pith-number/M22FBDE4F46E2FVBHDB4OK7SUA/events.json","paper":"https://pith.science/paper/M22FBDE4"},"agent_actions":{"view_html":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA","download_json":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA.json","view_paper":"https://pith.science/paper/M22FBDE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1857&json=true","fetch_graph":"https://pith.science/api/pith-number/M22FBDE4F46E2FVBHDB4OK7SUA/graph.json","fetch_events":"https://pith.science/api/pith-number/M22FBDE4F46E2FVBHDB4OK7SUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA/action/storage_attestation","attest_author":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA/action/author_attestation","sign_citation":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA/action/citation_signature","submit_replication":"https://pith.science/pith/M22FBDE4F46E2FVBHDB4OK7SUA/action/replication_record"}},"created_at":"2026-05-17T23:45:15.926886+00:00","updated_at":"2026-05-17T23:45:15.926886+00:00"}