{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:AGDAMNDK5TFYLJFVM67CXRDJFB","short_pith_number":"pith:AGDAMNDK","canonical_record":{"source":{"id":"2212.01848","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-04T15:26:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d1243c8d540d01400d10264f628abea101c7030e6f2fa3e7bd76d7bdf129e34a","abstract_canon_sha256":"d451e6f1601c2526dbbbfb3b3ab1d5284f36d12e2991b83f6df2772905102a95"},"schema_version":"1.0"},"canonical_sha256":"018606346aeccb85a4b567be2bc4692867b71f6d3c0016d522d9d23abba6a1dd","source":{"kind":"arxiv","id":"2212.01848","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.01848","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2212.01848v3","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01848","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"AGDAMNDK5TFY","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"AGDAMNDK5TFYLJFV","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"AGDAMNDK","created_at":"2026-07-05T08:21:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:AGDAMNDK5TFYLJFVM67CXRDJFB","target":"record","payload":{"canonical_record":{"source":{"id":"2212.01848","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-04T15:26:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d1243c8d540d01400d10264f628abea101c7030e6f2fa3e7bd76d7bdf129e34a","abstract_canon_sha256":"d451e6f1601c2526dbbbfb3b3ab1d5284f36d12e2991b83f6df2772905102a95"},"schema_version":"1.0"},"canonical_sha256":"018606346aeccb85a4b567be2bc4692867b71f6d3c0016d522d9d23abba6a1dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:03.951480Z","signature_b64":"FyDR8Pfhb3tNM84HpAp4cvdagr3J8KAEUyKyrkvn7XOmdZevktHHMc/thk2HPJING9eIy3EBlQ1IpCZTKsjvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"018606346aeccb85a4b567be2bc4692867b71f6d3c0016d522d9d23abba6a1dd","last_reissued_at":"2026-07-05T08:21:03.951003Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:03.951003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.01848","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-05T08:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQMIvccMCtvORSZqM0DL6vAZeICFsVr84uvY4uxgVpXRgKUmv+9ZzngvaLAFyZcjRtacCEHxSaYn2S8Awi5ECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:55:51.381786Z"},"content_sha256":"f82318995f4433e6ba4e0c7b95188d762f404ca1eeb03aef58425bcfe4b4591c","schema_version":"1.0","event_id":"sha256:f82318995f4433e6ba4e0c7b95188d762f404ca1eeb03aef58425bcfe4b4591c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:AGDAMNDK5TFYLJFVM67CXRDJFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Corrado Coppola, Giampaolo Liuzzi, Laura Palagi, Ruggiero Seccia","submitted_at":"2022-12-04T15:26:36Z","abstract_excerpt":"In this work, we consider minimizing the average of a very large number of smooth and possibly non-convex functions, and we focus on two widely used minibatch frameworks to tackle this optimization problem: Incremental Gradient (IG) and Random Reshuffling (RR). We define ease-controlled modifications of the IG/RR schemes, which require a light additional computational effort {but} can be proved to converge under {weak} and standard assumptions. In particular, we define two algorithmic schemes in which the IG/RR iteration is controlled by using a watchdog rule and a derivative-free linesearch t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01848","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/2212.01848/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-05T08:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76EvOt9nCDimki7vPOM+Q/BjsNANGVrw7rNAjsDABqsdPKDyX9xtPYpvgBrhTgio3k2+QYDOY3yngUXy4dyuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T23:55:51.382593Z"},"content_sha256":"2d8fad3f070f11de2af1975e6449352ec61fe1c2c862e5e7ffd512fd5cd3341d","schema_version":"1.0","event_id":"sha256:2d8fad3f070f11de2af1975e6449352ec61fe1c2c862e5e7ffd512fd5cd3341d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGDAMNDK5TFYLJFVM67CXRDJFB/bundle.json","state_url":"https://pith.science/pith/AGDAMNDK5TFYLJFVM67CXRDJFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGDAMNDK5TFYLJFVM67CXRDJFB/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-13T23:55:51Z","links":{"resolver":"https://pith.science/pith/AGDAMNDK5TFYLJFVM67CXRDJFB","bundle":"https://pith.science/pith/AGDAMNDK5TFYLJFVM67CXRDJFB/bundle.json","state":"https://pith.science/pith/AGDAMNDK5TFYLJFVM67CXRDJFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGDAMNDK5TFYLJFVM67CXRDJFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:AGDAMNDK5TFYLJFVM67CXRDJFB","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":"d451e6f1601c2526dbbbfb3b3ab1d5284f36d12e2991b83f6df2772905102a95","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-04T15:26:36Z","title_canon_sha256":"d1243c8d540d01400d10264f628abea101c7030e6f2fa3e7bd76d7bdf129e34a"},"schema_version":"1.0","source":{"id":"2212.01848","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.01848","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2212.01848v3","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.01848","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"AGDAMNDK5TFY","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"AGDAMNDK5TFYLJFV","created_at":"2026-07-05T08:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"AGDAMNDK","created_at":"2026-07-05T08:21:03Z"}],"graph_snapshots":[{"event_id":"sha256:2d8fad3f070f11de2af1975e6449352ec61fe1c2c862e5e7ffd512fd5cd3341d","target":"graph","created_at":"2026-07-05T08:21:03Z","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/2212.01848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we consider minimizing the average of a very large number of smooth and possibly non-convex functions, and we focus on two widely used minibatch frameworks to tackle this optimization problem: Incremental Gradient (IG) and Random Reshuffling (RR). We define ease-controlled modifications of the IG/RR schemes, which require a light additional computational effort {but} can be proved to converge under {weak} and standard assumptions. In particular, we define two algorithmic schemes in which the IG/RR iteration is controlled by using a watchdog rule and a derivative-free linesearch t","authors_text":"Corrado Coppola, Giampaolo Liuzzi, Laura Palagi, Ruggiero Seccia","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-04T15:26:36Z","title":"Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.01848","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:f82318995f4433e6ba4e0c7b95188d762f404ca1eeb03aef58425bcfe4b4591c","target":"record","created_at":"2026-07-05T08:21:03Z","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":"d451e6f1601c2526dbbbfb3b3ab1d5284f36d12e2991b83f6df2772905102a95","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-12-04T15:26:36Z","title_canon_sha256":"d1243c8d540d01400d10264f628abea101c7030e6f2fa3e7bd76d7bdf129e34a"},"schema_version":"1.0","source":{"id":"2212.01848","kind":"arxiv","version":3}},"canonical_sha256":"018606346aeccb85a4b567be2bc4692867b71f6d3c0016d522d9d23abba6a1dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"018606346aeccb85a4b567be2bc4692867b71f6d3c0016d522d9d23abba6a1dd","first_computed_at":"2026-07-05T08:21:03.951003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:21:03.951003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FyDR8Pfhb3tNM84HpAp4cvdagr3J8KAEUyKyrkvn7XOmdZevktHHMc/thk2HPJING9eIy3EBlQ1IpCZTKsjvAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:21:03.951480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.01848","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f82318995f4433e6ba4e0c7b95188d762f404ca1eeb03aef58425bcfe4b4591c","sha256:2d8fad3f070f11de2af1975e6449352ec61fe1c2c862e5e7ffd512fd5cd3341d"],"state_sha256":"a085ac1e0efeeba895cd206ad4c5fa689660f99fbb622d8ab58d5d07ddc263e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkMtxPMLfFK2K4tFBpL5+uvYa0sNa9HRyzEOdcjAMCxbFij4/jBlvXRS0AveX10p5q1EV+JA54IgNwTqsv/OBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T23:55:51.392638Z","bundle_sha256":"49bb11b48bbcba04253f261da95cd12ce65cddc0a894c2c9d38ae4f0842a3c83"}}