{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7G2YBZ53VHVBNNHQCQVGHH3C6B","short_pith_number":"pith:7G2YBZ53","canonical_record":{"source":{"id":"1404.1356","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-04T19:33:55Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"b985a43216b13376b4b3403976acb0a9016ea9a6228601e7cadaf0753f1d0089","abstract_canon_sha256":"1ec13f96b76862e8b25956056ccf6b494c6d506506fb353dbf01a0c282ecb427"},"schema_version":"1.0"},"canonical_sha256":"f9b580e7bba9ea16b4f0142a639f62f07abbf066468b80f56b8f3c613c015e10","source":{"kind":"arxiv","id":"1404.1356","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1356","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1356v5","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1356","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"7G2YBZ53VHVB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7G2YBZ53VHVBNNHQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7G2YBZ53","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7G2YBZ53VHVBNNHQCQVGHH3C6B","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1356","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-04T19:33:55Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"b985a43216b13376b4b3403976acb0a9016ea9a6228601e7cadaf0753f1d0089","abstract_canon_sha256":"1ec13f96b76862e8b25956056ccf6b494c6d506506fb353dbf01a0c282ecb427"},"schema_version":"1.0"},"canonical_sha256":"f9b580e7bba9ea16b4f0142a639f62f07abbf066468b80f56b8f3c613c015e10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:46.065670Z","signature_b64":"fwN+BoIibYtQSmFyoDPdvkbyJXKQCb22U28ECWlpESnpaSIvKTUppUlC3L/qItsakafqQ4X/4n/jfRmyvggSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9b580e7bba9ea16b4f0142a639f62f07abbf066468b80f56b8f3c613c015e10","last_reissued_at":"2026-05-18T01:04:46.065129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:46.065129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1356","source_version":5,"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:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHBIBRTWJCwLOTYxz3McsjzmhRXUJ/TMrWbCGbJ8RMCtD/CRw13/Dj0Nr6eJtIdRvVuRVeyoQIIgAmhtlQLYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:49:39.552478Z"},"content_sha256":"596111fa9ebdee3a71f638248a338cada3c2073fc430345c17a34ef773325725","schema_version":"1.0","event_id":"sha256:596111fa9ebdee3a71f638248a338cada3c2073fc430345c17a34ef773325725"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7G2YBZ53VHVBNNHQCQVGHH3C6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal learning with Bernstein Online Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Olivier Wintenberger (LSTA)","submitted_at":"2014-04-04T19:33:55Z","abstract_excerpt":"We introduce a new recursive aggregation procedure called Bernstein Online Aggregation (BOA). The exponential weights include an accuracy term and a second order term that is a proxy of the quadratic variation as in Hazan and Kale (2010). This second term stabilizes the procedure that is optimal in different senses. We first obtain optimal regret bounds in the deterministic context. Then, an adaptive version is the first exponential weights algorithm that exhibits a second order bound with excess losses that appears first in Gaillard et al. (2014). The second order bounds in the deterministic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1356","kind":"arxiv","version":5},"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:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9P+S8NfieNjzlR0hJpvs5TV0QMVusFu1oQjnlrUPrGIxK5ihXXSQ1d9dDgk3cbzaXZrrOObM16MdWlYtpRnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:49:39.552830Z"},"content_sha256":"dcc151a1a63a3a745d721eb27cb6eb44a705ddb2a3dc6eeebf9faf3bb08bb43e","schema_version":"1.0","event_id":"sha256:dcc151a1a63a3a745d721eb27cb6eb44a705ddb2a3dc6eeebf9faf3bb08bb43e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B/bundle.json","state_url":"https://pith.science/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B/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-23T16:49:39Z","links":{"resolver":"https://pith.science/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B","bundle":"https://pith.science/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B/bundle.json","state":"https://pith.science/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7G2YBZ53VHVBNNHQCQVGHH3C6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7G2YBZ53VHVBNNHQCQVGHH3C6B","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":"1ec13f96b76862e8b25956056ccf6b494c6d506506fb353dbf01a0c282ecb427","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-04T19:33:55Z","title_canon_sha256":"b985a43216b13376b4b3403976acb0a9016ea9a6228601e7cadaf0753f1d0089"},"schema_version":"1.0","source":{"id":"1404.1356","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1356","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1356v5","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1356","created_at":"2026-05-18T01:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"7G2YBZ53VHVB","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7G2YBZ53VHVBNNHQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7G2YBZ53","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:dcc151a1a63a3a745d721eb27cb6eb44a705ddb2a3dc6eeebf9faf3bb08bb43e","target":"graph","created_at":"2026-05-18T01:04:46Z","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 introduce a new recursive aggregation procedure called Bernstein Online Aggregation (BOA). The exponential weights include an accuracy term and a second order term that is a proxy of the quadratic variation as in Hazan and Kale (2010). This second term stabilizes the procedure that is optimal in different senses. We first obtain optimal regret bounds in the deterministic context. Then, an adaptive version is the first exponential weights algorithm that exhibits a second order bound with excess losses that appears first in Gaillard et al. (2014). The second order bounds in the deterministic ","authors_text":"Olivier Wintenberger (LSTA)","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-04T19:33:55Z","title":"Optimal learning with Bernstein Online Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1356","kind":"arxiv","version":5},"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:596111fa9ebdee3a71f638248a338cada3c2073fc430345c17a34ef773325725","target":"record","created_at":"2026-05-18T01:04:46Z","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":"1ec13f96b76862e8b25956056ccf6b494c6d506506fb353dbf01a0c282ecb427","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-04-04T19:33:55Z","title_canon_sha256":"b985a43216b13376b4b3403976acb0a9016ea9a6228601e7cadaf0753f1d0089"},"schema_version":"1.0","source":{"id":"1404.1356","kind":"arxiv","version":5}},"canonical_sha256":"f9b580e7bba9ea16b4f0142a639f62f07abbf066468b80f56b8f3c613c015e10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9b580e7bba9ea16b4f0142a639f62f07abbf066468b80f56b8f3c613c015e10","first_computed_at":"2026-05-18T01:04:46.065129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:46.065129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fwN+BoIibYtQSmFyoDPdvkbyJXKQCb22U28ECWlpESnpaSIvKTUppUlC3L/qItsakafqQ4X/4n/jfRmyvggSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:46.065670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1356","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:596111fa9ebdee3a71f638248a338cada3c2073fc430345c17a34ef773325725","sha256:dcc151a1a63a3a745d721eb27cb6eb44a705ddb2a3dc6eeebf9faf3bb08bb43e"],"state_sha256":"fcf1072c4ac0a81675f32a3684c140a5824a5acab0cc9f9c9163d58ca52c071e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVu+n1pFoprpMjeP+FnPF0yagrP4Ib+lzEanUdPvDDk8HA3MC2+RyT93CXaPi8i8kmUlUAAh6v01/JsXHQLRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:49:39.554843Z","bundle_sha256":"c457498a9efe31772b65ec63a6e54eedc997e00fe429520cb879568432c534f8"}}