{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TVRRAMPHRM3FR53WMUZKYPPHIX","short_pith_number":"pith:TVRRAMPH","canonical_record":{"source":{"id":"2505.04599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-07T17:40:12Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"262f72becce754ad8e1f306e2796f090d9f8e22942f421fd81303f09b0de5212","abstract_canon_sha256":"3d381b44913e863fe54ddf05cf8178167e880cba5836471d5e414e11021bd524"},"schema_version":"1.0"},"canonical_sha256":"9d631031e78b3658f7766532ac3de745f47a18ec0ae97fe1d9b937c3e9baf8ac","source":{"kind":"arxiv","id":"2505.04599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04599","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04599v1","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04599","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"TVRRAMPHRM3F","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"pith_short_16","alias_value":"TVRRAMPHRM3FR53W","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"pith_short_8","alias_value":"TVRRAMPH","created_at":"2026-07-05T11:00:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TVRRAMPHRM3FR53WMUZKYPPHIX","target":"record","payload":{"canonical_record":{"source":{"id":"2505.04599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-07T17:40:12Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"262f72becce754ad8e1f306e2796f090d9f8e22942f421fd81303f09b0de5212","abstract_canon_sha256":"3d381b44913e863fe54ddf05cf8178167e880cba5836471d5e414e11021bd524"},"schema_version":"1.0"},"canonical_sha256":"9d631031e78b3658f7766532ac3de745f47a18ec0ae97fe1d9b937c3e9baf8ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:10.464065Z","signature_b64":"2KXESCAD2eHM8l98ylccgWLSqLknry+AnU0Af5f0KsRNMQYmSVcY7W6IdvjzzVrcSV2d8kO5LvCztblhkInZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d631031e78b3658f7766532ac3de745f47a18ec0ae97fe1d9b937c3e9baf8ac","last_reissued_at":"2026-07-05T11:00:10.463512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:10.463512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.04599","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-05T11:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O44Jd/b+Fr15zJlFJfSxFhnfFcyZ/EfiBcAPyYivDxCcQHLEQ6AfEEJrP7QflWgLbQ82wI3xVHMDipAkrHAZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:13:15.649957Z"},"content_sha256":"a579629cb64d2e6a521e658b5a789f3154698432b0619fcd5ce6a09cfd4fda1e","schema_version":"1.0","event_id":"sha256:a579629cb64d2e6a521e658b5a789f3154698432b0619fcd5ce6a09cfd4fda1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TVRRAMPHRM3FR53WMUZKYPPHIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Michael Crawshaw, Mingrui Liu","submitted_at":"2025-05-07T17:40:12Z","abstract_excerpt":"Recent results in non-convex stochastic optimization demonstrate the convergence of popular adaptive algorithms (e.g., AdaGrad) under the $(L_0, L_1)$-smoothness condition, but the rate of convergence is a higher-order polynomial in terms of problem parameters like the smoothness constants. The complexity guaranteed by such algorithms to find an $\\epsilon$-stationary point may be significantly larger than the optimal complexity of $\\Theta \\left( \\Delta L \\sigma^2 \\epsilon^{-4} \\right)$ achieved by SGD in the $L$-smooth setting, where $\\Delta$ is the initial optimality gap, $\\sigma^2$ is the va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04599","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/2505.04599/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-05T11:00:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/b5mndj+IN4jrzF6k1yquZ2cSXhv8z0J2ECqBbXwAJBmbBahZnQ9gVzNru3PlY6KsYQyZ/U7TFUf9BMt4aAMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:13:15.650552Z"},"content_sha256":"17891b562073fe0923172b6251518b3f8dc75f7801d6828e11edf36c2b507434","schema_version":"1.0","event_id":"sha256:17891b562073fe0923172b6251518b3f8dc75f7801d6828e11edf36c2b507434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVRRAMPHRM3FR53WMUZKYPPHIX/bundle.json","state_url":"https://pith.science/pith/TVRRAMPHRM3FR53WMUZKYPPHIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVRRAMPHRM3FR53WMUZKYPPHIX/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-16T17:13:15Z","links":{"resolver":"https://pith.science/pith/TVRRAMPHRM3FR53WMUZKYPPHIX","bundle":"https://pith.science/pith/TVRRAMPHRM3FR53WMUZKYPPHIX/bundle.json","state":"https://pith.science/pith/TVRRAMPHRM3FR53WMUZKYPPHIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVRRAMPHRM3FR53WMUZKYPPHIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TVRRAMPHRM3FR53WMUZKYPPHIX","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":"3d381b44913e863fe54ddf05cf8178167e880cba5836471d5e414e11021bd524","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-07T17:40:12Z","title_canon_sha256":"262f72becce754ad8e1f306e2796f090d9f8e22942f421fd81303f09b0de5212"},"schema_version":"1.0","source":{"id":"2505.04599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04599","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04599v1","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04599","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"pith_short_12","alias_value":"TVRRAMPHRM3F","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"pith_short_16","alias_value":"TVRRAMPHRM3FR53W","created_at":"2026-07-05T11:00:10Z"},{"alias_kind":"pith_short_8","alias_value":"TVRRAMPH","created_at":"2026-07-05T11:00:10Z"}],"graph_snapshots":[{"event_id":"sha256:17891b562073fe0923172b6251518b3f8dc75f7801d6828e11edf36c2b507434","target":"graph","created_at":"2026-07-05T11:00:10Z","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/2505.04599/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent results in non-convex stochastic optimization demonstrate the convergence of popular adaptive algorithms (e.g., AdaGrad) under the $(L_0, L_1)$-smoothness condition, but the rate of convergence is a higher-order polynomial in terms of problem parameters like the smoothness constants. The complexity guaranteed by such algorithms to find an $\\epsilon$-stationary point may be significantly larger than the optimal complexity of $\\Theta \\left( \\Delta L \\sigma^2 \\epsilon^{-4} \\right)$ achieved by SGD in the $L$-smooth setting, where $\\Delta$ is the initial optimality gap, $\\sigma^2$ is the va","authors_text":"Michael Crawshaw, Mingrui Liu","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-07T17:40:12Z","title":"Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04599","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:a579629cb64d2e6a521e658b5a789f3154698432b0619fcd5ce6a09cfd4fda1e","target":"record","created_at":"2026-07-05T11:00:10Z","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":"3d381b44913e863fe54ddf05cf8178167e880cba5836471d5e414e11021bd524","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-07T17:40:12Z","title_canon_sha256":"262f72becce754ad8e1f306e2796f090d9f8e22942f421fd81303f09b0de5212"},"schema_version":"1.0","source":{"id":"2505.04599","kind":"arxiv","version":1}},"canonical_sha256":"9d631031e78b3658f7766532ac3de745f47a18ec0ae97fe1d9b937c3e9baf8ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d631031e78b3658f7766532ac3de745f47a18ec0ae97fe1d9b937c3e9baf8ac","first_computed_at":"2026-07-05T11:00:10.463512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:00:10.463512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2KXESCAD2eHM8l98ylccgWLSqLknry+AnU0Af5f0KsRNMQYmSVcY7W6IdvjzzVrcSV2d8kO5LvCztblhkInZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:00:10.464065Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.04599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a579629cb64d2e6a521e658b5a789f3154698432b0619fcd5ce6a09cfd4fda1e","sha256:17891b562073fe0923172b6251518b3f8dc75f7801d6828e11edf36c2b507434"],"state_sha256":"8a982cebcecdf1ff6e775db3ab48975ab12f54fe3c4690a0d4177351b8597413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imYxGfRmUT69tkpnUXHs3FqSdkJA2/WXjNL8qJ9B64YQqqlulnZh9fUF+6BqQ3DC+l0gj17Ult69HXIrYMa6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:13:15.660391Z","bundle_sha256":"9318df046f0e1f92788ad827ba822542584e46e10647fdaf37ee6ec88a620649"}}