{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O7EYH6YWIJV5TYL4YP2CBCCPB6","short_pith_number":"pith:O7EYH6YW","schema_version":"1.0","canonical_sha256":"77c983fb16426bd9e17cc3f420884f0f91e186b811a7838f9f9b91256edb0611","source":{"kind":"arxiv","id":"2411.09127","version":2},"attestation_state":"computed","paper":{"title":"Complexity-Aware Training of Deep Neural Networks for Optimal Structure Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Athanasios Sideris, Valentin Frank Ingmar Guenter","submitted_at":"2024-11-14T02:00:22Z","abstract_excerpt":"We propose a novel algorithm for combined unit and layer pruning of deep neural networks that functions during training and without requiring a pre-trained network to apply. Our algorithm optimally trades-off learning accuracy and pruning levels while balancing layer vs. unit pruning and computational vs. parameter complexity using only three user-defined parameters, which are easy to interpret and tune. We formulate a stochastic optimization problem over the network weights and the parameters of variational Bernoulli distributions for binary Random Variables taking values either 0 or 1 and sc"},"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":"2411.09127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-14T02:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"d5dc4d2c795619728fdc199510f02d2ba2f1027f34a7fbcd528b902608416fc1","abstract_canon_sha256":"2c04591825d2a4a161542fa4edc31df842807b97db7ae25d825acf8c03a9bde8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:01.903108Z","signature_b64":"DGozUMydURN33004VJeBhJovE/O6VyDF9QNM3DqEu9OIQDOUaXWdF4NnF1HlLI+h3l+oLgqAXWZG3qOwzSsgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77c983fb16426bd9e17cc3f420884f0f91e186b811a7838f9f9b91256edb0611","last_reissued_at":"2026-07-05T11:38:01.902591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:01.902591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity-Aware Training of Deep Neural Networks for Optimal Structure Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Athanasios Sideris, Valentin Frank Ingmar Guenter","submitted_at":"2024-11-14T02:00:22Z","abstract_excerpt":"We propose a novel algorithm for combined unit and layer pruning of deep neural networks that functions during training and without requiring a pre-trained network to apply. Our algorithm optimally trades-off learning accuracy and pruning levels while balancing layer vs. unit pruning and computational vs. parameter complexity using only three user-defined parameters, which are easy to interpret and tune. We formulate a stochastic optimization problem over the network weights and the parameters of variational Bernoulli distributions for binary Random Variables taking values either 0 or 1 and sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09127","kind":"arxiv","version":2},"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/2411.09127/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":"2411.09127","created_at":"2026-07-05T11:38:01.902651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09127v2","created_at":"2026-07-05T11:38:01.902651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09127","created_at":"2026-07-05T11:38:01.902651+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7EYH6YWIJV5","created_at":"2026-07-05T11:38:01.902651+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7EYH6YWIJV5TYL4","created_at":"2026-07-05T11:38:01.902651+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7EYH6YW","created_at":"2026-07-05T11:38:01.902651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11975","citing_title":"Online Training and Pruning of Deep Reinforcement Learning Networks","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6","json":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6.json","graph_json":"https://pith.science/api/pith-number/O7EYH6YWIJV5TYL4YP2CBCCPB6/graph.json","events_json":"https://pith.science/api/pith-number/O7EYH6YWIJV5TYL4YP2CBCCPB6/events.json","paper":"https://pith.science/paper/O7EYH6YW"},"agent_actions":{"view_html":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6","download_json":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6.json","view_paper":"https://pith.science/paper/O7EYH6YW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09127&json=true","fetch_graph":"https://pith.science/api/pith-number/O7EYH6YWIJV5TYL4YP2CBCCPB6/graph.json","fetch_events":"https://pith.science/api/pith-number/O7EYH6YWIJV5TYL4YP2CBCCPB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6/action/storage_attestation","attest_author":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6/action/author_attestation","sign_citation":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6/action/citation_signature","submit_replication":"https://pith.science/pith/O7EYH6YWIJV5TYL4YP2CBCCPB6/action/replication_record"}},"created_at":"2026-07-05T11:38:01.902651+00:00","updated_at":"2026-07-05T11:38:01.902651+00:00"}