{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KOGI6QXENOCIK66STWZEYKU6EJ","short_pith_number":"pith:KOGI6QXE","canonical_record":{"source":{"id":"2606.10110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:39:15Z","cross_cats_sorted":[],"title_canon_sha256":"2c5f21ad5ebb51e2cee8ec0dd84f56ab956c5b50167e6dcd9c7ba3b7504e3b53","abstract_canon_sha256":"1bac540ef18027ca642761a497e3af0134ce20a4d2ed5d5d1ee5125ded014bfd"},"schema_version":"1.0"},"canonical_sha256":"538c8f42e46b84857bd29db24c2a9e2253e4fdcaed61b6468e47d89be9082736","source":{"kind":"arxiv","id":"2606.10110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10110","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10110v1","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10110","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"KOGI6QXENOCI","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"pith_short_16","alias_value":"KOGI6QXENOCIK66S","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"pith_short_8","alias_value":"KOGI6QXE","created_at":"2026-06-10T01:08:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KOGI6QXENOCIK66STWZEYKU6EJ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.10110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:39:15Z","cross_cats_sorted":[],"title_canon_sha256":"2c5f21ad5ebb51e2cee8ec0dd84f56ab956c5b50167e6dcd9c7ba3b7504e3b53","abstract_canon_sha256":"1bac540ef18027ca642761a497e3af0134ce20a4d2ed5d5d1ee5125ded014bfd"},"schema_version":"1.0"},"canonical_sha256":"538c8f42e46b84857bd29db24c2a9e2253e4fdcaed61b6468e47d89be9082736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:54.748306Z","signature_b64":"HRW/JG3UzS1+/RxLryFCEqR0OOAVzPacs1M3zJA0ZzHa2iU//zoySDI46W6d9fm1X5DbselR0jQ7yK0HBbnfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538c8f42e46b84857bd29db24c2a9e2253e4fdcaed61b6468e47d89be9082736","last_reissued_at":"2026-06-10T01:08:54.747392Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:54.747392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.10110","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-06-10T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1jE37B7IEWlX5M2Ub2U2XmjUf4OAW5pReDlQ/cL217Vk76sO/irwP/mJwVK1s4qzV4YgdTNCGKkYBQldzxyjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:27:18.617873Z"},"content_sha256":"04c7c83da9c7cc000eef12117473de57a96c5f70449a34b33fddb358026a4730","schema_version":"1.0","event_id":"sha256:04c7c83da9c7cc000eef12117473de57a96c5f70449a34b33fddb358026a4730"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KOGI6QXENOCIK66STWZEYKU6EJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Dual Averaging Power-Prox Method with Application to Heavy-Tail Incremental Gradient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jeremy Rack, Sebastian U. Stich, Yuan Gao","submitted_at":"2026-06-08T19:39:15Z","abstract_excerpt":"We study finite-sum composite optimization under two departures from classical stochastic gradient descent theory that are central in practice: incremental gradient access and heavy-tailed gradient noise. Specifically, we consider fixed cyclic passes over component gradients and assume that, at the optimum, component gradients have a bounded $q$-th centralized moment for some $q\\in(1,2]$. This setting is much closer to modern ML training practice than the assumptions used in classical SGD theory, yet its theoretical understanding remains limited. We propose a Dual Averaging Power-Prox method f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10110","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/2606.10110/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-06-10T01:08:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y02OVm504mPFUJouS5/ex2Mj5b3q5zF7plLBLg53IlAN7Qg9CYrZ7m5i4ZlKAhPtD5XHh41yFXjUzAKv8slMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:27:18.618240Z"},"content_sha256":"894a0c4ad654a3d22fe4f94ea2c6b1b31dd7d42792402494781c5446187a8d83","schema_version":"1.0","event_id":"sha256:894a0c4ad654a3d22fe4f94ea2c6b1b31dd7d42792402494781c5446187a8d83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOGI6QXENOCIK66STWZEYKU6EJ/bundle.json","state_url":"https://pith.science/pith/KOGI6QXENOCIK66STWZEYKU6EJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOGI6QXENOCIK66STWZEYKU6EJ/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-04T15:27:18Z","links":{"resolver":"https://pith.science/pith/KOGI6QXENOCIK66STWZEYKU6EJ","bundle":"https://pith.science/pith/KOGI6QXENOCIK66STWZEYKU6EJ/bundle.json","state":"https://pith.science/pith/KOGI6QXENOCIK66STWZEYKU6EJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOGI6QXENOCIK66STWZEYKU6EJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KOGI6QXENOCIK66STWZEYKU6EJ","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":"1bac540ef18027ca642761a497e3af0134ce20a4d2ed5d5d1ee5125ded014bfd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:39:15Z","title_canon_sha256":"2c5f21ad5ebb51e2cee8ec0dd84f56ab956c5b50167e6dcd9c7ba3b7504e3b53"},"schema_version":"1.0","source":{"id":"2606.10110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10110","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10110v1","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10110","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"pith_short_12","alias_value":"KOGI6QXENOCI","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"pith_short_16","alias_value":"KOGI6QXENOCIK66S","created_at":"2026-06-10T01:08:54Z"},{"alias_kind":"pith_short_8","alias_value":"KOGI6QXE","created_at":"2026-06-10T01:08:54Z"}],"graph_snapshots":[{"event_id":"sha256:894a0c4ad654a3d22fe4f94ea2c6b1b31dd7d42792402494781c5446187a8d83","target":"graph","created_at":"2026-06-10T01:08:54Z","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/2606.10110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study finite-sum composite optimization under two departures from classical stochastic gradient descent theory that are central in practice: incremental gradient access and heavy-tailed gradient noise. Specifically, we consider fixed cyclic passes over component gradients and assume that, at the optimum, component gradients have a bounded $q$-th centralized moment for some $q\\in(1,2]$. This setting is much closer to modern ML training practice than the assumptions used in classical SGD theory, yet its theoretical understanding remains limited. We propose a Dual Averaging Power-Prox method f","authors_text":"Jeremy Rack, Sebastian U. Stich, Yuan Gao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:39:15Z","title":"The Dual Averaging Power-Prox Method with Application to Heavy-Tail Incremental Gradient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10110","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:04c7c83da9c7cc000eef12117473de57a96c5f70449a34b33fddb358026a4730","target":"record","created_at":"2026-06-10T01:08:54Z","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":"1bac540ef18027ca642761a497e3af0134ce20a4d2ed5d5d1ee5125ded014bfd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-08T19:39:15Z","title_canon_sha256":"2c5f21ad5ebb51e2cee8ec0dd84f56ab956c5b50167e6dcd9c7ba3b7504e3b53"},"schema_version":"1.0","source":{"id":"2606.10110","kind":"arxiv","version":1}},"canonical_sha256":"538c8f42e46b84857bd29db24c2a9e2253e4fdcaed61b6468e47d89be9082736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"538c8f42e46b84857bd29db24c2a9e2253e4fdcaed61b6468e47d89be9082736","first_computed_at":"2026-06-10T01:08:54.747392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:08:54.747392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HRW/JG3UzS1+/RxLryFCEqR0OOAVzPacs1M3zJA0ZzHa2iU//zoySDI46W6d9fm1X5DbselR0jQ7yK0HBbnfCw==","signature_status":"signed_v1","signed_at":"2026-06-10T01:08:54.748306Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04c7c83da9c7cc000eef12117473de57a96c5f70449a34b33fddb358026a4730","sha256:894a0c4ad654a3d22fe4f94ea2c6b1b31dd7d42792402494781c5446187a8d83"],"state_sha256":"4b2af4a5a32205ea5563f1c2434b068d28c423bb16f48e9ef2a4b6ef54c4a078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jg7zlfd0oFHQjSoPfzsb7z912uE+j+qmKOsC+QIlXqiqVPDl7Q+Budd6y+LLq5tvPY1CO088jJdjzvBGe5dACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T15:27:18.620311Z","bundle_sha256":"5721c854fa1c28a6012f26c0a47edefe113e1b05b2abcf14cabff3c10963e547"}}