{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RLUYP6AAPU7SFNCBBBLVXGOJYT","short_pith_number":"pith:RLUYP6AA","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"},"canonical_sha256":"8ae987f8007d3f22b44108575b99c9c4f6a32f1b4a22825e6e19e574b5557acc","source":{"kind":"arxiv","id":"2403.03331","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.03331","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"2403.03331v2","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03331","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"RLUYP6AAPU7S","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"pith_short_16","alias_value":"RLUYP6AAPU7SFNCB","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"pith_short_8","alias_value":"RLUYP6AA","created_at":"2026-07-05T10:50:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RLUYP6AAPU7SFNCBBBLVXGOJYT","target":"record","payload":{"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"},"canonical_sha256":"8ae987f8007d3f22b44108575b99c9c4f6a32f1b4a22825e6e19e574b5557acc","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"},"source_kind":"arxiv","source_id":"2403.03331","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUeTuL8sbAd7crXFuBY2SJ7IX+AJ6uG80iV9Pw8kdLThetm+zWbJ2RKC0IfFPA+0PE97Eb98EyjkXArJYarOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:41:54.152824Z"},"content_sha256":"68af8e852b370ad758a25a7021f0086af02074a0434ed812c8b0cbe38ee9149c","schema_version":"1.0","event_id":"sha256:68af8e852b370ad758a25a7021f0086af02074a0434ed812c8b0cbe38ee9149c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RLUYP6AAPU7SFNCBBBLVXGOJYT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQsr1XmBF1z8EbUNilA2eiEOn4SqnoxBFsDISKkkFP83wbw6e9cRidOym5NGzRJNfuH0fqBLic71qtVUuU+7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:41:54.153397Z"},"content_sha256":"2be69608b5b19242ce696b38051d2b0974b10b2826531ec4170b250851a9052b","schema_version":"1.0","event_id":"sha256:2be69608b5b19242ce696b38051d2b0974b10b2826531ec4170b250851a9052b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/bundle.json","state_url":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T01:41:54Z","links":{"resolver":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT","bundle":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/bundle.json","state":"https://pith.science/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLUYP6AAPU7SFNCBBBLVXGOJYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RLUYP6AAPU7SFNCBBBLVXGOJYT","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":"ab0353456b98d4231e56a62c0eb13b0c083daed1724caf05f1926ca8fd2feade","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T21:28:03Z","title_canon_sha256":"8e3d4756f07c720a2fa5666dea074a29aac9e0b7d5982e2b504ad68a8159b34d"},"schema_version":"1.0","source":{"id":"2403.03331","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.03331","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"2403.03331v2","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03331","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"RLUYP6AAPU7S","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"pith_short_16","alias_value":"RLUYP6AAPU7SFNCB","created_at":"2026-07-05T10:50:07Z"},{"alias_kind":"pith_short_8","alias_value":"RLUYP6AA","created_at":"2026-07-05T10:50:07Z"}],"graph_snapshots":[{"event_id":"sha256:2be69608b5b19242ce696b38051d2b0974b10b2826531ec4170b250851a9052b","target":"graph","created_at":"2026-07-05T10:50:07Z","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/2403.03331/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bartolomeo Stellato, Vinit Ranjan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T21:28:03Z","title":"Verification of First-Order Methods for Parametric Quadratic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03331","kind":"arxiv","version":2},"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:68af8e852b370ad758a25a7021f0086af02074a0434ed812c8b0cbe38ee9149c","target":"record","created_at":"2026-07-05T10:50:07Z","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":"ab0353456b98d4231e56a62c0eb13b0c083daed1724caf05f1926ca8fd2feade","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-05T21:28:03Z","title_canon_sha256":"8e3d4756f07c720a2fa5666dea074a29aac9e0b7d5982e2b504ad68a8159b34d"},"schema_version":"1.0","source":{"id":"2403.03331","kind":"arxiv","version":2}},"canonical_sha256":"8ae987f8007d3f22b44108575b99c9c4f6a32f1b4a22825e6e19e574b5557acc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ae987f8007d3f22b44108575b99c9c4f6a32f1b4a22825e6e19e574b5557acc","first_computed_at":"2026-07-05T10:50:07.870935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:50:07.870935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7S4qSMREftzar785ImXLpoiSiSHAk3xPPITSRFgVmkhhfKObXKkhc+ke43P6myl7ZB7JfgquW1vsYojHZ6vLCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:50:07.871338Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.03331","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68af8e852b370ad758a25a7021f0086af02074a0434ed812c8b0cbe38ee9149c","sha256:2be69608b5b19242ce696b38051d2b0974b10b2826531ec4170b250851a9052b"],"state_sha256":"d0b8b7d1fd82a8dc784e7268dbce6eeb3ad86d75166b0559dcc334b53917fc54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xH6JAlqehOd3JIGAH9Uew7UvEdyxKN3MLpsQ3zDvCSP6OG3M7JU8ZRes8YAMI++Fx77BbrbMGnjrW4H5Vaz7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:41:54.162871Z","bundle_sha256":"1b227377b0fb790c103c9f07b3bdc461b8651deab960c4a759272867ffe154d0"}}