{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FOPGNUQD4SHZW2VXVVC5FRHQXE","short_pith_number":"pith:FOPGNUQD","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"},"canonical_sha256":"2b9e66d203e48f9b6ab7ad45d2c4f0b9070cbdae31353699f4904bbbfae3756b","source":{"kind":"arxiv","id":"1111.0194","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0194","created_at":"2026-05-18T03:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0194v2","created_at":"2026-05-18T03:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0194","created_at":"2026-05-18T03:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"FOPGNUQD4SHZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FOPGNUQD4SHZW2VX","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FOPGNUQD","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FOPGNUQD4SHZW2VXVVC5FRHQXE","target":"record","payload":{"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"},"canonical_sha256":"2b9e66d203e48f9b6ab7ad45d2c4f0b9070cbdae31353699f4904bbbfae3756b","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"},"source_kind":"arxiv","source_id":"1111.0194","source_version":2,"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-05-18T03:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DMFCa1l8Rp03etEQYRWZoYJA0YwdckK45Xy0vy/WGGWpoE6dfI8PguryMOvnJSiN/rM4kytj1bShYGblTIiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:35:14.325651Z"},"content_sha256":"2541d10b67dd9920e6c8530caaaaf16466bab27bb2adbb7d7f7711092b39d04d","schema_version":"1.0","event_id":"sha256:2541d10b67dd9920e6c8530caaaaf16466bab27bb2adbb7d7f7711092b39d04d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FOPGNUQD4SHZW2VXVVC5FRHQXE","target":"graph","payload":{"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"},"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-05-18T03:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMVKjeepzFMIproLsc9HLMlvxbJo27Hlwq2eiAOH74XIcA/Yd6cVP5NE2l7i8FKUM9FhcbdjwNdTnThcG7OBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:35:14.326388Z"},"content_sha256":"0d0abdae9d2525359e94d5545569b059f7386a875ba8dfe8fae0f11e41490e39","schema_version":"1.0","event_id":"sha256:0d0abdae9d2525359e94d5545569b059f7386a875ba8dfe8fae0f11e41490e39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/bundle.json","state_url":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/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-06-01T00:35:14Z","links":{"resolver":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE","bundle":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/bundle.json","state":"https://pith.science/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOPGNUQD4SHZW2VXVVC5FRHQXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FOPGNUQD4SHZW2VXVVC5FRHQXE","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":"d430f787f30ef249479a88caf34d5ef3e14918a30adeba013266cd0bf1aaba10","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-11-01T13:08:15Z","title_canon_sha256":"518b2a3610c0351687f2fdcc6f92f3ce6f6310c066198040224b509c4188929f"},"schema_version":"1.0","source":{"id":"1111.0194","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0194","created_at":"2026-05-18T03:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0194v2","created_at":"2026-05-18T03:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0194","created_at":"2026-05-18T03:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"FOPGNUQD4SHZ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FOPGNUQD4SHZW2VX","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FOPGNUQD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:0d0abdae9d2525359e94d5545569b059f7386a875ba8dfe8fae0f11e41490e39","target":"graph","created_at":"2026-05-18T03:55:01Z","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"},"paper":{"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","authors_text":"Bernd G\\\"artner, Christian L. M\\\"uller, Sebastian U. Stich","cross_cats":["cs.DS","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-11-01T13:08:15Z","title":"Optimization of Convex Functions with Random Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0194","kind":"arxiv","version":2},"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:2541d10b67dd9920e6c8530caaaaf16466bab27bb2adbb7d7f7711092b39d04d","target":"record","created_at":"2026-05-18T03:55:01Z","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":"d430f787f30ef249479a88caf34d5ef3e14918a30adeba013266cd0bf1aaba10","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-11-01T13:08:15Z","title_canon_sha256":"518b2a3610c0351687f2fdcc6f92f3ce6f6310c066198040224b509c4188929f"},"schema_version":"1.0","source":{"id":"1111.0194","kind":"arxiv","version":2}},"canonical_sha256":"2b9e66d203e48f9b6ab7ad45d2c4f0b9070cbdae31353699f4904bbbfae3756b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b9e66d203e48f9b6ab7ad45d2c4f0b9070cbdae31353699f4904bbbfae3756b","first_computed_at":"2026-05-18T03:55:01.618717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:01.618717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ABhpcMByqmR3pqk3sCDqPbG+kE5Ue1HQYiaJXBSdRGnkqNKFYZBRgA5PL2aI/urDV3WJjMkABlL5O6+bGPOmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:01.619484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0194","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2541d10b67dd9920e6c8530caaaaf16466bab27bb2adbb7d7f7711092b39d04d","sha256:0d0abdae9d2525359e94d5545569b059f7386a875ba8dfe8fae0f11e41490e39"],"state_sha256":"b4999d449e7c79659bb5beeaaf09f5988aa348230a2ab0af701a9b89fd5cb737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Tk/OqWhHX5VQ8uP6iqcX5Y+OqoWXxYuL/bBSdzmevfL4tobLQsk935O0N65TwyeNKvH0Xu4H9Ote8ITx82YBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:35:14.330542Z","bundle_sha256":"f714e0ac0d402e4f8be483d0e1cbc876a55c6a08a1e3eca9ec8c96eea347e8ef"}}