{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QW3RJ52R5NAFUSLEZDDG6ZU2H7","short_pith_number":"pith:QW3RJ52R","schema_version":"1.0","canonical_sha256":"85b714f751eb405a4964c8c66f669a3fe95b5cbff0246216b78c332f2ef812b0","source":{"kind":"arxiv","id":"1905.13742","version":2},"attestation_state":"computed","paper":{"title":"High Dimensional Classification via Regularized and Unregularized Empirical Risk Minimization: Precise Error and Optimal Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Xiaoyi Mai, Zhenyu Liao","submitted_at":"2019-05-31T17:52:26Z","abstract_excerpt":"This article provides, through theoretical analysis, an in-depth understanding of the classification performance of the empirical risk minimization framework, in both ridge-regularized and unregularized cases, when high dimensional data are considered. Focusing on the fundamental problem of separating a two-class Gaussian mixture, the proposed analysis allows for a precise prediction of the classification error for a set of numerous data vectors $\\mathbf{x} \\in \\mathbb R^p$ of sufficiently large dimension $p$. This precise error depends on the loss function, the number of training samples, and"},"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":"1905.13742","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-31T17:52:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aa3d91353a8882f91c4fc4990a9bf4a2d986171bc115d18b478f15514901dab7","abstract_canon_sha256":"60b81a8e59b11be776a99ab2823c4e9e7464879cf248203afa255f03b3bab5d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:25.735849Z","signature_b64":"MgrNbMTSTRwSsJj/HLPqT7NYnyTxur5BtBFx83PvhNBz8RtJd+skcMaPOB+teZ9dPBd10m3BW9C7iFRIoMBLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b714f751eb405a4964c8c66f669a3fe95b5cbff0246216b78c332f2ef812b0","last_reissued_at":"2026-07-05T01:54:25.735427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:25.735427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Classification via Regularized and Unregularized Empirical Risk Minimization: Precise Error and Optimal Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Xiaoyi Mai, Zhenyu Liao","submitted_at":"2019-05-31T17:52:26Z","abstract_excerpt":"This article provides, through theoretical analysis, an in-depth understanding of the classification performance of the empirical risk minimization framework, in both ridge-regularized and unregularized cases, when high dimensional data are considered. Focusing on the fundamental problem of separating a two-class Gaussian mixture, the proposed analysis allows for a precise prediction of the classification error for a set of numerous data vectors $\\mathbf{x} \\in \\mathbb R^p$ of sufficiently large dimension $p$. This precise error depends on the loss function, the number of training samples, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13742","kind":"arxiv","version":2},"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/1905.13742/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":"1905.13742","created_at":"2026-07-05T01:54:25.735483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13742v2","created_at":"2026-07-05T01:54:25.735483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13742","created_at":"2026-07-05T01:54:25.735483+00:00"},{"alias_kind":"pith_short_12","alias_value":"QW3RJ52R5NAF","created_at":"2026-07-05T01:54:25.735483+00:00"},{"alias_kind":"pith_short_16","alias_value":"QW3RJ52R5NAFUSLE","created_at":"2026-07-05T01:54:25.735483+00:00"},{"alias_kind":"pith_short_8","alias_value":"QW3RJ52R","created_at":"2026-07-05T01:54:25.735483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22481","citing_title":"When Stronger Triggers Backfire: A High-Dimensional Theory of Backdoor Attacks","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15688","citing_title":"$\\alpha$-TCAV: A Unified Framework for Testing with Concept Activation Vectors","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7","json":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7.json","graph_json":"https://pith.science/api/pith-number/QW3RJ52R5NAFUSLEZDDG6ZU2H7/graph.json","events_json":"https://pith.science/api/pith-number/QW3RJ52R5NAFUSLEZDDG6ZU2H7/events.json","paper":"https://pith.science/paper/QW3RJ52R"},"agent_actions":{"view_html":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7","download_json":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7.json","view_paper":"https://pith.science/paper/QW3RJ52R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13742&json=true","fetch_graph":"https://pith.science/api/pith-number/QW3RJ52R5NAFUSLEZDDG6ZU2H7/graph.json","fetch_events":"https://pith.science/api/pith-number/QW3RJ52R5NAFUSLEZDDG6ZU2H7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7/action/storage_attestation","attest_author":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7/action/author_attestation","sign_citation":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7/action/citation_signature","submit_replication":"https://pith.science/pith/QW3RJ52R5NAFUSLEZDDG6ZU2H7/action/replication_record"}},"created_at":"2026-07-05T01:54:25.735483+00:00","updated_at":"2026-07-05T01:54:25.735483+00:00"}