{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F2SNBIQVZ57XQWX54HYY66IOWA","short_pith_number":"pith:F2SNBIQV","schema_version":"1.0","canonical_sha256":"2ea4d0a215cf7f785afde1f18f790eb02cd2ae1fdc0550930bf072ba74734c1b","source":{"kind":"arxiv","id":"1811.00866","version":1},"attestation_state":"computed","paper":{"title":"Efficient Neural Network Robustness Certification with General Activation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Huan Zhang, Luca Daniel, Pin-Yu Chen, Tsui-Wei Weng","submitted_at":"2018-11-02T14:03:25Z","abstract_excerpt":"Finding minimum distortion of adversarial examples and thus certifying robustness in neural network classifiers for given data points is known to be a challenging problem. Nevertheless, recently it has been shown to be possible to give a non-trivial certified lower bound of minimum adversarial distortion, and some recent progress has been made towards this direction by exploiting the piece-wise linear nature of ReLU activations. However, a generic robustness certification for general activation functions still remains largely unexplored. To address this issue, in this paper we introduce CROWN,"},"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":"1811.00866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T14:03:25Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"aec3f036e837489cb46305456a7adfb516033debdfae1c8d31d488f8388992eb","abstract_canon_sha256":"e802410edc2af6c3108110d530b2a3f6b1733b3148f398e41a52a5ddc4a538c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:41.916818Z","signature_b64":"WVhpkRzvceU99zRQXNkzYVkyBP5tDGzsVsYMdUoTxi/UDi4aVT3txaaghslB+dP+9EglGdASIrnqwDKe/1MHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea4d0a215cf7f785afde1f18f790eb02cd2ae1fdc0550930bf072ba74734c1b","last_reissued_at":"2026-05-18T00:01:41.916291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:41.916291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Neural Network Robustness Certification with General Activation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cho-Jui Hsieh, Huan Zhang, Luca Daniel, Pin-Yu Chen, Tsui-Wei Weng","submitted_at":"2018-11-02T14:03:25Z","abstract_excerpt":"Finding minimum distortion of adversarial examples and thus certifying robustness in neural network classifiers for given data points is known to be a challenging problem. Nevertheless, recently it has been shown to be possible to give a non-trivial certified lower bound of minimum adversarial distortion, and some recent progress has been made towards this direction by exploiting the piece-wise linear nature of ReLU activations. However, a generic robustness certification for general activation functions still remains largely unexplored. To address this issue, in this paper we introduce CROWN,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00866","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":"1811.00866","created_at":"2026-05-18T00:01:41.916381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00866v1","created_at":"2026-05-18T00:01:41.916381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00866","created_at":"2026-05-18T00:01:41.916381+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2SNBIQVZ57X","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2SNBIQVZ57XQWX5","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2SNBIQV","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2410.03000","citing_title":"Towards Generalized Certified Robustness with Multi-Norm Training","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17153","citing_title":"Stress-Testing Neural Network Verifiers with Provably Robust Instances","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13845","citing_title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","ref_index":133,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13845","citing_title":"Quantitative Linear Logic for Neuro-Symbolic Learning and Verification","ref_index":133,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16426","citing_title":"Functional Similarity Metric for Neural Networks: Overcoming Parametric Ambiguity via Activation Region Analysis","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA","json":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA.json","graph_json":"https://pith.science/api/pith-number/F2SNBIQVZ57XQWX54HYY66IOWA/graph.json","events_json":"https://pith.science/api/pith-number/F2SNBIQVZ57XQWX54HYY66IOWA/events.json","paper":"https://pith.science/paper/F2SNBIQV"},"agent_actions":{"view_html":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA","download_json":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA.json","view_paper":"https://pith.science/paper/F2SNBIQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00866&json=true","fetch_graph":"https://pith.science/api/pith-number/F2SNBIQVZ57XQWX54HYY66IOWA/graph.json","fetch_events":"https://pith.science/api/pith-number/F2SNBIQVZ57XQWX54HYY66IOWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/action/storage_attestation","attest_author":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/action/author_attestation","sign_citation":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/action/citation_signature","submit_replication":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/action/replication_record"}},"created_at":"2026-05-18T00:01:41.916381+00:00","updated_at":"2026-05-18T00:01:41.916381+00:00"}