{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GI6DXVPNSV6KGSDT6M2577M3VH","short_pith_number":"pith:GI6DXVPN","schema_version":"1.0","canonical_sha256":"323c3bd5ed957ca34873f335dffd9ba9e5a76b6aa811afeddfe59444f4415aa7","source":{"kind":"arxiv","id":"2202.02643","version":1},"attestation_state":"computed","paper":{"title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Decebal Constantin Mocanu, Li Shen, Mykola Pechenizkiy, Shiwei Liu, Tianlong Chen, Xiaohan Chen, Zhangyang Wang","submitted_at":"2022-02-05T21:19:41Z","abstract_excerpt":"Random pruning is arguably the most naive way to attain sparsity in neural networks, but has been deemed uncompetitive by either post-training pruning or sparse training. In this paper, we focus on sparse training and highlight a perhaps counter-intuitive finding, that random pruning at initialization can be quite powerful for the sparse training of modern neural networks. Without any delicate pruning criteria or carefully pursued sparsity structures, we empirically demonstrate that sparsely training a randomly pruned network from scratch can match the performance of its dense equivalent. Ther"},"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":"2202.02643","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-05T21:19:41Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"e21408e4e17327dc419dc0012f7a191d9151a615618959039493008b90e216d2","abstract_canon_sha256":"3def846b8f18d45b17318633be7028bb2d461a8087ff69a685068f20e5e96e09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:31.467781Z","signature_b64":"g827cbPHM48AzU1pvBc0ba38H+wYUeZaLmK2dj3Jl4Im0d+fIl7ymxoUquwwYcN689XVAsMyM2tw2aykXEMECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323c3bd5ed957ca34873f335dffd9ba9e5a76b6aa811afeddfe59444f4415aa7","last_reissued_at":"2026-07-05T03:54:31.467382Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:31.467382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Decebal Constantin Mocanu, Li Shen, Mykola Pechenizkiy, Shiwei Liu, Tianlong Chen, Xiaohan Chen, Zhangyang Wang","submitted_at":"2022-02-05T21:19:41Z","abstract_excerpt":"Random pruning is arguably the most naive way to attain sparsity in neural networks, but has been deemed uncompetitive by either post-training pruning or sparse training. In this paper, we focus on sparse training and highlight a perhaps counter-intuitive finding, that random pruning at initialization can be quite powerful for the sparse training of modern neural networks. Without any delicate pruning criteria or carefully pursued sparsity structures, we empirically demonstrate that sparsely training a randomly pruned network from scratch can match the performance of its dense equivalent. Ther"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02643","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/2202.02643/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":"2202.02643","created_at":"2026-07-05T03:54:31.467441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.02643v1","created_at":"2026-07-05T03:54:31.467441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02643","created_at":"2026-07-05T03:54:31.467441+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI6DXVPNSV6K","created_at":"2026-07-05T03:54:31.467441+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI6DXVPNSV6KGSDT","created_at":"2026-07-05T03:54:31.467441+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI6DXVPN","created_at":"2026-07-05T03:54:31.467441+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.02277","citing_title":"Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs \"Difficult\" Downstream Tasks in LLMs","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2603.06003","citing_title":"EvoESAP: Non-Uniform Expert Pruning for Sparse MoE","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH","json":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH.json","graph_json":"https://pith.science/api/pith-number/GI6DXVPNSV6KGSDT6M2577M3VH/graph.json","events_json":"https://pith.science/api/pith-number/GI6DXVPNSV6KGSDT6M2577M3VH/events.json","paper":"https://pith.science/paper/GI6DXVPN"},"agent_actions":{"view_html":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH","download_json":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH.json","view_paper":"https://pith.science/paper/GI6DXVPN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.02643&json=true","fetch_graph":"https://pith.science/api/pith-number/GI6DXVPNSV6KGSDT6M2577M3VH/graph.json","fetch_events":"https://pith.science/api/pith-number/GI6DXVPNSV6KGSDT6M2577M3VH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH/action/storage_attestation","attest_author":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH/action/author_attestation","sign_citation":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH/action/citation_signature","submit_replication":"https://pith.science/pith/GI6DXVPNSV6KGSDT6M2577M3VH/action/replication_record"}},"created_at":"2026-07-05T03:54:31.467441+00:00","updated_at":"2026-07-05T03:54:31.467441+00:00"}