{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XZDOAHGZCZFR76JHBIYCO5WHYU","short_pith_number":"pith:XZDOAHGZ","canonical_record":{"source":{"id":"1307.8371","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-31T16:11:26Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"title_canon_sha256":"972b185138b0f44e675422c6de865ef5d5847ad37054e28b570d70d9c8ccc1ed","abstract_canon_sha256":"a31189f463f4211a3c09955bc2b3dc872b53c1d6ee63c0f09f3eff3a29eed38e"},"schema_version":"1.0"},"canonical_sha256":"be46e01cd9164b1ff9270a302776c7c53b7ac17f28e06cff63c464a490534895","source":{"kind":"arxiv","id":"1307.8371","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8371","created_at":"2026-05-18T00:14:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8371v9","created_at":"2026-05-18T00:14:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8371","created_at":"2026-05-18T00:14:23Z"},{"alias_kind":"pith_short_12","alias_value":"XZDOAHGZCZFR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XZDOAHGZCZFR76JH","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XZDOAHGZ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XZDOAHGZCZFR76JHBIYCO5WHYU","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8371","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-31T16:11:26Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"title_canon_sha256":"972b185138b0f44e675422c6de865ef5d5847ad37054e28b570d70d9c8ccc1ed","abstract_canon_sha256":"a31189f463f4211a3c09955bc2b3dc872b53c1d6ee63c0f09f3eff3a29eed38e"},"schema_version":"1.0"},"canonical_sha256":"be46e01cd9164b1ff9270a302776c7c53b7ac17f28e06cff63c464a490534895","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:23.422170Z","signature_b64":"kvA3wU6woCB9ACewsTwT5c/ZgVoeqeT+5qZifKqc1qHNu8X40gO/XqGxXHmmE1ws3gwkc6RzmfHIPNRT+8ibCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be46e01cd9164b1ff9270a302776c7c53b7ac17f28e06cff63c464a490534895","last_reissued_at":"2026-05-18T00:14:23.421558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:23.421558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8371","source_version":9,"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:14:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVKG3QgbJ631PjpFjW6obxOo1jnzyUyEmR2qIuX2TVg68/6LWAwA8VE5EgoqR0QB3ali+KlIi4csTk+oDaoaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:40:42.034443Z"},"content_sha256":"c3e91b48351e1a0ec0c18e4f98549132fee61740e75489b9d5c511a0afe66d0c","schema_version":"1.0","event_id":"sha256:c3e91b48351e1a0ec0c18e4f98549132fee61740e75489b9d5c511a0afe66d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XZDOAHGZCZFR76JHBIYCO5WHYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Localization for Efficiently Learning Linear Separators with Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Maria Florina Balcan, Philip M. Long, Pranjal Awasthi","submitted_at":"2013-07-31T16:11:26Z","abstract_excerpt":"We introduce a new approach for designing computationally efficient learning algorithms that are tolerant to noise, and demonstrate its effectiveness by designing algorithms with improved noise tolerance guarantees for learning linear separators.\n  We consider both the malicious noise model and the adversarial label noise model. For malicious noise, where the adversary can corrupt both the label and the features, we provide a polynomial-time algorithm for learning linear separators in $\\Re^d$ under isotropic log-concave distributions that can tolerate a nearly information-theoretically optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8371","kind":"arxiv","version":9},"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:14:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEQVRKiYuRuZglEwQuHAgy/z5KinH43+S3FMFZfpQNNsYWTl5rq/wG5XvnkcYBy7KvGesOD6oE/xfYHQ8cBUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:40:42.034793Z"},"content_sha256":"4f1918c0bd4b0bc37d0da6f77c6f9d36056948fbf06e821f3074603d7c076dc0","schema_version":"1.0","event_id":"sha256:4f1918c0bd4b0bc37d0da6f77c6f9d36056948fbf06e821f3074603d7c076dc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZDOAHGZCZFR76JHBIYCO5WHYU/bundle.json","state_url":"https://pith.science/pith/XZDOAHGZCZFR76JHBIYCO5WHYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZDOAHGZCZFR76JHBIYCO5WHYU/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-05T08:40:42Z","links":{"resolver":"https://pith.science/pith/XZDOAHGZCZFR76JHBIYCO5WHYU","bundle":"https://pith.science/pith/XZDOAHGZCZFR76JHBIYCO5WHYU/bundle.json","state":"https://pith.science/pith/XZDOAHGZCZFR76JHBIYCO5WHYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZDOAHGZCZFR76JHBIYCO5WHYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XZDOAHGZCZFR76JHBIYCO5WHYU","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":"a31189f463f4211a3c09955bc2b3dc872b53c1d6ee63c0f09f3eff3a29eed38e","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-31T16:11:26Z","title_canon_sha256":"972b185138b0f44e675422c6de865ef5d5847ad37054e28b570d70d9c8ccc1ed"},"schema_version":"1.0","source":{"id":"1307.8371","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8371","created_at":"2026-05-18T00:14:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8371v9","created_at":"2026-05-18T00:14:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8371","created_at":"2026-05-18T00:14:23Z"},{"alias_kind":"pith_short_12","alias_value":"XZDOAHGZCZFR","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XZDOAHGZCZFR76JH","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XZDOAHGZ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:4f1918c0bd4b0bc37d0da6f77c6f9d36056948fbf06e821f3074603d7c076dc0","target":"graph","created_at":"2026-05-18T00:14:23Z","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 introduce a new approach for designing computationally efficient learning algorithms that are tolerant to noise, and demonstrate its effectiveness by designing algorithms with improved noise tolerance guarantees for learning linear separators.\n  We consider both the malicious noise model and the adversarial label noise model. For malicious noise, where the adversary can corrupt both the label and the features, we provide a polynomial-time algorithm for learning linear separators in $\\Re^d$ under isotropic log-concave distributions that can tolerate a nearly information-theoretically optimal","authors_text":"Maria Florina Balcan, Philip M. Long, Pranjal Awasthi","cross_cats":["cs.CC","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-31T16:11:26Z","title":"The Power of Localization for Efficiently Learning Linear Separators with Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8371","kind":"arxiv","version":9},"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:c3e91b48351e1a0ec0c18e4f98549132fee61740e75489b9d5c511a0afe66d0c","target":"record","created_at":"2026-05-18T00:14:23Z","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":"a31189f463f4211a3c09955bc2b3dc872b53c1d6ee63c0f09f3eff3a29eed38e","cross_cats_sorted":["cs.CC","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-31T16:11:26Z","title_canon_sha256":"972b185138b0f44e675422c6de865ef5d5847ad37054e28b570d70d9c8ccc1ed"},"schema_version":"1.0","source":{"id":"1307.8371","kind":"arxiv","version":9}},"canonical_sha256":"be46e01cd9164b1ff9270a302776c7c53b7ac17f28e06cff63c464a490534895","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be46e01cd9164b1ff9270a302776c7c53b7ac17f28e06cff63c464a490534895","first_computed_at":"2026-05-18T00:14:23.421558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:23.421558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kvA3wU6woCB9ACewsTwT5c/ZgVoeqeT+5qZifKqc1qHNu8X40gO/XqGxXHmmE1ws3gwkc6RzmfHIPNRT+8ibCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:23.422170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8371","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3e91b48351e1a0ec0c18e4f98549132fee61740e75489b9d5c511a0afe66d0c","sha256:4f1918c0bd4b0bc37d0da6f77c6f9d36056948fbf06e821f3074603d7c076dc0"],"state_sha256":"09f584d7dba8d17215063d53e928c30e4ca9868c79df92857d23e4a696252834"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dyaud4aP4K6cQgGMzWuGcBQkYhGE4JMOS8yRnYBwa9YVUmcfHzHojTH2Y6k8ZmRqPs3KwvSjX9dmYb5+iMx6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:40:42.036845Z","bundle_sha256":"2dfff2b283b5ddaa39a2ebbb13433d472ba3a699a1ed2242c4c6af2159b7dc6c"}}