{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UCTFGWRBD3EGINGLKDR33RY2HI","short_pith_number":"pith:UCTFGWRB","canonical_record":{"source":{"id":"1510.01064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-05T08:50:56Z","cross_cats_sorted":["cs.AI","cs.LG","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"46f5759b0d1b3b7756fd00e88ae9a218e52361706c64002055a26c2aa9543405","abstract_canon_sha256":"858abbbd1c07f508e4d214ca4a6c04acb2365ddd8f1250ce84e8cd708af03cdb"},"schema_version":"1.0"},"canonical_sha256":"a0a6535a211ec86434cb50e3bdc71a3a190a46321d34dc941414ef54738cac13","source":{"kind":"arxiv","id":"1510.01064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01064","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01064v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01064","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"UCTFGWRBD3EG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCTFGWRBD3EGINGL","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCTFGWRB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UCTFGWRBD3EGINGLKDR33RY2HI","target":"record","payload":{"canonical_record":{"source":{"id":"1510.01064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-05T08:50:56Z","cross_cats_sorted":["cs.AI","cs.LG","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"46f5759b0d1b3b7756fd00e88ae9a218e52361706c64002055a26c2aa9543405","abstract_canon_sha256":"858abbbd1c07f508e4d214ca4a6c04acb2365ddd8f1250ce84e8cd708af03cdb"},"schema_version":"1.0"},"canonical_sha256":"a0a6535a211ec86434cb50e3bdc71a3a190a46321d34dc941414ef54738cac13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.108011Z","signature_b64":"iJWoqGrcN/sFKITcq5Yura0zD31J7u7Qr185H4FyRsdMoh44yZIQPFuOYMZSUeDVvJfSiq6yT+tKfhiabQY/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0a6535a211ec86434cb50e3bdc71a3a190a46321d34dc941414ef54738cac13","last_reissued_at":"2026-05-18T00:36:48.107552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.107552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.01064","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-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKwzs1LfNaHKaOm2SBfN3gZGmmfn96u8z7MNbsAvFm4hhIt5s0xPvnEKPna8UCMM4JogWt/cNyKJz3Ugu53OBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:19:46.899780Z"},"content_sha256":"e7ae5b2bc0507604428ae1facc6834b47bff163c430587b1013a656c9da864ff","schema_version":"1.0","event_id":"sha256:e7ae5b2bc0507604428ae1facc6834b47bff163c430587b1013a656c9da864ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UCTFGWRBD3EGINGLKDR33RY2HI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boosting in the presence of outliers: adaptive classification with non-convex loss functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alexander Hanbo Li, Jelena Bradic","submitted_at":"2015-10-05T08:50:56Z","abstract_excerpt":"This paper examines the role and efficiency of the non-convex loss functions for binary classification problems. In particular, we investigate how to design a simple and effective boosting algorithm that is robust to the outliers in the data. The analysis of the role of a particular non-convex loss for prediction accuracy varies depending on the diminishing tail properties of the gradient of the loss -- the ability of the loss to efficiently adapt to the outlying data, the local convex properties of the loss and the proportion of the contaminated data. In order to use these properties efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01064","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-18T00:36:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5hUDPYi57IETSzPn/ADy1CpYZjZPyvBAaNp6t7sDqFgzOIiqvSv1GPwN5KGHa7fW/MkDhIR7poXz7fs3VIyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:19:46.900127Z"},"content_sha256":"3ba1b39594aae6c3ea3361ffa90fa31d5f76e32e78b57449b9c6e33e911ad6ba","schema_version":"1.0","event_id":"sha256:3ba1b39594aae6c3ea3361ffa90fa31d5f76e32e78b57449b9c6e33e911ad6ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCTFGWRBD3EGINGLKDR33RY2HI/bundle.json","state_url":"https://pith.science/pith/UCTFGWRBD3EGINGLKDR33RY2HI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCTFGWRBD3EGINGLKDR33RY2HI/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-07-01T21:19:46Z","links":{"resolver":"https://pith.science/pith/UCTFGWRBD3EGINGLKDR33RY2HI","bundle":"https://pith.science/pith/UCTFGWRBD3EGINGLKDR33RY2HI/bundle.json","state":"https://pith.science/pith/UCTFGWRBD3EGINGLKDR33RY2HI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCTFGWRBD3EGINGLKDR33RY2HI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UCTFGWRBD3EGINGLKDR33RY2HI","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":"858abbbd1c07f508e4d214ca4a6c04acb2365ddd8f1250ce84e8cd708af03cdb","cross_cats_sorted":["cs.AI","cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-05T08:50:56Z","title_canon_sha256":"46f5759b0d1b3b7756fd00e88ae9a218e52361706c64002055a26c2aa9543405"},"schema_version":"1.0","source":{"id":"1510.01064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01064","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01064v1","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01064","created_at":"2026-05-18T00:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"UCTFGWRBD3EG","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCTFGWRBD3EGINGL","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCTFGWRB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:3ba1b39594aae6c3ea3361ffa90fa31d5f76e32e78b57449b9c6e33e911ad6ba","target":"graph","created_at":"2026-05-18T00:36:48Z","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":"This paper examines the role and efficiency of the non-convex loss functions for binary classification problems. In particular, we investigate how to design a simple and effective boosting algorithm that is robust to the outliers in the data. The analysis of the role of a particular non-convex loss for prediction accuracy varies depending on the diminishing tail properties of the gradient of the loss -- the ability of the loss to efficiently adapt to the outlying data, the local convex properties of the loss and the proportion of the contaminated data. In order to use these properties efficien","authors_text":"Alexander Hanbo Li, Jelena Bradic","cross_cats":["cs.AI","cs.LG","math.ST","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-05T08:50:56Z","title":"Boosting in the presence of outliers: adaptive classification with non-convex loss functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01064","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:e7ae5b2bc0507604428ae1facc6834b47bff163c430587b1013a656c9da864ff","target":"record","created_at":"2026-05-18T00:36:48Z","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":"858abbbd1c07f508e4d214ca4a6c04acb2365ddd8f1250ce84e8cd708af03cdb","cross_cats_sorted":["cs.AI","cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-05T08:50:56Z","title_canon_sha256":"46f5759b0d1b3b7756fd00e88ae9a218e52361706c64002055a26c2aa9543405"},"schema_version":"1.0","source":{"id":"1510.01064","kind":"arxiv","version":1}},"canonical_sha256":"a0a6535a211ec86434cb50e3bdc71a3a190a46321d34dc941414ef54738cac13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0a6535a211ec86434cb50e3bdc71a3a190a46321d34dc941414ef54738cac13","first_computed_at":"2026-05-18T00:36:48.107552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:48.107552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iJWoqGrcN/sFKITcq5Yura0zD31J7u7Qr185H4FyRsdMoh44yZIQPFuOYMZSUeDVvJfSiq6yT+tKfhiabQY/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:48.108011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7ae5b2bc0507604428ae1facc6834b47bff163c430587b1013a656c9da864ff","sha256:3ba1b39594aae6c3ea3361ffa90fa31d5f76e32e78b57449b9c6e33e911ad6ba"],"state_sha256":"f1c5c2ea51f2fa98f628ff50560997da77288116430af4ad50b062ff95e0b476"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZXX+TEfgOLU8ZVtNs82lyjmhinfgFWKv7HIr3GdjYDdLuIRE7hRigvELkfsrJs4jraeKOhvi3x6F4z2xuKWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:19:46.902259Z","bundle_sha256":"4cd53a68556410ade2309f198750580bedd9ba2f7f15c6dcf1f3c96bfd26dd33"}}