{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TRXDMZYYEGESSVXANMY4GWPYTM","short_pith_number":"pith:TRXDMZYY","schema_version":"1.0","canonical_sha256":"9c6e36671821892956e06b31c359f89b122f6c4df4206b53fd06c02d83b1e044","source":{"kind":"arxiv","id":"1711.02017","version":3},"attestation_state":"computed","paper":{"title":"NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.NE","authors_text":"Hongxu Yin, Niraj K. Jha, Xiaoliang Dai","submitted_at":"2017-11-06T17:03:39Z","abstract_excerpt":"Deep neural networks (DNNs) have begun to have a pervasive impact on various applications of machine learning. However, the problem of finding an optimal DNN architecture for large applications is challenging. Common approaches go for deeper and larger DNN architectures but may incur substantial redundancy. To address these problems, we introduce a network growth algorithm that complements network pruning to learn both weights and compact DNN architectures during training. We propose a DNN synthesis tool (NeST) that combines both methods to automate the generation of compact and accurate DNNs."},"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":"1711.02017","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-06T17:03:39Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"138f51aac6ac1ab237b5f5d5a619c619ed3e16e0779e8bc2fc8f7b7a7f1dc341","abstract_canon_sha256":"e5cb7cfbccd3df0ef76cf117a16f1b051d48e0aca3292c250a2311ad7ffaf64b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:28.621251Z","signature_b64":"sOP5CATgVAus0LKNYQ59mZYaJv1/w8vGQ9fFGSAZlwOZwXSJiYRnU7Ul3Kq3XErFxoTb1Bt6YKfYY6HRi5TZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6e36671821892956e06b31c359f89b122f6c4df4206b53fd06c02d83b1e044","last_reissued_at":"2026-05-18T00:14:28.620710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:28.620710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.NE","authors_text":"Hongxu Yin, Niraj K. Jha, Xiaoliang Dai","submitted_at":"2017-11-06T17:03:39Z","abstract_excerpt":"Deep neural networks (DNNs) have begun to have a pervasive impact on various applications of machine learning. However, the problem of finding an optimal DNN architecture for large applications is challenging. Common approaches go for deeper and larger DNN architectures but may incur substantial redundancy. To address these problems, we introduce a network growth algorithm that complements network pruning to learn both weights and compact DNN architectures during training. We propose a DNN synthesis tool (NeST) that combines both methods to automate the generation of compact and accurate DNNs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02017","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":"1711.02017","created_at":"2026-05-18T00:14:28.620793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02017v3","created_at":"2026-05-18T00:14:28.620793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02017","created_at":"2026-05-18T00:14:28.620793+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRXDMZYYEGES","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRXDMZYYEGESSVXA","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRXDMZYY","created_at":"2026-05-18T12:31:46.661854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM","json":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM.json","graph_json":"https://pith.science/api/pith-number/TRXDMZYYEGESSVXANMY4GWPYTM/graph.json","events_json":"https://pith.science/api/pith-number/TRXDMZYYEGESSVXANMY4GWPYTM/events.json","paper":"https://pith.science/paper/TRXDMZYY"},"agent_actions":{"view_html":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM","download_json":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM.json","view_paper":"https://pith.science/paper/TRXDMZYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02017&json=true","fetch_graph":"https://pith.science/api/pith-number/TRXDMZYYEGESSVXANMY4GWPYTM/graph.json","fetch_events":"https://pith.science/api/pith-number/TRXDMZYYEGESSVXANMY4GWPYTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/action/storage_attestation","attest_author":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/action/author_attestation","sign_citation":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/action/citation_signature","submit_replication":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/action/replication_record"}},"created_at":"2026-05-18T00:14:28.620793+00:00","updated_at":"2026-05-18T00:14:28.620793+00:00"}