{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J27ICLJLSYNMUXKLRRNL4DGZFZ","short_pith_number":"pith:J27ICLJL","schema_version":"1.0","canonical_sha256":"4ebe812d2b961aca5d4b8c5abe0cd92e4de48c30261d4927e7decc42fc72e2c6","source":{"kind":"arxiv","id":"1706.01337","version":1},"attestation_state":"computed","paper":{"title":"Exponential Stability Analysis via Integral Quadratic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Andrew Packard, Benjamin Recht, Laurent Lessard, Ross Boczar","submitted_at":"2017-06-02T15:49:22Z","abstract_excerpt":"The theory of integral quadratic constraints (IQCs) allows verification of stability and gain-bound properties of systems containing nonlinear or uncertain elements. Gain bounds often imply exponential stability, but it can be challenging to compute useful numerical bounds on the exponential decay rate. This work presents a generalization of the classical IQC results of Megretski and Rantzer that leads to a tractable computational procedure for finding exponential rate certificates that are far less conservative than ones computed from $L_2$ gain bounds alone. An expanded library of IQCs for c"},"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":"1706.01337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-06-02T15:49:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"88b32cab1d0594ba793fc5ce19cd093129673759d23759dcce168693a6815a90","abstract_canon_sha256":"b496a4bd10f979a065c3e87b194beb329ed509fbd91bbd3025e56ad522df6c57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:03.828707Z","signature_b64":"fWcixNYzNkSOLKRChtmIavmRQuy7Db9N0XO9Xz0q+IsXONAw3N5nKCCl6Qe4YToe346kDkpFnqdSOsvyun+wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ebe812d2b961aca5d4b8c5abe0cd92e4de48c30261d4927e7decc42fc72e2c6","last_reissued_at":"2026-05-18T00:43:03.827949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:03.827949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Stability Analysis via Integral Quadratic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Andrew Packard, Benjamin Recht, Laurent Lessard, Ross Boczar","submitted_at":"2017-06-02T15:49:22Z","abstract_excerpt":"The theory of integral quadratic constraints (IQCs) allows verification of stability and gain-bound properties of systems containing nonlinear or uncertain elements. Gain bounds often imply exponential stability, but it can be challenging to compute useful numerical bounds on the exponential decay rate. This work presents a generalization of the classical IQC results of Megretski and Rantzer that leads to a tractable computational procedure for finding exponential rate certificates that are far less conservative than ones computed from $L_2$ gain bounds alone. An expanded library of IQCs for c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01337","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":"1706.01337","created_at":"2026-05-18T00:43:03.828060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01337v1","created_at":"2026-05-18T00:43:03.828060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01337","created_at":"2026-05-18T00:43:03.828060+00:00"},{"alias_kind":"pith_short_12","alias_value":"J27ICLJLSYNM","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J27ICLJLSYNMUXKL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J27ICLJL","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02762","citing_title":"A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ","json":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ.json","graph_json":"https://pith.science/api/pith-number/J27ICLJLSYNMUXKLRRNL4DGZFZ/graph.json","events_json":"https://pith.science/api/pith-number/J27ICLJLSYNMUXKLRRNL4DGZFZ/events.json","paper":"https://pith.science/paper/J27ICLJL"},"agent_actions":{"view_html":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ","download_json":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ.json","view_paper":"https://pith.science/paper/J27ICLJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01337&json=true","fetch_graph":"https://pith.science/api/pith-number/J27ICLJLSYNMUXKLRRNL4DGZFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/J27ICLJLSYNMUXKLRRNL4DGZFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ/action/storage_attestation","attest_author":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ/action/author_attestation","sign_citation":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ/action/citation_signature","submit_replication":"https://pith.science/pith/J27ICLJLSYNMUXKLRRNL4DGZFZ/action/replication_record"}},"created_at":"2026-05-18T00:43:03.828060+00:00","updated_at":"2026-05-18T00:43:03.828060+00:00"}