{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F2SNBIQVZ57XQWX54HYY66IOWA","short_pith_number":"pith:F2SNBIQV","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"},"canonical_sha256":"2ea4d0a215cf7f785afde1f18f790eb02cd2ae1fdc0550930bf072ba74734c1b","source":{"kind":"arxiv","id":"1811.00866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00866","created_at":"2026-05-18T00:01:41Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00866v1","created_at":"2026-05-18T00:01:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00866","created_at":"2026-05-18T00:01:41Z"},{"alias_kind":"pith_short_12","alias_value":"F2SNBIQVZ57X","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2SNBIQVZ57XQWX5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2SNBIQV","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F2SNBIQVZ57XQWX54HYY66IOWA","target":"record","payload":{"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"},"canonical_sha256":"2ea4d0a215cf7f785afde1f18f790eb02cd2ae1fdc0550930bf072ba74734c1b","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"},"source_kind":"arxiv","source_id":"1811.00866","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:01:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WlVFKK7o5p8LEyt+XK+AFrc2SNMl3Ga3iVvT7EyKp7E+pUfY/3BYB8plo5TCgOExDXAEulGMlidI/e9ikr5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:14:30.618694Z"},"content_sha256":"e2c71f78796dcf97d51a81e1e8cf06f4d3084dca8925752cfb6fcd31529e4c51","schema_version":"1.0","event_id":"sha256:e2c71f78796dcf97d51a81e1e8cf06f4d3084dca8925752cfb6fcd31529e4c51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F2SNBIQVZ57XQWX54HYY66IOWA","target":"graph","payload":{"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"},"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:01:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JR0ZoJMCJ1r2dD/YmtINKKqg8wEnHjZXGWbgfVANicB5OO+U3llqgeDcecBYw5fLhzJsf8hMTfaEt8t8op+fBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:14:30.619458Z"},"content_sha256":"f4cbe1d3084ee8e73ad7f68f9c08fac9459e09c0acb722688f105b6663fb185b","schema_version":"1.0","event_id":"sha256:f4cbe1d3084ee8e73ad7f68f9c08fac9459e09c0acb722688f105b6663fb185b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/bundle.json","state_url":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2SNBIQVZ57XQWX54HYY66IOWA/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-05-30T17:14:30Z","links":{"resolver":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA","bundle":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/bundle.json","state":"https://pith.science/pith/F2SNBIQVZ57XQWX54HYY66IOWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2SNBIQVZ57XQWX54HYY66IOWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F2SNBIQVZ57XQWX54HYY66IOWA","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":"e802410edc2af6c3108110d530b2a3f6b1733b3148f398e41a52a5ddc4a538c5","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T14:03:25Z","title_canon_sha256":"aec3f036e837489cb46305456a7adfb516033debdfae1c8d31d488f8388992eb"},"schema_version":"1.0","source":{"id":"1811.00866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00866","created_at":"2026-05-18T00:01:41Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00866v1","created_at":"2026-05-18T00:01:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00866","created_at":"2026-05-18T00:01:41Z"},{"alias_kind":"pith_short_12","alias_value":"F2SNBIQVZ57X","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F2SNBIQVZ57XQWX5","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F2SNBIQV","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f4cbe1d3084ee8e73ad7f68f9c08fac9459e09c0acb722688f105b6663fb185b","target":"graph","created_at":"2026-05-18T00:01:41Z","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":"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,","authors_text":"Cho-Jui Hsieh, Huan Zhang, Luca Daniel, Pin-Yu Chen, Tsui-Wei Weng","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T14:03:25Z","title":"Efficient Neural Network Robustness Certification with General Activation Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00866","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:e2c71f78796dcf97d51a81e1e8cf06f4d3084dca8925752cfb6fcd31529e4c51","target":"record","created_at":"2026-05-18T00:01:41Z","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":"e802410edc2af6c3108110d530b2a3f6b1733b3148f398e41a52a5ddc4a538c5","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T14:03:25Z","title_canon_sha256":"aec3f036e837489cb46305456a7adfb516033debdfae1c8d31d488f8388992eb"},"schema_version":"1.0","source":{"id":"1811.00866","kind":"arxiv","version":1}},"canonical_sha256":"2ea4d0a215cf7f785afde1f18f790eb02cd2ae1fdc0550930bf072ba74734c1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea4d0a215cf7f785afde1f18f790eb02cd2ae1fdc0550930bf072ba74734c1b","first_computed_at":"2026-05-18T00:01:41.916291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:41.916291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WVhpkRzvceU99zRQXNkzYVkyBP5tDGzsVsYMdUoTxi/UDi4aVT3txaaghslB+dP+9EglGdASIrnqwDKe/1MHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:41.916818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2c71f78796dcf97d51a81e1e8cf06f4d3084dca8925752cfb6fcd31529e4c51","sha256:f4cbe1d3084ee8e73ad7f68f9c08fac9459e09c0acb722688f105b6663fb185b"],"state_sha256":"823d617509fa181d415833193938412a106a64f187ac141d944b4254ce72d020"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8y3a2JVL1DrbS0pcaEXzIO6HnFXd/qDH9qgoKXzwdujlEloCXB/XSUcVTDfxqD88e4gtxSeXSyBLI8xgI20HAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:14:30.623572Z","bundle_sha256":"336c43f911cd3ebf85c3afa7649488444bc378e4020646576e0356986c3ec18f"}}