{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3U35EHNXT3HICC26DLWYVC5V3Z","short_pith_number":"pith:3U35EHNX","schema_version":"1.0","canonical_sha256":"dd37d21db79ece810b5e1aed8a8bb5de67d4d93f5db316fba2185dec19289b2e","source":{"kind":"arxiv","id":"1906.06307","version":2},"attestation_state":"computed","paper":{"title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Namhoon Lee, Philip H. S. Torr, Stephen Gould, Thalaiyasingam Ajanthan","submitted_at":"2019-06-14T17:26:29Z","abstract_excerpt":"Network pruning is a promising avenue for compressing deep neural networks. A typical approach to pruning starts by training a model and then removing redundant parameters while minimizing the impact on what is learned. Alternatively, a recent approach shows that pruning can be done at initialization prior to training, based on a saliency criterion called connection sensitivity. However, it remains unclear exactly why pruning an untrained, randomly initialized neural network is effective. In this work, by noting connection sensitivity as a form of gradient, we formally characterize initializat"},"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":"1906.06307","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T17:26:29Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"2c29ff0d1a34afb1b9bc73013bfeab9aa2c1f3b2c31c6feca9e54594e30976b4","abstract_canon_sha256":"4f65009a494ab206434b6d61508d5e1bf8f778d0e76972ef6784a0c1c1b79579"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:56.209018Z","signature_b64":"Qefpc0M/KUoCNmZjqT5I8e8UM0NCdBLV2EtDLtkQVou10EKSg86XYz5iTvM4lIBNwdGMgNI8eUb+yjEOR4keCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd37d21db79ece810b5e1aed8a8bb5de67d4d93f5db316fba2185dec19289b2e","last_reissued_at":"2026-07-05T00:40:56.208479Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:56.208479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Namhoon Lee, Philip H. S. Torr, Stephen Gould, Thalaiyasingam Ajanthan","submitted_at":"2019-06-14T17:26:29Z","abstract_excerpt":"Network pruning is a promising avenue for compressing deep neural networks. A typical approach to pruning starts by training a model and then removing redundant parameters while minimizing the impact on what is learned. Alternatively, a recent approach shows that pruning can be done at initialization prior to training, based on a saliency criterion called connection sensitivity. However, it remains unclear exactly why pruning an untrained, randomly initialized neural network is effective. In this work, by noting connection sensitivity as a form of gradient, we formally characterize initializat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06307","kind":"arxiv","version":2},"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/1906.06307/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":"1906.06307","created_at":"2026-07-05T00:40:56.208540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06307v2","created_at":"2026-07-05T00:40:56.208540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06307","created_at":"2026-07-05T00:40:56.208540+00:00"},{"alias_kind":"pith_short_12","alias_value":"3U35EHNXT3HI","created_at":"2026-07-05T00:40:56.208540+00:00"},{"alias_kind":"pith_short_16","alias_value":"3U35EHNXT3HICC26","created_at":"2026-07-05T00:40:56.208540+00:00"},{"alias_kind":"pith_short_8","alias_value":"3U35EHNX","created_at":"2026-07-05T00:40:56.208540+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22748","citing_title":"Agentic World Modeling: Foundations, Capabilities, Laws, and Beyond","ref_index":210,"is_internal_anchor":false},{"citing_arxiv_id":"2603.22149","citing_title":"Low Latency GNN Accelerator for Quantum Error Correction","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24380","citing_title":"Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22748","citing_title":"Agentic World Modeling: Foundations, Capabilities, Laws, and Beyond","ref_index":210,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z","json":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z.json","graph_json":"https://pith.science/api/pith-number/3U35EHNXT3HICC26DLWYVC5V3Z/graph.json","events_json":"https://pith.science/api/pith-number/3U35EHNXT3HICC26DLWYVC5V3Z/events.json","paper":"https://pith.science/paper/3U35EHNX"},"agent_actions":{"view_html":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z","download_json":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z.json","view_paper":"https://pith.science/paper/3U35EHNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06307&json=true","fetch_graph":"https://pith.science/api/pith-number/3U35EHNXT3HICC26DLWYVC5V3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/3U35EHNXT3HICC26DLWYVC5V3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z/action/storage_attestation","attest_author":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z/action/author_attestation","sign_citation":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z/action/citation_signature","submit_replication":"https://pith.science/pith/3U35EHNXT3HICC26DLWYVC5V3Z/action/replication_record"}},"created_at":"2026-07-05T00:40:56.208540+00:00","updated_at":"2026-07-05T00:40:56.208540+00:00"}