{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3OHGEFNWCZKVXR365AGCM37TI3","short_pith_number":"pith:3OHGEFNW","canonical_record":{"source":{"id":"1711.00851","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T17:59:24Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"811502c50d47f25ffa83c5757caa881e0abc21981460692b912146deafa0506b","abstract_canon_sha256":"0d9aa5f7c7893d5348d09a4d4e34b1af0d1a22a939e14a2680a33ddc4ae16712"},"schema_version":"1.0"},"canonical_sha256":"db8e6215b616555bc77ee80c266ff346fca8d22968c94e97d12f0875392450d5","source":{"kind":"arxiv","id":"1711.00851","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00851","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00851v3","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00851","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"3OHGEFNWCZKV","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3OHGEFNWCZKVXR36","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3OHGEFNW","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3OHGEFNWCZKVXR365AGCM37TI3","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00851","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T17:59:24Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"811502c50d47f25ffa83c5757caa881e0abc21981460692b912146deafa0506b","abstract_canon_sha256":"0d9aa5f7c7893d5348d09a4d4e34b1af0d1a22a939e14a2680a33ddc4ae16712"},"schema_version":"1.0"},"canonical_sha256":"db8e6215b616555bc77ee80c266ff346fca8d22968c94e97d12f0875392450d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:47.382794Z","signature_b64":"y3gzDSAw0/e291SIARzJyDjbYDCw5UabR8P10aFVJt8FB7wSljvcR4PA3OzHXGV/NuaQY8A27j25hxX9aOjZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8e6215b616555bc77ee80c266ff346fca8d22968c94e97d12f0875392450d5","last_reissued_at":"2026-05-18T00:13:47.382167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:47.382167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00851","source_version":3,"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:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlMG7WrOF97OtoWo0xI6Xm4kYxk3Ljah4T7mR2pk0Eb1nutUXZV8AONPzledtNer1O2aaiULLTcdF6lQxmHtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:00:13.079856Z"},"content_sha256":"c00a365b5792ddef39e6b09f0ce52ea0fa73fce11a5a6f17fe98e32f9ded29d4","schema_version":"1.0","event_id":"sha256:c00a365b5792ddef39e6b09f0ce52ea0fa73fce11a5a6f17fe98e32f9ded29d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3OHGEFNWCZKVXR365AGCM37TI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Eric Wong, J. Zico Kolter","submitted_at":"2017-11-02T17:59:24Z","abstract_excerpt":"We propose a method to learn deep ReLU-based classifiers that are provably robust against norm-bounded adversarial perturbations on the training data. For previously unseen examples, the approach is guaranteed to detect all adversarial examples, though it may flag some non-adversarial examples as well. The basic idea is to consider a convex outer approximation of the set of activations reachable through a norm-bounded perturbation, and we develop a robust optimization procedure that minimizes the worst case loss over this outer region (via a linear program). Crucially, we show that the dual pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00851","kind":"arxiv","version":3},"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:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05aeeM6FebsE+Ofsn9x0rfj6Jd5hocUl4ljeTKB0WasbVmdtT5mfFUn/A/MeyJZ9mNcS5R+r3q0ftTjSwd8OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:00:13.080139Z"},"content_sha256":"559e069c86c8961479e458f9abea246566a4237824fe0c3f080ba8142baf24e3","schema_version":"1.0","event_id":"sha256:559e069c86c8961479e458f9abea246566a4237824fe0c3f080ba8142baf24e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OHGEFNWCZKVXR365AGCM37TI3/bundle.json","state_url":"https://pith.science/pith/3OHGEFNWCZKVXR365AGCM37TI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OHGEFNWCZKVXR365AGCM37TI3/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-08-01T01:00:13Z","links":{"resolver":"https://pith.science/pith/3OHGEFNWCZKVXR365AGCM37TI3","bundle":"https://pith.science/pith/3OHGEFNWCZKVXR365AGCM37TI3/bundle.json","state":"https://pith.science/pith/3OHGEFNWCZKVXR365AGCM37TI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OHGEFNWCZKVXR365AGCM37TI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3OHGEFNWCZKVXR365AGCM37TI3","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":"0d9aa5f7c7893d5348d09a4d4e34b1af0d1a22a939e14a2680a33ddc4ae16712","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T17:59:24Z","title_canon_sha256":"811502c50d47f25ffa83c5757caa881e0abc21981460692b912146deafa0506b"},"schema_version":"1.0","source":{"id":"1711.00851","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00851","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00851v3","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00851","created_at":"2026-05-18T00:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"3OHGEFNWCZKV","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3OHGEFNWCZKVXR36","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3OHGEFNW","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:559e069c86c8961479e458f9abea246566a4237824fe0c3f080ba8142baf24e3","target":"graph","created_at":"2026-05-18T00:13:47Z","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":"We propose a method to learn deep ReLU-based classifiers that are provably robust against norm-bounded adversarial perturbations on the training data. For previously unseen examples, the approach is guaranteed to detect all adversarial examples, though it may flag some non-adversarial examples as well. The basic idea is to consider a convex outer approximation of the set of activations reachable through a norm-bounded perturbation, and we develop a robust optimization procedure that minimizes the worst case loss over this outer region (via a linear program). Crucially, we show that the dual pr","authors_text":"Eric Wong, J. Zico Kolter","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T17:59:24Z","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00851","kind":"arxiv","version":3},"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:c00a365b5792ddef39e6b09f0ce52ea0fa73fce11a5a6f17fe98e32f9ded29d4","target":"record","created_at":"2026-05-18T00:13:47Z","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":"0d9aa5f7c7893d5348d09a4d4e34b1af0d1a22a939e14a2680a33ddc4ae16712","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-02T17:59:24Z","title_canon_sha256":"811502c50d47f25ffa83c5757caa881e0abc21981460692b912146deafa0506b"},"schema_version":"1.0","source":{"id":"1711.00851","kind":"arxiv","version":3}},"canonical_sha256":"db8e6215b616555bc77ee80c266ff346fca8d22968c94e97d12f0875392450d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db8e6215b616555bc77ee80c266ff346fca8d22968c94e97d12f0875392450d5","first_computed_at":"2026-05-18T00:13:47.382167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:47.382167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y3gzDSAw0/e291SIARzJyDjbYDCw5UabR8P10aFVJt8FB7wSljvcR4PA3OzHXGV/NuaQY8A27j25hxX9aOjZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:47.382794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00851","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c00a365b5792ddef39e6b09f0ce52ea0fa73fce11a5a6f17fe98e32f9ded29d4","sha256:559e069c86c8961479e458f9abea246566a4237824fe0c3f080ba8142baf24e3"],"state_sha256":"39f09a6e45b5cd687e8805f151f08f55361727d4bec5cc59c1887f6336124178"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCehzdPtD8hOO3OomRQ/8/I30TF4b6ZYVN3MWdQcxEWQ/m6voVPXBGPsocgkgNkkAoo4BB6BlT8y0RQ6yhZRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T01:00:13.083239Z","bundle_sha256":"1013c62832285c4d39c5a1835400da328f7be447a281c54739c3116af94ab8bf"}}