{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IQTFMMVKB5RPMZABWJ3F47L6TZ","short_pith_number":"pith:IQTFMMVK","schema_version":"1.0","canonical_sha256":"44265632aa0f62f66401b2765e7d7e9e5557ba762068aa7924c22c0660eb822b","source":{"kind":"arxiv","id":"1906.06110","version":1},"attestation_state":"computed","paper":{"title":"Towards Compact and Robust Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Prateek Mittal, Shiqi Wang, Suman Jana, Vikash Sehwag","submitted_at":"2019-06-14T10:12:02Z","abstract_excerpt":"Deep neural networks have achieved impressive performance in many applications but their large number of parameters lead to significant computational and storage overheads. Several recent works attempt to mitigate these overheads by designing compact networks using pruning of connections. However, we observe that most of the existing strategies to design compact networks fail to preserve network robustness against adversarial examples. In this work, we rigorously study the extension of network pruning strategies to preserve both benign accuracy and robustness of a network. Starting with a form"},"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":"1906.06110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T10:12:02Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9a0a7259e3d12a370f83f22740a924433d4b5887951c1d460f690d788c32007f","abstract_canon_sha256":"26375dde4d22d39dc3f4a01ba38c23819d652f2dde3bcc73553fc042e903c037"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:19.680946Z","signature_b64":"TiFztZ9hs+ljyObdgGPODnnzJaY5P3ep8pXxWyDBM95v6FGDoux/+zvdmdjvrHKMuWye4qu3W1r5ASMzMysADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44265632aa0f62f66401b2765e7d7e9e5557ba762068aa7924c22c0660eb822b","last_reissued_at":"2026-05-17T23:43:19.680235Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:19.680235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Compact and Robust Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Prateek Mittal, Shiqi Wang, Suman Jana, Vikash Sehwag","submitted_at":"2019-06-14T10:12:02Z","abstract_excerpt":"Deep neural networks have achieved impressive performance in many applications but their large number of parameters lead to significant computational and storage overheads. Several recent works attempt to mitigate these overheads by designing compact networks using pruning of connections. However, we observe that most of the existing strategies to design compact networks fail to preserve network robustness against adversarial examples. In this work, we rigorously study the extension of network pruning strategies to preserve both benign accuracy and robustness of a network. Starting with a form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06110","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.06110","created_at":"2026-05-17T23:43:19.680343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06110v1","created_at":"2026-05-17T23:43:19.680343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06110","created_at":"2026-05-17T23:43:19.680343+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQTFMMVKB5RP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQTFMMVKB5RPMZAB","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQTFMMVK","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.05582","citing_title":"Bias In, Bias Out? Finding Unbiased Subnetworks in Vanilla Models","ref_index":86,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ","json":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ.json","graph_json":"https://pith.science/api/pith-number/IQTFMMVKB5RPMZABWJ3F47L6TZ/graph.json","events_json":"https://pith.science/api/pith-number/IQTFMMVKB5RPMZABWJ3F47L6TZ/events.json","paper":"https://pith.science/paper/IQTFMMVK"},"agent_actions":{"view_html":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ","download_json":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ.json","view_paper":"https://pith.science/paper/IQTFMMVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06110&json=true","fetch_graph":"https://pith.science/api/pith-number/IQTFMMVKB5RPMZABWJ3F47L6TZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IQTFMMVKB5RPMZABWJ3F47L6TZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ/action/storage_attestation","attest_author":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ/action/author_attestation","sign_citation":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ/action/citation_signature","submit_replication":"https://pith.science/pith/IQTFMMVKB5RPMZABWJ3F47L6TZ/action/replication_record"}},"created_at":"2026-05-17T23:43:19.680343+00:00","updated_at":"2026-05-17T23:43:19.680343+00:00"}