{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LYX3F5RGU2333ZBUXWUJQFAV3J","short_pith_number":"pith:LYX3F5RG","canonical_record":{"source":{"id":"1511.02974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-10T02:51:19Z","cross_cats_sorted":[],"title_canon_sha256":"8010e3d4823425abde2447c6cdc468b6525c482c32c531788eee62f9c05c6cf9","abstract_canon_sha256":"5a027ec391249b95bc31210ea425be2226c7f93ab409f2c2fa62ac4f70bba267"},"schema_version":"1.0"},"canonical_sha256":"5e2fb2f626a6b7bde434bda8981415da64e8a94355ecb8f29ae6a0841926d9a2","source":{"kind":"arxiv","id":"1511.02974","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02974","created_at":"2026-05-18T00:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02974v2","created_at":"2026-05-18T00:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02974","created_at":"2026-05-18T00:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"LYX3F5RGU233","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LYX3F5RGU2333ZBU","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LYX3F5RG","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LYX3F5RGU2333ZBUXWUJQFAV3J","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-10T02:51:19Z","cross_cats_sorted":[],"title_canon_sha256":"8010e3d4823425abde2447c6cdc468b6525c482c32c531788eee62f9c05c6cf9","abstract_canon_sha256":"5a027ec391249b95bc31210ea425be2226c7f93ab409f2c2fa62ac4f70bba267"},"schema_version":"1.0"},"canonical_sha256":"5e2fb2f626a6b7bde434bda8981415da64e8a94355ecb8f29ae6a0841926d9a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:49.170613Z","signature_b64":"ug68SsMhdj7xt8XxKF8GOMfju9eSZGUeVckYTDtoMb5TWzc4P5jWf9R9XxHlcHXD0ROgXvoxzjvmyGrDRfR6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e2fb2f626a6b7bde434bda8981415da64e8a94355ecb8f29ae6a0841926d9a2","last_reissued_at":"2026-05-18T00:59:49.170050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:49.170050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02974","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:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5nx7gQLX1SOuMprDwB7Dtm2seOVBPaIpmLdWo+aoqUxJmqmKx21NIBmlhkIFK25a4eFmyANRfEmml2LAWs7FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:43:13.758727Z"},"content_sha256":"2b0e1d9b2aec870f6eec3bfce2f21d7c87a45e42d60e5ef11bd2bc348ddbeff8","schema_version":"1.0","event_id":"sha256:2b0e1d9b2aec870f6eec3bfce2f21d7c87a45e42d60e5ef11bd2bc348ddbeff8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LYX3F5RGU2333ZBUXWUJQFAV3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Robert M. Freund","submitted_at":"2015-11-10T02:51:19Z","abstract_excerpt":"Motivated by recent work of Renegar, we present new computational methods and associated computational guarantees for solving convex optimization problems using first-order methods. Our problem of interest is the general convex optimization problem $f^* = \\min_{x \\in Q} f(x)$, where we presume knowledge of a strict lower bound $f_{\\mathrm{slb}} < f^*$. [Indeed, $f_{\\mathrm{slb}}$ is naturally known when optimizing many loss functions in statistics and machine learning (least-squares, logistic loss, exponential loss, total variation loss, etc.) as well as in Renegar's transformed version of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02974","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:59:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZF1gcy1kivWfeDrKRdYJ3E+2Ep4ku3oylXEe517evU0fNLehcfqOlN9mCaQSEsOhAJoAQ3r4hCQm0gMZG+WSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:43:13.759376Z"},"content_sha256":"cf9991c42b49d99b3867593e14661cadfb61a9aaf7083014bab9019e7ade600c","schema_version":"1.0","event_id":"sha256:cf9991c42b49d99b3867593e14661cadfb61a9aaf7083014bab9019e7ade600c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYX3F5RGU2333ZBUXWUJQFAV3J/bundle.json","state_url":"https://pith.science/pith/LYX3F5RGU2333ZBUXWUJQFAV3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYX3F5RGU2333ZBUXWUJQFAV3J/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-12T05:43:13Z","links":{"resolver":"https://pith.science/pith/LYX3F5RGU2333ZBUXWUJQFAV3J","bundle":"https://pith.science/pith/LYX3F5RGU2333ZBUXWUJQFAV3J/bundle.json","state":"https://pith.science/pith/LYX3F5RGU2333ZBUXWUJQFAV3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYX3F5RGU2333ZBUXWUJQFAV3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LYX3F5RGU2333ZBUXWUJQFAV3J","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":"5a027ec391249b95bc31210ea425be2226c7f93ab409f2c2fa62ac4f70bba267","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-10T02:51:19Z","title_canon_sha256":"8010e3d4823425abde2447c6cdc468b6525c482c32c531788eee62f9c05c6cf9"},"schema_version":"1.0","source":{"id":"1511.02974","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02974","created_at":"2026-05-18T00:59:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02974v2","created_at":"2026-05-18T00:59:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02974","created_at":"2026-05-18T00:59:49Z"},{"alias_kind":"pith_short_12","alias_value":"LYX3F5RGU233","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LYX3F5RGU2333ZBU","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LYX3F5RG","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:cf9991c42b49d99b3867593e14661cadfb61a9aaf7083014bab9019e7ade600c","target":"graph","created_at":"2026-05-18T00:59:49Z","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":"Motivated by recent work of Renegar, we present new computational methods and associated computational guarantees for solving convex optimization problems using first-order methods. Our problem of interest is the general convex optimization problem $f^* = \\min_{x \\in Q} f(x)$, where we presume knowledge of a strict lower bound $f_{\\mathrm{slb}} < f^*$. [Indeed, $f_{\\mathrm{slb}}$ is naturally known when optimizing many loss functions in statistics and machine learning (least-squares, logistic loss, exponential loss, total variation loss, etc.) as well as in Renegar's transformed version of the","authors_text":"Haihao Lu, Robert M. Freund","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-10T02:51:19Z","title":"New Computational Guarantees for Solving Convex Optimization Problems with First Order Methods, via a Function Growth Condition Measure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02974","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:2b0e1d9b2aec870f6eec3bfce2f21d7c87a45e42d60e5ef11bd2bc348ddbeff8","target":"record","created_at":"2026-05-18T00:59:49Z","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":"5a027ec391249b95bc31210ea425be2226c7f93ab409f2c2fa62ac4f70bba267","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-10T02:51:19Z","title_canon_sha256":"8010e3d4823425abde2447c6cdc468b6525c482c32c531788eee62f9c05c6cf9"},"schema_version":"1.0","source":{"id":"1511.02974","kind":"arxiv","version":2}},"canonical_sha256":"5e2fb2f626a6b7bde434bda8981415da64e8a94355ecb8f29ae6a0841926d9a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e2fb2f626a6b7bde434bda8981415da64e8a94355ecb8f29ae6a0841926d9a2","first_computed_at":"2026-05-18T00:59:49.170050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:49.170050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ug68SsMhdj7xt8XxKF8GOMfju9eSZGUeVckYTDtoMb5TWzc4P5jWf9R9XxHlcHXD0ROgXvoxzjvmyGrDRfR6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:49.170613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02974","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b0e1d9b2aec870f6eec3bfce2f21d7c87a45e42d60e5ef11bd2bc348ddbeff8","sha256:cf9991c42b49d99b3867593e14661cadfb61a9aaf7083014bab9019e7ade600c"],"state_sha256":"92986e080c3b59ef66aceb159b9813045c097da9bfcca4aebc4b696f5bb81427"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BdBYmIXmgQMDuLxRxI5ewXdbJhjlFeNLqOddk0CBAl3sBIi2hNGiUEi2B7ciSGMcMzBT9fgH3X4S18mG4kU/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:43:13.762610Z","bundle_sha256":"e792bca8cbb3bf3ae43ddc6faf84e9f170a4fb1236fd4de3a83c8ea3809bbce0"}}