{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FTGMR7HW5FS4Q5G7LAQJQRVSY4","short_pith_number":"pith:FTGMR7HW","schema_version":"1.0","canonical_sha256":"2cccc8fcf6e965c874df58209846b2c701418a1125a44f6748fe5b99df8469be","source":{"kind":"arxiv","id":"1809.08352","version":1},"attestation_state":"computed","paper":{"title":"Unrestricted Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Catherine Olsson, Chiyuan Zhang, Ian Goodfellow, Nicholas Carlini, Paul Christiano, Tom B. Brown","submitted_at":"2018-09-22T00:16:18Z","abstract_excerpt":"We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achieve high accuracy and coverage on non-adversarial data while making no confident mistakes on adversarial inputs. Attackers try to subvert defenses by finding arbitrary unambiguous inputs where the model assigns an incorrect label with high confidence. We propose a simple unambigu"},"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":"1809.08352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-22T00:16:18Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"a7809bb61f00911e3d86793a9b4423bb24a9f69f5aa9f534b6d25711564650fd","abstract_canon_sha256":"da264e42e78c6a3fb7d0a31b8f63c847af3a92be46ec8e9adca65bbf5705b02e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:08.721704Z","signature_b64":"SL5wfG01oHkizEyBpF66/zzi2r1GglQ6FlWAa2NqLKGbgYGRIVxsd37VDh19nwghTsM+le9S8IA2AdmN8nQdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cccc8fcf6e965c874df58209846b2c701418a1125a44f6748fe5b99df8469be","last_reissued_at":"2026-05-18T00:05:08.721154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:08.721154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unrestricted Adversarial Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Catherine Olsson, Chiyuan Zhang, Ian Goodfellow, Nicholas Carlini, Paul Christiano, Tom B. Brown","submitted_at":"2018-09-22T00:16:18Z","abstract_excerpt":"We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achieve high accuracy and coverage on non-adversarial data while making no confident mistakes on adversarial inputs. Attackers try to subvert defenses by finding arbitrary unambiguous inputs where the model assigns an incorrect label with high confidence. We propose a simple unambigu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08352","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":"1809.08352","created_at":"2026-05-18T00:05:08.721237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08352v1","created_at":"2026-05-18T00:05:08.721237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08352","created_at":"2026-05-18T00:05:08.721237+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTGMR7HW5FS4","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTGMR7HW5FS4Q5G7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTGMR7HW","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4","json":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4.json","graph_json":"https://pith.science/api/pith-number/FTGMR7HW5FS4Q5G7LAQJQRVSY4/graph.json","events_json":"https://pith.science/api/pith-number/FTGMR7HW5FS4Q5G7LAQJQRVSY4/events.json","paper":"https://pith.science/paper/FTGMR7HW"},"agent_actions":{"view_html":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4","download_json":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4.json","view_paper":"https://pith.science/paper/FTGMR7HW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08352&json=true","fetch_graph":"https://pith.science/api/pith-number/FTGMR7HW5FS4Q5G7LAQJQRVSY4/graph.json","fetch_events":"https://pith.science/api/pith-number/FTGMR7HW5FS4Q5G7LAQJQRVSY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4/action/storage_attestation","attest_author":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4/action/author_attestation","sign_citation":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4/action/citation_signature","submit_replication":"https://pith.science/pith/FTGMR7HW5FS4Q5G7LAQJQRVSY4/action/replication_record"}},"created_at":"2026-05-18T00:05:08.721237+00:00","updated_at":"2026-05-18T00:05:08.721237+00:00"}