{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HT5XDLPO2FFPSEDQHFYVG4LMXQ","short_pith_number":"pith:HT5XDLPO","schema_version":"1.0","canonical_sha256":"3cfb71adeed14af91070397153716cbc34d7d40895aaf00908b432c5803a0f69","source":{"kind":"arxiv","id":"1712.04581","version":3},"attestation_state":"computed","paper":{"title":"Potential-Function Proofs for First-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Anupam Gupta, Nikhil Bansal","submitted_at":"2017-12-13T01:10:13Z","abstract_excerpt":"This note discusses proofs for convergence of first-order methods based on simple potential-function arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants."},"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":"1712.04581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-13T01:10:13Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"fd108523a78670e4ebfffe5f102f7a0c434d39853c37d96a678f5746d0b4de0a","abstract_canon_sha256":"801f1ff30304e80c4e4f660dfea20af2bdb7cebf647d91e63453b0fda6d50d01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:32.832744Z","signature_b64":"5MSrPVu++79AUguUf59lGikuwDkEGGVURNxCFmuYgX5pX4KAbtRwpkS5FPS0oGBMtHYHHQ7qGSKnD+mX3oJSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cfb71adeed14af91070397153716cbc34d7d40895aaf00908b432c5803a0f69","last_reissued_at":"2026-05-17T23:44:32.832034Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:32.832034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Potential-Function Proofs for First-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Anupam Gupta, Nikhil Bansal","submitted_at":"2017-12-13T01:10:13Z","abstract_excerpt":"This note discusses proofs for convergence of first-order methods based on simple potential-function arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04581","kind":"arxiv","version":3},"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":"1712.04581","created_at":"2026-05-17T23:44:32.832137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04581v3","created_at":"2026-05-17T23:44:32.832137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04581","created_at":"2026-05-17T23:44:32.832137+00:00"},{"alias_kind":"pith_short_12","alias_value":"HT5XDLPO2FFP","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HT5XDLPO2FFPSEDQ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HT5XDLPO","created_at":"2026-05-18T12:31:18.294218+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/HT5XDLPO2FFPSEDQHFYVG4LMXQ","json":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ.json","graph_json":"https://pith.science/api/pith-number/HT5XDLPO2FFPSEDQHFYVG4LMXQ/graph.json","events_json":"https://pith.science/api/pith-number/HT5XDLPO2FFPSEDQHFYVG4LMXQ/events.json","paper":"https://pith.science/paper/HT5XDLPO"},"agent_actions":{"view_html":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ","download_json":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ.json","view_paper":"https://pith.science/paper/HT5XDLPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04581&json=true","fetch_graph":"https://pith.science/api/pith-number/HT5XDLPO2FFPSEDQHFYVG4LMXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HT5XDLPO2FFPSEDQHFYVG4LMXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ/action/storage_attestation","attest_author":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ/action/author_attestation","sign_citation":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ/action/citation_signature","submit_replication":"https://pith.science/pith/HT5XDLPO2FFPSEDQHFYVG4LMXQ/action/replication_record"}},"created_at":"2026-05-17T23:44:32.832137+00:00","updated_at":"2026-05-17T23:44:32.832137+00:00"}