{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TRP4Y5QVQEXIBBUQSW27L2K3II","short_pith_number":"pith:TRP4Y5QV","schema_version":"1.0","canonical_sha256":"9c5fcc7615812e80869095b5f5e95b4226ab609c7f8dceabbca70ed025663c1d","source":{"kind":"arxiv","id":"1710.03695","version":2},"attestation_state":"computed","paper":{"title":"Fast and Safe: Accelerated gradient methods with optimality certificates and underestimate sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chenxin Ma, Majid Jahani, Martin Tak\\'a\\v{c}, Naga Venkata C. Gudapati, Rachael Tappenden","submitted_at":"2017-10-10T16:10:55Z","abstract_excerpt":"In this work we introduce the concept of an Underestimate Sequence (UES), which is motivated by Nesterov's estimate sequence. Our definition of a UES utilizes three sequences, one of which is a lower bound (or under-estimator) of the objective function. The question of how to construct an appropriate sequence of lower bounds is addressed, and we present lower bounds for strongly convex smooth functions and for strongly convex composite functions, which adhere to the UES framework. Further, we propose several first order methods for minimizing strongly convex functions in both the smooth and co"},"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":"1710.03695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-10T16:10:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f82faae377c9bcdc660e4ec16a6d7f15eaae0809127ee290f3038e93ec71ee08","abstract_canon_sha256":"2936814a4c15b80157f18ae6caa259535b39b96d0d5084943fcc089ac0afe507"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:50.751353Z","signature_b64":"hGHmzbtr1AlLd55WRYBvhoDElxhxSpAeKM0RUHRQ48sJ8u1aj2YZS4GvFsTUlCUL1QmQa01ac/CEeb5rEXTFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c5fcc7615812e80869095b5f5e95b4226ab609c7f8dceabbca70ed025663c1d","last_reissued_at":"2026-07-05T02:14:50.750855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:50.750855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Safe: Accelerated gradient methods with optimality certificates and underestimate sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chenxin Ma, Majid Jahani, Martin Tak\\'a\\v{c}, Naga Venkata C. Gudapati, Rachael Tappenden","submitted_at":"2017-10-10T16:10:55Z","abstract_excerpt":"In this work we introduce the concept of an Underestimate Sequence (UES), which is motivated by Nesterov's estimate sequence. Our definition of a UES utilizes three sequences, one of which is a lower bound (or under-estimator) of the objective function. The question of how to construct an appropriate sequence of lower bounds is addressed, and we present lower bounds for strongly convex smooth functions and for strongly convex composite functions, which adhere to the UES framework. Further, we propose several first order methods for minimizing strongly convex functions in both the smooth and co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03695","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1710.03695/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.03695","created_at":"2026-07-05T02:14:50.750923+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03695v2","created_at":"2026-07-05T02:14:50.750923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03695","created_at":"2026-07-05T02:14:50.750923+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRP4Y5QVQEXI","created_at":"2026-07-05T02:14:50.750923+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRP4Y5QVQEXIBBUQ","created_at":"2026-07-05T02:14:50.750923+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRP4Y5QV","created_at":"2026-07-05T02:14:50.750923+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16970","citing_title":"Horospherically Convex Optimization on Hadamard Manifolds Part I: Analysis and Algorithms","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II","json":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II.json","graph_json":"https://pith.science/api/pith-number/TRP4Y5QVQEXIBBUQSW27L2K3II/graph.json","events_json":"https://pith.science/api/pith-number/TRP4Y5QVQEXIBBUQSW27L2K3II/events.json","paper":"https://pith.science/paper/TRP4Y5QV"},"agent_actions":{"view_html":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II","download_json":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II.json","view_paper":"https://pith.science/paper/TRP4Y5QV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03695&json=true","fetch_graph":"https://pith.science/api/pith-number/TRP4Y5QVQEXIBBUQSW27L2K3II/graph.json","fetch_events":"https://pith.science/api/pith-number/TRP4Y5QVQEXIBBUQSW27L2K3II/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II/action/storage_attestation","attest_author":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II/action/author_attestation","sign_citation":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II/action/citation_signature","submit_replication":"https://pith.science/pith/TRP4Y5QVQEXIBBUQSW27L2K3II/action/replication_record"}},"created_at":"2026-07-05T02:14:50.750923+00:00","updated_at":"2026-07-05T02:14:50.750923+00:00"}