{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3747VX2DCBBXZHP72BIG56SL3W","short_pith_number":"pith:3747VX2D","schema_version":"1.0","canonical_sha256":"dff9fadf4310437c9dffd0506efa4bdd82f87722a86e1194b50c106ab134df26","source":{"kind":"arxiv","id":"2607.26969","version":1},"attestation_state":"computed","paper":{"title":"Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Evgeniy Kovalev, Fedor Stonyakin","submitted_at":"2026-07-29T14:31:24Z","abstract_excerpt":"Generalized smoothness, such as (L0, L1)-smoothness, have recently attracted considerable attention due to their ability to model optimization problems arising in modern machine and deep learning, where the classical Lipschitz assumptions of the gradient is often violated. At the same time, computing exact gradients may be impractical or computationally expensive in many applications. In this work, we study convex (L0, L1)-smooth optimization under access only to a normalized approximation recently proposed Comparison Oracle, which returns an inexact normalized gradient in linear time with a b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.26969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-29T14:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"76ef496319e6bdf2e823d50d755a3483308a40bf746914ee4bf3fb6c9e990529","abstract_canon_sha256":"c11598d70e32e1463666649fb8a20c7a8b6573ee56da23da8864ff1666681062"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff9fadf4310437c9dffd0506efa4bdd82f87722a86e1194b50c106ab134df26","last_reissued_at":"2026-07-30T01:23:11.929762Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:11.929762Z"},"graph_snapshot":{"paper":{"title":"Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Evgeniy Kovalev, Fedor Stonyakin","submitted_at":"2026-07-29T14:31:24Z","abstract_excerpt":"Generalized smoothness, such as (L0, L1)-smoothness, have recently attracted considerable attention due to their ability to model optimization problems arising in modern machine and deep learning, where the classical Lipschitz assumptions of the gradient is often violated. At the same time, computing exact gradients may be impractical or computationally expensive in many applications. In this work, we study convex (L0, L1)-smooth optimization under access only to a normalized approximation recently proposed Comparison Oracle, which returns an inexact normalized gradient in linear time with a b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26969","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/2607.26969/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.26969","created_at":"2026-07-30T01:23:11.934863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.26969v1","created_at":"2026-07-30T01:23:11.934863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26969","created_at":"2026-07-30T01:23:11.934863+00:00"},{"alias_kind":"pith_short_12","alias_value":"3747VX2DCBBX","created_at":"2026-07-30T01:23:11.934863+00:00"},{"alias_kind":"pith_short_16","alias_value":"3747VX2DCBBXZHP7","created_at":"2026-07-30T01:23:11.934863+00:00"},{"alias_kind":"pith_short_8","alias_value":"3747VX2D","created_at":"2026-07-30T01:23:11.934863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W","json":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W.json","graph_json":"https://pith.science/api/pith-number/3747VX2DCBBXZHP72BIG56SL3W/graph.json","events_json":"https://pith.science/api/pith-number/3747VX2DCBBXZHP72BIG56SL3W/events.json","paper":"https://pith.science/paper/3747VX2D"},"agent_actions":{"view_html":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W","download_json":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W.json","view_paper":"https://pith.science/paper/3747VX2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.26969&json=true","fetch_graph":"https://pith.science/api/pith-number/3747VX2DCBBXZHP72BIG56SL3W/graph.json","fetch_events":"https://pith.science/api/pith-number/3747VX2DCBBXZHP72BIG56SL3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W/action/storage_attestation","attest_author":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W/action/author_attestation","sign_citation":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W/action/citation_signature","submit_replication":"https://pith.science/pith/3747VX2DCBBXZHP72BIG56SL3W/action/replication_record"}},"created_at":"2026-07-30T01:23:11.934863+00:00","updated_at":"2026-07-30T01:23:11.934863+00:00"}