{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AEBDDFSRQISB3OCIIHMHITUPS3","short_pith_number":"pith:AEBDDFSR","schema_version":"1.0","canonical_sha256":"010231965182241db84841d8744e8f96f149605eb5299fa7ee945a5149ea8076","source":{"kind":"arxiv","id":"1906.00945","version":2},"attestation_state":"computed","paper":{"title":"Adversarial Robustness as a Prior for Learned Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Aleksander Madry, Andrew Ilyas, Brandon Tran, Dimitris Tsipras, Logan Engstrom, Shibani Santurkar","submitted_at":"2019-06-03T17:55:20Z","abstract_excerpt":"An important goal in deep learning is to learn versatile, high-level feature representations of input data. However, standard networks' representations seem to possess shortcomings that, as we illustrate, prevent them from fully realizing this goal. In this work, we show that robust optimization can be re-cast as a tool for enforcing priors on the features learned by deep neural networks. It turns out that representations learned by robust models address the aforementioned shortcomings and make significant progress towards learning a high-level encoding of inputs. In particular, these represen"},"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":"1906.00945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-03T17:55:20Z","cross_cats_sorted":["cs.CV","cs.LG","cs.NE"],"title_canon_sha256":"520832e8e6d7c48bec11ee3f1c204b5c1717f5c5a0ef9a62efcbdf5080a25ebc","abstract_canon_sha256":"60c1d230ea1421d3a2b181b387cb3c6a6d9b3f78e1c6ccd2d778303d10486656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:36.389071Z","signature_b64":"M1s65Gn6S1SsDM+HtbSjepIWI4kJ9XzSm61zmBJGc7CIpDkLmQmaAARMPBfC1dCMmHYhMJYf0Lj/I4D8J85wBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"010231965182241db84841d8744e8f96f149605eb5299fa7ee945a5149ea8076","last_reissued_at":"2026-07-05T00:07:36.388610Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:36.388610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Robustness as a Prior for Learned Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Aleksander Madry, Andrew Ilyas, Brandon Tran, Dimitris Tsipras, Logan Engstrom, Shibani Santurkar","submitted_at":"2019-06-03T17:55:20Z","abstract_excerpt":"An important goal in deep learning is to learn versatile, high-level feature representations of input data. However, standard networks' representations seem to possess shortcomings that, as we illustrate, prevent them from fully realizing this goal. In this work, we show that robust optimization can be re-cast as a tool for enforcing priors on the features learned by deep neural networks. It turns out that representations learned by robust models address the aforementioned shortcomings and make significant progress towards learning a high-level encoding of inputs. In particular, these represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00945","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.00945/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1906.00945","created_at":"2026-07-05T00:07:36.388667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00945v2","created_at":"2026-07-05T00:07:36.388667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00945","created_at":"2026-07-05T00:07:36.388667+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEBDDFSRQISB","created_at":"2026-07-05T00:07:36.388667+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEBDDFSRQISB3OCI","created_at":"2026-07-05T00:07:36.388667+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEBDDFSR","created_at":"2026-07-05T00:07:36.388667+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03730","citing_title":"Beyond False Stability: High-Noise Drift Gating for Test-Time Adversarial Defenses in Vision-Language Models","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21999","citing_title":"Toward Understanding Adversarial Distillation: Why Robust Teachers Fail","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27529","citing_title":"Adjoint Inversion Reveals Holographic Superposition and Destructive Interference in CNN Classifiers","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2209.10652","citing_title":"Toy Models of Superposition","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04261","citing_title":"Laundering AI Authority with Adversarial Examples","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3","json":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3.json","graph_json":"https://pith.science/api/pith-number/AEBDDFSRQISB3OCIIHMHITUPS3/graph.json","events_json":"https://pith.science/api/pith-number/AEBDDFSRQISB3OCIIHMHITUPS3/events.json","paper":"https://pith.science/paper/AEBDDFSR"},"agent_actions":{"view_html":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3","download_json":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3.json","view_paper":"https://pith.science/paper/AEBDDFSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00945&json=true","fetch_graph":"https://pith.science/api/pith-number/AEBDDFSRQISB3OCIIHMHITUPS3/graph.json","fetch_events":"https://pith.science/api/pith-number/AEBDDFSRQISB3OCIIHMHITUPS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3/action/storage_attestation","attest_author":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3/action/author_attestation","sign_citation":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3/action/citation_signature","submit_replication":"https://pith.science/pith/AEBDDFSRQISB3OCIIHMHITUPS3/action/replication_record"}},"created_at":"2026-07-05T00:07:36.388667+00:00","updated_at":"2026-07-05T00:07:36.388667+00:00"}