{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MPDXOJ6G3RFITMMKG4SY6PDYOY","short_pith_number":"pith:MPDXOJ6G","schema_version":"1.0","canonical_sha256":"63c77727c6dc4a89b18a37258f3c7876092a683501b6c711569d14e82795af38","source":{"kind":"arxiv","id":"2006.05467","version":3},"attestation_state":"computed","paper":{"title":"Pruning neural networks without any data by iteratively conserving synaptic flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.CV","q-bio.NC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Kunin, Daniel L. K. Yamins, Hidenori Tanaka, Surya Ganguli","submitted_at":"2020-06-09T19:21:57Z","abstract_excerpt":"Pruning the parameters of deep neural networks has generated intense interest due to potential savings in time, memory and energy both during training and at test time. Recent works have identified, through an expensive sequence of training and pruning cycles, the existence of winning lottery tickets or sparse trainable subnetworks at initialization. This raises a foundational question: can we identify highly sparse trainable subnetworks at initialization, without ever training, or indeed without ever looking at the data? We provide an affirmative answer to this question through theory driven "},"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":"2006.05467","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-09T19:21:57Z","cross_cats_sorted":["cond-mat.dis-nn","cs.CV","q-bio.NC","stat.ML"],"title_canon_sha256":"eaa7945ed980d71f452f9c40534666b01c99fd8cca264a48031bfd9e1161cf85","abstract_canon_sha256":"290228eae29bdf0653bc2b69f1aaa1f14e13182dc794b970eee9f593460e5cc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:46.977426Z","signature_b64":"X5xxkqQxwNX/y3/3N2ROspiLoKXKYaStkrLc0YloKHXuYT7GxcWu2dcahaHfR4ePeHBzOfxDTOL8Xmc8inbSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63c77727c6dc4a89b18a37258f3c7876092a683501b6c711569d14e82795af38","last_reissued_at":"2026-07-05T01:52:46.976980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:46.976980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pruning neural networks without any data by iteratively conserving synaptic flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.CV","q-bio.NC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Kunin, Daniel L. K. Yamins, Hidenori Tanaka, Surya Ganguli","submitted_at":"2020-06-09T19:21:57Z","abstract_excerpt":"Pruning the parameters of deep neural networks has generated intense interest due to potential savings in time, memory and energy both during training and at test time. Recent works have identified, through an expensive sequence of training and pruning cycles, the existence of winning lottery tickets or sparse trainable subnetworks at initialization. This raises a foundational question: can we identify highly sparse trainable subnetworks at initialization, without ever training, or indeed without ever looking at the data? We provide an affirmative answer to this question through theory driven "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.05467","kind":"arxiv","version":3},"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/2006.05467/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":"2006.05467","created_at":"2026-07-05T01:52:46.977035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.05467v3","created_at":"2026-07-05T01:52:46.977035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.05467","created_at":"2026-07-05T01:52:46.977035+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPDXOJ6G3RFI","created_at":"2026-07-05T01:52:46.977035+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPDXOJ6G3RFITMMK","created_at":"2026-07-05T01:52:46.977035+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPDXOJ6G","created_at":"2026-07-05T01:52:46.977035+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22019","citing_title":"Channel Location Constrains the Auditability of Subliminal Learning","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25134","citing_title":"Theoretical Analysis of Sparse Optimization with Reparameterization, Weight Decay, and Adaptive Learning Rate","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09639","citing_title":"XTinyU-Net: Training-Free U-Net Scaling via Initialization-Time Sensitivity","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12207","citing_title":"Not How Many, But Which: Parameter Placement in Low-Rank Adaptation","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27052","citing_title":"Man, Machine, and Mathematics","ref_index":93,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09639","citing_title":"XTinyU-Net: Training-Free U-Net Scaling via Initialization-Time Sensitivity","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10560","citing_title":"Heterogeneous Connectivity in Sparse Networks: Fan-in Profiles, Gradient Hierarchy, and Topological Equilibria","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY","json":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY.json","graph_json":"https://pith.science/api/pith-number/MPDXOJ6G3RFITMMKG4SY6PDYOY/graph.json","events_json":"https://pith.science/api/pith-number/MPDXOJ6G3RFITMMKG4SY6PDYOY/events.json","paper":"https://pith.science/paper/MPDXOJ6G"},"agent_actions":{"view_html":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY","download_json":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY.json","view_paper":"https://pith.science/paper/MPDXOJ6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.05467&json=true","fetch_graph":"https://pith.science/api/pith-number/MPDXOJ6G3RFITMMKG4SY6PDYOY/graph.json","fetch_events":"https://pith.science/api/pith-number/MPDXOJ6G3RFITMMKG4SY6PDYOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY/action/storage_attestation","attest_author":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY/action/author_attestation","sign_citation":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY/action/citation_signature","submit_replication":"https://pith.science/pith/MPDXOJ6G3RFITMMKG4SY6PDYOY/action/replication_record"}},"created_at":"2026-07-05T01:52:46.977035+00:00","updated_at":"2026-07-05T01:52:46.977035+00:00"}