{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PT25LPFSGZVFWJX4QN5EJNO4DW","short_pith_number":"pith:PT25LPFS","schema_version":"1.0","canonical_sha256":"7cf5d5bcb2366a5b26fc837a44b5dc1db56598e98deaa31c21369d66ccfe7b4f","source":{"kind":"arxiv","id":"2307.06092","version":5},"attestation_state":"computed","paper":{"title":"Quantitative CLTs in Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boris Hanin, Domenico Marinucci, Giovanni Peccati, Ivan Nourdin, Stefano Favaro","submitted_at":"2023-07-12T11:35:37Z","abstract_excerpt":"We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain quantitative bounds on normal approximations valid at large but finite $n$ and any fixed network depth. Our theorems show both for the finite-dimensional distributions and the entire process, that the distance between a random fully connected network (and its derivatives) to the corresponding infinite width Gaussian process scales like $n^{-\\gamma}$ for $\\gamma>0$, "},"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":"2307.06092","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-07-12T11:35:37Z","cross_cats_sorted":["cs.AI","math.PR","stat.ML"],"title_canon_sha256":"70ade5ab8316b10be7158cbf70ab652984d15189c065cca15392ed4e7d3621dc","abstract_canon_sha256":"20073c2d746cd971916915008f6988e63836b5777cdb7cdb1273127dff86e789"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:30.565932Z","signature_b64":"90tgj0hZsVEsJHvUNiJK4wzRZOqqbU8BaQ77iZJBGp3sS6Je2AFvwrCBkABY7ZpyeTWD77+t+BKE2crDtfc1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cf5d5bcb2366a5b26fc837a44b5dc1db56598e98deaa31c21369d66ccfe7b4f","last_reissued_at":"2026-07-05T08:32:30.565389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:30.565389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantitative CLTs in Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boris Hanin, Domenico Marinucci, Giovanni Peccati, Ivan Nourdin, Stefano Favaro","submitted_at":"2023-07-12T11:35:37Z","abstract_excerpt":"We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain quantitative bounds on normal approximations valid at large but finite $n$ and any fixed network depth. Our theorems show both for the finite-dimensional distributions and the entire process, that the distance between a random fully connected network (and its derivatives) to the corresponding infinite width Gaussian process scales like $n^{-\\gamma}$ for $\\gamma>0$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.06092","kind":"arxiv","version":5},"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/2307.06092/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":"2307.06092","created_at":"2026-07-05T08:32:30.565449+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.06092v5","created_at":"2026-07-05T08:32:30.565449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.06092","created_at":"2026-07-05T08:32:30.565449+00:00"},{"alias_kind":"pith_short_12","alias_value":"PT25LPFSGZVF","created_at":"2026-07-05T08:32:30.565449+00:00"},{"alias_kind":"pith_short_16","alias_value":"PT25LPFSGZVFWJX4","created_at":"2026-07-05T08:32:30.565449+00:00"},{"alias_kind":"pith_short_8","alias_value":"PT25LPFS","created_at":"2026-07-05T08:32:30.565449+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15911","citing_title":"Kernel shape renormalization explains output-output correlations in finite Bayesian one-hidden-layer networks","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW","json":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW.json","graph_json":"https://pith.science/api/pith-number/PT25LPFSGZVFWJX4QN5EJNO4DW/graph.json","events_json":"https://pith.science/api/pith-number/PT25LPFSGZVFWJX4QN5EJNO4DW/events.json","paper":"https://pith.science/paper/PT25LPFS"},"agent_actions":{"view_html":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW","download_json":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW.json","view_paper":"https://pith.science/paper/PT25LPFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.06092&json=true","fetch_graph":"https://pith.science/api/pith-number/PT25LPFSGZVFWJX4QN5EJNO4DW/graph.json","fetch_events":"https://pith.science/api/pith-number/PT25LPFSGZVFWJX4QN5EJNO4DW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW/action/storage_attestation","attest_author":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW/action/author_attestation","sign_citation":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW/action/citation_signature","submit_replication":"https://pith.science/pith/PT25LPFSGZVFWJX4QN5EJNO4DW/action/replication_record"}},"created_at":"2026-07-05T08:32:30.565449+00:00","updated_at":"2026-07-05T08:32:30.565449+00:00"}