{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D33XRV4F4SX7QREBLYRRWGXMNI","short_pith_number":"pith:D33XRV4F","canonical_record":{"source":{"id":"1307.1192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-04T03:17:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"43fc8a5a7829ce8326c9f5004771435b8d349d13a39c88fb8e07efe68ec6a52a","abstract_canon_sha256":"1dcb26b193ff7a149eb3497a1c75df98b8dcdbfa4c384dcba7de8f911415c5e3"},"schema_version":"1.0"},"canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","source":{"kind":"arxiv","id":"1307.1192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1192","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1192v1","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1192","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"D33XRV4F4SX7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D33XRV4F4SX7QREB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D33XRV4F","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D33XRV4F4SX7QREBLYRRWGXMNI","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-04T03:17:23Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"43fc8a5a7829ce8326c9f5004771435b8d349d13a39c88fb8e07efe68ec6a52a","abstract_canon_sha256":"1dcb26b193ff7a149eb3497a1c75df98b8dcdbfa4c384dcba7de8f911415c5e3"},"schema_version":"1.0"},"canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:14.442800Z","signature_b64":"ybDVtX6WZabpORX0c6cTzrwOTGFvOy3Es0MraGsWtOQ22COIMMjCfzjn5605b3MKStk80H3gzGjOF6jtzFRzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","last_reissued_at":"2026-05-18T03:19:14.442108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:14.442108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1192","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-18T03:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjK/gurKBNa4Ew1aR9VrcPZuj0/QRYXmenPpbLz6ogtVJpN1CSIWtgMG8r5m1wcH7qFvGb14ZwqY+HR7FMekCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:06.579818Z"},"content_sha256":"913220e1fd3314218c5c7b3e8f11a20ab150065176a3de0fdc367c104591cf42","schema_version":"1.0","event_id":"sha256:913220e1fd3314218c5c7b3e8f11a20ab150065176a3de0fdc367c104591cf42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D33XRV4F4SX7QREBLYRRWGXMNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Paul Grigas, Rahul Mazumder, Robert M. Freund","submitted_at":"2013-07-04T03:17:23Z","abstract_excerpt":"Boosting methods are highly popular and effective supervised learning methods which combine weak learners into a single accurate model with good statistical performance. In this paper, we analyze two well-known boosting methods, AdaBoost and Incremental Forward Stagewise Regression (FS$_\\varepsilon$), by establishing their precise connections to the Mirror Descent algorithm, which is a first-order method in convex optimization. As a consequence of these connections we obtain novel computational guarantees for these boosting methods. In particular, we characterize convergence bounds of AdaBoost"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1192","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-18T03:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1NNODGdvE6tdgJlrx2j1yXedadEIeneItVcRC+5vi04qRKsKZV9sND8X+/jU08tEM60IQiM2enPYM13LnCJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:07:06.580311Z"},"content_sha256":"1595328a50cbe7736c661818502a847da6888f5819eaa42e3e2a1314018505d3","schema_version":"1.0","event_id":"sha256:1595328a50cbe7736c661818502a847da6888f5819eaa42e3e2a1314018505d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/bundle.json","state_url":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D33XRV4F4SX7QREBLYRRWGXMNI/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-05T14:07:06Z","links":{"resolver":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI","bundle":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/bundle.json","state":"https://pith.science/pith/D33XRV4F4SX7QREBLYRRWGXMNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D33XRV4F4SX7QREBLYRRWGXMNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D33XRV4F4SX7QREBLYRRWGXMNI","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":"1dcb26b193ff7a149eb3497a1c75df98b8dcdbfa4c384dcba7de8f911415c5e3","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-04T03:17:23Z","title_canon_sha256":"43fc8a5a7829ce8326c9f5004771435b8d349d13a39c88fb8e07efe68ec6a52a"},"schema_version":"1.0","source":{"id":"1307.1192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1192","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1192v1","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1192","created_at":"2026-05-18T03:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"D33XRV4F4SX7","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D33XRV4F4SX7QREB","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D33XRV4F","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:1595328a50cbe7736c661818502a847da6888f5819eaa42e3e2a1314018505d3","target":"graph","created_at":"2026-05-18T03:19:14Z","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":"Boosting methods are highly popular and effective supervised learning methods which combine weak learners into a single accurate model with good statistical performance. In this paper, we analyze two well-known boosting methods, AdaBoost and Incremental Forward Stagewise Regression (FS$_\\varepsilon$), by establishing their precise connections to the Mirror Descent algorithm, which is a first-order method in convex optimization. As a consequence of these connections we obtain novel computational guarantees for these boosting methods. In particular, we characterize convergence bounds of AdaBoost","authors_text":"Paul Grigas, Rahul Mazumder, Robert M. Freund","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-04T03:17:23Z","title":"AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1192","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:913220e1fd3314218c5c7b3e8f11a20ab150065176a3de0fdc367c104591cf42","target":"record","created_at":"2026-05-18T03:19:14Z","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":"1dcb26b193ff7a149eb3497a1c75df98b8dcdbfa4c384dcba7de8f911415c5e3","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-07-04T03:17:23Z","title_canon_sha256":"43fc8a5a7829ce8326c9f5004771435b8d349d13a39c88fb8e07efe68ec6a52a"},"schema_version":"1.0","source":{"id":"1307.1192","kind":"arxiv","version":1}},"canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ef778d785e4aff844815e231b1aec6a11dfed49079ad5f06c4bf5e0f7a4cb62","first_computed_at":"2026-05-18T03:19:14.442108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:14.442108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ybDVtX6WZabpORX0c6cTzrwOTGFvOy3Es0MraGsWtOQ22COIMMjCfzjn5605b3MKStk80H3gzGjOF6jtzFRzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:14.442800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:913220e1fd3314218c5c7b3e8f11a20ab150065176a3de0fdc367c104591cf42","sha256:1595328a50cbe7736c661818502a847da6888f5819eaa42e3e2a1314018505d3"],"state_sha256":"582008e3ef25ed24be754fb636c943e09b2aef3f5111bf202d07fa052e66b2d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1O4rd7/pQmewAw3tVFYcQxjJF47krTG2/iIhbw3j0rhl1WsMPUIwqyICZz9SxotRhsiJOYoCLHOzas8oaxZYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:07:06.582473Z","bundle_sha256":"fbca48b3bcb9f9ac4e4b115f4e51705959721b70ce310a3f54d207ab0f157e54"}}