{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GYJMTQMHWREDOJGVGVHWKLQQNC","short_pith_number":"pith:GYJMTQMH","schema_version":"1.0","canonical_sha256":"3612c9c187b4483724d5354f652e10689f25fe86db76bbbe58918a81e058b8d5","source":{"kind":"arxiv","id":"1506.02626","version":3},"attestation_state":"computed","paper":{"title":"Learning both Weights and Connections for Efficient Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Jeff Pool, John Tran, Song Han, William J. Dally","submitted_at":"2015-06-08T19:28:43Z","abstract_excerpt":"Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems. Also, conventional networks fix the architecture before training starts; as a result, training cannot improve the architecture. To address these limitations, we describe a method to reduce the storage and computation required by neural networks by an order of magnitude without affecting their accuracy by learning only the important connections. Our method prunes redundant connections using a three-step method. First, we train the network to learn which connections are i"},"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":"1506.02626","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-08T19:28:43Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"81c56c392cf92cfa4b105a13d0ae7d69a6dac5da37a8e4c461d57dd490993ff6","abstract_canon_sha256":"885621ca943528824e3ae71366f8d373619c2f91ebc3e80aaab5c0a10389a896"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:14.125365Z","signature_b64":"teVqvG7HGcMP4QFsVy/oGhJDelgj8JiNiOEVnMz/u/F5Gax9gCCl0TAcWHkaDmiFN6723xmSATqLSlClfcJJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3612c9c187b4483724d5354f652e10689f25fe86db76bbbe58918a81e058b8d5","last_reissued_at":"2026-05-18T01:28:14.124657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:14.124657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning both Weights and Connections for Efficient Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.NE","authors_text":"Jeff Pool, John Tran, Song Han, William J. Dally","submitted_at":"2015-06-08T19:28:43Z","abstract_excerpt":"Neural networks are both computationally intensive and memory intensive, making them difficult to deploy on embedded systems. Also, conventional networks fix the architecture before training starts; as a result, training cannot improve the architecture. To address these limitations, we describe a method to reduce the storage and computation required by neural networks by an order of magnitude without affecting their accuracy by learning only the important connections. Our method prunes redundant connections using a three-step method. First, we train the network to learn which connections are i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02626","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":""},"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":"1506.02626","created_at":"2026-05-18T01:28:14.124771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02626v3","created_at":"2026-05-18T01:28:14.124771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02626","created_at":"2026-05-18T01:28:14.124771+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYJMTQMHWRED","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYJMTQMHWREDOJGV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYJMTQMH","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2509.22166","citing_title":"Motivating Next-Gen Accelerators with Flexible (N:M) Activation Sparsity via Benchmarking Lightweight Post-Training Sparsification Approaches","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13688","citing_title":"MedCore: Boundary-Preserving Medical Core Pruning for MedSAM","ref_index":49,"is_internal_anchor":true},{"citing_arxiv_id":"2205.14135","citing_title":"FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26587","citing_title":"Sparse-on-Dense: Area and Energy-Efficient Computing of Sparse Neural Networks on Dense Matrix Multiplication Accelerators","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08813","citing_title":"AgentSlimming: Towards Efficient and Cost-Aware Multi-Agent Systems","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04726","citing_title":"RecGPT-Mobile: On-Device Large Language Models for User Intent Understanding in Taobao Feed Recommendation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12668","citing_title":"OFA-Diffusion Compression: Compressing Diffusion Model in One-Shot Manner","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC","json":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC.json","graph_json":"https://pith.science/api/pith-number/GYJMTQMHWREDOJGVGVHWKLQQNC/graph.json","events_json":"https://pith.science/api/pith-number/GYJMTQMHWREDOJGVGVHWKLQQNC/events.json","paper":"https://pith.science/paper/GYJMTQMH"},"agent_actions":{"view_html":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC","download_json":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC.json","view_paper":"https://pith.science/paper/GYJMTQMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02626&json=true","fetch_graph":"https://pith.science/api/pith-number/GYJMTQMHWREDOJGVGVHWKLQQNC/graph.json","fetch_events":"https://pith.science/api/pith-number/GYJMTQMHWREDOJGVGVHWKLQQNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC/action/storage_attestation","attest_author":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC/action/author_attestation","sign_citation":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC/action/citation_signature","submit_replication":"https://pith.science/pith/GYJMTQMHWREDOJGVGVHWKLQQNC/action/replication_record"}},"created_at":"2026-05-18T01:28:14.124771+00:00","updated_at":"2026-05-18T01:28:14.124771+00:00"}