{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FOPGNUQD4SHZW2VXVVC5FRHQXE","short_pith_number":"pith:FOPGNUQD","schema_version":"1.0","canonical_sha256":"2b9e66d203e48f9b6ab7ad45d2c4f0b9070cbdae31353699f4904bbbfae3756b","source":{"kind":"arxiv","id":"1111.0194","version":2},"attestation_state":"computed","paper":{"title":"Optimization of Convex Functions with Random Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Bernd G\\\"artner, Christian L. M\\\"uller, Sebastian U. Stich","submitted_at":"2011-11-01T13:08:15Z","abstract_excerpt":"We consider unconstrained randomized optimization of convex objective functions. We analyze the Random Pursuit algorithm, which iteratively computes an approximate solution to the optimization problem by repeated optimization over a randomly chosen one-dimensional subspace. This randomized method only uses zeroth-order information about the objective function and does not need any problem-specific parametrization. We prove convergence and give convergence rates for smooth objectives assuming that the one-dimensional optimization can be solved exactly or approximately by an oracle. A convenient"},"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":"1111.0194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-11-01T13:08:15Z","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"title_canon_sha256":"518b2a3610c0351687f2fdcc6f92f3ce6f6310c066198040224b509c4188929f","abstract_canon_sha256":"d430f787f30ef249479a88caf34d5ef3e14918a30adeba013266cd0bf1aaba10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:01.619484Z","signature_b64":"ABhpcMByqmR3pqk3sCDqPbG+kE5Ue1HQYiaJXBSdRGnkqNKFYZBRgA5PL2aI/urDV3WJjMkABlL5O6+bGPOmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b9e66d203e48f9b6ab7ad45d2c4f0b9070cbdae31353699f4904bbbfae3756b","last_reissued_at":"2026-05-18T03:55:01.618717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:01.618717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Convex Functions with Random Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Bernd G\\\"artner, Christian L. M\\\"uller, Sebastian U. Stich","submitted_at":"2011-11-01T13:08:15Z","abstract_excerpt":"We consider unconstrained randomized optimization of convex objective functions. We analyze the Random Pursuit algorithm, which iteratively computes an approximate solution to the optimization problem by repeated optimization over a randomly chosen one-dimensional subspace. This randomized method only uses zeroth-order information about the objective function and does not need any problem-specific parametrization. We prove convergence and give convergence rates for smooth objectives assuming that the one-dimensional optimization can be solved exactly or approximately by an oracle. A convenient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0194","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":""},"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":"1111.0194","created_at":"2026-05-18T03:55:01.618834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0194v2","created_at":"2026-05-18T03:55:01.618834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0194","created_at":"2026-05-18T03:55:01.618834+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOPGNUQD4SHZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOPGNUQD4SHZW2VX","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOPGNUQD","created_at":"2026-05-18T12:26:28.662955+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/FOPGNUQD4SHZW2VXVVC5FRHQXE","json":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE.json","graph_json":"https://pith.science/api/pith-number/FOPGNUQD4SHZW2VXVVC5FRHQXE/graph.json","events_json":"https://pith.science/api/pith-number/FOPGNUQD4SHZW2VXVVC5FRHQXE/events.json","paper":"https://pith.science/paper/FOPGNUQD"},"agent_actions":{"view_html":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE","download_json":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE.json","view_paper":"https://pith.science/paper/FOPGNUQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0194&json=true","fetch_graph":"https://pith.science/api/pith-number/FOPGNUQD4SHZW2VXVVC5FRHQXE/graph.json","fetch_events":"https://pith.science/api/pith-number/FOPGNUQD4SHZW2VXVVC5FRHQXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/action/storage_attestation","attest_author":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/action/author_attestation","sign_citation":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/action/citation_signature","submit_replication":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/action/replication_record"}},"created_at":"2026-05-18T03:55:01.618834+00:00","updated_at":"2026-05-18T03:55:01.618834+00:00"}