{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:65VJMABTPHUXXODJ3Y2DRY5HLM","short_pith_number":"pith:65VJMABT","schema_version":"1.0","canonical_sha256":"f76a96003379e97bb869de3438e3a75b21adb85fced20a3691ed82bcb8df065e","source":{"kind":"arxiv","id":"2411.16745","version":1},"attestation_state":"computed","paper":{"title":"On quasi-convex smooth optimization problems by a comparison oracle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"A. V. Gasnikov, A. V. Lobanov, F. S. Stonyakin, I. A. Kuruzov, M. S. Alkousa, S. R. Singh, Y. V. Dorn","submitted_at":"2024-11-23T20:24:56Z","abstract_excerpt":"Frequently, when dealing with many machine learning models, optimization problems appear to be challenging due to a limited understanding of the constructions and characterizations of the objective functions in these problems. Therefore, major complications arise when dealing with first-order algorithms, in which gradient computations are challenging or even impossible in various scenarios. For this reason, we resort to derivative-free methods (zeroth-order methods). This paper is devoted to an approach to minimizing quasi-convex functions using a recently proposed comparison oracle only. This"},"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.16745","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-23T20:24:56Z","cross_cats_sorted":[],"title_canon_sha256":"5f6bd74b45a1e67d6c162e5d30839cad96737da68f2b9f17b5e82a7666f39d2e","abstract_canon_sha256":"f74fe05dbd26de9f00052246191dc14f1e59e50f045a92dc7fa6eefacb226e9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:22.738858Z","signature_b64":"KJair9lLIN4UebJ0fdYMMVwVHJIPmmStsrNH/Qkj9rL3Zx1sE/VuCXxA2n3tIwjtS7xUIRcDEITN40EZfmQ/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f76a96003379e97bb869de3438e3a75b21adb85fced20a3691ed82bcb8df065e","last_reissued_at":"2026-07-05T09:40:22.738472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:22.738472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On quasi-convex smooth optimization problems by a comparison oracle","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"A. V. Gasnikov, A. V. Lobanov, F. S. Stonyakin, I. A. Kuruzov, M. S. Alkousa, S. R. Singh, Y. V. Dorn","submitted_at":"2024-11-23T20:24:56Z","abstract_excerpt":"Frequently, when dealing with many machine learning models, optimization problems appear to be challenging due to a limited understanding of the constructions and characterizations of the objective functions in these problems. Therefore, major complications arise when dealing with first-order algorithms, in which gradient computations are challenging or even impossible in various scenarios. For this reason, we resort to derivative-free methods (zeroth-order methods). This paper is devoted to an approach to minimizing quasi-convex functions using a recently proposed comparison oracle only. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16745","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/2411.16745/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.16745","created_at":"2026-07-05T09:40:22.738530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16745v1","created_at":"2026-07-05T09:40:22.738530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16745","created_at":"2026-07-05T09:40:22.738530+00:00"},{"alias_kind":"pith_short_12","alias_value":"65VJMABTPHUX","created_at":"2026-07-05T09:40:22.738530+00:00"},{"alias_kind":"pith_short_16","alias_value":"65VJMABTPHUXXODJ","created_at":"2026-07-05T09:40:22.738530+00:00"},{"alias_kind":"pith_short_8","alias_value":"65VJMABT","created_at":"2026-07-05T09:40:22.738530+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/65VJMABTPHUXXODJ3Y2DRY5HLM","json":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM.json","graph_json":"https://pith.science/api/pith-number/65VJMABTPHUXXODJ3Y2DRY5HLM/graph.json","events_json":"https://pith.science/api/pith-number/65VJMABTPHUXXODJ3Y2DRY5HLM/events.json","paper":"https://pith.science/paper/65VJMABT"},"agent_actions":{"view_html":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM","download_json":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM.json","view_paper":"https://pith.science/paper/65VJMABT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16745&json=true","fetch_graph":"https://pith.science/api/pith-number/65VJMABTPHUXXODJ3Y2DRY5HLM/graph.json","fetch_events":"https://pith.science/api/pith-number/65VJMABTPHUXXODJ3Y2DRY5HLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/action/storage_attestation","attest_author":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/action/author_attestation","sign_citation":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/action/citation_signature","submit_replication":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/action/replication_record"}},"created_at":"2026-07-05T09:40:22.738530+00:00","updated_at":"2026-07-05T09:40:22.738530+00:00"}