{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SPB56X4WI7QM3OU2FVTD5JTWUS","short_pith_number":"pith:SPB56X4W","canonical_record":{"source":{"id":"1406.2010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-08T18:24:08Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d6d12be97d4d38fcdeee23141a0934eeca6b4c0d5fe18ff68187eb0bbc84c6cf","abstract_canon_sha256":"56f58ddf4c51253157fe6a2e04b26c5526780503f291a280396a81cb50574650"},"schema_version":"1.0"},"canonical_sha256":"93c3df5f9647e0cdba9a2d663ea676a48a371cdde51ccbe30eed33dbf773c2c6","source":{"kind":"arxiv","id":"1406.2010","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2010","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2010v2","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2010","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"SPB56X4WI7QM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SPB56X4WI7QM3OU2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SPB56X4W","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SPB56X4WI7QM3OU2FVTD5JTWUS","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-08T18:24:08Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d6d12be97d4d38fcdeee23141a0934eeca6b4c0d5fe18ff68187eb0bbc84c6cf","abstract_canon_sha256":"56f58ddf4c51253157fe6a2e04b26c5526780503f291a280396a81cb50574650"},"schema_version":"1.0"},"canonical_sha256":"93c3df5f9647e0cdba9a2d663ea676a48a371cdde51ccbe30eed33dbf773c2c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.341851Z","signature_b64":"Ld6i3uBJDQMiDJ5MDQ+zmtFlJrMOCDPKr0qcTAtvjNgtjrWvcIy3fy5Xq2T8Uyi0P6zwd4SR7RoGt2YbwTQ3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c3df5f9647e0cdba9a2d663ea676a48a371cdde51ccbe30eed33dbf773c2c6","last_reissued_at":"2026-05-18T02:49:53.341426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.341426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2010","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-18T02:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FnBspbjuMjOkL20WS+rbBRHkmVtYP+FeOuE7xmYi5MKqnR4z7gdJ4VVz2L+sUhXh7DSUQbcdxkVNh+aCnfECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:40.773946Z"},"content_sha256":"d57c7ff016fb7cfec2a5b9f5348910e029661f9629483646b85132ead2a844ca","schema_version":"1.0","event_id":"sha256:d57c7ff016fb7cfec2a5b9f5348910e029661f9629483646b85132ead2a844ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SPB56X4WI7QM3OU2FVTD5JTWUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On low complexity Acceleration Techniques for Randomized Optimization: Supplementary Online Material","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Sebastian U. Stich","submitted_at":"2014-06-08T18:24:08Z","abstract_excerpt":"Recently it was shown by Nesterov (2011) that techniques form convex optimization can be used to successfully accelerate simple derivative-free randomized optimization methods. The appeal of those schemes lies in their low complexity, which is only $\\Theta(n)$ per iteration---compared to $\\Theta(n^2)$ for algorithms storing second-order information or covariance matrices. From a high-level point of view, those accelerated schemes employ correlations between successive iterates---a concept looking similar to the evolution path used in Covariance Matrix Adaptation Evolution Strategies (CMA-ES).\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2010","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-18T02:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoJ2JKXDhJ1kpOzozQdTjuzlXTS4occGpzBZOJw5Pey92ua102k4ZMncIDdE43Ac+X/miaSnZDaB/QH3R8K2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:40.774632Z"},"content_sha256":"41cadb3325740e06a1be1e13fa201df34eb1f36285bf45785ac2fd07eb8a2007","schema_version":"1.0","event_id":"sha256:41cadb3325740e06a1be1e13fa201df34eb1f36285bf45785ac2fd07eb8a2007"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPB56X4WI7QM3OU2FVTD5JTWUS/bundle.json","state_url":"https://pith.science/pith/SPB56X4WI7QM3OU2FVTD5JTWUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPB56X4WI7QM3OU2FVTD5JTWUS/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-05-31T23:22:40Z","links":{"resolver":"https://pith.science/pith/SPB56X4WI7QM3OU2FVTD5JTWUS","bundle":"https://pith.science/pith/SPB56X4WI7QM3OU2FVTD5JTWUS/bundle.json","state":"https://pith.science/pith/SPB56X4WI7QM3OU2FVTD5JTWUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPB56X4WI7QM3OU2FVTD5JTWUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SPB56X4WI7QM3OU2FVTD5JTWUS","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":"56f58ddf4c51253157fe6a2e04b26c5526780503f291a280396a81cb50574650","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-08T18:24:08Z","title_canon_sha256":"d6d12be97d4d38fcdeee23141a0934eeca6b4c0d5fe18ff68187eb0bbc84c6cf"},"schema_version":"1.0","source":{"id":"1406.2010","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2010","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2010v2","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2010","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"SPB56X4WI7QM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SPB56X4WI7QM3OU2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SPB56X4W","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:41cadb3325740e06a1be1e13fa201df34eb1f36285bf45785ac2fd07eb8a2007","target":"graph","created_at":"2026-05-18T02:49:53Z","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":"Recently it was shown by Nesterov (2011) that techniques form convex optimization can be used to successfully accelerate simple derivative-free randomized optimization methods. The appeal of those schemes lies in their low complexity, which is only $\\Theta(n)$ per iteration---compared to $\\Theta(n^2)$ for algorithms storing second-order information or covariance matrices. From a high-level point of view, those accelerated schemes employ correlations between successive iterates---a concept looking similar to the evolution path used in Covariance Matrix Adaptation Evolution Strategies (CMA-ES).\n","authors_text":"Sebastian U. Stich","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-08T18:24:08Z","title":"On low complexity Acceleration Techniques for Randomized Optimization: Supplementary Online Material"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2010","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:d57c7ff016fb7cfec2a5b9f5348910e029661f9629483646b85132ead2a844ca","target":"record","created_at":"2026-05-18T02:49:53Z","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":"56f58ddf4c51253157fe6a2e04b26c5526780503f291a280396a81cb50574650","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-08T18:24:08Z","title_canon_sha256":"d6d12be97d4d38fcdeee23141a0934eeca6b4c0d5fe18ff68187eb0bbc84c6cf"},"schema_version":"1.0","source":{"id":"1406.2010","kind":"arxiv","version":2}},"canonical_sha256":"93c3df5f9647e0cdba9a2d663ea676a48a371cdde51ccbe30eed33dbf773c2c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93c3df5f9647e0cdba9a2d663ea676a48a371cdde51ccbe30eed33dbf773c2c6","first_computed_at":"2026-05-18T02:49:53.341426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:53.341426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ld6i3uBJDQMiDJ5MDQ+zmtFlJrMOCDPKr0qcTAtvjNgtjrWvcIy3fy5Xq2T8Uyi0P6zwd4SR7RoGt2YbwTQ3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:53.341851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2010","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d57c7ff016fb7cfec2a5b9f5348910e029661f9629483646b85132ead2a844ca","sha256:41cadb3325740e06a1be1e13fa201df34eb1f36285bf45785ac2fd07eb8a2007"],"state_sha256":"4eeff06e2160ad2be709221e717debb73f011996a06d48866e1b23299c46bcd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9b6PDo/xyacNSC5mM73M2sZIYKDuVq0Qv0ae2zDWjEj3SuFQACXvkIZ4hGP0dCBMUWSxEwna6zl4I6ml1SBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:22:40.778178Z","bundle_sha256":"b81281f05fb4ab9bd16066693ff0eb84f429d1ff67fadcb4623b4f8a7a2f1a92"}}