{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVLE2BAC6GCUPYW5YDEFV7VYKL","short_pith_number":"pith:JVLE2BAC","schema_version":"1.0","canonical_sha256":"4d564d0402f18547e2ddc0c85afeb852e61ca57b23a8925d31d956ef1f91ea12","source":{"kind":"arxiv","id":"1301.2012","version":1},"attestation_state":"computed","paper":{"title":"Error Correction in Learning using SVMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ramarathnam Venkatesan, Srivatsan Laxman, Sushil Mittal","submitted_at":"2013-01-10T00:47:21Z","abstract_excerpt":"This paper is concerned with learning binary classifiers under adversarial label-noise. We introduce the problem of error-correction in learning where the goal is to recover the original clean data from a label-manipulated version of it, given (i) no constraints on the adversary other than an upper-bound on the number of errors, and (ii) some regularity properties for the original data. We present a simple and practical error-correction algorithm called SubSVMs that learns individual SVMs on several small-size (log-size), class-balanced, random subsets of the data and then reclassifies the tra"},"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":"1301.2012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-10T00:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"2c8004a9bd8928e84472a61f5b7909a68858d6e5fecaa422ba9ba885abfdf448","abstract_canon_sha256":"b40f1d14ce0b66e25b9a78797c19f5f236a6c5197fa993488be6821d698dd11a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:48.527241Z","signature_b64":"lUZQpXps64TXdUQRI9gKhLYlVjv8MuGdfO6IsFbLE1X6CYIzSKcdDKrbQbWtXg2zbH3QZFXHWSBGK7877TNgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d564d0402f18547e2ddc0c85afeb852e61ca57b23a8925d31d956ef1f91ea12","last_reissued_at":"2026-05-18T03:36:48.526768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:48.526768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Correction in Learning using SVMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ramarathnam Venkatesan, Srivatsan Laxman, Sushil Mittal","submitted_at":"2013-01-10T00:47:21Z","abstract_excerpt":"This paper is concerned with learning binary classifiers under adversarial label-noise. We introduce the problem of error-correction in learning where the goal is to recover the original clean data from a label-manipulated version of it, given (i) no constraints on the adversary other than an upper-bound on the number of errors, and (ii) some regularity properties for the original data. We present a simple and practical error-correction algorithm called SubSVMs that learns individual SVMs on several small-size (log-size), class-balanced, random subsets of the data and then reclassifies the tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2012","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":"1301.2012","created_at":"2026-05-18T03:36:48.526845+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2012v1","created_at":"2026-05-18T03:36:48.526845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2012","created_at":"2026-05-18T03:36:48.526845+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVLE2BAC6GCU","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVLE2BAC6GCUPYW5","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVLE2BAC","created_at":"2026-05-18T12:27:49.015174+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/JVLE2BAC6GCUPYW5YDEFV7VYKL","json":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL.json","graph_json":"https://pith.science/api/pith-number/JVLE2BAC6GCUPYW5YDEFV7VYKL/graph.json","events_json":"https://pith.science/api/pith-number/JVLE2BAC6GCUPYW5YDEFV7VYKL/events.json","paper":"https://pith.science/paper/JVLE2BAC"},"agent_actions":{"view_html":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL","download_json":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL.json","view_paper":"https://pith.science/paper/JVLE2BAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2012&json=true","fetch_graph":"https://pith.science/api/pith-number/JVLE2BAC6GCUPYW5YDEFV7VYKL/graph.json","fetch_events":"https://pith.science/api/pith-number/JVLE2BAC6GCUPYW5YDEFV7VYKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL/action/storage_attestation","attest_author":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL/action/author_attestation","sign_citation":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL/action/citation_signature","submit_replication":"https://pith.science/pith/JVLE2BAC6GCUPYW5YDEFV7VYKL/action/replication_record"}},"created_at":"2026-05-18T03:36:48.526845+00:00","updated_at":"2026-05-18T03:36:48.526845+00:00"}