{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R5UW7JIDRU2OQYYNFZEKI7UP7E","short_pith_number":"pith:R5UW7JID","schema_version":"1.0","canonical_sha256":"8f696fa5038d34e8630d2e48a47e8ff90ad347819ccdc662cd0d09afe0d5dc1f","source":{"kind":"arxiv","id":"1612.03983","version":1},"attestation_state":"computed","paper":{"title":"Path-Complete Graphs and Common Lyapunov Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"David Angeli, Matthew Philippe, Nikolaos Athanasopoulos, Rapha\\\"el M. Jungers","submitted_at":"2016-12-13T00:23:18Z","abstract_excerpt":"A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate for discrete-time switching systems under arbitrary switching.\n  In this paper, we prove that the satisfiability of such a criterion implies the existence of a Common Lyapunov Function, expressed as the composition of minima and maxima of the pieces of the Path-Complete Lyapunov function. The converse, however, is not true even for discrete-time linear syste"},"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":"1612.03983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-12-13T00:23:18Z","cross_cats_sorted":[],"title_canon_sha256":"58486d8e2b264e2ec6b78c445758b5bdc748d0376b4b6279a9943fa2ded85582","abstract_canon_sha256":"b8d5499ded450f81dec337d5dac35fe8dfa71fd88a882587e17b355ab3dfcf4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:05.947017Z","signature_b64":"SDFFVf1Q0/YEHZghzOVqU3TU/anPXCkDEB/mqkDaLOviBfHOV7RHT1kudLMrDXB1cvkQxwOH4KDx86ArjMMZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f696fa5038d34e8630d2e48a47e8ff90ad347819ccdc662cd0d09afe0d5dc1f","last_reissued_at":"2026-05-18T00:55:05.946355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:05.946355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path-Complete Graphs and Common Lyapunov Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"David Angeli, Matthew Philippe, Nikolaos Athanasopoulos, Rapha\\\"el M. Jungers","submitted_at":"2016-12-13T00:23:18Z","abstract_excerpt":"A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate for discrete-time switching systems under arbitrary switching.\n  In this paper, we prove that the satisfiability of such a criterion implies the existence of a Common Lyapunov Function, expressed as the composition of minima and maxima of the pieces of the Path-Complete Lyapunov function. The converse, however, is not true even for discrete-time linear syste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03983","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":"1612.03983","created_at":"2026-05-18T00:55:05.946451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.03983v1","created_at":"2026-05-18T00:55:05.946451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03983","created_at":"2026-05-18T00:55:05.946451+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5UW7JIDRU2O","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5UW7JIDRU2OQYYN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5UW7JID","created_at":"2026-05-18T12:30:41.710351+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/R5UW7JIDRU2OQYYNFZEKI7UP7E","json":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E.json","graph_json":"https://pith.science/api/pith-number/R5UW7JIDRU2OQYYNFZEKI7UP7E/graph.json","events_json":"https://pith.science/api/pith-number/R5UW7JIDRU2OQYYNFZEKI7UP7E/events.json","paper":"https://pith.science/paper/R5UW7JID"},"agent_actions":{"view_html":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E","download_json":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E.json","view_paper":"https://pith.science/paper/R5UW7JID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.03983&json=true","fetch_graph":"https://pith.science/api/pith-number/R5UW7JIDRU2OQYYNFZEKI7UP7E/graph.json","fetch_events":"https://pith.science/api/pith-number/R5UW7JIDRU2OQYYNFZEKI7UP7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E/action/storage_attestation","attest_author":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E/action/author_attestation","sign_citation":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E/action/citation_signature","submit_replication":"https://pith.science/pith/R5UW7JIDRU2OQYYNFZEKI7UP7E/action/replication_record"}},"created_at":"2026-05-18T00:55:05.946451+00:00","updated_at":"2026-05-18T00:55:05.946451+00:00"}