{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:C2DUP6UJ63IX7MLYC3ZK6IRXIN","short_pith_number":"pith:C2DUP6UJ","canonical_record":{"source":{"id":"2507.20773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T12:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"e6318d276fce491787346fa48a7023442d41aef1bec0106d0de44693e97b0d67","abstract_canon_sha256":"b6e29bae20c5123d2ae7eaa42bb513ef56ec606773d1ec7b24fe95ad1debe8aa"},"schema_version":"1.0"},"canonical_sha256":"168747fa89f6d17fb17816f2af2237437aa9fa22855156e79857a87bc5a01b33","source":{"kind":"arxiv","id":"2507.20773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20773","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20773v1","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20773","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"C2DUP6UJ63IX","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"pith_short_16","alias_value":"C2DUP6UJ63IX7MLY","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"pith_short_8","alias_value":"C2DUP6UJ","created_at":"2026-07-05T11:44:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:C2DUP6UJ63IX7MLYC3ZK6IRXIN","target":"record","payload":{"canonical_record":{"source":{"id":"2507.20773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T12:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"e6318d276fce491787346fa48a7023442d41aef1bec0106d0de44693e97b0d67","abstract_canon_sha256":"b6e29bae20c5123d2ae7eaa42bb513ef56ec606773d1ec7b24fe95ad1debe8aa"},"schema_version":"1.0"},"canonical_sha256":"168747fa89f6d17fb17816f2af2237437aa9fa22855156e79857a87bc5a01b33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:25.618447Z","signature_b64":"dmyjxc527LaLWWPrgaBQG/pM3sOsiyRfhu1P5Y/4t2uvP1m9iA9+k+kc0Bo20kvToS0m6KdW7JJv3I+pekP4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168747fa89f6d17fb17816f2af2237437aa9fa22855156e79857a87bc5a01b33","last_reissued_at":"2026-07-05T11:44:25.617934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:25.617934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.20773","source_version":1,"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-05T11:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCGmpPS641EtndiGoYVex/UyMXSh6r0YJbsa/kdNweXwH82RHjB15N53XkZm4tP7DdNlHg3++lpcj3OMOegaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:00:11.782735Z"},"content_sha256":"f1d599d761f79d4474d8a632614688e06d2f4bd41b0df16b65d232fe905a2abd","schema_version":"1.0","event_id":"sha256:f1d599d761f79d4474d8a632614688e06d2f4bd41b0df16b65d232fe905a2abd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:C2DUP6UJ63IX7MLYC3ZK6IRXIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Numerical Design of Optimized First-Order Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fran\\c{c}ois Glineur, Julien M. Hendrickx, Yassine Kamri","submitted_at":"2025-07-28T12:35:46Z","abstract_excerpt":"We derive several numerical methods for designing optimized first-order algorithms in unconstrained convex optimization settings. Our methods are based on the Performance Estimation Problem (PEP) framework, which casts the worst-case analysis of optimization algorithms as an optimization problem itself. We benchmark our methods against existing approaches in the literature on the task of optimizing the step sizes of memoryless gradient descent (which uses only the current gradient for updates) over the class of smooth convex functions. We then apply our methods to numerically tune the step siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20773","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.20773/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-05T11:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DclieSNpVsheZtYD9DuEG7YWh55kjFDuoeyblt+If0yaqIfiQdA2FfFRfMTvxDWRWX1/yhCnFA5VH6rmzYyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T09:00:11.783688Z"},"content_sha256":"268909cd59895f4cb4c27ea1927b7c78e52a5201a768e92429a7f242087cc60c","schema_version":"1.0","event_id":"sha256:268909cd59895f4cb4c27ea1927b7c78e52a5201a768e92429a7f242087cc60c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN/bundle.json","state_url":"https://pith.science/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN/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-09T09:00:11Z","links":{"resolver":"https://pith.science/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN","bundle":"https://pith.science/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN/bundle.json","state":"https://pith.science/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2DUP6UJ63IX7MLYC3ZK6IRXIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:C2DUP6UJ63IX7MLYC3ZK6IRXIN","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":"b6e29bae20c5123d2ae7eaa42bb513ef56ec606773d1ec7b24fe95ad1debe8aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T12:35:46Z","title_canon_sha256":"e6318d276fce491787346fa48a7023442d41aef1bec0106d0de44693e97b0d67"},"schema_version":"1.0","source":{"id":"2507.20773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20773","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20773v1","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20773","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"C2DUP6UJ63IX","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"pith_short_16","alias_value":"C2DUP6UJ63IX7MLY","created_at":"2026-07-05T11:44:25Z"},{"alias_kind":"pith_short_8","alias_value":"C2DUP6UJ","created_at":"2026-07-05T11:44:25Z"}],"graph_snapshots":[{"event_id":"sha256:268909cd59895f4cb4c27ea1927b7c78e52a5201a768e92429a7f242087cc60c","target":"graph","created_at":"2026-07-05T11:44:25Z","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/2507.20773/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We derive several numerical methods for designing optimized first-order algorithms in unconstrained convex optimization settings. Our methods are based on the Performance Estimation Problem (PEP) framework, which casts the worst-case analysis of optimization algorithms as an optimization problem itself. We benchmark our methods against existing approaches in the literature on the task of optimizing the step sizes of memoryless gradient descent (which uses only the current gradient for updates) over the class of smooth convex functions. We then apply our methods to numerically tune the step siz","authors_text":"Fran\\c{c}ois Glineur, Julien M. Hendrickx, Yassine Kamri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T12:35:46Z","title":"Numerical Design of Optimized First-Order Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20773","kind":"arxiv","version":1},"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:f1d599d761f79d4474d8a632614688e06d2f4bd41b0df16b65d232fe905a2abd","target":"record","created_at":"2026-07-05T11:44:25Z","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":"b6e29bae20c5123d2ae7eaa42bb513ef56ec606773d1ec7b24fe95ad1debe8aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-28T12:35:46Z","title_canon_sha256":"e6318d276fce491787346fa48a7023442d41aef1bec0106d0de44693e97b0d67"},"schema_version":"1.0","source":{"id":"2507.20773","kind":"arxiv","version":1}},"canonical_sha256":"168747fa89f6d17fb17816f2af2237437aa9fa22855156e79857a87bc5a01b33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"168747fa89f6d17fb17816f2af2237437aa9fa22855156e79857a87bc5a01b33","first_computed_at":"2026-07-05T11:44:25.617934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:25.617934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dmyjxc527LaLWWPrgaBQG/pM3sOsiyRfhu1P5Y/4t2uvP1m9iA9+k+kc0Bo20kvToS0m6KdW7JJv3I+pekP4AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:25.618447Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1d599d761f79d4474d8a632614688e06d2f4bd41b0df16b65d232fe905a2abd","sha256:268909cd59895f4cb4c27ea1927b7c78e52a5201a768e92429a7f242087cc60c"],"state_sha256":"dcb8be3ef19abfe4baf262747346e84ed35bfcaaeb00432db40e0d647c530204"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"carHD8ZteDhbSJVv04q0Fo1e2Zf/dmrHnfQtdUGtAPRknWUX4vdeLm8KBWy9wHvfqN0Yo0Zgjb9K4x7CBhWfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T09:00:11.795219Z","bundle_sha256":"c8c8e0a5f65fe9f09e1d1581183f74696bbeac078c8a1e39836b95b1afccc9f6"}}