{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TRXDMZYYEGESSVXANMY4GWPYTM","short_pith_number":"pith:TRXDMZYY","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"},"canonical_sha256":"9c6e36671821892956e06b31c359f89b122f6c4df4206b53fd06c02d83b1e044","source":{"kind":"arxiv","id":"1711.02017","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02017","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02017v3","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02017","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"TRXDMZYYEGES","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRXDMZYYEGESSVXA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRXDMZYY","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TRXDMZYYEGESSVXANMY4GWPYTM","target":"record","payload":{"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"},"canonical_sha256":"9c6e36671821892956e06b31c359f89b122f6c4df4206b53fd06c02d83b1e044","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"},"source_kind":"arxiv","source_id":"1711.02017","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWBg29kYq8OJHOT9SgJbhk1BHQTcusiuUEO46MmNFzk7hw+9OktwQ0GCFqKQVG4bj6t4rj31F4ZlShV9tWSiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:16:25.394805Z"},"content_sha256":"1428733d5219becea01a83a251eb0f92e3d13b66058b38894437d620a6fc55d1","schema_version":"1.0","event_id":"sha256:1428733d5219becea01a83a251eb0f92e3d13b66058b38894437d620a6fc55d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TRXDMZYYEGESSVXANMY4GWPYTM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPzPVznVG+6GWPIArrN9RZ+4hmNaLu53wYyglLCJs+t8irt/NCUT44XNBpizqkgbUySvIluJxcjMIJIA+PFJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:16:25.395164Z"},"content_sha256":"34f157fcfee9d6251f7478503d65aae1efae9e94765551f683aa291a7a7d1a84","schema_version":"1.0","event_id":"sha256:34f157fcfee9d6251f7478503d65aae1efae9e94765551f683aa291a7a7d1a84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/bundle.json","state_url":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRXDMZYYEGESSVXANMY4GWPYTM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T16:16:25Z","links":{"resolver":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM","bundle":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/bundle.json","state":"https://pith.science/pith/TRXDMZYYEGESSVXANMY4GWPYTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRXDMZYYEGESSVXANMY4GWPYTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TRXDMZYYEGESSVXANMY4GWPYTM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e5cb7cfbccd3df0ef76cf117a16f1b051d48e0aca3292c250a2311ad7ffaf64b","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-06T17:03:39Z","title_canon_sha256":"138f51aac6ac1ab237b5f5d5a619c619ed3e16e0779e8bc2fc8f7b7a7f1dc341"},"schema_version":"1.0","source":{"id":"1711.02017","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02017","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02017v3","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02017","created_at":"2026-05-18T00:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"TRXDMZYYEGES","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TRXDMZYYEGESSVXA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TRXDMZYY","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:34f157fcfee9d6251f7478503d65aae1efae9e94765551f683aa291a7a7d1a84","target":"graph","created_at":"2026-05-18T00:14:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Hongxu Yin, Niraj K. Jha, Xiaoliang Dai","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-06T17:03:39Z","title":"NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02017","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1428733d5219becea01a83a251eb0f92e3d13b66058b38894437d620a6fc55d1","target":"record","created_at":"2026-05-18T00:14:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e5cb7cfbccd3df0ef76cf117a16f1b051d48e0aca3292c250a2311ad7ffaf64b","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2017-11-06T17:03:39Z","title_canon_sha256":"138f51aac6ac1ab237b5f5d5a619c619ed3e16e0779e8bc2fc8f7b7a7f1dc341"},"schema_version":"1.0","source":{"id":"1711.02017","kind":"arxiv","version":3}},"canonical_sha256":"9c6e36671821892956e06b31c359f89b122f6c4df4206b53fd06c02d83b1e044","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6e36671821892956e06b31c359f89b122f6c4df4206b53fd06c02d83b1e044","first_computed_at":"2026-05-18T00:14:28.620710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:28.620710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sOP5CATgVAus0LKNYQ59mZYaJv1/w8vGQ9fFGSAZlwOZwXSJiYRnU7Ul3Kq3XErFxoTb1Bt6YKfYY6HRi5TZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:28.621251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02017","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1428733d5219becea01a83a251eb0f92e3d13b66058b38894437d620a6fc55d1","sha256:34f157fcfee9d6251f7478503d65aae1efae9e94765551f683aa291a7a7d1a84"],"state_sha256":"36adf6f47730f63bd014ccf1e0b56e62fcc947d7e73553c6788e1758de76abe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZ6BU6ONGtYK0K6VsYWCZiKuc5fQYyZvA5NDX0mVDEjmiW+TgoW16BM0ae5+nvq9ymBzgfm1EiRIW9iUZ4YbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:16:25.397065Z","bundle_sha256":"468b2e1510042da9f71f4b8cdc206d97dfc3bc0a5884e4290b9dcffa6a268cb6"}}