{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CXMMQMYBFLXM3CCALF4GHVQIIZ","short_pith_number":"pith:CXMMQMYB","canonical_record":{"source":{"id":"1303.4645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T16:03:17Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"e937a49ad1343896ca18962481afd53b40e547f408ea3747831a4ec03d70b603","abstract_canon_sha256":"0999f9ed04c8de3c6768db56504f65dc65fc2b75017a0d5f8f287eb8ba0d56d4"},"schema_version":"1.0"},"canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","source":{"kind":"arxiv","id":"1303.4645","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4645","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4645v2","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4645","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"CXMMQMYBFLXM","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CXMMQMYBFLXM3CCA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CXMMQMYB","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CXMMQMYBFLXM3CCALF4GHVQIIZ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T16:03:17Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"e937a49ad1343896ca18962481afd53b40e547f408ea3747831a4ec03d70b603","abstract_canon_sha256":"0999f9ed04c8de3c6768db56504f65dc65fc2b75017a0d5f8f287eb8ba0d56d4"},"schema_version":"1.0"},"canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:58.049414Z","signature_b64":"SRhs4J7FJHklxrI597eRrDX68Ss5pNVguindCFpC7zICEbZUo1Dh4H8eFp5aC+RC17u1HSUqp+0f70/WS3XgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","last_reissued_at":"2026-05-18T03:13:58.048870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:58.048870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4645","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-18T03:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lA+AcUbagNuUnqfF9RM1SPpvtAGgY/NvxfP82OSPeqdLP0WTlldz0toyp3qZE1n3XwCXkAnXxeCH6sZ/+r6nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:49:52.729118Z"},"content_sha256":"ca88e412168b1944dc0cf0722b93706b3eb8e1f1502883eb4fdba728c25e1056","schema_version":"1.0","event_id":"sha256:ca88e412168b1944dc0cf0722b93706b3eb8e1f1502883eb4fdba728c25e1056"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CXMMQMYBFLXM3CCALF4GHVQIIZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient methods for convex minimization: better rates under weaker conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Hui Zhang, Wotao Yin","submitted_at":"2013-03-19T16:03:17Z","abstract_excerpt":"The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker than the commonly accepted ones. We relax the common gradient Lipschitz-continuity condition and strong convexity condition to ones that hold only over certain line segments. Specifically, we establish complexities $O(\\frac{R}{\\epsilon})$ and $O(\\sqrt{\\frac{R}{\\epsilon}})$ for the ordinary and accelerate gradient methods, respectively, assuming that $\\nabla f$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4645","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-18T03:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeoKtU2DifKEkjvHVONSRG5bc8NC6ZOihpLkn3JCM9mJ/PjBUMj/aEl+QdlYxiwIAgrl7dQvkDmH6WXp4aKwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:49:52.729819Z"},"content_sha256":"04221213b96918c9197f2ab583d70c67947ed5ad9ac5ed2dcee62fdc3491296b","schema_version":"1.0","event_id":"sha256:04221213b96918c9197f2ab583d70c67947ed5ad9ac5ed2dcee62fdc3491296b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/bundle.json","state_url":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/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-05-27T03:49:52Z","links":{"resolver":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ","bundle":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/bundle.json","state":"https://pith.science/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXMMQMYBFLXM3CCALF4GHVQIIZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CXMMQMYBFLXM3CCALF4GHVQIIZ","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":"0999f9ed04c8de3c6768db56504f65dc65fc2b75017a0d5f8f287eb8ba0d56d4","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T16:03:17Z","title_canon_sha256":"e937a49ad1343896ca18962481afd53b40e547f408ea3747831a4ec03d70b603"},"schema_version":"1.0","source":{"id":"1303.4645","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4645","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4645v2","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4645","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"CXMMQMYBFLXM","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CXMMQMYBFLXM3CCA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CXMMQMYB","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:04221213b96918c9197f2ab583d70c67947ed5ad9ac5ed2dcee62fdc3491296b","target":"graph","created_at":"2026-05-18T03:13:58Z","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":"The convergence behavior of gradient methods for minimizing convex differentiable functions is one of the core questions in convex optimization. This paper shows that their well-known complexities can be achieved under conditions weaker than the commonly accepted ones. We relax the common gradient Lipschitz-continuity condition and strong convexity condition to ones that hold only over certain line segments. Specifically, we establish complexities $O(\\frac{R}{\\epsilon})$ and $O(\\sqrt{\\frac{R}{\\epsilon}})$ for the ordinary and accelerate gradient methods, respectively, assuming that $\\nabla f$ ","authors_text":"Hui Zhang, Wotao Yin","cross_cats":["cs.IT","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T16:03:17Z","title":"Gradient methods for convex minimization: better rates under weaker conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4645","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:ca88e412168b1944dc0cf0722b93706b3eb8e1f1502883eb4fdba728c25e1056","target":"record","created_at":"2026-05-18T03:13:58Z","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":"0999f9ed04c8de3c6768db56504f65dc65fc2b75017a0d5f8f287eb8ba0d56d4","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T16:03:17Z","title_canon_sha256":"e937a49ad1343896ca18962481afd53b40e547f408ea3747831a4ec03d70b603"},"schema_version":"1.0","source":{"id":"1303.4645","kind":"arxiv","version":2}},"canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15d8c833012aeecd8840597863d6084655a29e1b0978663888e47022dc8d81eb","first_computed_at":"2026-05-18T03:13:58.048870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:58.048870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SRhs4J7FJHklxrI597eRrDX68Ss5pNVguindCFpC7zICEbZUo1Dh4H8eFp5aC+RC17u1HSUqp+0f70/WS3XgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:58.049414Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4645","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca88e412168b1944dc0cf0722b93706b3eb8e1f1502883eb4fdba728c25e1056","sha256:04221213b96918c9197f2ab583d70c67947ed5ad9ac5ed2dcee62fdc3491296b"],"state_sha256":"749f08775fd11cd3adaa621033e77d594d6acbcd12ad618502bfa834e255bc22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QE4TohWQf7oRan479Ck5nz0pzvUG+8WnR5mFb4NJvs1jovTkTdfGrDSrOB0dzH1ey1RLzyK4x7t8dReHikBxAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:49:52.732643Z","bundle_sha256":"28cf3ede713d5593bdd306e779373289bb1a7185f379c9fb545c6763af434dcf"}}