{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4BRQOA5AZA3QG7TUAIU2XLUIAC","short_pith_number":"pith:4BRQOA5A","canonical_record":{"source":{"id":"1502.02651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"97296edf921061ae4774294313d54dbc2119a86ddf7a0974ee76540b49f98461","abstract_canon_sha256":"64a8b5996755fbf2ad67a5a9a97f5820d1b49ea2be4597527b2cf80956fed73a"},"schema_version":"1.0"},"canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","source":{"kind":"arxiv","id":"1502.02651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02651","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02651v1","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02651","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"4BRQOA5AZA3Q","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BRQOA5AZA3QG7TU","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BRQOA5A","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4BRQOA5AZA3QG7TUAIU2XLUIAC","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"97296edf921061ae4774294313d54dbc2119a86ddf7a0974ee76540b49f98461","abstract_canon_sha256":"64a8b5996755fbf2ad67a5a9a97f5820d1b49ea2be4597527b2cf80956fed73a"},"schema_version":"1.0"},"canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:41.538258Z","signature_b64":"D86xBpoZZG73AWySL/m6nwFb/aDwrEl9hn7ZnossA9ttKJGCakHFQTOwIco1qR1wx2/Y5nK9bzo7netxNY/RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","last_reissued_at":"2026-05-18T02:27:41.537411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:41.537411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02651","source_version":1,"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:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjwLan9OY5kUGIuimqdtQeN0uF2wz54+3nCste/XEFO9oRxIZ0ouWaR27Z4QSL3j4mdDXb7bwSAtwLyHNAWUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:27.298007Z"},"content_sha256":"43d2bc222b569ef4fcbd67e2772818e111d666d1ffad82435cb14cbcc4c15355","schema_version":"1.0","event_id":"sha256:43d2bc222b569ef4fcbd67e2772818e111d666d1ffad82435cb14cbcc4c15355"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4BRQOA5AZA3QG7TUAIU2XLUIAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal and Adaptive Algorithms for Online Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alina Beygelzimer, Haipeng Luo, Satyen Kale","submitted_at":"2015-02-09T20:58:38Z","abstract_excerpt":"We study online boosting, the task of converting any weak online learner into a strong online learner. Based on a novel and natural definition of weak online learnability, we develop two online boosting algorithms. The first algorithm is an online version of boost-by-majority. By proving a matching lower bound, we show that this algorithm is essentially optimal in terms of the number of weak learners and the sample complexity needed to achieve a specified accuracy. This optimal algorithm is not adaptive however. Using tools from online loss minimization, we derive an adaptive online boosting a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02651","kind":"arxiv","version":1},"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:27:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4YfHr69bogbZ6HcNTJzY0C2FtwDwXV6e4EBxR+ZcCjolCW2U4kAUNDzkIodFc9odayyYZqkpUeEmn3HDDjfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:29:27.298684Z"},"content_sha256":"89facb27820befd45b0e47c481dfda89fcad30da96e409473b9b0372e06a5b5e","schema_version":"1.0","event_id":"sha256:89facb27820befd45b0e47c481dfda89fcad30da96e409473b9b0372e06a5b5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/bundle.json","state_url":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/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-28T20:29:27Z","links":{"resolver":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC","bundle":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/bundle.json","state":"https://pith.science/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BRQOA5AZA3QG7TUAIU2XLUIAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4BRQOA5AZA3QG7TUAIU2XLUIAC","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":"64a8b5996755fbf2ad67a5a9a97f5820d1b49ea2be4597527b2cf80956fed73a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:58:38Z","title_canon_sha256":"97296edf921061ae4774294313d54dbc2119a86ddf7a0974ee76540b49f98461"},"schema_version":"1.0","source":{"id":"1502.02651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02651","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02651v1","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02651","created_at":"2026-05-18T02:27:41Z"},{"alias_kind":"pith_short_12","alias_value":"4BRQOA5AZA3Q","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4BRQOA5AZA3QG7TU","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4BRQOA5A","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:89facb27820befd45b0e47c481dfda89fcad30da96e409473b9b0372e06a5b5e","target":"graph","created_at":"2026-05-18T02:27:41Z","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 study online boosting, the task of converting any weak online learner into a strong online learner. Based on a novel and natural definition of weak online learnability, we develop two online boosting algorithms. The first algorithm is an online version of boost-by-majority. By proving a matching lower bound, we show that this algorithm is essentially optimal in terms of the number of weak learners and the sample complexity needed to achieve a specified accuracy. This optimal algorithm is not adaptive however. Using tools from online loss minimization, we derive an adaptive online boosting a","authors_text":"Alina Beygelzimer, Haipeng Luo, Satyen Kale","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:58:38Z","title":"Optimal and Adaptive Algorithms for Online Boosting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02651","kind":"arxiv","version":1},"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:43d2bc222b569ef4fcbd67e2772818e111d666d1ffad82435cb14cbcc4c15355","target":"record","created_at":"2026-05-18T02:27:41Z","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":"64a8b5996755fbf2ad67a5a9a97f5820d1b49ea2be4597527b2cf80956fed73a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-09T20:58:38Z","title_canon_sha256":"97296edf921061ae4774294313d54dbc2119a86ddf7a0974ee76540b49f98461"},"schema_version":"1.0","source":{"id":"1502.02651","kind":"arxiv","version":1}},"canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0630703a0c837037e740229abae8800a6ac1c01a3874650b3568e2ad1c0783b","first_computed_at":"2026-05-18T02:27:41.537411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:41.537411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D86xBpoZZG73AWySL/m6nwFb/aDwrEl9hn7ZnossA9ttKJGCakHFQTOwIco1qR1wx2/Y5nK9bzo7netxNY/RDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:41.538258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43d2bc222b569ef4fcbd67e2772818e111d666d1ffad82435cb14cbcc4c15355","sha256:89facb27820befd45b0e47c481dfda89fcad30da96e409473b9b0372e06a5b5e"],"state_sha256":"cb91111a88935756fca17c585143f93b604fe8b5bef2853c50ddf749c59703ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0P4XMJvm29/4JaMj5ScII9swdeDs/ECJ72ovvBZ8osSGJqjfbh2CRPdG9ywwdEOgauZVVwfEpYW37lB0BD/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:29:27.302038Z","bundle_sha256":"3dca99b83789a685c1f4cba628160c26f20af3978429267d52646d39ffd7e659"}}