{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:R3T27UZXMXE5IXQJE3U7YOYXD4","short_pith_number":"pith:R3T27UZX","schema_version":"1.0","canonical_sha256":"8ee7afd33765c9d45e0926e9fc3b171f164302c21805a3d2995b2e405f13086c","source":{"kind":"arxiv","id":"2311.02270","version":1},"attestation_state":"computed","paper":{"title":"Regularized Linear Regression for Binary Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Danil Akhtiamov, Reza Ghane","submitted_at":"2023-11-03T23:18:21Z","abstract_excerpt":"Regularized linear regression is a promising approach for binary classification problems in which the training set has noisy labels since the regularization term can help to avoid interpolating the mislabeled data points. In this paper we provide a systematic study of the effects of the regularization strength on the performance of linear classifiers that are trained to solve binary classification problems by minimizing a regularized least-squares objective. We consider the over-parametrized regime and assume that the classes are generated from a Gaussian Mixture Model (GMM) where a fraction $"},"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":"2311.02270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-03T23:18:21Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"69dab3a4a7510442e27f34df0108ec1e9f2acbb8a51f10275d5855e1e6dac14c","abstract_canon_sha256":"2efd2147b27debdcea487365df903f4a68416e1099b7dfe5733b5501a1d039fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:08.630485Z","signature_b64":"bi5j+L2TymKo+hDVH6KqokEELdW0NqrF6hLh3Elg3Bko1c6Ekj9BSxQTRRbtHWP577nCXFsa0GjJB+d8QyYCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ee7afd33765c9d45e0926e9fc3b171f164302c21805a3d2995b2e405f13086c","last_reissued_at":"2026-07-05T07:09:08.629985Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:08.629985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Linear Regression for Binary Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Danil Akhtiamov, Reza Ghane","submitted_at":"2023-11-03T23:18:21Z","abstract_excerpt":"Regularized linear regression is a promising approach for binary classification problems in which the training set has noisy labels since the regularization term can help to avoid interpolating the mislabeled data points. In this paper we provide a systematic study of the effects of the regularization strength on the performance of linear classifiers that are trained to solve binary classification problems by minimizing a regularized least-squares objective. We consider the over-parametrized regime and assume that the classes are generated from a Gaussian Mixture Model (GMM) where a fraction $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02270","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.02270/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.02270","created_at":"2026-07-05T07:09:08.630048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.02270v1","created_at":"2026-07-05T07:09:08.630048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02270","created_at":"2026-07-05T07:09:08.630048+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3T27UZXMXE5","created_at":"2026-07-05T07:09:08.630048+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3T27UZXMXE5IXQJ","created_at":"2026-07-05T07:09:08.630048+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3T27UZX","created_at":"2026-07-05T07:09:08.630048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27769","citing_title":"Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4","json":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4.json","graph_json":"https://pith.science/api/pith-number/R3T27UZXMXE5IXQJE3U7YOYXD4/graph.json","events_json":"https://pith.science/api/pith-number/R3T27UZXMXE5IXQJE3U7YOYXD4/events.json","paper":"https://pith.science/paper/R3T27UZX"},"agent_actions":{"view_html":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4","download_json":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4.json","view_paper":"https://pith.science/paper/R3T27UZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.02270&json=true","fetch_graph":"https://pith.science/api/pith-number/R3T27UZXMXE5IXQJE3U7YOYXD4/graph.json","fetch_events":"https://pith.science/api/pith-number/R3T27UZXMXE5IXQJE3U7YOYXD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4/action/storage_attestation","attest_author":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4/action/author_attestation","sign_citation":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4/action/citation_signature","submit_replication":"https://pith.science/pith/R3T27UZXMXE5IXQJE3U7YOYXD4/action/replication_record"}},"created_at":"2026-07-05T07:09:08.630048+00:00","updated_at":"2026-07-05T07:09:08.630048+00:00"}