{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EF7EBYJ4T77WCBII3D7AXDENCH","short_pith_number":"pith:EF7EBYJ4","schema_version":"1.0","canonical_sha256":"217e40e13c9fff610508d8fe0b8c8d11f601fa6033574d2f645ff99f17a33a99","source":{"kind":"arxiv","id":"1209.1996","version":1},"attestation_state":"computed","paper":{"title":"A Bayesian Boosting Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alexander Lorbert, David M. Blei, Peter J. Ramadge, Robert E. Schapire","submitted_at":"2012-09-10T13:57:37Z","abstract_excerpt":"We offer a novel view of AdaBoost in a statistical setting. We propose a Bayesian model for binary classification in which label noise is modeled hierarchically. Using variational inference to optimize a dynamic evidence lower bound, we derive a new boosting-like algorithm called VIBoost. We show its close connections to AdaBoost and give experimental results from four datasets."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.1996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-10T13:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"3eb1f7b1acfb3961869e5be9370ae360404d1412091f4b26e48a546492059a00","abstract_canon_sha256":"dfc1f5a6647c2923c3474afbf9268a61b261aa903363c4e9e299c1d8daf58e90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:53.929195Z","signature_b64":"ElKE8bb6JF3Ffb79kEP30RDMkGeHIAavqUqrDjUxhUlgtS8pOipAMdnrD7P1LT00dfEw7XViDNr6Loy1z7GuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217e40e13c9fff610508d8fe0b8c8d11f601fa6033574d2f645ff99f17a33a99","last_reissued_at":"2026-05-18T03:45:53.928681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:53.928681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bayesian Boosting Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Alexander Lorbert, David M. Blei, Peter J. Ramadge, Robert E. Schapire","submitted_at":"2012-09-10T13:57:37Z","abstract_excerpt":"We offer a novel view of AdaBoost in a statistical setting. We propose a Bayesian model for binary classification in which label noise is modeled hierarchically. Using variational inference to optimize a dynamic evidence lower bound, we derive a new boosting-like algorithm called VIBoost. We show its close connections to AdaBoost and give experimental results from four datasets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1996","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.1996","created_at":"2026-05-18T03:45:53.928756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.1996v1","created_at":"2026-05-18T03:45:53.928756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1996","created_at":"2026-05-18T03:45:53.928756+00:00"},{"alias_kind":"pith_short_12","alias_value":"EF7EBYJ4T77W","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EF7EBYJ4T77WCBII","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EF7EBYJ4","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH","json":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH.json","graph_json":"https://pith.science/api/pith-number/EF7EBYJ4T77WCBII3D7AXDENCH/graph.json","events_json":"https://pith.science/api/pith-number/EF7EBYJ4T77WCBII3D7AXDENCH/events.json","paper":"https://pith.science/paper/EF7EBYJ4"},"agent_actions":{"view_html":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH","download_json":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH.json","view_paper":"https://pith.science/paper/EF7EBYJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.1996&json=true","fetch_graph":"https://pith.science/api/pith-number/EF7EBYJ4T77WCBII3D7AXDENCH/graph.json","fetch_events":"https://pith.science/api/pith-number/EF7EBYJ4T77WCBII3D7AXDENCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH/action/storage_attestation","attest_author":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH/action/author_attestation","sign_citation":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH/action/citation_signature","submit_replication":"https://pith.science/pith/EF7EBYJ4T77WCBII3D7AXDENCH/action/replication_record"}},"created_at":"2026-05-18T03:45:53.928756+00:00","updated_at":"2026-05-18T03:45:53.928756+00:00"}