{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:65VJMABTPHUXXODJ3Y2DRY5HLM","short_pith_number":"pith:65VJMABT","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"},"canonical_sha256":"f76a96003379e97bb869de3438e3a75b21adb85fced20a3691ed82bcb8df065e","source":{"kind":"arxiv","id":"2411.16745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16745","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16745v1","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16745","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"65VJMABTPHUX","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"pith_short_16","alias_value":"65VJMABTPHUXXODJ","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"pith_short_8","alias_value":"65VJMABT","created_at":"2026-07-05T09:40:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:65VJMABTPHUXXODJ3Y2DRY5HLM","target":"record","payload":{"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"},"canonical_sha256":"f76a96003379e97bb869de3438e3a75b21adb85fced20a3691ed82bcb8df065e","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"},"source_kind":"arxiv","source_id":"2411.16745","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-05T09:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4NI6mWn3zEaDXBqsqelgkkKHc2pYhJSg/b5xJeyfRSxSxdSHgXtzxbRiDlLN9onVQdbgzNUxZzcboPSnfxKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:21:52.813937Z"},"content_sha256":"f62bae6118aa6f176e389a8511237a0387502d089de4d64367fcd2d3399e4d21","schema_version":"1.0","event_id":"sha256:f62bae6118aa6f176e389a8511237a0387502d089de4d64367fcd2d3399e4d21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:65VJMABTPHUXXODJ3Y2DRY5HLM","target":"graph","payload":{"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"},"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-05T09:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXmemkjIQF/vJ14dVk4laes+wjOQvig2KxALihgt4GgsktBU5ER9446wLhsXyh6x+4hkBwwYSc49y1NVOixVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:21:52.814483Z"},"content_sha256":"ec82318bea92ec09447d06598aaa15321f0b8d5b21113382b155493c1b6f182d","schema_version":"1.0","event_id":"sha256:ec82318bea92ec09447d06598aaa15321f0b8d5b21113382b155493c1b6f182d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/bundle.json","state_url":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/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-13T08:21:52Z","links":{"resolver":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM","bundle":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/bundle.json","state":"https://pith.science/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65VJMABTPHUXXODJ3Y2DRY5HLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:65VJMABTPHUXXODJ3Y2DRY5HLM","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":"f74fe05dbd26de9f00052246191dc14f1e59e50f045a92dc7fa6eefacb226e9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-23T20:24:56Z","title_canon_sha256":"5f6bd74b45a1e67d6c162e5d30839cad96737da68f2b9f17b5e82a7666f39d2e"},"schema_version":"1.0","source":{"id":"2411.16745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16745","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16745v1","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16745","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"65VJMABTPHUX","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"pith_short_16","alias_value":"65VJMABTPHUXXODJ","created_at":"2026-07-05T09:40:22Z"},{"alias_kind":"pith_short_8","alias_value":"65VJMABT","created_at":"2026-07-05T09:40:22Z"}],"graph_snapshots":[{"event_id":"sha256:ec82318bea92ec09447d06598aaa15321f0b8d5b21113382b155493c1b6f182d","target":"graph","created_at":"2026-07-05T09:40:22Z","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/2411.16745/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"A. V. Gasnikov, A. V. Lobanov, F. S. Stonyakin, I. A. Kuruzov, M. S. Alkousa, S. R. Singh, Y. V. Dorn","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-23T20:24:56Z","title":"On quasi-convex smooth optimization problems by a comparison oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16745","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:f62bae6118aa6f176e389a8511237a0387502d089de4d64367fcd2d3399e4d21","target":"record","created_at":"2026-07-05T09:40:22Z","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":"f74fe05dbd26de9f00052246191dc14f1e59e50f045a92dc7fa6eefacb226e9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-23T20:24:56Z","title_canon_sha256":"5f6bd74b45a1e67d6c162e5d30839cad96737da68f2b9f17b5e82a7666f39d2e"},"schema_version":"1.0","source":{"id":"2411.16745","kind":"arxiv","version":1}},"canonical_sha256":"f76a96003379e97bb869de3438e3a75b21adb85fced20a3691ed82bcb8df065e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f76a96003379e97bb869de3438e3a75b21adb85fced20a3691ed82bcb8df065e","first_computed_at":"2026-07-05T09:40:22.738472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:22.738472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KJair9lLIN4UebJ0fdYMMVwVHJIPmmStsrNH/Qkj9rL3Zx1sE/VuCXxA2n3tIwjtS7xUIRcDEITN40EZfmQ/Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:22.738858Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f62bae6118aa6f176e389a8511237a0387502d089de4d64367fcd2d3399e4d21","sha256:ec82318bea92ec09447d06598aaa15321f0b8d5b21113382b155493c1b6f182d"],"state_sha256":"4b3d02bea3f287e3175ed3fcf8fc1b0a0c8e133b693af60b3d7513036d3466a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c03DumWwGeUfh9P/FDC1Bfr31Tek/MKVAQ7r9jduNUqXAf8bodT42IHdFA/D/rpUDOSJGMcbJJN4ykrTX7GGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:21:52.818317Z","bundle_sha256":"a0ebc82b953938c4bb8347376f0021d87e3ef86099c72aa12465327629760a1d"}}