{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UVJFY4EOJ2KC3U3ZKEB5KDQV5P","short_pith_number":"pith:UVJFY4EO","canonical_record":{"source":{"id":"1504.02089","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-08T19:54:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b84ecd48117d08d5032bd667ac51267305ad90d55d9866b773844c1cb677f0ed","abstract_canon_sha256":"079c051a09d20dece5ab56d3154c8a0d3aedd351f17425e45656a77b10f65365"},"schema_version":"1.0"},"canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","source":{"kind":"arxiv","id":"1504.02089","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02089","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02089v4","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02089","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"UVJFY4EOJ2KC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVJFY4EOJ2KC3U3Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVJFY4EO","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UVJFY4EOJ2KC3U3ZKEB5KDQV5P","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02089","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-08T19:54:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b84ecd48117d08d5032bd667ac51267305ad90d55d9866b773844c1cb677f0ed","abstract_canon_sha256":"079c051a09d20dece5ab56d3154c8a0d3aedd351f17425e45656a77b10f65365"},"schema_version":"1.0"},"canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:49.177789Z","signature_b64":"JcSpmNuQpoSf1Sb+o3+31q0JboMqiGNPObGGtwe7OpNpKEWnuPfNdOFL1naSck3lgiW++eFqq+zn6joESJD+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","last_reissued_at":"2026-05-18T01:21:49.177261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:49.177261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02089","source_version":4,"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-18T01:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXgM9d1sChRvqYdQUoay+5z2kYPwgskeEFS6xAedfo8j43y9da1Xc4yTmbmeIUyDcdvCFtnjisYI4O0vGsxxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:36:14.749083Z"},"content_sha256":"ab142c66e1dec26404b10f3b945208cc113183ff368221b007079206cf0ce7b2","schema_version":"1.0","event_id":"sha256:ab142c66e1dec26404b10f3b945208cc113183ff368221b007079206cf0ce7b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UVJFY4EOJ2KC3U3ZKEB5KDQV5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Computational Power of Optimization in Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Tomer Koren","submitted_at":"2015-04-08T19:54:27Z","abstract_excerpt":"We consider the fundamental problem of prediction with expert advice where the experts are \"optimizable\": there is a black-box optimization oracle that can be used to compute, in constant time, the leading expert in retrospect at any point in time. In this setting, we give a novel online algorithm that attains vanishing regret with respect to $N$ experts in total $\\widetilde{O}(\\sqrt{N})$ computation time. We also give a lower bound showing that this running time cannot be improved (up to log factors) in the oracle model, thereby exhibiting a quadratic speedup as compared to the standard, orac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02089","kind":"arxiv","version":4},"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-18T01:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pLdkHvm8kGpHjPgj3hTQhVXf+3iikW/sec1XSrTQBsph3+/c8yXYY7A1Wgy+1mHO6PgKO+0VQR1qIP1aT3dxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:36:14.749504Z"},"content_sha256":"db607beb52e51d19c055099d7aec35b9440fc6630754d30839996789fa62669d","schema_version":"1.0","event_id":"sha256:db607beb52e51d19c055099d7aec35b9440fc6630754d30839996789fa62669d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/bundle.json","state_url":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/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-07T18:36:14Z","links":{"resolver":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P","bundle":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/bundle.json","state":"https://pith.science/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVJFY4EOJ2KC3U3ZKEB5KDQV5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UVJFY4EOJ2KC3U3ZKEB5KDQV5P","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":"079c051a09d20dece5ab56d3154c8a0d3aedd351f17425e45656a77b10f65365","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-08T19:54:27Z","title_canon_sha256":"b84ecd48117d08d5032bd667ac51267305ad90d55d9866b773844c1cb677f0ed"},"schema_version":"1.0","source":{"id":"1504.02089","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02089","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02089v4","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02089","created_at":"2026-05-18T01:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"UVJFY4EOJ2KC","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UVJFY4EOJ2KC3U3Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UVJFY4EO","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:db607beb52e51d19c055099d7aec35b9440fc6630754d30839996789fa62669d","target":"graph","created_at":"2026-05-18T01:21:49Z","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 the fundamental problem of prediction with expert advice where the experts are \"optimizable\": there is a black-box optimization oracle that can be used to compute, in constant time, the leading expert in retrospect at any point in time. In this setting, we give a novel online algorithm that attains vanishing regret with respect to $N$ experts in total $\\widetilde{O}(\\sqrt{N})$ computation time. We also give a lower bound showing that this running time cannot be improved (up to log factors) in the oracle model, thereby exhibiting a quadratic speedup as compared to the standard, orac","authors_text":"Elad Hazan, Tomer Koren","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-08T19:54:27Z","title":"The Computational Power of Optimization in Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02089","kind":"arxiv","version":4},"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:ab142c66e1dec26404b10f3b945208cc113183ff368221b007079206cf0ce7b2","target":"record","created_at":"2026-05-18T01:21:49Z","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":"079c051a09d20dece5ab56d3154c8a0d3aedd351f17425e45656a77b10f65365","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-08T19:54:27Z","title_canon_sha256":"b84ecd48117d08d5032bd667ac51267305ad90d55d9866b773844c1cb677f0ed"},"schema_version":"1.0","source":{"id":"1504.02089","kind":"arxiv","version":4}},"canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5525c708e4e942dd3795103d50e15ebe0848ecfd54c41794934cc59d5950451","first_computed_at":"2026-05-18T01:21:49.177261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:49.177261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JcSpmNuQpoSf1Sb+o3+31q0JboMqiGNPObGGtwe7OpNpKEWnuPfNdOFL1naSck3lgiW++eFqq+zn6joESJD+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:49.177789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02089","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab142c66e1dec26404b10f3b945208cc113183ff368221b007079206cf0ce7b2","sha256:db607beb52e51d19c055099d7aec35b9440fc6630754d30839996789fa62669d"],"state_sha256":"25d85b195988b6b5841cabbfd2164f7a3c940addaa35757e3692447762393935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3p7ntr82qforN91dJJbHPZeEtKzepqkC1loqz/egstwWVbLXsgDWCK6wifNfoxNeqlD7F+GY9Y8wlCOm5bPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:36:14.752095Z","bundle_sha256":"08cf9fff4e31735d02643dc9fd87a5698d92afc5311e96df07f282ac124c3348"}}