{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BXCYOCZKP7LK5JI546DE36AHHY","short_pith_number":"pith:BXCYOCZK","schema_version":"1.0","canonical_sha256":"0dc5870b2a7fd6aea51de7864df8073e280ea376e1cb83813ab5211f255bc424","source":{"kind":"arxiv","id":"1909.12272","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds on Adversarial Robustness from Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal","submitted_at":"2019-09-26T17:30:16Z","abstract_excerpt":"While progress has been made in understanding the robustness of machine learning classifiers to test-time adversaries (evasion attacks), fundamental questions remain unresolved. In this paper, we use optimal transport to characterize the minimum possible loss in an adversarial classification scenario. In this setting, an adversary receives a random labeled example from one of two classes, perturbs the example subject to a neighborhood constraint, and presents the modified example to the classifier. We define an appropriate cost function such that the minimum transportation cost between the dis"},"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":"1909.12272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-26T17:30:16Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"71b3b5321996237dfd4491a7e27bbc530e5f79db90deb6eda8d4def438dfe9d4","abstract_canon_sha256":"03fe07de39046039c17294613aafe3dc828f2b60b1d48728eadc324dc94c1277"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:06.100889Z","signature_b64":"FSC4HF/WtNWvHlrBw3/Ez5Hy30zVlwUYE7RNFshk5k4drUfLxw5dqX/rAjWt+jbZaMMtk2rUJ9UL+R39kvLCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc5870b2a7fd6aea51de7864df8073e280ea376e1cb83813ab5211f255bc424","last_reissued_at":"2026-07-05T00:16:06.100434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:06.100434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Adversarial Robustness from Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal","submitted_at":"2019-09-26T17:30:16Z","abstract_excerpt":"While progress has been made in understanding the robustness of machine learning classifiers to test-time adversaries (evasion attacks), fundamental questions remain unresolved. In this paper, we use optimal transport to characterize the minimum possible loss in an adversarial classification scenario. In this setting, an adversary receives a random labeled example from one of two classes, perturbs the example subject to a neighborhood constraint, and presents the modified example to the classifier. We define an appropriate cost function such that the minimum transportation cost between the dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.12272","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/1909.12272/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":"1909.12272","created_at":"2026-07-05T00:16:06.100491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.12272v2","created_at":"2026-07-05T00:16:06.100491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.12272","created_at":"2026-07-05T00:16:06.100491+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXCYOCZKP7LK","created_at":"2026-07-05T00:16:06.100491+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXCYOCZKP7LK5JI5","created_at":"2026-07-05T00:16:06.100491+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXCYOCZK","created_at":"2026-07-05T00:16:06.100491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00207","citing_title":"Homogenization of $\\ell_2$-Adversarial Training in High-Dimensions: Exact Dynamics under Stochastic Gradient Descent","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY","json":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY.json","graph_json":"https://pith.science/api/pith-number/BXCYOCZKP7LK5JI546DE36AHHY/graph.json","events_json":"https://pith.science/api/pith-number/BXCYOCZKP7LK5JI546DE36AHHY/events.json","paper":"https://pith.science/paper/BXCYOCZK"},"agent_actions":{"view_html":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY","download_json":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY.json","view_paper":"https://pith.science/paper/BXCYOCZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.12272&json=true","fetch_graph":"https://pith.science/api/pith-number/BXCYOCZKP7LK5JI546DE36AHHY/graph.json","fetch_events":"https://pith.science/api/pith-number/BXCYOCZKP7LK5JI546DE36AHHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY/action/storage_attestation","attest_author":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY/action/author_attestation","sign_citation":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY/action/citation_signature","submit_replication":"https://pith.science/pith/BXCYOCZKP7LK5JI546DE36AHHY/action/replication_record"}},"created_at":"2026-07-05T00:16:06.100491+00:00","updated_at":"2026-07-05T00:16:06.100491+00:00"}