{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DPB44LKJ7VU36UAKNMAEXW7Y4G","short_pith_number":"pith:DPB44LKJ","canonical_record":{"source":{"id":"2302.14428","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-28T09:18:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"46e459291961a189c3ae282a0181df2c71c22c2362c6e4757837e91c36fe2441","abstract_canon_sha256":"6b8656b0d925f77828c0a6e75de9ceed14f0a10b5a8cf73e7cb8c71abd81dcc7"},"schema_version":"1.0"},"canonical_sha256":"1bc3ce2d49fd69bf500a6b004bdbf8e19c7882f9c399b7fb9cf90bbe8d6ffbcf","source":{"kind":"arxiv","id":"2302.14428","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.14428","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.14428v3","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14428","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"DPB44LKJ7VU3","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"DPB44LKJ7VU36UAK","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"DPB44LKJ","created_at":"2026-07-05T06:23:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DPB44LKJ7VU36UAKNMAEXW7Y4G","target":"record","payload":{"canonical_record":{"source":{"id":"2302.14428","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-28T09:18:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"46e459291961a189c3ae282a0181df2c71c22c2362c6e4757837e91c36fe2441","abstract_canon_sha256":"6b8656b0d925f77828c0a6e75de9ceed14f0a10b5a8cf73e7cb8c71abd81dcc7"},"schema_version":"1.0"},"canonical_sha256":"1bc3ce2d49fd69bf500a6b004bdbf8e19c7882f9c399b7fb9cf90bbe8d6ffbcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:59.278092Z","signature_b64":"QfDzbWle79HfyE+s7Ph0RSQPOovqDOGuXd55SR4lAN3tQ577bMqPPc3Tym48w18ggvSZyL9TJXg/VORM9i4vDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc3ce2d49fd69bf500a6b004bdbf8e19c7882f9c399b7fb9cf90bbe8d6ffbcf","last_reissued_at":"2026-07-05T06:23:59.277715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:59.277715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.14428","source_version":3,"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-05T06:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0WzC4dfA4xc3wV5qvg09nEx0kMi9V96ufTbHX7TDb24VIXpTEVnneZ3Squ27n7CFKzKHIV0WcZNkTIoF/vkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:58:20.716715Z"},"content_sha256":"e647eda8c4db3cce33d6633f8dc8fccfca23ca0ac3a9e4a0b1ed6efa514b25b0","schema_version":"1.0","event_id":"sha256:e647eda8c4db3cce33d6633f8dc8fccfca23ca0ac3a9e4a0b1ed6efa514b25b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DPB44LKJ7VU36UAKNMAEXW7Y4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Gradient Descent under Markovian Sampling Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Mathieu Even","submitted_at":"2023-02-28T09:18:00Z","abstract_excerpt":"We study a variation of vanilla stochastic gradient descent where the optimizer only has access to a Markovian sampling scheme. These schemes encompass applications that range from decentralized optimization with a random walker (token algorithms), to RL and online system identification problems. We focus on obtaining rates of convergence under the least restrictive assumptions possible on the underlying Markov chain and on the functions optimized. We first unveil the theoretical lower bound for methods that sample stochastic gradients along the path of a Markov chain, making appear a dependen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14428","kind":"arxiv","version":3},"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/2302.14428/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-05T06:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IS+cN/l5OlHu0HF0Igf4nkIcKhmBcJbDaF+J21bj9Zk8Ei56OvYB7DoCmX4BbVE4Wude9h1XLK5cSYryquyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:58:20.717223Z"},"content_sha256":"a6f73494cda162a13508907a5af622a22724eddce7a060fdfae322ede510b7f5","schema_version":"1.0","event_id":"sha256:a6f73494cda162a13508907a5af622a22724eddce7a060fdfae322ede510b7f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G/bundle.json","state_url":"https://pith.science/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G/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-09T07:58:20Z","links":{"resolver":"https://pith.science/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G","bundle":"https://pith.science/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G/bundle.json","state":"https://pith.science/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPB44LKJ7VU36UAKNMAEXW7Y4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DPB44LKJ7VU36UAKNMAEXW7Y4G","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":"6b8656b0d925f77828c0a6e75de9ceed14f0a10b5a8cf73e7cb8c71abd81dcc7","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-28T09:18:00Z","title_canon_sha256":"46e459291961a189c3ae282a0181df2c71c22c2362c6e4757837e91c36fe2441"},"schema_version":"1.0","source":{"id":"2302.14428","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.14428","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2302.14428v3","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.14428","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"DPB44LKJ7VU3","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"DPB44LKJ7VU36UAK","created_at":"2026-07-05T06:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"DPB44LKJ","created_at":"2026-07-05T06:23:59Z"}],"graph_snapshots":[{"event_id":"sha256:a6f73494cda162a13508907a5af622a22724eddce7a060fdfae322ede510b7f5","target":"graph","created_at":"2026-07-05T06:23:59Z","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/2302.14428/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a variation of vanilla stochastic gradient descent where the optimizer only has access to a Markovian sampling scheme. These schemes encompass applications that range from decentralized optimization with a random walker (token algorithms), to RL and online system identification problems. We focus on obtaining rates of convergence under the least restrictive assumptions possible on the underlying Markov chain and on the functions optimized. We first unveil the theoretical lower bound for methods that sample stochastic gradients along the path of a Markov chain, making appear a dependen","authors_text":"Mathieu Even","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-28T09:18:00Z","title":"Stochastic Gradient Descent under Markovian Sampling Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.14428","kind":"arxiv","version":3},"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:e647eda8c4db3cce33d6633f8dc8fccfca23ca0ac3a9e4a0b1ed6efa514b25b0","target":"record","created_at":"2026-07-05T06:23:59Z","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":"6b8656b0d925f77828c0a6e75de9ceed14f0a10b5a8cf73e7cb8c71abd81dcc7","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-02-28T09:18:00Z","title_canon_sha256":"46e459291961a189c3ae282a0181df2c71c22c2362c6e4757837e91c36fe2441"},"schema_version":"1.0","source":{"id":"2302.14428","kind":"arxiv","version":3}},"canonical_sha256":"1bc3ce2d49fd69bf500a6b004bdbf8e19c7882f9c399b7fb9cf90bbe8d6ffbcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bc3ce2d49fd69bf500a6b004bdbf8e19c7882f9c399b7fb9cf90bbe8d6ffbcf","first_computed_at":"2026-07-05T06:23:59.277715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:23:59.277715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QfDzbWle79HfyE+s7Ph0RSQPOovqDOGuXd55SR4lAN3tQ577bMqPPc3Tym48w18ggvSZyL9TJXg/VORM9i4vDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:23:59.278092Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.14428","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e647eda8c4db3cce33d6633f8dc8fccfca23ca0ac3a9e4a0b1ed6efa514b25b0","sha256:a6f73494cda162a13508907a5af622a22724eddce7a060fdfae322ede510b7f5"],"state_sha256":"4029fa6da54e8323c69e464ff129079506897d8eb6ed63a0abcbef608e3b3f21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anbCOez2weSVCGWaL5TmtfVxTfVaf0GFfvoziWTjgVb+JKt8kE2VQG+s20USwySu/vOGov0Pqj+jQyx6JLKXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:58:20.722604Z","bundle_sha256":"283532b5a028d67c6b65c00e60c701a41e57b23960b21facfb4b3e1439adf87e"}}