{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PN76LMQ7HXNQDEEYL2GTB3M2IW","short_pith_number":"pith:PN76LMQ7","canonical_record":{"source":{"id":"1607.00485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-02T09:55:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cfa670e516b17881fb0faef9eef14bae5f64e1f6c8d3815332c7174ca3ecf57f","abstract_canon_sha256":"8c2be599d7bc9e1aed6cca9dcdfdea6b59da66df69a1ceee370e79edf2c8a830"},"schema_version":"1.0"},"canonical_sha256":"7b7fe5b21f3ddb0190985e8d30ed9a45aeb726972b6b5ffe9c53db217a15059d","source":{"kind":"arxiv","id":"1607.00485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00485","created_at":"2026-05-18T00:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00485v1","created_at":"2026-05-18T00:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00485","created_at":"2026-05-18T00:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"PN76LMQ7HXNQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PN76LMQ7HXNQDEEY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PN76LMQ7","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PN76LMQ7HXNQDEEYL2GTB3M2IW","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-02T09:55:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cfa670e516b17881fb0faef9eef14bae5f64e1f6c8d3815332c7174ca3ecf57f","abstract_canon_sha256":"8c2be599d7bc9e1aed6cca9dcdfdea6b59da66df69a1ceee370e79edf2c8a830"},"schema_version":"1.0"},"canonical_sha256":"7b7fe5b21f3ddb0190985e8d30ed9a45aeb726972b6b5ffe9c53db217a15059d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:56.943456Z","signature_b64":"tVagHq/QYhFi+PKbUifRLKYGEj21pX60DeCE7VFRgbDBHQnojDvNnYE9lZNRALYpvKd6twUDvNNFFZWaGQ1ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b7fe5b21f3ddb0190985e8d30ed9a45aeb726972b6b5ffe9c53db217a15059d","last_reissued_at":"2026-05-18T00:50:56.942668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:56.942668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00485","source_version":1,"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:50:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKr0V8K4jgs0AKpLDEVBqbF/favAX1Yl/Bz0Au+GZpk9lJ4S260RtUGWTqGIMZYq1t4GSC1pMS/kFsSWWynuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:54.750119Z"},"content_sha256":"3586277bbf63d69b7a6fceff61200d3451953002af73e229f1be9487846698e1","schema_version":"1.0","event_id":"sha256:3586277bbf63d69b7a6fceff61200d3451953002af73e229f1be9487846698e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PN76LMQ7HXNQDEEYL2GTB3M2IW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Sparse Regularization for Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amir Hussain, Aurelio Uncini, Danilo Comminiello, Simone Scardapane","submitted_at":"2016-07-02T09:55:26Z","abstract_excerpt":"In this paper, we consider the joint task of simultaneously optimizing (i) the weights of a deep neural network, (ii) the number of neurons for each hidden layer, and (iii) the subset of active input features (i.e., feature selection). While these problems are generally dealt with separately, we present a simple regularized formulation allowing to solve all three of them in parallel, using standard optimization routines. Specifically, we extend the group Lasso penalty (originated in the linear regression literature) in order to impose group-level sparsity on the network's connections, where ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00485","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":""},"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:50:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3puB+GqzuTerC9Et0f/qclmXsTd3fnYifSP9O0ChufL60D22GeNog3r/cJnmfGvSGabfCDoG224uMoM79RyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:54.750771Z"},"content_sha256":"63ef5563529be7a6ff5249f11f030a0ca30cdd247b09cd38d762d3195d34decf","schema_version":"1.0","event_id":"sha256:63ef5563529be7a6ff5249f11f030a0ca30cdd247b09cd38d762d3195d34decf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW/bundle.json","state_url":"https://pith.science/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW/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-09T07:50:54Z","links":{"resolver":"https://pith.science/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW","bundle":"https://pith.science/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW/bundle.json","state":"https://pith.science/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PN76LMQ7HXNQDEEYL2GTB3M2IW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PN76LMQ7HXNQDEEYL2GTB3M2IW","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":"8c2be599d7bc9e1aed6cca9dcdfdea6b59da66df69a1ceee370e79edf2c8a830","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-02T09:55:26Z","title_canon_sha256":"cfa670e516b17881fb0faef9eef14bae5f64e1f6c8d3815332c7174ca3ecf57f"},"schema_version":"1.0","source":{"id":"1607.00485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00485","created_at":"2026-05-18T00:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00485v1","created_at":"2026-05-18T00:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00485","created_at":"2026-05-18T00:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"PN76LMQ7HXNQ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PN76LMQ7HXNQDEEY","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PN76LMQ7","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:63ef5563529be7a6ff5249f11f030a0ca30cdd247b09cd38d762d3195d34decf","target":"graph","created_at":"2026-05-18T00:50:56Z","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":"In this paper, we consider the joint task of simultaneously optimizing (i) the weights of a deep neural network, (ii) the number of neurons for each hidden layer, and (iii) the subset of active input features (i.e., feature selection). While these problems are generally dealt with separately, we present a simple regularized formulation allowing to solve all three of them in parallel, using standard optimization routines. Specifically, we extend the group Lasso penalty (originated in the linear regression literature) in order to impose group-level sparsity on the network's connections, where ea","authors_text":"Amir Hussain, Aurelio Uncini, Danilo Comminiello, Simone Scardapane","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-02T09:55:26Z","title":"Group Sparse Regularization for Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00485","kind":"arxiv","version":1},"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:3586277bbf63d69b7a6fceff61200d3451953002af73e229f1be9487846698e1","target":"record","created_at":"2026-05-18T00:50:56Z","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":"8c2be599d7bc9e1aed6cca9dcdfdea6b59da66df69a1ceee370e79edf2c8a830","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-02T09:55:26Z","title_canon_sha256":"cfa670e516b17881fb0faef9eef14bae5f64e1f6c8d3815332c7174ca3ecf57f"},"schema_version":"1.0","source":{"id":"1607.00485","kind":"arxiv","version":1}},"canonical_sha256":"7b7fe5b21f3ddb0190985e8d30ed9a45aeb726972b6b5ffe9c53db217a15059d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b7fe5b21f3ddb0190985e8d30ed9a45aeb726972b6b5ffe9c53db217a15059d","first_computed_at":"2026-05-18T00:50:56.942668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:56.942668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVagHq/QYhFi+PKbUifRLKYGEj21pX60DeCE7VFRgbDBHQnojDvNnYE9lZNRALYpvKd6twUDvNNFFZWaGQ1ABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:56.943456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3586277bbf63d69b7a6fceff61200d3451953002af73e229f1be9487846698e1","sha256:63ef5563529be7a6ff5249f11f030a0ca30cdd247b09cd38d762d3195d34decf"],"state_sha256":"a7ae5911605913bedced435e44b514670e88d2e20f28c4a6ed0606ab78cb08d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+3WQGOFP+0wSr/vCX+t0UzSEP6oge6zS84fCl59P53+xB19BcS+FIU/5phu62ibOXZNGt9UwJpENrwG3wiMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:50:54.754745Z","bundle_sha256":"81f93f2048186adee4b659a5053bfde65ce5baffb240499209e5a1dc0686bab4"}}