{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5FOJLLMDDBSMC3DWDFRM2W5BZZ","short_pith_number":"pith:5FOJLLMD","canonical_record":{"source":{"id":"2505.21796","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-27T21:58:35Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"387c55cc8c67d0356b58549af0f426296eddcaf4b630fd3be3918c6d3f523741","abstract_canon_sha256":"d74e26c859c4440794f714dd320763daf26adb176e641e8e9adce98bcd191f30"},"schema_version":"1.0"},"canonical_sha256":"e95c95ad831864c16c761962cd5ba1ce79fbe22b37032da8d7275f59c6724286","source":{"kind":"arxiv","id":"2505.21796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21796","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21796v1","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21796","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"5FOJLLMDDBSM","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"5FOJLLMDDBSMC3DW","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"5FOJLLMD","created_at":"2026-07-05T11:11:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5FOJLLMDDBSMC3DWDFRM2W5BZZ","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21796","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-27T21:58:35Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"387c55cc8c67d0356b58549af0f426296eddcaf4b630fd3be3918c6d3f523741","abstract_canon_sha256":"d74e26c859c4440794f714dd320763daf26adb176e641e8e9adce98bcd191f30"},"schema_version":"1.0"},"canonical_sha256":"e95c95ad831864c16c761962cd5ba1ce79fbe22b37032da8d7275f59c6724286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:03.750648Z","signature_b64":"IjY2wb6/uf1JJ9ub1oNN9oN/cRueBqapyJ9/nnNpdyUqgVkZNdYLZOpgHbqOJ6YL4x6caqie19Ihcz+HXIhRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e95c95ad831864c16c761962cd5ba1ce79fbe22b37032da8d7275f59c6724286","last_reissued_at":"2026-07-05T11:11:03.750191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:03.750191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21796","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-05T11:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0QvSn9UFTX1J5BM8KY2LUZLXwnfZeBFy9hmTiW75fgwlMgYy04sBezC9Ig0utx7RI46pK/DlKApeU165o+QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:06:32.426040Z"},"content_sha256":"4464970cff5728080683d751ff642e7dd68f2fdc38523eb6d43812a43cf2a11d","schema_version":"1.0","event_id":"sha256:4464970cff5728080683d751ff642e7dd68f2fdc38523eb6d43812a43cf2a11d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5FOJLLMDDBSMC3DWDFRM2W5BZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"stat.ML","authors_text":"Martin Zubeldia, Sajad Khodadadian","submitted_at":"2025-05-27T21:58:35Z","abstract_excerpt":"Polyak-Ruppert averaging is a widely used technique to achieve the optimal asymptotic variance of stochastic approximation (SA) algorithms, yet its high-probability performance guarantees remain underexplored in general settings. In this paper, we present a general framework for establishing non-asymptotic concentration bounds for the error of averaged SA iterates. Our approach assumes access to individual concentration bounds for the unaveraged iterates and yields a sharp bound on the averaged iterates. We also construct an example, showing the tightness of our result up to constant multiplic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21796","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/2505.21796/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-05T11:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OJ6IbmKAHTob8C82/MRmM6vqs53+xMLQZgQZmQJD7u6QVsdOsvpzZY5QlUiR++R1czgL+m7fjrzedtNDaq6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:06:32.426534Z"},"content_sha256":"d532aad4458e694f1879e19bdc0f95762023716cd75258074def8e4dbe67f9d1","schema_version":"1.0","event_id":"sha256:d532aad4458e694f1879e19bdc0f95762023716cd75258074def8e4dbe67f9d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ/bundle.json","state_url":"https://pith.science/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ/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-08T03:06:32Z","links":{"resolver":"https://pith.science/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ","bundle":"https://pith.science/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ/bundle.json","state":"https://pith.science/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FOJLLMDDBSMC3DWDFRM2W5BZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5FOJLLMDDBSMC3DWDFRM2W5BZZ","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":"d74e26c859c4440794f714dd320763daf26adb176e641e8e9adce98bcd191f30","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-27T21:58:35Z","title_canon_sha256":"387c55cc8c67d0356b58549af0f426296eddcaf4b630fd3be3918c6d3f523741"},"schema_version":"1.0","source":{"id":"2505.21796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21796","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21796v1","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21796","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"5FOJLLMDDBSM","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_16","alias_value":"5FOJLLMDDBSMC3DW","created_at":"2026-07-05T11:11:03Z"},{"alias_kind":"pith_short_8","alias_value":"5FOJLLMD","created_at":"2026-07-05T11:11:03Z"}],"graph_snapshots":[{"event_id":"sha256:d532aad4458e694f1879e19bdc0f95762023716cd75258074def8e4dbe67f9d1","target":"graph","created_at":"2026-07-05T11:11:03Z","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/2505.21796/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Polyak-Ruppert averaging is a widely used technique to achieve the optimal asymptotic variance of stochastic approximation (SA) algorithms, yet its high-probability performance guarantees remain underexplored in general settings. In this paper, we present a general framework for establishing non-asymptotic concentration bounds for the error of averaged SA iterates. Our approach assumes access to individual concentration bounds for the unaveraged iterates and yields a sharp bound on the averaged iterates. We also construct an example, showing the tightness of our result up to constant multiplic","authors_text":"Martin Zubeldia, Sajad Khodadadian","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-27T21:58:35Z","title":"A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21796","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:4464970cff5728080683d751ff642e7dd68f2fdc38523eb6d43812a43cf2a11d","target":"record","created_at":"2026-07-05T11:11:03Z","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":"d74e26c859c4440794f714dd320763daf26adb176e641e8e9adce98bcd191f30","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-27T21:58:35Z","title_canon_sha256":"387c55cc8c67d0356b58549af0f426296eddcaf4b630fd3be3918c6d3f523741"},"schema_version":"1.0","source":{"id":"2505.21796","kind":"arxiv","version":1}},"canonical_sha256":"e95c95ad831864c16c761962cd5ba1ce79fbe22b37032da8d7275f59c6724286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e95c95ad831864c16c761962cd5ba1ce79fbe22b37032da8d7275f59c6724286","first_computed_at":"2026-07-05T11:11:03.750191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:03.750191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IjY2wb6/uf1JJ9ub1oNN9oN/cRueBqapyJ9/nnNpdyUqgVkZNdYLZOpgHbqOJ6YL4x6caqie19Ihcz+HXIhRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:03.750648Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4464970cff5728080683d751ff642e7dd68f2fdc38523eb6d43812a43cf2a11d","sha256:d532aad4458e694f1879e19bdc0f95762023716cd75258074def8e4dbe67f9d1"],"state_sha256":"6e16e1e990d34cdaa861bcc6a6f026f13258373ab4ed3ebd6d6c8bc9b6a46319"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QpQ/FsW4daIL6ylG1ImNarVLOFYLcCBAobZaVN8Za9vzN4g+F6yA/YgZbJnnsfn/oLer0rjvWpjr+UQG1ti4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T03:06:32.430018Z","bundle_sha256":"6bce736178514bb5c863a9a7cea0288ceb9f5027e4da075fb2cfa115f2d77f98"}}