{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UWUP2XSP6RD4WL62YRYWDOQXJS","short_pith_number":"pith:UWUP2XSP","schema_version":"1.0","canonical_sha256":"a5a8fd5e4ff447cb2fdac47161ba174c9ec697349057b9e747217fb3066120ba","source":{"kind":"arxiv","id":"2511.07341","version":2},"attestation_state":"computed","paper":{"title":"Universal Reduced-Operator Method and High-Order Global Curvature Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikita Doikov, Yurii Nesterov","submitted_at":"2025-11-10T17:42:46Z","abstract_excerpt":"In this paper, we develop a new concept of Global Curvature Bound (GCB) for an arbitrary nonlinear operator between abstract metric spaces. We use this notion to characterize the global complexity of high-order algorithms solving composite variational problems, which include convex minimization and min-max problems. We develop the new universal Reduced-Operator Method, which automatically achieves the fastest universal rate within our class, while our analysis does not need any specific assumptions about smoothness of the target nonlinear operator. Every step of our universal method of order $"},"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":"2511.07341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-11-10T17:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"cb2da7245bc1c851d0153d98a31b94e773543a3186750379421007a3f2d06919","abstract_canon_sha256":"7adda50488a322391ec5ed05716edf836ab0f3b25179eb53bc554c003e9ec540"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:18.355534Z","signature_b64":"+jr+ARz/+BYIXNsLFBQ5k/B6hDXGbLpvKURcdkeXWfvUqGvtI9LS2+lv7VMiz0nrRqOWFJF8XLTUD8nvXO6wBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5a8fd5e4ff447cb2fdac47161ba174c9ec697349057b9e747217fb3066120ba","last_reissued_at":"2026-07-23T01:24:18.354597Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:18.354597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Reduced-Operator Method and High-Order Global Curvature Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikita Doikov, Yurii Nesterov","submitted_at":"2025-11-10T17:42:46Z","abstract_excerpt":"In this paper, we develop a new concept of Global Curvature Bound (GCB) for an arbitrary nonlinear operator between abstract metric spaces. We use this notion to characterize the global complexity of high-order algorithms solving composite variational problems, which include convex minimization and min-max problems. We develop the new universal Reduced-Operator Method, which automatically achieves the fastest universal rate within our class, while our analysis does not need any specific assumptions about smoothness of the target nonlinear operator. Every step of our universal method of order $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.07341","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/2511.07341/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":"2511.07341","created_at":"2026-07-23T01:24:18.355047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.07341v2","created_at":"2026-07-23T01:24:18.355047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.07341","created_at":"2026-07-23T01:24:18.355047+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWUP2XSP6RD4","created_at":"2026-07-23T01:24:18.355047+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWUP2XSP6RD4WL62","created_at":"2026-07-23T01:24:18.355047+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWUP2XSP","created_at":"2026-07-23T01:24:18.355047+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/UWUP2XSP6RD4WL62YRYWDOQXJS","json":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS.json","graph_json":"https://pith.science/api/pith-number/UWUP2XSP6RD4WL62YRYWDOQXJS/graph.json","events_json":"https://pith.science/api/pith-number/UWUP2XSP6RD4WL62YRYWDOQXJS/events.json","paper":"https://pith.science/paper/UWUP2XSP"},"agent_actions":{"view_html":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS","download_json":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS.json","view_paper":"https://pith.science/paper/UWUP2XSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.07341&json=true","fetch_graph":"https://pith.science/api/pith-number/UWUP2XSP6RD4WL62YRYWDOQXJS/graph.json","fetch_events":"https://pith.science/api/pith-number/UWUP2XSP6RD4WL62YRYWDOQXJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS/action/storage_attestation","attest_author":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS/action/author_attestation","sign_citation":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS/action/citation_signature","submit_replication":"https://pith.science/pith/UWUP2XSP6RD4WL62YRYWDOQXJS/action/replication_record"}},"created_at":"2026-07-23T01:24:18.355047+00:00","updated_at":"2026-07-23T01:24:18.355047+00:00"}