{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:4NP3BSZ4AVB4SMMISQQ62OEYXN","short_pith_number":"pith:4NP3BSZ4","canonical_record":{"source":{"id":"2111.06328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-11T17:39:50Z","cross_cats_sorted":[],"title_canon_sha256":"61d23c3549f518e346c0bdddaeaf958ad24e92fd742a8604616eb7611d07c226","abstract_canon_sha256":"e4ecfd7bdc75f247b2c73a19bb1ee2fd37d1dd9ea28dca04eb559ac0b6bbed7e"},"schema_version":"1.0"},"canonical_sha256":"e35fb0cb3c0543c931889421ed3898bb71039c42658af5b47b26b88a921589e7","source":{"kind":"arxiv","id":"2111.06328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06328","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06328v1","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06328","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"4NP3BSZ4AVB4","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NP3BSZ4AVB4SMMI","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NP3BSZ4","created_at":"2026-07-05T03:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:4NP3BSZ4AVB4SMMISQQ62OEYXN","target":"record","payload":{"canonical_record":{"source":{"id":"2111.06328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-11T17:39:50Z","cross_cats_sorted":[],"title_canon_sha256":"61d23c3549f518e346c0bdddaeaf958ad24e92fd742a8604616eb7611d07c226","abstract_canon_sha256":"e4ecfd7bdc75f247b2c73a19bb1ee2fd37d1dd9ea28dca04eb559ac0b6bbed7e"},"schema_version":"1.0"},"canonical_sha256":"e35fb0cb3c0543c931889421ed3898bb71039c42658af5b47b26b88a921589e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:00.554799Z","signature_b64":"4HdCZYf23+u1UFucsqN/bbMwea46QuUbnWhHVna+Rax+nncUsQ8GclNzyydwvyDlgfoGYJjP5yMhu6tnrpGdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e35fb0cb3c0543c931889421ed3898bb71039c42658af5b47b26b88a921589e7","last_reissued_at":"2026-07-05T03:31:00.554408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:00.554408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.06328","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-05T03:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcNW2PjaMHpMF8GC9Nf1PbhJICbUFWNs3W4B9HvxL8hGOZzRZUnqXl4sNp6s7vNjQ+p8OpjTMHDL3uLJ6c3NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:17:56.849218Z"},"content_sha256":"cc97ffe2fb22995a9547f166f3d8b3347f0c9478cfb557ed7a402341fbbe2fcd","schema_version":"1.0","event_id":"sha256:cc97ffe2fb22995a9547f166f3d8b3347f0c9478cfb557ed7a402341fbbe2fcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:4NP3BSZ4AVB4SMMISQQ62OEYXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shancong Mou, Siva Theja Maguluri, Zaiwei Chen","submitted_at":"2021-11-11T17:39:50Z","abstract_excerpt":"Stochastic approximation (SA) and stochastic gradient descent (SGD) algorithms are work-horses for modern machine learning algorithms. Their constant stepsize variants are preferred in practice due to fast convergence behavior. However, constant step stochastic iterative algorithms do not converge asymptotically to the optimal solution, but instead have a stationary distribution, which in general cannot be analytically characterized. In this work, we study the asymptotic behavior of the appropriately scaled stationary distribution, in the limit when the constant stepsize goes to zero. Specific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06328","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/2111.06328/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-05T03:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXP2XgANY/4M80zaOTdvN6FP1ADKyc3jeCr+sWelEuvhDytXIXJylg4ImGsye6Df62ZfwiNyfp5jGNeaXmjsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:17:56.849784Z"},"content_sha256":"801b01c246323d81b62c033aba4188ae63e6ae78ded8c8f65e35362e8639c358","schema_version":"1.0","event_id":"sha256:801b01c246323d81b62c033aba4188ae63e6ae78ded8c8f65e35362e8639c358"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN/bundle.json","state_url":"https://pith.science/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN/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-31T14:17:56Z","links":{"resolver":"https://pith.science/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN","bundle":"https://pith.science/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN/bundle.json","state":"https://pith.science/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NP3BSZ4AVB4SMMISQQ62OEYXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:4NP3BSZ4AVB4SMMISQQ62OEYXN","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":"e4ecfd7bdc75f247b2c73a19bb1ee2fd37d1dd9ea28dca04eb559ac0b6bbed7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-11T17:39:50Z","title_canon_sha256":"61d23c3549f518e346c0bdddaeaf958ad24e92fd742a8604616eb7611d07c226"},"schema_version":"1.0","source":{"id":"2111.06328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06328","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06328v1","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06328","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"4NP3BSZ4AVB4","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NP3BSZ4AVB4SMMI","created_at":"2026-07-05T03:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NP3BSZ4","created_at":"2026-07-05T03:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:801b01c246323d81b62c033aba4188ae63e6ae78ded8c8f65e35362e8639c358","target":"graph","created_at":"2026-07-05T03:31:00Z","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/2111.06328/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic approximation (SA) and stochastic gradient descent (SGD) algorithms are work-horses for modern machine learning algorithms. Their constant stepsize variants are preferred in practice due to fast convergence behavior. However, constant step stochastic iterative algorithms do not converge asymptotically to the optimal solution, but instead have a stationary distribution, which in general cannot be analytically characterized. In this work, we study the asymptotic behavior of the appropriately scaled stationary distribution, in the limit when the constant stepsize goes to zero. Specific","authors_text":"Shancong Mou, Siva Theja Maguluri, Zaiwei Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-11T17:39:50Z","title":"Stationary Behavior of Constant Stepsize SGD Type Algorithms: An Asymptotic Characterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06328","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:cc97ffe2fb22995a9547f166f3d8b3347f0c9478cfb557ed7a402341fbbe2fcd","target":"record","created_at":"2026-07-05T03:31:00Z","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":"e4ecfd7bdc75f247b2c73a19bb1ee2fd37d1dd9ea28dca04eb559ac0b6bbed7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-11T17:39:50Z","title_canon_sha256":"61d23c3549f518e346c0bdddaeaf958ad24e92fd742a8604616eb7611d07c226"},"schema_version":"1.0","source":{"id":"2111.06328","kind":"arxiv","version":1}},"canonical_sha256":"e35fb0cb3c0543c931889421ed3898bb71039c42658af5b47b26b88a921589e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e35fb0cb3c0543c931889421ed3898bb71039c42658af5b47b26b88a921589e7","first_computed_at":"2026-07-05T03:31:00.554408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:31:00.554408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4HdCZYf23+u1UFucsqN/bbMwea46QuUbnWhHVna+Rax+nncUsQ8GclNzyydwvyDlgfoGYJjP5yMhu6tnrpGdAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:31:00.554799Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.06328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc97ffe2fb22995a9547f166f3d8b3347f0c9478cfb557ed7a402341fbbe2fcd","sha256:801b01c246323d81b62c033aba4188ae63e6ae78ded8c8f65e35362e8639c358"],"state_sha256":"a60b31c7fc1174b6de0fc7dc1f9a857fbd74682cd19f54503a7eeb074ae80a84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhOhk6Yn4PP96aicWVAyGjp6hUrjrBda6dFo5VQwaKwx6QERP6LSSATuWPEke7pu42bv3Ko+dk5MuIzclMmDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T14:17:56.853811Z","bundle_sha256":"441049618b06e45a1568808c7c522b5423140cf365fd6615749464a7ffde2e8d"}}