{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YQCN26ORYA4ZF5WLBUP6ARSUF7","short_pith_number":"pith:YQCN26OR","canonical_record":{"source":{"id":"2209.07446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-15T16:50:55Z","cross_cats_sorted":[],"title_canon_sha256":"0bb82205a061cd20f11cc12a02e552d9752640398b0b08eabadd677e2b9afe59","abstract_canon_sha256":"69bb0b4a826d696221f7a8a5140c9166ee80faf9cf925a2549cc633e5600ee1b"},"schema_version":"1.0"},"canonical_sha256":"c404dd79d1c03992f6cb0d1fe046542fe1f17906ab6e4340596f644e4c2c45d1","source":{"kind":"arxiv","id":"2209.07446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.07446","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"2209.07446v1","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.07446","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"YQCN26ORYA4Z","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"pith_short_16","alias_value":"YQCN26ORYA4ZF5WL","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"pith_short_8","alias_value":"YQCN26OR","created_at":"2026-07-05T04:57:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YQCN26ORYA4ZF5WLBUP6ARSUF7","target":"record","payload":{"canonical_record":{"source":{"id":"2209.07446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-15T16:50:55Z","cross_cats_sorted":[],"title_canon_sha256":"0bb82205a061cd20f11cc12a02e552d9752640398b0b08eabadd677e2b9afe59","abstract_canon_sha256":"69bb0b4a826d696221f7a8a5140c9166ee80faf9cf925a2549cc633e5600ee1b"},"schema_version":"1.0"},"canonical_sha256":"c404dd79d1c03992f6cb0d1fe046542fe1f17906ab6e4340596f644e4c2c45d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:57:58.768795Z","signature_b64":"K+G0rDsB8KV1Gdr8Sk/3C367tOsjdAICEdGfBk9dfFAUM5EsyLy3QUOfYxyxnd0eRg6CVf2TfLAY03HgGVlKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c404dd79d1c03992f6cb0d1fe046542fe1f17906ab6e4340596f644e4c2c45d1","last_reissued_at":"2026-07-05T04:57:58.768384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:57:58.768384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.07446","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-05T04:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DT1yrp2N5MznpeG/SRAPYAuT+GKeftcGYTGfBnvI6BsH/bP+vugi0RoNh8OdEKpyeyLpUMTyKQ+nFkpeomQUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T02:30:18.551398Z"},"content_sha256":"a7e15e572a1339e188cbddd5befea886b466a8644356a468cd0beffb8900bf61","schema_version":"1.0","event_id":"sha256:a7e15e572a1339e188cbddd5befea886b466a8644356a468cd0beffb8900bf61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YQCN26ORYA4ZF5WLBUP6ARSUF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiency Ordering of Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Do Young Eun, Jie Hu, Vishwaraj Doshi","submitted_at":"2022-09-15T16:50:55Z","abstract_excerpt":"We consider the stochastic gradient descent (SGD) algorithm driven by a general stochastic sequence, including i.i.d noise and random walk on an arbitrary graph, among others; and analyze it in the asymptotic sense. Specifically, we employ the notion of `efficiency ordering', a well-analyzed tool for comparing the performance of Markov Chain Monte Carlo (MCMC) samplers, for SGD algorithms in the form of Loewner ordering of covariance matrices associated with the scaled iterate errors in the long term. Using this ordering, we show that input sequences that are more efficient for MCMC sampling a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.07446","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/2209.07446/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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BX/m43+WbddaASQzPzyJTHmNhh/3f/22WU+y1JnfoMxh1m6ADIekxWgtqFoiQvxxf5oaICBtAFl/yuWxkdrqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T02:30:18.551909Z"},"content_sha256":"aa5b27aa2309648e6ae3dea156c159bf58c5267279ddb787bf80c18f6ded52e9","schema_version":"1.0","event_id":"sha256:aa5b27aa2309648e6ae3dea156c159bf58c5267279ddb787bf80c18f6ded52e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7/bundle.json","state_url":"https://pith.science/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7/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-07T02:30:18Z","links":{"resolver":"https://pith.science/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7","bundle":"https://pith.science/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7/bundle.json","state":"https://pith.science/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQCN26ORYA4ZF5WLBUP6ARSUF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YQCN26ORYA4ZF5WLBUP6ARSUF7","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":"69bb0b4a826d696221f7a8a5140c9166ee80faf9cf925a2549cc633e5600ee1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-15T16:50:55Z","title_canon_sha256":"0bb82205a061cd20f11cc12a02e552d9752640398b0b08eabadd677e2b9afe59"},"schema_version":"1.0","source":{"id":"2209.07446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.07446","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"2209.07446v1","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.07446","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"YQCN26ORYA4Z","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"pith_short_16","alias_value":"YQCN26ORYA4ZF5WL","created_at":"2026-07-05T04:57:58Z"},{"alias_kind":"pith_short_8","alias_value":"YQCN26OR","created_at":"2026-07-05T04:57:58Z"}],"graph_snapshots":[{"event_id":"sha256:aa5b27aa2309648e6ae3dea156c159bf58c5267279ddb787bf80c18f6ded52e9","target":"graph","created_at":"2026-07-05T04:57:58Z","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/2209.07446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the stochastic gradient descent (SGD) algorithm driven by a general stochastic sequence, including i.i.d noise and random walk on an arbitrary graph, among others; and analyze it in the asymptotic sense. Specifically, we employ the notion of `efficiency ordering', a well-analyzed tool for comparing the performance of Markov Chain Monte Carlo (MCMC) samplers, for SGD algorithms in the form of Loewner ordering of covariance matrices associated with the scaled iterate errors in the long term. Using this ordering, we show that input sequences that are more efficient for MCMC sampling a","authors_text":"Do Young Eun, Jie Hu, Vishwaraj Doshi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-15T16:50:55Z","title":"Efficiency Ordering of Stochastic Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.07446","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:a7e15e572a1339e188cbddd5befea886b466a8644356a468cd0beffb8900bf61","target":"record","created_at":"2026-07-05T04:57:58Z","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":"69bb0b4a826d696221f7a8a5140c9166ee80faf9cf925a2549cc633e5600ee1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-15T16:50:55Z","title_canon_sha256":"0bb82205a061cd20f11cc12a02e552d9752640398b0b08eabadd677e2b9afe59"},"schema_version":"1.0","source":{"id":"2209.07446","kind":"arxiv","version":1}},"canonical_sha256":"c404dd79d1c03992f6cb0d1fe046542fe1f17906ab6e4340596f644e4c2c45d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c404dd79d1c03992f6cb0d1fe046542fe1f17906ab6e4340596f644e4c2c45d1","first_computed_at":"2026-07-05T04:57:58.768384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:57:58.768384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K+G0rDsB8KV1Gdr8Sk/3C367tOsjdAICEdGfBk9dfFAUM5EsyLy3QUOfYxyxnd0eRg6CVf2TfLAY03HgGVlKCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:57:58.768795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.07446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7e15e572a1339e188cbddd5befea886b466a8644356a468cd0beffb8900bf61","sha256:aa5b27aa2309648e6ae3dea156c159bf58c5267279ddb787bf80c18f6ded52e9"],"state_sha256":"94f549b7e9655ccf3552dcf823ed9b971835640ddbe160f308b659beaea8bda5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfvU2sZTYRM7jPxUpXi79FpXR3dgO9DeG3w1qVzlZod30ympmqdN93NZoKFuYSTJ5yn3pg65dfD0EszeUmOZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T02:30:18.555868Z","bundle_sha256":"294aeafd58e7c081b41afb8a19ba0346c1bd2b190d2baee9cdd88430816ac3e0"}}