{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S5U3EE5HEMUUEJRRAJTJNKERZ4","short_pith_number":"pith:S5U3EE5H","canonical_record":{"source":{"id":"1909.00843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"39b22bff3a4219a6f75576d686f133fc2378fdf4062d07411527fb35538ff41d","abstract_canon_sha256":"4fd092f3bc7d2a783822d8b4b3a53b4b0526bebf3b16fe94d2fa967d85931856"},"schema_version":"1.0"},"canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","source":{"kind":"arxiv","id":"1909.00843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00843","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00843v1","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00843","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"S5U3EE5HEMUU","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_16","alias_value":"S5U3EE5HEMUUEJRR","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_8","alias_value":"S5U3EE5H","created_at":"2026-07-05T00:01:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S5U3EE5HEMUUEJRRAJTJNKERZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1909.00843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"39b22bff3a4219a6f75576d686f133fc2378fdf4062d07411527fb35538ff41d","abstract_canon_sha256":"4fd092f3bc7d2a783822d8b4b3a53b4b0526bebf3b16fe94d2fa967d85931856"},"schema_version":"1.0"},"canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:13.261715Z","signature_b64":"s3MaKkML+UioQbNh/cUbv/FNrk4tPJLYv/c8vX1fbQKozBv/vTw1c8mIqDgWe08B8Inok/aO/Vwce6soiT9QBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","last_reissued_at":"2026-07-05T00:01:13.261348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:13.261348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.00843","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-07-05T00:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHoTUurqMltdHxiwMrtIYnFbJZ7C9PPzKIEs2fFh8m8T7XJ4MYvWCFjHUZMYwERmwpwPd6ZP1CH4z9thZVL0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T21:43:29.380127Z"},"content_sha256":"22f786936d3c91b92e7ac571a660766551173da71618803e529cc9498d15e6df","schema_version":"1.0","event_id":"sha256:22f786936d3c91b92e7ac571a660766551173da71618803e529cc9498d15e6df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S5U3EE5HEMUUEJRRAJTJNKERZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christopher Liaw, Nicholas J. A. Harvey, Sikander Randhawa","submitted_at":"2019-09-02T19:47:47Z","abstract_excerpt":"We consider stochastic gradient descent algorithms for minimizing a non-smooth, strongly-convex function. Several forms of this algorithm, including suffix averaging, are known to achieve the optimal $O(1/T)$ convergence rate in expectation. We consider a simple, non-uniform averaging strategy of Lacoste-Julien et al. (2011) and prove that it achieves the optimal $O(1/T)$ convergence rate with high probability. Our proof uses a recently developed generalization of Freedman's inequality. Finally, we compare several of these algorithms experimentally and show that this non-uniform averaging stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00843","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00843/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"},"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-07-05T00:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6mooFgdJKn1Yi8nm0F3GdEmCy5bLI62JV+ZyyZG+KJlDknQ0AM02zhByNXdjVX+fpElsZTbemj8X1E7QTe1zAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T21:43:29.380660Z"},"content_sha256":"8af37a54bddfc931e46c1d5dc7f813f49e4638976cac26849a7af047e20c29cb","schema_version":"1.0","event_id":"sha256:8af37a54bddfc931e46c1d5dc7f813f49e4638976cac26849a7af047e20c29cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4/bundle.json","state_url":"https://pith.science/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4/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-08-09T21:43:29Z","links":{"resolver":"https://pith.science/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4","bundle":"https://pith.science/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4/bundle.json","state":"https://pith.science/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5U3EE5HEMUUEJRRAJTJNKERZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S5U3EE5HEMUUEJRRAJTJNKERZ4","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":"4fd092f3bc7d2a783822d8b4b3a53b4b0526bebf3b16fe94d2fa967d85931856","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","title_canon_sha256":"39b22bff3a4219a6f75576d686f133fc2378fdf4062d07411527fb35538ff41d"},"schema_version":"1.0","source":{"id":"1909.00843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00843","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00843v1","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00843","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"S5U3EE5HEMUU","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_16","alias_value":"S5U3EE5HEMUUEJRR","created_at":"2026-07-05T00:01:13Z"},{"alias_kind":"pith_short_8","alias_value":"S5U3EE5H","created_at":"2026-07-05T00:01:13Z"}],"graph_snapshots":[{"event_id":"sha256:8af37a54bddfc931e46c1d5dc7f813f49e4638976cac26849a7af047e20c29cb","target":"graph","created_at":"2026-07-05T00:01:13Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.00843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider stochastic gradient descent algorithms for minimizing a non-smooth, strongly-convex function. Several forms of this algorithm, including suffix averaging, are known to achieve the optimal $O(1/T)$ convergence rate in expectation. We consider a simple, non-uniform averaging strategy of Lacoste-Julien et al. (2011) and prove that it achieves the optimal $O(1/T)$ convergence rate with high probability. Our proof uses a recently developed generalization of Freedman's inequality. Finally, we compare several of these algorithms experimentally and show that this non-uniform averaging stra","authors_text":"Christopher Liaw, Nicholas J. A. Harvey, Sikander Randhawa","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00843","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:22f786936d3c91b92e7ac571a660766551173da71618803e529cc9498d15e6df","target":"record","created_at":"2026-07-05T00:01:13Z","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":"4fd092f3bc7d2a783822d8b4b3a53b4b0526bebf3b16fe94d2fa967d85931856","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-02T19:47:47Z","title_canon_sha256":"39b22bff3a4219a6f75576d686f133fc2378fdf4062d07411527fb35538ff41d"},"schema_version":"1.0","source":{"id":"1909.00843","kind":"arxiv","version":1}},"canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9769b213a72329422631026696a891cf3d0b3a5a151f9c3b31390fcc60dddb4e","first_computed_at":"2026-07-05T00:01:13.261348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:13.261348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s3MaKkML+UioQbNh/cUbv/FNrk4tPJLYv/c8vX1fbQKozBv/vTw1c8mIqDgWe08B8Inok/aO/Vwce6soiT9QBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:13.261715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22f786936d3c91b92e7ac571a660766551173da71618803e529cc9498d15e6df","sha256:8af37a54bddfc931e46c1d5dc7f813f49e4638976cac26849a7af047e20c29cb"],"state_sha256":"b2396ce8765932f79660587ec2c9d0db5678abb471c4b17ef922c41c8b53da42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhm75qEET4d8btEK6RU0/kARSdj4cuaTOn3vaN1hMNnnf3HS5ZBSKeLCX9i+0oBonV6IXJVbQppcIuRzlJuTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T21:43:29.386655Z","bundle_sha256":"2480d1c64cd4b40452aa4086ff9a2e683aeb40c745f02eb18b5b2005df179429"}}