{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CGLD6545FNFLBPKFUU5WB3HC2J","short_pith_number":"pith:CGLD6545","schema_version":"1.0","canonical_sha256":"11963f779d2b4ab0bd45a53b60ece2d266951f537702fcfe1306770a23e1f1c7","source":{"kind":"arxiv","id":"2110.03187","version":1},"attestation_state":"computed","paper":{"title":"On the Optimal Memorization Power of ReLU Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gal Vardi, Gilad Yehudai, Ohad Shamir","submitted_at":"2021-10-07T05:25:23Z","abstract_excerpt":"We study the memorization power of feedforward ReLU neural networks. We show that such networks can memorize any $N$ points that satisfy a mild separability assumption using $\\tilde{O}\\left(\\sqrt{N}\\right)$ parameters. Known VC-dimension upper bounds imply that memorizing $N$ samples requires $\\Omega(\\sqrt{N})$ parameters, and hence our construction is optimal up to logarithmic factors. We also give a generalized construction for networks with depth bounded by $1 \\leq L \\leq \\sqrt{N}$, for memorizing $N$ samples using $\\tilde{O}(N/L)$ parameters. This bound is also optimal up to logarithmic fa"},"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":"2110.03187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-07T05:25:23Z","cross_cats_sorted":["cs.NE","stat.ML"],"title_canon_sha256":"a8bd483e0340d213219c1cd25467741e5152226b8587084ba1272a3dae12695d","abstract_canon_sha256":"f05350709b911ea012f644a66ab23bc3aa3ca23bdf951e10f0d7df95c402ab18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:40.274734Z","signature_b64":"vdDH1dqBrAwpQmcuHnfRCiLrtJwJ0n3n72LR2qyrU6t8QAbyKeaoAj8A7qdjHwqKudYDgy2eGbN0S8smPBoSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11963f779d2b4ab0bd45a53b60ece2d266951f537702fcfe1306770a23e1f1c7","last_reissued_at":"2026-07-05T03:20:40.274332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:40.274332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimal Memorization Power of ReLU Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gal Vardi, Gilad Yehudai, Ohad Shamir","submitted_at":"2021-10-07T05:25:23Z","abstract_excerpt":"We study the memorization power of feedforward ReLU neural networks. We show that such networks can memorize any $N$ points that satisfy a mild separability assumption using $\\tilde{O}\\left(\\sqrt{N}\\right)$ parameters. Known VC-dimension upper bounds imply that memorizing $N$ samples requires $\\Omega(\\sqrt{N})$ parameters, and hence our construction is optimal up to logarithmic factors. We also give a generalized construction for networks with depth bounded by $1 \\leq L \\leq \\sqrt{N}$, for memorizing $N$ samples using $\\tilde{O}(N/L)$ parameters. This bound is also optimal up to logarithmic fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03187","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/2110.03187/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":"2110.03187","created_at":"2026-07-05T03:20:40.274397+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.03187v1","created_at":"2026-07-05T03:20:40.274397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03187","created_at":"2026-07-05T03:20:40.274397+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGLD6545FNFL","created_at":"2026-07-05T03:20:40.274397+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGLD6545FNFLBPKF","created_at":"2026-07-05T03:20:40.274397+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGLD6545","created_at":"2026-07-05T03:20:40.274397+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/CGLD6545FNFLBPKFUU5WB3HC2J","json":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J.json","graph_json":"https://pith.science/api/pith-number/CGLD6545FNFLBPKFUU5WB3HC2J/graph.json","events_json":"https://pith.science/api/pith-number/CGLD6545FNFLBPKFUU5WB3HC2J/events.json","paper":"https://pith.science/paper/CGLD6545"},"agent_actions":{"view_html":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J","download_json":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J.json","view_paper":"https://pith.science/paper/CGLD6545","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.03187&json=true","fetch_graph":"https://pith.science/api/pith-number/CGLD6545FNFLBPKFUU5WB3HC2J/graph.json","fetch_events":"https://pith.science/api/pith-number/CGLD6545FNFLBPKFUU5WB3HC2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J/action/storage_attestation","attest_author":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J/action/author_attestation","sign_citation":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J/action/citation_signature","submit_replication":"https://pith.science/pith/CGLD6545FNFLBPKFUU5WB3HC2J/action/replication_record"}},"created_at":"2026-07-05T03:20:40.274397+00:00","updated_at":"2026-07-05T03:20:40.274397+00:00"}