{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SOIOTEWTKWAKQRXZ6Z5GWFZOJ2","short_pith_number":"pith:SOIOTEWT","canonical_record":{"source":{"id":"1907.09547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T19:52:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ab78dce09c778246b7cc49f6e1f6958f5414302b5fc757756d07d5597d2b3628","abstract_canon_sha256":"b10c1cff10b4327f245b13c56d0dafd6274462a165077c8cdf259a9e4ae26301"},"schema_version":"1.0"},"canonical_sha256":"9390e992d35580a846f9f67a6b172e4eb2a23e3baedcea3ef1c88853c7d8f82a","source":{"kind":"arxiv","id":"1907.09547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09547","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09547v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09547","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"SOIOTEWTKWAK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SOIOTEWTKWAKQRXZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SOIOTEWT","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SOIOTEWTKWAKQRXZ6Z5GWFZOJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T19:52:11Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ab78dce09c778246b7cc49f6e1f6958f5414302b5fc757756d07d5597d2b3628","abstract_canon_sha256":"b10c1cff10b4327f245b13c56d0dafd6274462a165077c8cdf259a9e4ae26301"},"schema_version":"1.0"},"canonical_sha256":"9390e992d35580a846f9f67a6b172e4eb2a23e3baedcea3ef1c88853c7d8f82a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:52.940985Z","signature_b64":"xeFwFzI4e3Qgl6hqeg8iIMTHeUEdYqKqWqjtFB4hSTKCtVRXqNGBC8tO4hESQIGJuFcMeqkfvtygtk8JNAoeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9390e992d35580a846f9f67a6b172e4eb2a23e3baedcea3ef1c88853c7d8f82a","last_reissued_at":"2026-05-17T23:39:52.940501Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:52.940501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09547","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-17T23:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+y0UDqGvmcsahrlqsvewyOQ4wED7K0GiIIp0u08zPWAkJjQk/QZX51aewL3zBGftqqBLlGYASU5RPziRqN3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:22:20.836055Z"},"content_sha256":"91674e5d68a4d3b1b96797c0a67904cee4ddb5cd92f01d3739f9ea4a137d62ef","schema_version":"1.0","event_id":"sha256:91674e5d68a4d3b1b96797c0a67904cee4ddb5cd92f01d3739f9ea4a137d62ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SOIOTEWTKWAKQRXZ6Z5GWFZOJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Damek Davis, Dmitriy Drusvyatskiy, Vasileios Charisopoulos","submitted_at":"2019-07-22T19:52:11Z","abstract_excerpt":"Stochastic (sub)gradient methods require step size schedule tuning to perform well in practice. Classical tuning strategies decay the step size polynomially and lead to optimal sublinear rates on (strongly) convex problems. An alternative schedule, popular in nonconvex optimization, is called \\emph{geometric step decay} and proceeds by halving the step size after every few epochs. In recent work, geometric step decay was shown to improve exponentially upon classical sublinear rates for the class of \\emph{sharp} convex functions. In this work, we ask whether geometric step decay similarly impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09547","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-17T23:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8DO0ViJEBVf4sGbCVR7o0MUq01w6MHPqRVoFsBisVJptsXEi+GOKV0Np96RNYqaTeqJcQ0ms+29YKXeJGC7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:22:20.836631Z"},"content_sha256":"2949fa75b335270f93b30b567d5b5d93e10ad538e6006162621720b6602dca87","schema_version":"1.0","event_id":"sha256:2949fa75b335270f93b30b567d5b5d93e10ad538e6006162621720b6602dca87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2/bundle.json","state_url":"https://pith.science/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2/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-07T05:22:20Z","links":{"resolver":"https://pith.science/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2","bundle":"https://pith.science/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2/bundle.json","state":"https://pith.science/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOIOTEWTKWAKQRXZ6Z5GWFZOJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SOIOTEWTKWAKQRXZ6Z5GWFZOJ2","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":"b10c1cff10b4327f245b13c56d0dafd6274462a165077c8cdf259a9e4ae26301","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T19:52:11Z","title_canon_sha256":"ab78dce09c778246b7cc49f6e1f6958f5414302b5fc757756d07d5597d2b3628"},"schema_version":"1.0","source":{"id":"1907.09547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09547","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09547v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09547","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"SOIOTEWTKWAK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SOIOTEWTKWAKQRXZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SOIOTEWT","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2949fa75b335270f93b30b567d5b5d93e10ad538e6006162621720b6602dca87","target":"graph","created_at":"2026-05-17T23:39:52Z","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":"Stochastic (sub)gradient methods require step size schedule tuning to perform well in practice. Classical tuning strategies decay the step size polynomially and lead to optimal sublinear rates on (strongly) convex problems. An alternative schedule, popular in nonconvex optimization, is called \\emph{geometric step decay} and proceeds by halving the step size after every few epochs. In recent work, geometric step decay was shown to improve exponentially upon classical sublinear rates for the class of \\emph{sharp} convex functions. In this work, we ask whether geometric step decay similarly impro","authors_text":"Damek Davis, Dmitriy Drusvyatskiy, Vasileios Charisopoulos","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T19:52:11Z","title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09547","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:91674e5d68a4d3b1b96797c0a67904cee4ddb5cd92f01d3739f9ea4a137d62ef","target":"record","created_at":"2026-05-17T23:39:52Z","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":"b10c1cff10b4327f245b13c56d0dafd6274462a165077c8cdf259a9e4ae26301","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-22T19:52:11Z","title_canon_sha256":"ab78dce09c778246b7cc49f6e1f6958f5414302b5fc757756d07d5597d2b3628"},"schema_version":"1.0","source":{"id":"1907.09547","kind":"arxiv","version":1}},"canonical_sha256":"9390e992d35580a846f9f67a6b172e4eb2a23e3baedcea3ef1c88853c7d8f82a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9390e992d35580a846f9f67a6b172e4eb2a23e3baedcea3ef1c88853c7d8f82a","first_computed_at":"2026-05-17T23:39:52.940501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:52.940501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xeFwFzI4e3Qgl6hqeg8iIMTHeUEdYqKqWqjtFB4hSTKCtVRXqNGBC8tO4hESQIGJuFcMeqkfvtygtk8JNAoeBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:52.940985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91674e5d68a4d3b1b96797c0a67904cee4ddb5cd92f01d3739f9ea4a137d62ef","sha256:2949fa75b335270f93b30b567d5b5d93e10ad538e6006162621720b6602dca87"],"state_sha256":"ae9709d7b84850c1ee8f41150ca1c4ed70c9ef039bb40365374e08fad365e71a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTsPSwCfsCT6Ub0rVnNeg9W7GoojDT/D2tHYWeOvy+1Wkb2A78UXeXV4W6MqYgi9yMGJK3G/E9vv6p/OZEDYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:22:20.839745Z","bundle_sha256":"85563971cc1d1f7e2315e368da8763c5f19200d4d78c8946a86d487ec30a1d2b"}}