{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UIGF556SFOMQQ2Y6DRVMYE4OQG","short_pith_number":"pith:UIGF556S","schema_version":"1.0","canonical_sha256":"a20c5ef7d22b99086b1e1c6acc138e81b392e4e292bb2dc72af2d5c3bb08206a","source":{"kind":"arxiv","id":"1809.07802","version":2},"attestation_state":"computed","paper":{"title":"Playing the Game of Universal Adversarial Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bilal Piot, Julien Perolat, Mateusz Malinowski, Olivier Pietquin","submitted_at":"2018-09-20T18:48:36Z","abstract_excerpt":"We study the problem of learning classifiers robust to universal adversarial perturbations. While prior work approaches this problem via robust optimization, adversarial training, or input transformation, we instead phrase it as a two-player zero-sum game. In this new formulation, both players simultaneously play the same game, where one player chooses a classifier that minimizes a classification loss whilst the other player creates an adversarial perturbation that increases the same loss when applied to every sample in the training set. By observing that performing a classification (respectiv"},"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.07802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-20T18:48:36Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"496efbbfa2b6fca1e0f786266af29829a46065efa3c4992d8fe1b1cc104076dc","abstract_canon_sha256":"f9bd111f191d58ed28c6962058283e1905a590d213d6a98a107b88d7d1846000"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:44.338543Z","signature_b64":"XIuDjiVacTXn95a8Q998QP4o5STeVUx38Qvf8Upbmcdr2ew9nXFUb0iMtUnff016+LGROkaQk2qVQedQTNhBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20c5ef7d22b99086b1e1c6acc138e81b392e4e292bb2dc72af2d5c3bb08206a","last_reissued_at":"2026-05-18T00:04:44.337808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:44.337808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Playing the Game of Universal Adversarial Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bilal Piot, Julien Perolat, Mateusz Malinowski, Olivier Pietquin","submitted_at":"2018-09-20T18:48:36Z","abstract_excerpt":"We study the problem of learning classifiers robust to universal adversarial perturbations. While prior work approaches this problem via robust optimization, adversarial training, or input transformation, we instead phrase it as a two-player zero-sum game. In this new formulation, both players simultaneously play the same game, where one player chooses a classifier that minimizes a classification loss whilst the other player creates an adversarial perturbation that increases the same loss when applied to every sample in the training set. By observing that performing a classification (respectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07802","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":""},"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.07802","created_at":"2026-05-18T00:04:44.337920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07802v2","created_at":"2026-05-18T00:04:44.337920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07802","created_at":"2026-05-18T00:04:44.337920+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIGF556SFOMQ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIGF556SFOMQQ2Y6","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIGF556S","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13024","citing_title":"Position: Certified Robustness Does Not (Yet) Imply Model Security","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG","json":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG.json","graph_json":"https://pith.science/api/pith-number/UIGF556SFOMQQ2Y6DRVMYE4OQG/graph.json","events_json":"https://pith.science/api/pith-number/UIGF556SFOMQQ2Y6DRVMYE4OQG/events.json","paper":"https://pith.science/paper/UIGF556S"},"agent_actions":{"view_html":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG","download_json":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG.json","view_paper":"https://pith.science/paper/UIGF556S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07802&json=true","fetch_graph":"https://pith.science/api/pith-number/UIGF556SFOMQQ2Y6DRVMYE4OQG/graph.json","fetch_events":"https://pith.science/api/pith-number/UIGF556SFOMQQ2Y6DRVMYE4OQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG/action/storage_attestation","attest_author":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG/action/author_attestation","sign_citation":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG/action/citation_signature","submit_replication":"https://pith.science/pith/UIGF556SFOMQQ2Y6DRVMYE4OQG/action/replication_record"}},"created_at":"2026-05-18T00:04:44.337920+00:00","updated_at":"2026-05-18T00:04:44.337920+00:00"}