{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PO2YXKQUEDSO7H3F2YGJK6YMEY","short_pith_number":"pith:PO2YXKQU","canonical_record":{"source":{"id":"1803.10928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T05:22:59Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"99940111cb94d15d11ac8670ba58ea1d2ca92539b1ca617279b2a505ba6592a0","abstract_canon_sha256":"611f429cac5f3dbe028b6e4beb5e3d5e96465128c18985af3c2d9fcb84ec9b9c"},"schema_version":"1.0"},"canonical_sha256":"7bb58baa1420e4ef9f65d60c957b0c261efc918808708573e5162d4b9ef57c61","source":{"kind":"arxiv","id":"1803.10928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10928","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10928v2","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10928","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"PO2YXKQUEDSO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PO2YXKQUEDSO7H3F","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PO2YXKQU","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PO2YXKQUEDSO7H3F2YGJK6YMEY","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T05:22:59Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"99940111cb94d15d11ac8670ba58ea1d2ca92539b1ca617279b2a505ba6592a0","abstract_canon_sha256":"611f429cac5f3dbe028b6e4beb5e3d5e96465128c18985af3c2d9fcb84ec9b9c"},"schema_version":"1.0"},"canonical_sha256":"7bb58baa1420e4ef9f65d60c957b0c261efc918808708573e5162d4b9ef57c61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.074343Z","signature_b64":"Adn1nuZjP5BUhEaBVFH1X5beWmQgj26A55Z4p0QEs/uIb/7vmoatS2MPiDEuf/p2D8+8Zqt/qcHkbkzyBc2qCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bb58baa1420e4ef9f65d60c957b0c261efc918808708573e5162d4b9ef57c61","last_reissued_at":"2026-05-18T00:05:05.073686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.073686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10928","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-05-18T00:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPLdu2fpNPOuDTX3RKAL8KROu86MhOkCE9SG0/xm5/Y9AG6sBgXwKN9S8qfkNPn8HbGqSdmpS2oAPFKjECnJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:39:51.807457Z"},"content_sha256":"f3b961a9de35edaabc55383f32fdf733d5416d07fdaee8270d7efaa65e5d75ab","schema_version":"1.0","event_id":"sha256:f3b961a9de35edaabc55383f32fdf733d5416d07fdaee8270d7efaa65e5d75ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PO2YXKQUEDSO7H3F2YGJK6YMEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design of First-Order Optimization Algorithms via Sum-of-Squares Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Mahyar Fazlyab, Manfred Morari, Victor M. Preciado","submitted_at":"2018-03-29T05:22:59Z","abstract_excerpt":"In this paper, we propose a framework based on sum-of-squares programming to design iterative first-order optimization algorithms for smooth and strongly convex problems. Our starting point is to develop a polynomial matrix inequality as a sufficient condition for exponential convergence of the algorithm. The entries of this matrix are polynomial functions of the unknown parameters (exponential decay rate, stepsize, momentum coefficient, etc.). We then formulate a polynomial optimization, in which the objective is to optimize the exponential decay rate over the parameters of the algorithm. Fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10928","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":""},"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-05-18T00:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVnXZihF7cQIuYKXnKmQEZ6OZBOpjc/ON9G+oMlaS5ibI6/jK/bJp2SLVw3Hzv/rfRIbdUr+X1NaKsQ1XtlUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:39:51.807805Z"},"content_sha256":"285a565b8ac3510da7145823c808f4a220fcefff5955846c84483e42e5120578","schema_version":"1.0","event_id":"sha256:285a565b8ac3510da7145823c808f4a220fcefff5955846c84483e42e5120578"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY/bundle.json","state_url":"https://pith.science/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY/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-06-04T12:39:51Z","links":{"resolver":"https://pith.science/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY","bundle":"https://pith.science/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY/bundle.json","state":"https://pith.science/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PO2YXKQUEDSO7H3F2YGJK6YMEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PO2YXKQUEDSO7H3F2YGJK6YMEY","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":"611f429cac5f3dbe028b6e4beb5e3d5e96465128c18985af3c2d9fcb84ec9b9c","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T05:22:59Z","title_canon_sha256":"99940111cb94d15d11ac8670ba58ea1d2ca92539b1ca617279b2a505ba6592a0"},"schema_version":"1.0","source":{"id":"1803.10928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10928","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10928v2","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10928","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"PO2YXKQUEDSO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PO2YXKQUEDSO7H3F","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PO2YXKQU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:285a565b8ac3510da7145823c808f4a220fcefff5955846c84483e42e5120578","target":"graph","created_at":"2026-05-18T00:05:05Z","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"},"paper":{"abstract_excerpt":"In this paper, we propose a framework based on sum-of-squares programming to design iterative first-order optimization algorithms for smooth and strongly convex problems. Our starting point is to develop a polynomial matrix inequality as a sufficient condition for exponential convergence of the algorithm. The entries of this matrix are polynomial functions of the unknown parameters (exponential decay rate, stepsize, momentum coefficient, etc.). We then formulate a polynomial optimization, in which the objective is to optimize the exponential decay rate over the parameters of the algorithm. Fin","authors_text":"Mahyar Fazlyab, Manfred Morari, Victor M. Preciado","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T05:22:59Z","title":"Design of First-Order Optimization Algorithms via Sum-of-Squares Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10928","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:f3b961a9de35edaabc55383f32fdf733d5416d07fdaee8270d7efaa65e5d75ab","target":"record","created_at":"2026-05-18T00:05:05Z","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":"611f429cac5f3dbe028b6e4beb5e3d5e96465128c18985af3c2d9fcb84ec9b9c","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-29T05:22:59Z","title_canon_sha256":"99940111cb94d15d11ac8670ba58ea1d2ca92539b1ca617279b2a505ba6592a0"},"schema_version":"1.0","source":{"id":"1803.10928","kind":"arxiv","version":2}},"canonical_sha256":"7bb58baa1420e4ef9f65d60c957b0c261efc918808708573e5162d4b9ef57c61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bb58baa1420e4ef9f65d60c957b0c261efc918808708573e5162d4b9ef57c61","first_computed_at":"2026-05-18T00:05:05.073686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:05.073686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Adn1nuZjP5BUhEaBVFH1X5beWmQgj26A55Z4p0QEs/uIb/7vmoatS2MPiDEuf/p2D8+8Zqt/qcHkbkzyBc2qCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:05.074343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3b961a9de35edaabc55383f32fdf733d5416d07fdaee8270d7efaa65e5d75ab","sha256:285a565b8ac3510da7145823c808f4a220fcefff5955846c84483e42e5120578"],"state_sha256":"c16f15b52866e6e8c1697015691da68882f0a80cf19628426acecd1980c230f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/paNTvW5cfhrtqEZdkVAXednktYdqQYHBKu15MJwsxnnQmTMRtH1pq+DCyKm0hdyNu3j7oKTgsNfmr3mhB+ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:39:51.809830Z","bundle_sha256":"6b0e4a320db8d3fa1ebb76be90707a04d44cd89bf290bb98548b182267e873cc"}}