{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OID4PCF2JLQOXVJSBFBMSDEW7O","short_pith_number":"pith:OID4PCF2","canonical_record":{"source":{"id":"2310.07922","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-11T22:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"22ea08ad1ce5d857a07f8031a3a209f8c16980997c660456c3f696f8f7a6efec","abstract_canon_sha256":"b937f1b6360ecc54db626069ff1840fa54a938e9df43be870af9ed0c453e91e3"},"schema_version":"1.0"},"canonical_sha256":"7207c788ba4ae0ebd5320942c90c96fbb9f0c5c34aa9d5acddfd1ae8e9a2fce8","source":{"kind":"arxiv","id":"2310.07922","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.07922","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"2310.07922v4","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07922","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"OID4PCF2JLQO","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"pith_short_16","alias_value":"OID4PCF2JLQOXVJS","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"pith_short_8","alias_value":"OID4PCF2","created_at":"2026-07-05T08:07:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OID4PCF2JLQOXVJSBFBMSDEW7O","target":"record","payload":{"canonical_record":{"source":{"id":"2310.07922","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-11T22:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"22ea08ad1ce5d857a07f8031a3a209f8c16980997c660456c3f696f8f7a6efec","abstract_canon_sha256":"b937f1b6360ecc54db626069ff1840fa54a938e9df43be870af9ed0c453e91e3"},"schema_version":"1.0"},"canonical_sha256":"7207c788ba4ae0ebd5320942c90c96fbb9f0c5c34aa9d5acddfd1ae8e9a2fce8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:11.634677Z","signature_b64":"ef35BmNCS898PDHScQNewRv2X44Ozv4dp2BHhIs1qU1NHf6a0aCiGQsnmLYHvxZ5lbHkWpg5+JlgQIuzcodLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7207c788ba4ae0ebd5320942c90c96fbb9f0c5c34aa9d5acddfd1ae8e9a2fce8","last_reissued_at":"2026-07-05T08:07:11.634191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:11.634191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.07922","source_version":4,"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-05T08:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpF4q6xn7MJ71YKx8t7pUWdswmOGU1CyPS0uljpIXxrDpdLt5GUW4s8UR+S1SZgymy1hELWmhV6a7Ye4g2rHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:02:45.162366Z"},"content_sha256":"4fb7e8877fc45dfe7086f937929b476ff7752629e49ca9087834683a583bdf0c","schema_version":"1.0","event_id":"sha256:4fb7e8877fc45dfe7086f937929b476ff7752629e49ca9087834683a583bdf0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OID4PCF2JLQOXVJSBFBMSDEW7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polyak Minorant Method for Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikhil Devanathan, Stephen Boyd","submitted_at":"2023-10-11T22:31:42Z","abstract_excerpt":"In 1963 Boris Polyak suggested a particular step size for gradient descent methods, now known as the Polyak step size, that he later adapted to subgradient methods. The Polyak step size requires knowledge of the optimal value of the minimization problem, which is a strong assumption but one that holds for several important problems. In this paper we extend Polyak's method to handle constraints and, as a generalization of subgradients, general minorants, which are convex functions that tightly lower bound the objective and constraint functions. We refer to this algorithm as the Polyak Minorant "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07922","kind":"arxiv","version":4},"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/2310.07922/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-05T08:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSnRQVNFVnft6aKoRNWBiwrktigh+e7T13XrY/XnT2URh/p8nyX7IUFEUrqYLDwq7qHsTh0M0uY54/3Aus/iAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:02:45.162852Z"},"content_sha256":"ed058af444617e77921e016a258bd81455aca94ca100e2a305a4d9a8f2887a12","schema_version":"1.0","event_id":"sha256:ed058af444617e77921e016a258bd81455aca94ca100e2a305a4d9a8f2887a12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OID4PCF2JLQOXVJSBFBMSDEW7O/bundle.json","state_url":"https://pith.science/pith/OID4PCF2JLQOXVJSBFBMSDEW7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OID4PCF2JLQOXVJSBFBMSDEW7O/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-08T08:02:45Z","links":{"resolver":"https://pith.science/pith/OID4PCF2JLQOXVJSBFBMSDEW7O","bundle":"https://pith.science/pith/OID4PCF2JLQOXVJSBFBMSDEW7O/bundle.json","state":"https://pith.science/pith/OID4PCF2JLQOXVJSBFBMSDEW7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OID4PCF2JLQOXVJSBFBMSDEW7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OID4PCF2JLQOXVJSBFBMSDEW7O","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":"b937f1b6360ecc54db626069ff1840fa54a938e9df43be870af9ed0c453e91e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-11T22:31:42Z","title_canon_sha256":"22ea08ad1ce5d857a07f8031a3a209f8c16980997c660456c3f696f8f7a6efec"},"schema_version":"1.0","source":{"id":"2310.07922","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.07922","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"2310.07922v4","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.07922","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"OID4PCF2JLQO","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"pith_short_16","alias_value":"OID4PCF2JLQOXVJS","created_at":"2026-07-05T08:07:11Z"},{"alias_kind":"pith_short_8","alias_value":"OID4PCF2","created_at":"2026-07-05T08:07:11Z"}],"graph_snapshots":[{"event_id":"sha256:ed058af444617e77921e016a258bd81455aca94ca100e2a305a4d9a8f2887a12","target":"graph","created_at":"2026-07-05T08:07:11Z","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/2310.07922/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1963 Boris Polyak suggested a particular step size for gradient descent methods, now known as the Polyak step size, that he later adapted to subgradient methods. The Polyak step size requires knowledge of the optimal value of the minimization problem, which is a strong assumption but one that holds for several important problems. In this paper we extend Polyak's method to handle constraints and, as a generalization of subgradients, general minorants, which are convex functions that tightly lower bound the objective and constraint functions. We refer to this algorithm as the Polyak Minorant ","authors_text":"Nikhil Devanathan, Stephen Boyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-11T22:31:42Z","title":"Polyak Minorant Method for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.07922","kind":"arxiv","version":4},"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:4fb7e8877fc45dfe7086f937929b476ff7752629e49ca9087834683a583bdf0c","target":"record","created_at":"2026-07-05T08:07:11Z","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":"b937f1b6360ecc54db626069ff1840fa54a938e9df43be870af9ed0c453e91e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-11T22:31:42Z","title_canon_sha256":"22ea08ad1ce5d857a07f8031a3a209f8c16980997c660456c3f696f8f7a6efec"},"schema_version":"1.0","source":{"id":"2310.07922","kind":"arxiv","version":4}},"canonical_sha256":"7207c788ba4ae0ebd5320942c90c96fbb9f0c5c34aa9d5acddfd1ae8e9a2fce8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7207c788ba4ae0ebd5320942c90c96fbb9f0c5c34aa9d5acddfd1ae8e9a2fce8","first_computed_at":"2026-07-05T08:07:11.634191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:11.634191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ef35BmNCS898PDHScQNewRv2X44Ozv4dp2BHhIs1qU1NHf6a0aCiGQsnmLYHvxZ5lbHkWpg5+JlgQIuzcodLBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:11.634677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.07922","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fb7e8877fc45dfe7086f937929b476ff7752629e49ca9087834683a583bdf0c","sha256:ed058af444617e77921e016a258bd81455aca94ca100e2a305a4d9a8f2887a12"],"state_sha256":"f970b1803d2cb6f8a543b34fc0faf2704bb94cf8eb4e8a5b0c0e4f0c696fc135"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHMGIB3xljRvUQn4Vlm6KM13K8sxUteCsqunIlLExrw4sR+9AXZg8u2lGAszB9cASCM1apXkucL59rZMoO+6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:02:45.166293Z","bundle_sha256":"c467ba8c2e1c98fe7e2cfda0f5f03365dc3468043b4b20f1bc684ce54c20948c"}}