{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RLUYP6AAPU7SFNCBBBLVXGOJYT","short_pith_number":"pith:RLUYP6AA","schema_version":"1.0","canonical_sha256":"8ae987f8007d3f22b44108575b99c9c4f6a32f1b4a22825e6e19e574b5557acc","source":{"kind":"arxiv","id":"2403.03331","version":2},"attestation_state":"computed","paper":{"title":"Verification of First-Order Methods for Parametric Quadratic Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bartolomeo Stellato, Vinit Ranjan","submitted_at":"2024-03-05T21:28:03Z","abstract_excerpt":"We introduce a numerical framework to verify the finite step convergence of first-order methods for parametric convex quadratic optimization. We formulate the verification problem as a mathematical optimization problem where we maximize a performance metric (e.g., fixed-point residual at the last iteration) subject to constraints representing proximal algorithm steps (e.g., linear system solutions, projections, or gradient steps). Our framework is highly modular because we encode a wide range of proximal algorithms as variations of two primitive steps: affine steps and element-wise maximum ste"},"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":"2403.03331","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T21:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"8e3d4756f07c720a2fa5666dea074a29aac9e0b7d5982e2b504ad68a8159b34d","abstract_canon_sha256":"ab0353456b98d4231e56a62c0eb13b0c083daed1724caf05f1926ca8fd2feade"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:07.871338Z","signature_b64":"7S4qSMREftzar785ImXLpoiSiSHAk3xPPITSRFgVmkhhfKObXKkhc+ke43P6myl7ZB7JfgquW1vsYojHZ6vLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae987f8007d3f22b44108575b99c9c4f6a32f1b4a22825e6e19e574b5557acc","last_reissued_at":"2026-07-05T10:50:07.870935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:07.870935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of First-Order Methods for Parametric Quadratic Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bartolomeo Stellato, Vinit Ranjan","submitted_at":"2024-03-05T21:28:03Z","abstract_excerpt":"We introduce a numerical framework to verify the finite step convergence of first-order methods for parametric convex quadratic optimization. We formulate the verification problem as a mathematical optimization problem where we maximize a performance metric (e.g., fixed-point residual at the last iteration) subject to constraints representing proximal algorithm steps (e.g., linear system solutions, projections, or gradient steps). Our framework is highly modular because we encode a wide range of proximal algorithms as variations of two primitive steps: affine steps and element-wise maximum ste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03331","kind":"arxiv","version":2},"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/2403.03331/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":"2403.03331","created_at":"2026-07-05T10:50:07.870990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03331v2","created_at":"2026-07-05T10:50:07.870990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03331","created_at":"2026-07-05T10:50:07.870990+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLUYP6AAPU7S","created_at":"2026-07-05T10:50:07.870990+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLUYP6AAPU7SFNCB","created_at":"2026-07-05T10:50:07.870990+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLUYP6AA","created_at":"2026-07-05T10:50:07.870990+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.05497","citing_title":"Accelerating Proximal Gradient Descent via Silver Stepsizes","ref_index":1987,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT","json":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT.json","graph_json":"https://pith.science/api/pith-number/RLUYP6AAPU7SFNCBBBLVXGOJYT/graph.json","events_json":"https://pith.science/api/pith-number/RLUYP6AAPU7SFNCBBBLVXGOJYT/events.json","paper":"https://pith.science/paper/RLUYP6AA"},"agent_actions":{"view_html":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT","download_json":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT.json","view_paper":"https://pith.science/paper/RLUYP6AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03331&json=true","fetch_graph":"https://pith.science/api/pith-number/RLUYP6AAPU7SFNCBBBLVXGOJYT/graph.json","fetch_events":"https://pith.science/api/pith-number/RLUYP6AAPU7SFNCBBBLVXGOJYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/action/storage_attestation","attest_author":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/action/author_attestation","sign_citation":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/action/citation_signature","submit_replication":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/action/replication_record"}},"created_at":"2026-07-05T10:50:07.870990+00:00","updated_at":"2026-07-05T10:50:07.870990+00:00"}