{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YK5OFHTQETNZQYQWOVZFBY3Q65","short_pith_number":"pith:YK5OFHTQ","canonical_record":{"source":{"id":"2205.08199","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-17T09:45:23Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"7bc2f9acc96382222c6ac602927bf8fad84619e98d40db8e8f280aa03e804bf5","abstract_canon_sha256":"9f278b8dd281c152e5b31608c958cebf863af58f140eb0b5ed8c8d2a1a156db1"},"schema_version":"1.0"},"canonical_sha256":"c2bae29e7024db986216757250e370f752cd57a8d2157b4145c017dea56a4045","source":{"kind":"arxiv","id":"2205.08199","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YK5OFHTQETNZQYQWOVZFBY3Q65","target":"record","payload":{"canonical_record":{"source":{"id":"2205.08199","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-05-17T09:45:23Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"7bc2f9acc96382222c6ac602927bf8fad84619e98d40db8e8f280aa03e804bf5","abstract_canon_sha256":"9f278b8dd281c152e5b31608c958cebf863af58f140eb0b5ed8c8d2a1a156db1"},"schema_version":"1.0"},"canonical_sha256":"c2bae29e7024db986216757250e370f752cd57a8d2157b4145c017dea56a4045","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:52.445997Z","signature_b64":"dQfkQkVQp1ogCBnpCTUoH8ENVD7ubNIyr9HIPB7nv01TQ/doq3tKNWCH35G46l7lZ/4stgZ3Jnq9OXd3hNQ5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2bae29e7024db986216757250e370f752cd57a8d2157b4145c017dea56a4045","last_reissued_at":"2026-07-05T04:48:52.445603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:52.445603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.08199","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYgZwlk6EhKX9Z3AE822kvvAnlE5pbQcOomf7tWaPnXtHOq5aKPk280yUgyDweQG6nRj+nhxXG7gNFQdocTnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T04:58:12.025020Z"},"content_sha256":"26e9e89e59e3ae6111fb1109387b05fb9cbbcea83d65deb18c6614d85a1bc0c8","schema_version":"1.0","event_id":"sha256:26e9e89e59e3ae6111fb1109387b05fb9cbbcea83d65deb18c6614d85a1bc0c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YK5OFHTQETNZQYQWOVZFBY3Q65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp asymptotics on the compression of two-layer neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Marco Mondelli, Mohammad Hossein Amani, Rattana Pukdee, Simone Bombari, Stefano Rini","submitted_at":"2022-05-17T09:45:23Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08199","kind":"arxiv","version":4},"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/2205.08199/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:48:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnzZKix751Pv95Z/WbCUoW0Useq0yX/xEQWWr6183MhgQPicGcCSpLYdXd/qpKufyo/q5AWOWZFceLxGsOdUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T04:58:12.025501Z"},"content_sha256":"21b9d19372fbe6c7bc9e673a0bbf5cf2176f8dc33e167194af7a5c174b4f668f","schema_version":"1.0","event_id":"sha256:21b9d19372fbe6c7bc9e673a0bbf5cf2176f8dc33e167194af7a5c174b4f668f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YK5OFHTQETNZQYQWOVZFBY3Q65/bundle.json","state_url":"https://pith.science/pith/YK5OFHTQETNZQYQWOVZFBY3Q65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YK5OFHTQETNZQYQWOVZFBY3Q65/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T04:58:12Z","links":{"resolver":"https://pith.science/pith/YK5OFHTQETNZQYQWOVZFBY3Q65","bundle":"https://pith.science/pith/YK5OFHTQETNZQYQWOVZFBY3Q65/bundle.json","state":"https://pith.science/pith/YK5OFHTQETNZQYQWOVZFBY3Q65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YK5OFHTQETNZQYQWOVZFBY3Q65/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsZvXi0EZk84Tcqqc531MA8yAJBvxQXTP6YWgNAokrV6mvgJr4cfeLlDZ5zr20D8ptFbpecMAasy1+UGILdxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T04:58:12.029517Z","bundle_sha256":"ed84f54db2691553dbdb52a070370db60e1e38580749205a4e52e63eed9672b9"}}