{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XT37DFQWPVEBWMVTUK434J6YWU","short_pith_number":"pith:XT37DFQW","schema_version":"1.0","canonical_sha256":"bcf7f196167d481b32b3a2b9be27d8b533510d983c9a4b5fa897a1f2953d77d8","source":{"kind":"arxiv","id":"1712.00381","version":1},"attestation_state":"computed","paper":{"title":"On Path-Complete Lyapunov Functions: Geometry and Comparison","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":"2017-12-01T15:58:07Z","abstract_excerpt":"We study optimization-based criteria for the stability of switching systems, known as Path-Complete Lyapunov Functions, and ask the question \"can we decide algorithmically when a criterion is less conservative than another\". Our contribution is twofold. First, we show that a Path-Complete Lyapunov Function, which is a multiple Lyapunov function by nature, can always be expressed as a common Lyapunov function taking the form of a combination of minima and maxima of the elementary functions that compose it. Geometrically, our results provide for each Path-Complete criterion an implied invariant "},"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":"1712.00381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-12-01T15:58:07Z","cross_cats_sorted":[],"title_canon_sha256":"d86adcb221da793171c526f925b75d92ac2c443e193ce95300308a1c116d1532","abstract_canon_sha256":"0449886bfeb577fccff2cbf0b2b6e7be2a45af1021dadb94b848edee31d3f321"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.375608Z","signature_b64":"CRbQ9O+1CHbHvV8YNMZEl/voG8+8w3pI4zqtRHri07ZFbd83giSGY9mdDmbJ82KSxo4t5+KARMys0CusVAkKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf7f196167d481b32b3a2b9be27d8b533510d983c9a4b5fa897a1f2953d77d8","last_reissued_at":"2026-05-18T00:29:06.375002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.375002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Path-Complete Lyapunov Functions: Geometry and Comparison","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":"2017-12-01T15:58:07Z","abstract_excerpt":"We study optimization-based criteria for the stability of switching systems, known as Path-Complete Lyapunov Functions, and ask the question \"can we decide algorithmically when a criterion is less conservative than another\". Our contribution is twofold. First, we show that a Path-Complete Lyapunov Function, which is a multiple Lyapunov function by nature, can always be expressed as a common Lyapunov function taking the form of a combination of minima and maxima of the elementary functions that compose it. Geometrically, our results provide for each Path-Complete criterion an implied invariant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00381","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":"1712.00381","created_at":"2026-05-18T00:29:06.375122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00381v1","created_at":"2026-05-18T00:29:06.375122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00381","created_at":"2026-05-18T00:29:06.375122+00:00"},{"alias_kind":"pith_short_12","alias_value":"XT37DFQWPVEB","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XT37DFQWPVEBWMVT","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XT37DFQW","created_at":"2026-05-18T12:31:56.362134+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/XT37DFQWPVEBWMVTUK434J6YWU","json":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU.json","graph_json":"https://pith.science/api/pith-number/XT37DFQWPVEBWMVTUK434J6YWU/graph.json","events_json":"https://pith.science/api/pith-number/XT37DFQWPVEBWMVTUK434J6YWU/events.json","paper":"https://pith.science/paper/XT37DFQW"},"agent_actions":{"view_html":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU","download_json":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU.json","view_paper":"https://pith.science/paper/XT37DFQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00381&json=true","fetch_graph":"https://pith.science/api/pith-number/XT37DFQWPVEBWMVTUK434J6YWU/graph.json","fetch_events":"https://pith.science/api/pith-number/XT37DFQWPVEBWMVTUK434J6YWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU/action/storage_attestation","attest_author":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU/action/author_attestation","sign_citation":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU/action/citation_signature","submit_replication":"https://pith.science/pith/XT37DFQWPVEBWMVTUK434J6YWU/action/replication_record"}},"created_at":"2026-05-18T00:29:06.375122+00:00","updated_at":"2026-05-18T00:29:06.375122+00:00"}