{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZUW4AD4LGWR4ZTSWBW7HAU6WEM","short_pith_number":"pith:ZUW4AD4L","canonical_record":{"source":{"id":"2006.05988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-10T17:57:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"053cf377909e6370b004f61ab6a8f18be43c3c32a48a23a8885cedc67641b0c2","abstract_canon_sha256":"f312b402daa5f047eb17bc4d75d91fbb741df6fd45902fe2dbe732bb4b0d548a"},"schema_version":"1.0"},"canonical_sha256":"cd2dc00f8b35a3ccce560dbe7053d6230bae05a3ed0fb6fedea65cf68f8df106","source":{"kind":"arxiv","id":"2006.05988","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05988","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05988v3","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05988","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZUW4AD4LGWR4","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZUW4AD4LGWR4ZTSW","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZUW4AD4L","created_at":"2026-07-05T02:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZUW4AD4LGWR4ZTSWBW7HAU6WEM","target":"record","payload":{"canonical_record":{"source":{"id":"2006.05988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-10T17:57:21Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"053cf377909e6370b004f61ab6a8f18be43c3c32a48a23a8885cedc67641b0c2","abstract_canon_sha256":"f312b402daa5f047eb17bc4d75d91fbb741df6fd45902fe2dbe732bb4b0d548a"},"schema_version":"1.0"},"canonical_sha256":"cd2dc00f8b35a3ccce560dbe7053d6230bae05a3ed0fb6fedea65cf68f8df106","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:49.673993Z","signature_b64":"xzZBDRhbkjCoYurr0C2NQdiI5WA7C2QEYKvNpXj7yvK/cn1x4J7oydUXodMaLpv2/xxYdo+1FXFDPlTFXHGVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd2dc00f8b35a3ccce560dbe7053d6230bae05a3ed0fb6fedea65cf68f8df106","last_reissued_at":"2026-07-05T02:28:49.673592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:49.673592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.05988","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-05T02:28:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUb81DgJZQEDh+HEZCY+7aPx+7QOzvYHkERhqzJSjSktmX8l0QqlYBvl9tfsd3itkZ2KYrP0EgBJR8MWbNpVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:59:50.048162Z"},"content_sha256":"1986b4f8d6ee950604a45f86988773f93e8b3df2cd42408c3ff2fc11aad5a5f6","schema_version":"1.0","event_id":"sha256:1986b4f8d6ee950604a45f86988773f93e8b3df2cd42408c3ff2fc11aad5a5f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZUW4AD4LGWR4ZTSWBW7HAU6WEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Reshuffling: Simple Analysis with Vast Improvements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ahmed Khaled, Konstantin Mishchenko, Peter Richt\\'arik","submitted_at":"2020-06-10T17:57:21Z","abstract_excerpt":"Random Reshuffling (RR) is an algorithm for minimizing finite-sum functions that utilizes iterative gradient descent steps in conjunction with data reshuffling. Often contrasted with its sibling Stochastic Gradient Descent (SGD), RR is usually faster in practice and enjoys significant popularity in convex and non-convex optimization. The convergence rate of RR has attracted substantial attention recently and, for strongly convex and smooth functions, it was shown to converge faster than SGD if 1) the stepsize is small, 2) the gradients are bounded, and 3) the number of epochs is large. We remo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05988","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/2006.05988/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-05T02:28:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huGXVt5C4f3KS8EtM1oBJp1o64yez8yFkTV/YhjZRicWx2MmRT8EjV5fKZjZulrB7Kg+MgNmTreAZTc2Wbg5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:59:50.048670Z"},"content_sha256":"d697dad17a9c34c22015c9f1b2c0bf4228ea548ddc9a74d25ddf16c4581f922b","schema_version":"1.0","event_id":"sha256:d697dad17a9c34c22015c9f1b2c0bf4228ea548ddc9a74d25ddf16c4581f922b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM/bundle.json","state_url":"https://pith.science/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM/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-04T20:59:50Z","links":{"resolver":"https://pith.science/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM","bundle":"https://pith.science/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM/bundle.json","state":"https://pith.science/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUW4AD4LGWR4ZTSWBW7HAU6WEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZUW4AD4LGWR4ZTSWBW7HAU6WEM","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":"f312b402daa5f047eb17bc4d75d91fbb741df6fd45902fe2dbe732bb4b0d548a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-10T17:57:21Z","title_canon_sha256":"053cf377909e6370b004f61ab6a8f18be43c3c32a48a23a8885cedc67641b0c2"},"schema_version":"1.0","source":{"id":"2006.05988","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.05988","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"arxiv_version","alias_value":"2006.05988v3","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05988","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZUW4AD4LGWR4","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZUW4AD4LGWR4ZTSW","created_at":"2026-07-05T02:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZUW4AD4L","created_at":"2026-07-05T02:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:d697dad17a9c34c22015c9f1b2c0bf4228ea548ddc9a74d25ddf16c4581f922b","target":"graph","created_at":"2026-07-05T02:28:49Z","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/2006.05988/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random Reshuffling (RR) is an algorithm for minimizing finite-sum functions that utilizes iterative gradient descent steps in conjunction with data reshuffling. Often contrasted with its sibling Stochastic Gradient Descent (SGD), RR is usually faster in practice and enjoys significant popularity in convex and non-convex optimization. The convergence rate of RR has attracted substantial attention recently and, for strongly convex and smooth functions, it was shown to converge faster than SGD if 1) the stepsize is small, 2) the gradients are bounded, and 3) the number of epochs is large. We remo","authors_text":"Ahmed Khaled, Konstantin Mishchenko, Peter Richt\\'arik","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-10T17:57:21Z","title":"Random Reshuffling: Simple Analysis with Vast Improvements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05988","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:1986b4f8d6ee950604a45f86988773f93e8b3df2cd42408c3ff2fc11aad5a5f6","target":"record","created_at":"2026-07-05T02:28:49Z","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":"f312b402daa5f047eb17bc4d75d91fbb741df6fd45902fe2dbe732bb4b0d548a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-10T17:57:21Z","title_canon_sha256":"053cf377909e6370b004f61ab6a8f18be43c3c32a48a23a8885cedc67641b0c2"},"schema_version":"1.0","source":{"id":"2006.05988","kind":"arxiv","version":3}},"canonical_sha256":"cd2dc00f8b35a3ccce560dbe7053d6230bae05a3ed0fb6fedea65cf68f8df106","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd2dc00f8b35a3ccce560dbe7053d6230bae05a3ed0fb6fedea65cf68f8df106","first_computed_at":"2026-07-05T02:28:49.673592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:28:49.673592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xzZBDRhbkjCoYurr0C2NQdiI5WA7C2QEYKvNpXj7yvK/cn1x4J7oydUXodMaLpv2/xxYdo+1FXFDPlTFXHGVCw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:28:49.673993Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.05988","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1986b4f8d6ee950604a45f86988773f93e8b3df2cd42408c3ff2fc11aad5a5f6","sha256:d697dad17a9c34c22015c9f1b2c0bf4228ea548ddc9a74d25ddf16c4581f922b"],"state_sha256":"fed2c120d86db6672cb2c1cbdfc66349e21e293974de83406541b43274c25620"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pq1zVO2vPXQZPONHMM6giAImPrr49HT7li8SmrGiOxoxWm4ntHdGuYv2jsxVT7xNk2A8dTZZiCGeBSHOkrGXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:59:50.052052Z","bundle_sha256":"43d675847c640800ef25739c6197a98a823223cf97f0ac32ba960781c180d65e"}}