{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2IRACNQ5LGWAUJLJJXBKK5SEER","short_pith_number":"pith:2IRACNQ5","schema_version":"1.0","canonical_sha256":"d22201361d59ac0a25694dc2a5764424416ba6a4f05b11b037c4d1617f5668f0","source":{"kind":"arxiv","id":"2403.06903","version":3},"attestation_state":"computed","paper":{"title":"Benign overfitting in leaky ReLU networks with moderate input dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Deanna Needell, Erin George, Guido Mont\\'ufar, Kedar Karhadkar, Michael Murray","submitted_at":"2024-03-11T16:56:01Z","abstract_excerpt":"The problem of benign overfitting asks whether it is possible for a model to perfectly fit noisy training data and still generalize well. We study benign overfitting in two-layer leaky ReLU networks trained with the hinge loss on a binary classification task. We consider input data that can be decomposed into the sum of a common signal and a random noise component, that lie on subspaces orthogonal to one another. We characterize conditions on the signal to noise ratio (SNR) of the model parameters giving rise to benign versus non-benign (or harmful) overfitting: in particular, if the SNR is hi"},"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":"2403.06903","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-11T16:56:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ba61db33a6113525d367861886e346a6e24343ffe5e2e35750ba32f65b40522e","abstract_canon_sha256":"1bda4a0753a4bc197b1c6248cf1c6451121c5a51d9a74e2f02456b5a0e5ed864"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:53.996694Z","signature_b64":"oCf0zk+Ddzy5bnG/MXOVlt3Ebu95p3oLWtYqlkmp3cvZq2Y0H1FKK8Fa3uEiQnZbFWsnK4LZnVvLwnAAolAQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d22201361d59ac0a25694dc2a5764424416ba6a4f05b11b037c4d1617f5668f0","last_reissued_at":"2026-07-05T09:14:53.996235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:53.996235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benign overfitting in leaky ReLU networks with moderate input dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Deanna Needell, Erin George, Guido Mont\\'ufar, Kedar Karhadkar, Michael Murray","submitted_at":"2024-03-11T16:56:01Z","abstract_excerpt":"The problem of benign overfitting asks whether it is possible for a model to perfectly fit noisy training data and still generalize well. We study benign overfitting in two-layer leaky ReLU networks trained with the hinge loss on a binary classification task. We consider input data that can be decomposed into the sum of a common signal and a random noise component, that lie on subspaces orthogonal to one another. We characterize conditions on the signal to noise ratio (SNR) of the model parameters giving rise to benign versus non-benign (or harmful) overfitting: in particular, if the SNR is hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06903","kind":"arxiv","version":3},"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/2403.06903/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":"2403.06903","created_at":"2026-07-05T09:14:53.996291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06903v3","created_at":"2026-07-05T09:14:53.996291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06903","created_at":"2026-07-05T09:14:53.996291+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IRACNQ5LGWA","created_at":"2026-07-05T09:14:53.996291+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IRACNQ5LGWAUJLJ","created_at":"2026-07-05T09:14:53.996291+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IRACNQ5","created_at":"2026-07-05T09:14:53.996291+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21494","citing_title":"Double descent for least-squares interpolation on contaminated data: A simulation study","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER","json":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER.json","graph_json":"https://pith.science/api/pith-number/2IRACNQ5LGWAUJLJJXBKK5SEER/graph.json","events_json":"https://pith.science/api/pith-number/2IRACNQ5LGWAUJLJJXBKK5SEER/events.json","paper":"https://pith.science/paper/2IRACNQ5"},"agent_actions":{"view_html":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER","download_json":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER.json","view_paper":"https://pith.science/paper/2IRACNQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06903&json=true","fetch_graph":"https://pith.science/api/pith-number/2IRACNQ5LGWAUJLJJXBKK5SEER/graph.json","fetch_events":"https://pith.science/api/pith-number/2IRACNQ5LGWAUJLJJXBKK5SEER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER/action/storage_attestation","attest_author":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER/action/author_attestation","sign_citation":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER/action/citation_signature","submit_replication":"https://pith.science/pith/2IRACNQ5LGWAUJLJJXBKK5SEER/action/replication_record"}},"created_at":"2026-07-05T09:14:53.996291+00:00","updated_at":"2026-07-05T09:14:53.996291+00:00"}