{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:D3NNJKERGGRPCIIBTH7U34VNJW","short_pith_number":"pith:D3NNJKER","schema_version":"1.0","canonical_sha256":"1edad4a89131a2f1210199ff4df2ad4db2bd97ae15776e5290f854480ffea12b","source":{"kind":"arxiv","id":"2302.10722","version":2},"attestation_state":"computed","paper":{"title":"Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Arjun Nitin Bhagoji, Ben Y. Zhao, Daniel Cullina, Haitao Zheng, Prateek Mittal, Sihui Dai, Wenxin Ding","submitted_at":"2023-02-21T15:17:13Z","abstract_excerpt":"Finding classifiers robust to adversarial examples is critical for their safe deployment. Determining the robustness of the best possible classifier under a given threat model for a given data distribution and comparing it to that achieved by state-of-the-art training methods is thus an important diagnostic tool. In this paper, we find achievable information-theoretic lower bounds on loss in the presence of a test-time attacker for multi-class classifiers on any discrete dataset. We provide a general framework for finding the optimal 0-1 loss that revolves around the construction of a conflict"},"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":"2302.10722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-21T15:17:13Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"1f872bc8674ccd172f9021ff3ee932fcf60ebb465959e88ce66a44a3e55b4898","abstract_canon_sha256":"7889d2dedb9490c3f3f858617e4dc2f9968d0a3b5aa7b874105274f9514f4a76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:10.728721Z","signature_b64":"Ji9scvJTCutpHBxsbP7Ze6YUxBbZWm1isUTE6kL1g7dSLp2p8vtazWHgrND56ndkcDszbMaNRqBg/0b19LMoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1edad4a89131a2f1210199ff4df2ad4db2bd97ae15776e5290f854480ffea12b","last_reissued_at":"2026-07-05T07:21:10.728219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:10.728219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Arjun Nitin Bhagoji, Ben Y. Zhao, Daniel Cullina, Haitao Zheng, Prateek Mittal, Sihui Dai, Wenxin Ding","submitted_at":"2023-02-21T15:17:13Z","abstract_excerpt":"Finding classifiers robust to adversarial examples is critical for their safe deployment. Determining the robustness of the best possible classifier under a given threat model for a given data distribution and comparing it to that achieved by state-of-the-art training methods is thus an important diagnostic tool. In this paper, we find achievable information-theoretic lower bounds on loss in the presence of a test-time attacker for multi-class classifiers on any discrete dataset. We provide a general framework for finding the optimal 0-1 loss that revolves around the construction of a conflict"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10722","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/2302.10722/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":"2302.10722","created_at":"2026-07-05T07:21:10.728278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.10722v2","created_at":"2026-07-05T07:21:10.728278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10722","created_at":"2026-07-05T07:21:10.728278+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3NNJKERGGRP","created_at":"2026-07-05T07:21:10.728278+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3NNJKERGGRPCIIB","created_at":"2026-07-05T07:21:10.728278+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3NNJKER","created_at":"2026-07-05T07:21:10.728278+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/D3NNJKERGGRPCIIBTH7U34VNJW","json":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW.json","graph_json":"https://pith.science/api/pith-number/D3NNJKERGGRPCIIBTH7U34VNJW/graph.json","events_json":"https://pith.science/api/pith-number/D3NNJKERGGRPCIIBTH7U34VNJW/events.json","paper":"https://pith.science/paper/D3NNJKER"},"agent_actions":{"view_html":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW","download_json":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW.json","view_paper":"https://pith.science/paper/D3NNJKER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.10722&json=true","fetch_graph":"https://pith.science/api/pith-number/D3NNJKERGGRPCIIBTH7U34VNJW/graph.json","fetch_events":"https://pith.science/api/pith-number/D3NNJKERGGRPCIIBTH7U34VNJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW/action/storage_attestation","attest_author":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW/action/author_attestation","sign_citation":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW/action/citation_signature","submit_replication":"https://pith.science/pith/D3NNJKERGGRPCIIBTH7U34VNJW/action/replication_record"}},"created_at":"2026-07-05T07:21:10.728278+00:00","updated_at":"2026-07-05T07:21:10.728278+00:00"}