{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CVKYWGQ27DJVXVBAKHPHPQ2K4D","short_pith_number":"pith:CVKYWGQ2","schema_version":"1.0","canonical_sha256":"15558b1a1af8d35bd42051de77c34ae0c8d9511bb192908768089b224f6465a7","source":{"kind":"arxiv","id":"2412.11330","version":6},"attestation_state":"computed","paper":{"title":"Exact Verification of First-Order Methods via Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Lodi, Bartolomeo Stellato, Jisun Park, Stefano Gualandi, Vinit Ranjan","submitted_at":"2024-12-15T22:20:22Z","abstract_excerpt":"We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the objective is to maximize the infinity norm of the fixed-point residual after a given number of iterations. Our approach captures a wide range of gradient, projection, proximal iterations through affine or piecewise affine constraints. We derive tight polyhedral convex hull formulations of the constraints representing the algorithm iterations. To improve the sca"},"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":"2412.11330","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-15T22:20:22Z","cross_cats_sorted":[],"title_canon_sha256":"f21408e130dfe5870ba4ba6fc9f502b95f46e20239f539bfba36bf48516d7324","abstract_canon_sha256":"a67def65f73689747cddfb2c80fafe61eb5b5ac6e51ba839bcf9a5efe1909fda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:04:51.754094Z","signature_b64":"sXliGFBqI+93STTupUzIlUxPkNeSgqf+/7gU9HFjFo74NEWewxYgRoy+8g/aX34u2sqQd/SWx55zFnrtV3d9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15558b1a1af8d35bd42051de77c34ae0c8d9511bb192908768089b224f6465a7","last_reissued_at":"2026-05-29T01:04:51.753604Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:04:51.753604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Verification of First-Order Methods via Mixed-Integer Linear Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Lodi, Bartolomeo Stellato, Jisun Park, Stefano Gualandi, Vinit Ranjan","submitted_at":"2024-12-15T22:20:22Z","abstract_excerpt":"We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the objective is to maximize the infinity norm of the fixed-point residual after a given number of iterations. Our approach captures a wide range of gradient, projection, proximal iterations through affine or piecewise affine constraints. We derive tight polyhedral convex hull formulations of the constraints representing the algorithm iterations. To improve the sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11330","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.11330/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.11330","created_at":"2026-05-29T01:04:51.753661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11330v6","created_at":"2026-05-29T01:04:51.753661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11330","created_at":"2026-05-29T01:04:51.753661+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVKYWGQ27DJV","created_at":"2026-05-29T01:04:51.753661+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVKYWGQ27DJVXVBA","created_at":"2026-05-29T01:04:51.753661+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVKYWGQ2","created_at":"2026-05-29T01:04:51.753661+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/CVKYWGQ27DJVXVBAKHPHPQ2K4D","json":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D.json","graph_json":"https://pith.science/api/pith-number/CVKYWGQ27DJVXVBAKHPHPQ2K4D/graph.json","events_json":"https://pith.science/api/pith-number/CVKYWGQ27DJVXVBAKHPHPQ2K4D/events.json","paper":"https://pith.science/paper/CVKYWGQ2"},"agent_actions":{"view_html":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D","download_json":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D.json","view_paper":"https://pith.science/paper/CVKYWGQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11330&json=true","fetch_graph":"https://pith.science/api/pith-number/CVKYWGQ27DJVXVBAKHPHPQ2K4D/graph.json","fetch_events":"https://pith.science/api/pith-number/CVKYWGQ27DJVXVBAKHPHPQ2K4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D/action/storage_attestation","attest_author":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D/action/author_attestation","sign_citation":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D/action/citation_signature","submit_replication":"https://pith.science/pith/CVKYWGQ27DJVXVBAKHPHPQ2K4D/action/replication_record"}},"created_at":"2026-05-29T01:04:51.753661+00:00","updated_at":"2026-05-29T01:04:51.753661+00:00"}