{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6N3TMPZPAGKUC4PHXYAYVCC5ON","short_pith_number":"pith:6N3TMPZP","schema_version":"1.0","canonical_sha256":"f377363f2f01954171e7be018a885d737b7f77a71e72d349d036b91e161e5eb4","source":{"kind":"arxiv","id":"1707.09084","version":1},"attestation_state":"computed","paper":{"title":"Convergence of first-order methods via the convex conjugate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pena","submitted_at":"2017-07-28T01:44:36Z","abstract_excerpt":"This paper gives a unified and succinct approach to the $O(1/\\sqrt{k}), O(1/k),$ and $O(1/k^2)$ convergence rates of the subgradient, gradient, and accelerated gradient methods for unconstrained convex minimization. In the three cases the proof of convergence follows from a generic bound defined by the convex conjugate of the objective function."},"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":"1707.09084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-28T01:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"2846a7ce17d6c0ad5a400629142fa69db0fc96da6dfed0b1a9ff346d62c9012f","abstract_canon_sha256":"df3088bf6b5de6608b0bfa5ea0f03be1dde8a14e1339eb5fafa463f63becb0b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:17.154528Z","signature_b64":"Tp6j1uDCagyF+G/yJh798lQ8EPfzgdxIWuTAEUwLaW4ehr2c8Gx9h+p3gEi0EsKqz30LetSPdUzzbapLmwGbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f377363f2f01954171e7be018a885d737b7f77a71e72d349d036b91e161e5eb4","last_reissued_at":"2026-05-18T00:39:17.153891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:17.153891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence of first-order methods via the convex conjugate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pena","submitted_at":"2017-07-28T01:44:36Z","abstract_excerpt":"This paper gives a unified and succinct approach to the $O(1/\\sqrt{k}), O(1/k),$ and $O(1/k^2)$ convergence rates of the subgradient, gradient, and accelerated gradient methods for unconstrained convex minimization. In the three cases the proof of convergence follows from a generic bound defined by the convex conjugate of the objective function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09084","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":""},"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":"1707.09084","created_at":"2026-05-18T00:39:17.153992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09084v1","created_at":"2026-05-18T00:39:17.153992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09084","created_at":"2026-05-18T00:39:17.153992+00:00"},{"alias_kind":"pith_short_12","alias_value":"6N3TMPZPAGKU","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6N3TMPZPAGKUC4PH","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6N3TMPZP","created_at":"2026-05-18T12:31:03.183658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON","json":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON.json","graph_json":"https://pith.science/api/pith-number/6N3TMPZPAGKUC4PHXYAYVCC5ON/graph.json","events_json":"https://pith.science/api/pith-number/6N3TMPZPAGKUC4PHXYAYVCC5ON/events.json","paper":"https://pith.science/paper/6N3TMPZP"},"agent_actions":{"view_html":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON","download_json":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON.json","view_paper":"https://pith.science/paper/6N3TMPZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09084&json=true","fetch_graph":"https://pith.science/api/pith-number/6N3TMPZPAGKUC4PHXYAYVCC5ON/graph.json","fetch_events":"https://pith.science/api/pith-number/6N3TMPZPAGKUC4PHXYAYVCC5ON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON/action/storage_attestation","attest_author":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON/action/author_attestation","sign_citation":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON/action/citation_signature","submit_replication":"https://pith.science/pith/6N3TMPZPAGKUC4PHXYAYVCC5ON/action/replication_record"}},"created_at":"2026-05-18T00:39:17.153992+00:00","updated_at":"2026-05-18T00:39:17.153992+00:00"}