{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HM66DB53PHQG2NUDXTCGOUJBPE","short_pith_number":"pith:HM66DB53","canonical_record":{"source":{"id":"2606.03953","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T17:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"300111cee7c2c6af63f4bab93c7367442e59983ef7cad66dbd751c246e5ae607","abstract_canon_sha256":"eda477e5d74f7ce9e9d2981d6f90e3fba3986ee513a3a005b151dece40049499"},"schema_version":"1.0"},"canonical_sha256":"3b3de187bb79e06d3683bcc46751217916b819fb0276350db1fc6f838f205e95","source":{"kind":"arxiv","id":"2606.03953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03953","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03953v1","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03953","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"HM66DB53PHQG","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_16","alias_value":"HM66DB53PHQG2NUD","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_8","alias_value":"HM66DB53","created_at":"2026-06-03T02:06:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HM66DB53PHQG2NUDXTCGOUJBPE","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03953","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T17:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"300111cee7c2c6af63f4bab93c7367442e59983ef7cad66dbd751c246e5ae607","abstract_canon_sha256":"eda477e5d74f7ce9e9d2981d6f90e3fba3986ee513a3a005b151dece40049499"},"schema_version":"1.0"},"canonical_sha256":"3b3de187bb79e06d3683bcc46751217916b819fb0276350db1fc6f838f205e95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:06:07.842204Z","signature_b64":"lz75qilO6vur1af6cGYdRowxEz4Na6U9vSfiCwkNnP5B3dfdF4hD00//SPx8JwntSxyWTSd9zxkzY15jV44hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3de187bb79e06d3683bcc46751217916b819fb0276350db1fc6f838f205e95","last_reissued_at":"2026-06-03T02:06:07.841816Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:06:07.841816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03953","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-06-03T02:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Riy9PQwzSko2Offv/B/qNfynU9zD2zNIh8FeinK9YcX3P768jmcvRj6ecXc+iaj01lA3ML4faHDrRk4QgvcbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:38:10.151643Z"},"content_sha256":"a4ca53d296330e1efd22ead0a01c518ac00ff9237aafaa6a69d763fcd8520cfb","schema_version":"1.0","event_id":"sha256:a4ca53d296330e1efd22ead0a01c518ac00ff9237aafaa6a69d763fcd8520cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HM66DB53PHQG2NUDXTCGOUJBPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Introduction to stochastic gradient methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Simon Weissmann","submitted_at":"2026-06-02T17:40:46Z","abstract_excerpt":"These lecture notes provide an introduction to first-order optimization methods with a particular emphasis on stochastic gradient methods. We begin with deterministic gradient based methods for unconstrained optimization and study their convergence under standard assumptions such as smoothness, convexity, strong convexity, and the Polyak-Lojasiewicz condition. We then turn to stochastic approximation and stochastic gradient descent, motivated by empirical and expected risk minimization in machine learning. The main focus is on convergence theory: we discuss almost sure convergence and converge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03953","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/2606.03953/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-06-03T02:06:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4032KuHyChmjbllcg1YZ+7IJxcB8IYZw5LIEwgSFBsZ9piSdm6BYxo45MfywgoP+nnjC4j5OR171KBYLGsGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:38:10.152302Z"},"content_sha256":"2eb68471c2da57fd5f4f32a4d9bc436f71ca6519e0536325dd4a90b48af37ecc","schema_version":"1.0","event_id":"sha256:2eb68471c2da57fd5f4f32a4d9bc436f71ca6519e0536325dd4a90b48af37ecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HM66DB53PHQG2NUDXTCGOUJBPE/bundle.json","state_url":"https://pith.science/pith/HM66DB53PHQG2NUDXTCGOUJBPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HM66DB53PHQG2NUDXTCGOUJBPE/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-07-05T15:38:10Z","links":{"resolver":"https://pith.science/pith/HM66DB53PHQG2NUDXTCGOUJBPE","bundle":"https://pith.science/pith/HM66DB53PHQG2NUDXTCGOUJBPE/bundle.json","state":"https://pith.science/pith/HM66DB53PHQG2NUDXTCGOUJBPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HM66DB53PHQG2NUDXTCGOUJBPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HM66DB53PHQG2NUDXTCGOUJBPE","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":"eda477e5d74f7ce9e9d2981d6f90e3fba3986ee513a3a005b151dece40049499","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T17:40:46Z","title_canon_sha256":"300111cee7c2c6af63f4bab93c7367442e59983ef7cad66dbd751c246e5ae607"},"schema_version":"1.0","source":{"id":"2606.03953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03953","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03953v1","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03953","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_12","alias_value":"HM66DB53PHQG","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_16","alias_value":"HM66DB53PHQG2NUD","created_at":"2026-06-03T02:06:07Z"},{"alias_kind":"pith_short_8","alias_value":"HM66DB53","created_at":"2026-06-03T02:06:07Z"}],"graph_snapshots":[{"event_id":"sha256:2eb68471c2da57fd5f4f32a4d9bc436f71ca6519e0536325dd4a90b48af37ecc","target":"graph","created_at":"2026-06-03T02:06:07Z","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/2606.03953/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"These lecture notes provide an introduction to first-order optimization methods with a particular emphasis on stochastic gradient methods. We begin with deterministic gradient based methods for unconstrained optimization and study their convergence under standard assumptions such as smoothness, convexity, strong convexity, and the Polyak-Lojasiewicz condition. We then turn to stochastic approximation and stochastic gradient descent, motivated by empirical and expected risk minimization in machine learning. The main focus is on convergence theory: we discuss almost sure convergence and converge","authors_text":"Simon Weissmann","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T17:40:46Z","title":"Introduction to stochastic gradient methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03953","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:a4ca53d296330e1efd22ead0a01c518ac00ff9237aafaa6a69d763fcd8520cfb","target":"record","created_at":"2026-06-03T02:06:07Z","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":"eda477e5d74f7ce9e9d2981d6f90e3fba3986ee513a3a005b151dece40049499","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T17:40:46Z","title_canon_sha256":"300111cee7c2c6af63f4bab93c7367442e59983ef7cad66dbd751c246e5ae607"},"schema_version":"1.0","source":{"id":"2606.03953","kind":"arxiv","version":1}},"canonical_sha256":"3b3de187bb79e06d3683bcc46751217916b819fb0276350db1fc6f838f205e95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b3de187bb79e06d3683bcc46751217916b819fb0276350db1fc6f838f205e95","first_computed_at":"2026-06-03T02:06:07.841816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T02:06:07.841816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lz75qilO6vur1af6cGYdRowxEz4Na6U9vSfiCwkNnP5B3dfdF4hD00//SPx8JwntSxyWTSd9zxkzY15jV44hCA==","signature_status":"signed_v1","signed_at":"2026-06-03T02:06:07.842204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4ca53d296330e1efd22ead0a01c518ac00ff9237aafaa6a69d763fcd8520cfb","sha256:2eb68471c2da57fd5f4f32a4d9bc436f71ca6519e0536325dd4a90b48af37ecc"],"state_sha256":"c5be92c5e6d1ee4bb749faef107cce9d95b7b7e9779c95d44c16e1c9f2562d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVp13Z+CzOGUVxHfpwxRi7Thws3Q/SECLHX548h36FDHcM9EzcdnC50UMrNW351Ke2lYedmJRyuIFM3jzLULCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:38:10.156188Z","bundle_sha256":"0a3ac0144a95211ca4f1cbd8357a6cfccc1edd135eb477b11ba866a7dea12f4d"}}