{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HI7W7IERVVXF3HTLB5UMNKORRX","short_pith_number":"pith:HI7W7IER","schema_version":"1.0","canonical_sha256":"3a3f6fa091ad6e5d9e6b0f68c6a9d18decd25ebfdbb44784ba6ddb0247236d33","source":{"kind":"arxiv","id":"1807.06714","version":2},"attestation_state":"computed","paper":{"title":"Defend Deep Neural Networks Against Adversarial Examples via Fixed and Dynamic Quantized Activation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Adnan Siraj Rakin, Boqing Gong, Deliang Fan, Jinfeng Yi","submitted_at":"2018-07-18T00:21:12Z","abstract_excerpt":"Recent studies have shown that deep neural networks (DNNs) are vulnerable to adversarial attacks. To this end, many defense approaches that attempt to improve the robustness of DNNs have been proposed. In a separate and yet related area, recent works have explored to quantize neural network weights and activation functions into low bit-width to compress model size and reduce computational complexity. In this work, we find that these two different tracks, namely the pursuit of network compactness and robustness, can be merged into one and give rise to networks of both advantages. To the best of"},"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":"1807.06714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-18T00:21:12Z","cross_cats_sorted":["cs.CR","cs.CV"],"title_canon_sha256":"0b4561634c2e5f5f879d31d655563611bebf907cb9bb447134bd2aad3d4382bc","abstract_canon_sha256":"af80a30e31439bf9e7f0f16c4c27252bc14dc8529ebd5c0d5df3ca4050a6349f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:13.681346Z","signature_b64":"76f0XaCguYTeMNmLuIkF/4Ssu7mGGKUL+Eu9UKbLGrq0U8cVnNEFriSbXpYfZHyBpz3d9VQLrCmU5vFfLytGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3f6fa091ad6e5d9e6b0f68c6a9d18decd25ebfdbb44784ba6ddb0247236d33","last_reissued_at":"2026-07-05T00:27:13.680881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:13.680881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defend Deep Neural Networks Against Adversarial Examples via Fixed and Dynamic Quantized Activation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV"],"primary_cat":"cs.LG","authors_text":"Adnan Siraj Rakin, Boqing Gong, Deliang Fan, Jinfeng Yi","submitted_at":"2018-07-18T00:21:12Z","abstract_excerpt":"Recent studies have shown that deep neural networks (DNNs) are vulnerable to adversarial attacks. To this end, many defense approaches that attempt to improve the robustness of DNNs have been proposed. In a separate and yet related area, recent works have explored to quantize neural network weights and activation functions into low bit-width to compress model size and reduce computational complexity. In this work, we find that these two different tracks, namely the pursuit of network compactness and robustness, can be merged into one and give rise to networks of both advantages. To the best of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06714","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/1807.06714/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":"1807.06714","created_at":"2026-07-05T00:27:13.680943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06714v2","created_at":"2026-07-05T00:27:13.680943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06714","created_at":"2026-07-05T00:27:13.680943+00:00"},{"alias_kind":"pith_short_12","alias_value":"HI7W7IERVVXF","created_at":"2026-07-05T00:27:13.680943+00:00"},{"alias_kind":"pith_short_16","alias_value":"HI7W7IERVVXF3HTL","created_at":"2026-07-05T00:27:13.680943+00:00"},{"alias_kind":"pith_short_8","alias_value":"HI7W7IER","created_at":"2026-07-05T00:27:13.680943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00900","citing_title":"Metric Learning for Adversarial Robustness","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX","json":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX.json","graph_json":"https://pith.science/api/pith-number/HI7W7IERVVXF3HTLB5UMNKORRX/graph.json","events_json":"https://pith.science/api/pith-number/HI7W7IERVVXF3HTLB5UMNKORRX/events.json","paper":"https://pith.science/paper/HI7W7IER"},"agent_actions":{"view_html":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX","download_json":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX.json","view_paper":"https://pith.science/paper/HI7W7IER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06714&json=true","fetch_graph":"https://pith.science/api/pith-number/HI7W7IERVVXF3HTLB5UMNKORRX/graph.json","fetch_events":"https://pith.science/api/pith-number/HI7W7IERVVXF3HTLB5UMNKORRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX/action/storage_attestation","attest_author":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX/action/author_attestation","sign_citation":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX/action/citation_signature","submit_replication":"https://pith.science/pith/HI7W7IERVVXF3HTLB5UMNKORRX/action/replication_record"}},"created_at":"2026-07-05T00:27:13.680943+00:00","updated_at":"2026-07-05T00:27:13.680943+00:00"}