{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CWIK7VY2X3IFGZUGJDNZL4Z6AG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37d22efdb3533897ee893d52f7e5853476c31e9d54927e69006aa6913f7d01fb","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-10T21:15:00Z","title_canon_sha256":"0ec62d96211045dd8a07594fa73f4ec44f24b03f379e22ce97de856fa569f629"},"schema_version":"1.0","source":{"id":"2012.05981","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.05981","created_at":"2026-07-05T02:36:31Z"},{"alias_kind":"arxiv_version","alias_value":"2012.05981v3","created_at":"2026-07-05T02:36:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05981","created_at":"2026-07-05T02:36:31Z"},{"alias_kind":"pith_short_12","alias_value":"CWIK7VY2X3IF","created_at":"2026-07-05T02:36:31Z"},{"alias_kind":"pith_short_16","alias_value":"CWIK7VY2X3IFGZUG","created_at":"2026-07-05T02:36:31Z"},{"alias_kind":"pith_short_8","alias_value":"CWIK7VY2","created_at":"2026-07-05T02:36:31Z"}],"graph_snapshots":[{"event_id":"sha256:3b5ab275fdfc9764ad6fe677d66019a7ee0225faf906bd5d5fe1f277b311c424","target":"graph","created_at":"2026-07-05T02:36:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.05981/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Abstracting neural networks with constraints they impose on their inputs and outputs can be very useful in the analysis of neural network classifiers and to derive optimization-based algorithms for certification of stability and robustness of feedback systems involving neural networks. In this paper, we propose a convex program, in the form of a Linear Matrix Inequality (LMI), to certify incremental quadratic constraints on the map of neural networks over a region of interest. These certificates can capture several useful properties such as (local) Lipschitz continuity, one-sided Lipschitz con","authors_text":"Justin Ruths, Mahyar Fazlyab, Navid Hashemi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-10T21:15:00Z","title":"Certifying Incremental Quadratic Constraints for Neural Networks via Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.05981","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9c2d0cd98cf68a8e71e350d2b4e520c85e28ff60e66c888027d4f4c2dd5a2111","target":"record","created_at":"2026-07-05T02:36:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37d22efdb3533897ee893d52f7e5853476c31e9d54927e69006aa6913f7d01fb","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-10T21:15:00Z","title_canon_sha256":"0ec62d96211045dd8a07594fa73f4ec44f24b03f379e22ce97de856fa569f629"},"schema_version":"1.0","source":{"id":"2012.05981","kind":"arxiv","version":3}},"canonical_sha256":"1590afd71abed053668648db95f33e01b27c350686e5faf51c13a941c420e57e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1590afd71abed053668648db95f33e01b27c350686e5faf51c13a941c420e57e","first_computed_at":"2026-07-05T02:36:31.793011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:31.793011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"by2UKHhkshdcEWMMGNZNaROidCfBTkx6KME3WH9FYczfjCJz9va/9aQ08JB3LetRlvUq/55WueHJJsedZKgzAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:31.793596Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.05981","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c2d0cd98cf68a8e71e350d2b4e520c85e28ff60e66c888027d4f4c2dd5a2111","sha256:3b5ab275fdfc9764ad6fe677d66019a7ee0225faf906bd5d5fe1f277b311c424"],"state_sha256":"7166f5926187b707d1210c49d0b190cbff1d96de28a32f16fcd42c95033dbaf7"}