{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5QDO2MRBJ5BRCSBQMAMFKX7ZVG","short_pith_number":"pith:5QDO2MRB","canonical_record":{"source":{"id":"1506.07254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T06:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"2961c29dd78baf147db775b0d48fa2472845c125ba86a7cc674fe89d721d931d","abstract_canon_sha256":"cce3933cee4db3da0b522a9757bd0d51b95f63b9da308eb7c5fe60ac14bfd627"},"schema_version":"1.0"},"canonical_sha256":"ec06ed32214f431148306018555ff9a9a0f50dea47cb734cb81c14992b439b80","source":{"kind":"arxiv","id":"1506.07254","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07254","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07254v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07254","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"5QDO2MRBJ5BR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QDO2MRBJ5BRCSBQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QDO2MRB","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5QDO2MRBJ5BRCSBQMAMFKX7ZVG","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T06:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"2961c29dd78baf147db775b0d48fa2472845c125ba86a7cc674fe89d721d931d","abstract_canon_sha256":"cce3933cee4db3da0b522a9757bd0d51b95f63b9da308eb7c5fe60ac14bfd627"},"schema_version":"1.0"},"canonical_sha256":"ec06ed32214f431148306018555ff9a9a0f50dea47cb734cb81c14992b439b80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:54.469150Z","signature_b64":"jHC9vgShewJbe+eF0kCzduxO6auR4Rl0z0Li/liKIVGfGvJAiozFq/BN0ad46Z7KVZ90FGV+cN8xQKN9/NfSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec06ed32214f431148306018555ff9a9a0f50dea47cb734cb81c14992b439b80","last_reissued_at":"2026-05-18T01:39:54.468658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:54.468658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07254","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-18T01:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wYZC9xpv5VFT1BuLhoelATL1nvNaRwLgIrUBgGmIG2JDELk8CM2Crr30mkbjRZgXMXAS0QxLTp5UyZb4hfbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:18:38.841943Z"},"content_sha256":"bf962b13987cb3ed03b08ae7511859978796742121e38a8b0c74b09861809afc","schema_version":"1.0","event_id":"sha256:bf962b13987cb3ed03b08ae7511859978796742121e38a8b0c74b09861809afc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5QDO2MRBJ5BRCSBQMAMFKX7ZVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unconfused ultraconservative multiclass algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Liva Ralaivola, Ugo Louche","submitted_at":"2015-06-24T06:31:21Z","abstract_excerpt":"We tackle the problem of learning linear classifiers from noisy datasets in a multiclass setting. The two-class version of this problem was studied a few years ago where the proposed approaches to combat the noise revolve around a Per-ceptron learning scheme fed with peculiar examples computed through a weighted average of points from the noisy training set. We propose to build upon these approaches and we introduce a new algorithm called UMA (for Unconfused Multiclass additive Algorithm) which may be seen as a generalization to the multiclass setting of the previous approaches. In order to ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07254","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-18T01:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OG7YUwwebZhxjPJ1w9dK2jp+2sWKVDB1RhzW5ivL03dga1+zhYxaQ5HsWS0Z6TS0/+Pw4rXmN9ka/c8JECSODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:18:38.842284Z"},"content_sha256":"45bd3e372477bacdfc104128e4178a0b5777943ad8bd141fbfc1d294c2f9bdfe","schema_version":"1.0","event_id":"sha256:45bd3e372477bacdfc104128e4178a0b5777943ad8bd141fbfc1d294c2f9bdfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG/bundle.json","state_url":"https://pith.science/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG/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-04T06:18:38Z","links":{"resolver":"https://pith.science/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG","bundle":"https://pith.science/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG/bundle.json","state":"https://pith.science/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QDO2MRBJ5BRCSBQMAMFKX7ZVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5QDO2MRBJ5BRCSBQMAMFKX7ZVG","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":"cce3933cee4db3da0b522a9757bd0d51b95f63b9da308eb7c5fe60ac14bfd627","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T06:31:21Z","title_canon_sha256":"2961c29dd78baf147db775b0d48fa2472845c125ba86a7cc674fe89d721d931d"},"schema_version":"1.0","source":{"id":"1506.07254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07254","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07254v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07254","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"5QDO2MRBJ5BR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QDO2MRBJ5BRCSBQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QDO2MRB","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:45bd3e372477bacdfc104128e4178a0b5777943ad8bd141fbfc1d294c2f9bdfe","target":"graph","created_at":"2026-05-18T01:39:54Z","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 tackle the problem of learning linear classifiers from noisy datasets in a multiclass setting. The two-class version of this problem was studied a few years ago where the proposed approaches to combat the noise revolve around a Per-ceptron learning scheme fed with peculiar examples computed through a weighted average of points from the noisy training set. We propose to build upon these approaches and we introduce a new algorithm called UMA (for Unconfused Multiclass additive Algorithm) which may be seen as a generalization to the multiclass setting of the previous approaches. In order to ch","authors_text":"Liva Ralaivola, Ugo Louche","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T06:31:21Z","title":"Unconfused ultraconservative multiclass algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07254","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:bf962b13987cb3ed03b08ae7511859978796742121e38a8b0c74b09861809afc","target":"record","created_at":"2026-05-18T01:39:54Z","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":"cce3933cee4db3da0b522a9757bd0d51b95f63b9da308eb7c5fe60ac14bfd627","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T06:31:21Z","title_canon_sha256":"2961c29dd78baf147db775b0d48fa2472845c125ba86a7cc674fe89d721d931d"},"schema_version":"1.0","source":{"id":"1506.07254","kind":"arxiv","version":1}},"canonical_sha256":"ec06ed32214f431148306018555ff9a9a0f50dea47cb734cb81c14992b439b80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec06ed32214f431148306018555ff9a9a0f50dea47cb734cb81c14992b439b80","first_computed_at":"2026-05-18T01:39:54.468658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:54.468658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jHC9vgShewJbe+eF0kCzduxO6auR4Rl0z0Li/liKIVGfGvJAiozFq/BN0ad46Z7KVZ90FGV+cN8xQKN9/NfSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:54.469150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf962b13987cb3ed03b08ae7511859978796742121e38a8b0c74b09861809afc","sha256:45bd3e372477bacdfc104128e4178a0b5777943ad8bd141fbfc1d294c2f9bdfe"],"state_sha256":"b6577f734feee67ca042fe1aee33b07b0d4439fd67a32601f1ceae2c3afa06d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dm3NXSXYzrtRAyAwZAhklwMXObIQW7WidqeZGeeVate1gXXtf141BYKBKLmGeuMPVcXQuv+q/sFIruR9A51sDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:18:38.844248Z","bundle_sha256":"a63f89bb5e86278411a96e79f65bb201acc8b2248f9acdfde7efac39ac9a4ea3"}}