{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YK5OFHTQETNZQYQWOVZFBY3Q65","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f278b8dd281c152e5b31608c958cebf863af58f140eb0b5ed8c8d2a1a156db1","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-17T09:45:23Z","title_canon_sha256":"7bc2f9acc96382222c6ac602927bf8fad84619e98d40db8e8f280aa03e804bf5"},"schema_version":"1.0","source":{"id":"2205.08199","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.08199","created_at":"2026-07-05T04:48:52Z"},{"alias_kind":"arxiv_version","alias_value":"2205.08199v4","created_at":"2026-07-05T04:48:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08199","created_at":"2026-07-05T04:48:52Z"},{"alias_kind":"pith_short_12","alias_value":"YK5OFHTQETNZ","created_at":"2026-07-05T04:48:52Z"},{"alias_kind":"pith_short_16","alias_value":"YK5OFHTQETNZQYQW","created_at":"2026-07-05T04:48:52Z"},{"alias_kind":"pith_short_8","alias_value":"YK5OFHTQ","created_at":"2026-07-05T04:48:52Z"}],"graph_snapshots":[{"event_id":"sha256:21b9d19372fbe6c7bc9e673a0bbf5cf2176f8dc33e167194af7a5c174b4f668f","target":"graph","created_at":"2026-07-05T04:48:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.08199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the compression of a target two-layer neural network with N nodes into a compressed network with M<N nodes. More precisely, we consider the setting in which the weights of the target network are i.i.d. sub-Gaussian, and we minimize the population L_2 loss between the outputs of the target and of the compressed network, under the assumption of Gaussian inputs. By using tools from high-dimensional probability, we show that this non-convex problem can be simplified when the target network is sufficiently over-parameterized, and provide the error rate of this approximation ","authors_text":"Marco Mondelli, Mohammad Hossein Amani, Rattana Pukdee, Simone Bombari, Stefano Rini","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-17T09:45:23Z","title":"Sharp asymptotics on the compression of two-layer neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08199","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:26e9e89e59e3ae6111fb1109387b05fb9cbbcea83d65deb18c6614d85a1bc0c8","target":"record","created_at":"2026-07-05T04:48:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9f278b8dd281c152e5b31608c958cebf863af58f140eb0b5ed8c8d2a1a156db1","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-17T09:45:23Z","title_canon_sha256":"7bc2f9acc96382222c6ac602927bf8fad84619e98d40db8e8f280aa03e804bf5"},"schema_version":"1.0","source":{"id":"2205.08199","kind":"arxiv","version":4}},"canonical_sha256":"c2bae29e7024db986216757250e370f752cd57a8d2157b4145c017dea56a4045","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2bae29e7024db986216757250e370f752cd57a8d2157b4145c017dea56a4045","first_computed_at":"2026-07-05T04:48:52.445603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:52.445603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dQfkQkVQp1ogCBnpCTUoH8ENVD7ubNIyr9HIPB7nv01TQ/doq3tKNWCH35G46l7lZ/4stgZ3Jnq9OXd3hNQ5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:52.445997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.08199","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26e9e89e59e3ae6111fb1109387b05fb9cbbcea83d65deb18c6614d85a1bc0c8","sha256:21b9d19372fbe6c7bc9e673a0bbf5cf2176f8dc33e167194af7a5c174b4f668f"],"state_sha256":"895b851faf674ec254fb8078501191aef93857b84d6e6b2099aa26f71ed61133"}