{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E4JF2PAAPNHYAY2QFHNXJUAZGE","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":"fb228248f654ab76b3fac08d119fe28df476eedfae551ba851722e88ee346f81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-01T13:47:40Z","title_canon_sha256":"c62ffa817fdd22e75bf1c3eb9c4a5a608bf1fcfc66c7eef6eb8fde649220e607"},"schema_version":"1.0","source":{"id":"1905.00313","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00313","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00313v2","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00313","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"E4JF2PAAPNHY","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_16","alias_value":"E4JF2PAAPNHYAY2Q","created_at":"2026-07-05T04:45:08Z"},{"alias_kind":"pith_short_8","alias_value":"E4JF2PAA","created_at":"2026-07-05T04:45:08Z"}],"graph_snapshots":[{"event_id":"sha256:f0d79067a1c4a284640572292b799d8c69238200412b70997fca5618f7ea13bc","target":"graph","created_at":"2026-07-05T04:45:08Z","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/1905.00313/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper revisits the Polyak step size schedule for convex optimization problems, proving that a simple variant of it simultaneously attains near optimal convergence rates for the gradient descent algorithm, for all ranges of strong convexity, smoothness, and Lipschitz parameters, without a-priory knowledge of these parameters.","authors_text":"Elad Hazan, Sham Kakade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00313","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:c0ab127a4f8eeb16b1a4a779a4a11fb9f53f81c31c466af98e2d6189845c9aeb","target":"record","created_at":"2026-07-05T04:45:08Z","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":"fb228248f654ab76b3fac08d119fe28df476eedfae551ba851722e88ee346f81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-01T13:47:40Z","title_canon_sha256":"c62ffa817fdd22e75bf1c3eb9c4a5a608bf1fcfc66c7eef6eb8fde649220e607"},"schema_version":"1.0","source":{"id":"1905.00313","kind":"arxiv","version":2}},"canonical_sha256":"27125d3c007b4f80635029db74d019311f863a5c83c9eadaff6fa1d1cf24215a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27125d3c007b4f80635029db74d019311f863a5c83c9eadaff6fa1d1cf24215a","first_computed_at":"2026-07-05T04:45:08.476261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:45:08.476261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mZB+DzFGx2KAgDJfTquTHc1imqDj6+hD0VG5ixxupNAXomXR1I3LrUXxHNtjXEKxGryI8qr0HJ5fGevA0RiICA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:45:08.477053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00313","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0ab127a4f8eeb16b1a4a779a4a11fb9f53f81c31c466af98e2d6189845c9aeb","sha256:f0d79067a1c4a284640572292b799d8c69238200412b70997fca5618f7ea13bc"],"state_sha256":"1d0c5528d09ecc481d0d195aef4ca9621a980a5e3236b04ec870c86e2966bd78"}