{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:44RXQ25IFSPZXXJ2FRX6SWDRQA","short_pith_number":"pith:44RXQ25I","schema_version":"1.0","canonical_sha256":"e723786ba82c9f9bdd3a2c6fe95871801d09af36091b30c2621c5c5be29ea9af","source":{"kind":"arxiv","id":"2411.08987","version":2},"attestation_state":"computed","paper":{"title":"Non-Euclidean High-Order Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Crist\\'obal Guzm\\'an, David Mart\\'inez-Rubio, Juan Pablo Contreras","submitted_at":"2024-11-13T19:22:34Z","abstract_excerpt":"We develop algorithms for the optimization of convex objectives that have H\\\"older continuous $q$-th derivatives by using a $q$-th order oracle, for any $q \\geq 1$. Our algorithms work for general norms under mild conditions, including the $\\ell_p$-settings for $1\\leq p\\leq \\infty$. We can also optimize structured functions that allow for inexactly implementing a non-Euclidean ball optimization oracle. We do this by developing a non-Euclidean inexact accelerated proximal point method that makes use of an \\emph{inexact uniformly convex regularizer}. We show a lower bound for general norms that "},"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":"2411.08987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-11-13T19:22:34Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"65087a0a3b944beb1be1739192f6ca9d18b0f42af5312b16b2e22bb3db5ea3aa","abstract_canon_sha256":"9f3b1202d5dc4d4396bdd928e3de0bfb4f708c72623b64cab3119827a369bbb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:28.948158Z","signature_b64":"w7KPktDWW0fE31T4yTo32KQ5d+5XmOeEo//hvolMF7uUy8Wk4cpARttexylY/XzyL6w0mkQ/P1ANYJTATTcgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e723786ba82c9f9bdd3a2c6fe95871801d09af36091b30c2621c5c5be29ea9af","last_reissued_at":"2026-07-05T10:10:28.947756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:28.947756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Euclidean High-Order Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Crist\\'obal Guzm\\'an, David Mart\\'inez-Rubio, Juan Pablo Contreras","submitted_at":"2024-11-13T19:22:34Z","abstract_excerpt":"We develop algorithms for the optimization of convex objectives that have H\\\"older continuous $q$-th derivatives by using a $q$-th order oracle, for any $q \\geq 1$. Our algorithms work for general norms under mild conditions, including the $\\ell_p$-settings for $1\\leq p\\leq \\infty$. We can also optimize structured functions that allow for inexactly implementing a non-Euclidean ball optimization oracle. We do this by developing a non-Euclidean inexact accelerated proximal point method that makes use of an \\emph{inexact uniformly convex regularizer}. We show a lower bound for general norms that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08987","kind":"arxiv","version":2},"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/2411.08987/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":"2411.08987","created_at":"2026-07-05T10:10:28.947810+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08987v2","created_at":"2026-07-05T10:10:28.947810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08987","created_at":"2026-07-05T10:10:28.947810+00:00"},{"alias_kind":"pith_short_12","alias_value":"44RXQ25IFSPZ","created_at":"2026-07-05T10:10:28.947810+00:00"},{"alias_kind":"pith_short_16","alias_value":"44RXQ25IFSPZXXJ2","created_at":"2026-07-05T10:10:28.947810+00:00"},{"alias_kind":"pith_short_8","alias_value":"44RXQ25I","created_at":"2026-07-05T10:10:28.947810+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/44RXQ25IFSPZXXJ2FRX6SWDRQA","json":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA.json","graph_json":"https://pith.science/api/pith-number/44RXQ25IFSPZXXJ2FRX6SWDRQA/graph.json","events_json":"https://pith.science/api/pith-number/44RXQ25IFSPZXXJ2FRX6SWDRQA/events.json","paper":"https://pith.science/paper/44RXQ25I"},"agent_actions":{"view_html":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA","download_json":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA.json","view_paper":"https://pith.science/paper/44RXQ25I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08987&json=true","fetch_graph":"https://pith.science/api/pith-number/44RXQ25IFSPZXXJ2FRX6SWDRQA/graph.json","fetch_events":"https://pith.science/api/pith-number/44RXQ25IFSPZXXJ2FRX6SWDRQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA/action/storage_attestation","attest_author":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA/action/author_attestation","sign_citation":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA/action/citation_signature","submit_replication":"https://pith.science/pith/44RXQ25IFSPZXXJ2FRX6SWDRQA/action/replication_record"}},"created_at":"2026-07-05T10:10:28.947810+00:00","updated_at":"2026-07-05T10:10:28.947810+00:00"}