{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RAUQVV4RHB64GBZJSN22PV45H7","short_pith_number":"pith:RAUQVV4R","canonical_record":{"source":{"id":"1503.06833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T21:00:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"29694278ff80b821f15dd180c6c13e153ef037234c04e95b2e01f24fe827c737","abstract_canon_sha256":"937f504e64bf8220d553297cd298f1cc633d9e2944994440a884cb904aeab76e"},"schema_version":"1.0"},"canonical_sha256":"88290ad791387dc307299375a7d79d3ffa34c0598fad1b2ca1b9347d3022cbb2","source":{"kind":"arxiv","id":"1503.06833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06833","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06833v1","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06833","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"RAUQVV4RHB64","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAUQVV4RHB64GBZJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAUQVV4R","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RAUQVV4RHB64GBZJSN22PV45H7","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T21:00:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"29694278ff80b821f15dd180c6c13e153ef037234c04e95b2e01f24fe827c737","abstract_canon_sha256":"937f504e64bf8220d553297cd298f1cc633d9e2944994440a884cb904aeab76e"},"schema_version":"1.0"},"canonical_sha256":"88290ad791387dc307299375a7d79d3ffa34c0598fad1b2ca1b9347d3022cbb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.955601Z","signature_b64":"sX590qbp5nDTgNK8pYZTp+PKNgkXj9PjwP03qUoSn7TodftUELeUFlp5lhmoRuMirjOX8DVBwAnd1Z2+fPjFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88290ad791387dc307299375a7d79d3ffa34c0598fad1b2ca1b9347d3022cbb2","last_reissued_at":"2026-05-18T02:20:29.955197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.955197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06833","source_version":1,"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-18T02:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jm9Hog2mUh6IEiqmlpPh0mOn4kOiwnc39E6jzh8VbjDZhN9hYVVHITEPcFiuw4F0e3lLnwXSgWu/NO2ZQkzoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:25:42.921392Z"},"content_sha256":"62cff9cc51b512ab968848b2249cb388006094f51ac5265c051073c63578a548","schema_version":"1.0","event_id":"sha256:62cff9cc51b512ab968848b2249cb388006094f51ac5265c051073c63578a548"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RAUQVV4RHB64GBZJSN22PV45H7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Ohad Shamir, Shai Shalev-Shwartz, Yossi Arjevani","submitted_at":"2015-03-23T21:00:18Z","abstract_excerpt":"We develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive application of linear operators. This, in turn, reveals a powerful connection between a class of optimization algorithms and the analytic theory of polynomials whereby new lower and upper bounds are derived. Whereas existing lower bounds for this setting are only valid when the dimensionality scales with the number of iterations, our lower bound holds in the natural regime where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06833","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"},"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-18T02:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/rCZ73adrApnd46iQL5oJkzUm19/pP6Zb5pchxizvik6gaEqZP7CeTIWfonWNa1Ki92HQAUGpr90S8+IFd8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:25:42.921978Z"},"content_sha256":"5e7298d6c5d588a60b7e68d9f9aff66ff8787d06e3c2c62af296a863eb1ea6d1","schema_version":"1.0","event_id":"sha256:5e7298d6c5d588a60b7e68d9f9aff66ff8787d06e3c2c62af296a863eb1ea6d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAUQVV4RHB64GBZJSN22PV45H7/bundle.json","state_url":"https://pith.science/pith/RAUQVV4RHB64GBZJSN22PV45H7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAUQVV4RHB64GBZJSN22PV45H7/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-05T03:25:42Z","links":{"resolver":"https://pith.science/pith/RAUQVV4RHB64GBZJSN22PV45H7","bundle":"https://pith.science/pith/RAUQVV4RHB64GBZJSN22PV45H7/bundle.json","state":"https://pith.science/pith/RAUQVV4RHB64GBZJSN22PV45H7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAUQVV4RHB64GBZJSN22PV45H7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RAUQVV4RHB64GBZJSN22PV45H7","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":"937f504e64bf8220d553297cd298f1cc633d9e2944994440a884cb904aeab76e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T21:00:18Z","title_canon_sha256":"29694278ff80b821f15dd180c6c13e153ef037234c04e95b2e01f24fe827c737"},"schema_version":"1.0","source":{"id":"1503.06833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06833","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06833v1","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06833","created_at":"2026-05-18T02:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"RAUQVV4RHB64","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAUQVV4RHB64GBZJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAUQVV4R","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5e7298d6c5d588a60b7e68d9f9aff66ff8787d06e3c2c62af296a863eb1ea6d1","target":"graph","created_at":"2026-05-18T02:20:29Z","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":"We develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive application of linear operators. This, in turn, reveals a powerful connection between a class of optimization algorithms and the analytic theory of polynomials whereby new lower and upper bounds are derived. Whereas existing lower bounds for this setting are only valid when the dimensionality scales with the number of iterations, our lower bound holds in the natural regime where","authors_text":"Ohad Shamir, Shai Shalev-Shwartz, Yossi Arjevani","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T21:00:18Z","title":"On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06833","kind":"arxiv","version":1},"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:62cff9cc51b512ab968848b2249cb388006094f51ac5265c051073c63578a548","target":"record","created_at":"2026-05-18T02:20:29Z","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":"937f504e64bf8220d553297cd298f1cc633d9e2944994440a884cb904aeab76e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-23T21:00:18Z","title_canon_sha256":"29694278ff80b821f15dd180c6c13e153ef037234c04e95b2e01f24fe827c737"},"schema_version":"1.0","source":{"id":"1503.06833","kind":"arxiv","version":1}},"canonical_sha256":"88290ad791387dc307299375a7d79d3ffa34c0598fad1b2ca1b9347d3022cbb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88290ad791387dc307299375a7d79d3ffa34c0598fad1b2ca1b9347d3022cbb2","first_computed_at":"2026-05-18T02:20:29.955197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:29.955197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sX590qbp5nDTgNK8pYZTp+PKNgkXj9PjwP03qUoSn7TodftUELeUFlp5lhmoRuMirjOX8DVBwAnd1Z2+fPjFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:29.955601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62cff9cc51b512ab968848b2249cb388006094f51ac5265c051073c63578a548","sha256:5e7298d6c5d588a60b7e68d9f9aff66ff8787d06e3c2c62af296a863eb1ea6d1"],"state_sha256":"163cb8ff9e4e85253e57491b6d3a914c9840b7196a064f16e797ee0d930e70dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouf7gaHGsgYkziXv4IevQGjPJKwMMsTtHbkM2GPoYqrgzQ3QyW6+Z28KV/lWbHcgkf41FNnPu5AlrHHpTuqPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:25:42.925242Z","bundle_sha256":"d1ff7feb9caac531a37906b7e8af9efa9b495fc9453a3db12990e6d391c7abc8"}}