{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E4JF2PAAPNHYAY2QFHNXJUAZGE","short_pith_number":"pith:E4JF2PAA","canonical_record":{"source":{"id":"1905.00313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-01T13:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"c62ffa817fdd22e75bf1c3eb9c4a5a608bf1fcfc66c7eef6eb8fde649220e607","abstract_canon_sha256":"fb228248f654ab76b3fac08d119fe28df476eedfae551ba851722e88ee346f81"},"schema_version":"1.0"},"canonical_sha256":"27125d3c007b4f80635029db74d019311f863a5c83c9eadaff6fa1d1cf24215a","source":{"kind":"arxiv","id":"1905.00313","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E4JF2PAAPNHYAY2QFHNXJUAZGE","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-01T13:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"c62ffa817fdd22e75bf1c3eb9c4a5a608bf1fcfc66c7eef6eb8fde649220e607","abstract_canon_sha256":"fb228248f654ab76b3fac08d119fe28df476eedfae551ba851722e88ee346f81"},"schema_version":"1.0"},"canonical_sha256":"27125d3c007b4f80635029db74d019311f863a5c83c9eadaff6fa1d1cf24215a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:45:08.477053Z","signature_b64":"mZB+DzFGx2KAgDJfTquTHc1imqDj6+hD0VG5ixxupNAXomXR1I3LrUXxHNtjXEKxGryI8qr0HJ5fGevA0RiICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27125d3c007b4f80635029db74d019311f863a5c83c9eadaff6fa1d1cf24215a","last_reissued_at":"2026-07-05T04:45:08.476261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:45:08.476261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00313","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-07-05T04:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbbiYYaPy8HnYCEhQLuixuI+fum53+Zqp2Qjof1LdxgjLooAZNaaLniAJiQdLSx7YWOqox9j0wtBZiFPB53DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:53:28.470881Z"},"content_sha256":"c0ab127a4f8eeb16b1a4a779a4a11fb9f53f81c31c466af98e2d6189845c9aeb","schema_version":"1.0","event_id":"sha256:c0ab127a4f8eeb16b1a4a779a4a11fb9f53f81c31c466af98e2d6189845c9aeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E4JF2PAAPNHYAY2QFHNXJUAZGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting the Polyak step size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elad Hazan, Sham Kakade","submitted_at":"2019-05-01T13:47:40Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00313","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.00313/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-05T04:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3FE99T5CGaKkMyaCiie9zgRUzMk446LdNW2ey/cEAtbHnSWhLFqG48QZa9yUUnq7Bw1pR9lpz+sW+qiiMd9gCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:53:28.471380Z"},"content_sha256":"f0d79067a1c4a284640572292b799d8c69238200412b70997fca5618f7ea13bc","schema_version":"1.0","event_id":"sha256:f0d79067a1c4a284640572292b799d8c69238200412b70997fca5618f7ea13bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE/bundle.json","state_url":"https://pith.science/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE/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-04T04:53:28Z","links":{"resolver":"https://pith.science/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE","bundle":"https://pith.science/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE/bundle.json","state":"https://pith.science/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4JF2PAAPNHYAY2QFHNXJUAZGE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnKGJQT91AKeihQnE3fbppzm5GCIm7SyAB9ujh8+P9AFjWH7qINTndRXSkH+KqbMaw7qKpq8tPobzEAdd1B2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:53:28.475414Z","bundle_sha256":"137e8dffbdca7de40f32bdffd0595303ce8d4afd284acdeb7081645e99163c8d"}}