{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5F3PLYL2UFHDJSFLFNFQ2R63NR","short_pith_number":"pith:5F3PLYL2","schema_version":"1.0","canonical_sha256":"e976f5e17aa14e34c8ab2b4b0d47db6c682d415bd9c7c12ba2af9281752b8461","source":{"kind":"arxiv","id":"2104.08382","version":2},"attestation_state":"computed","paper":{"title":"Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal, Vikash Sehwag","submitted_at":"2021-04-16T21:41:28Z","abstract_excerpt":"Understanding the fundamental limits of robust supervised learning has emerged as a problem of immense interest, from both practical and theoretical standpoints. In particular, it is critical to determine classifier-agnostic bounds on the training loss to establish when learning is possible. In this paper, we determine optimal lower bounds on the cross-entropy loss in the presence of test-time adversaries, along with the corresponding optimal classification outputs. Our formulation of the bound as a solution to an optimization problem is general enough to encompass any loss function depending "},"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":"2104.08382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-16T21:41:28Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"86618a9ba7980de662917002f2b25137e248c06926e71417945779bb301ad5f9","abstract_canon_sha256":"d48d3156ed43b752d29456c039b6822d051ebd86ad7a6ab52fe292f378db9793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:27.527584Z","signature_b64":"kGn2wWf7ys+8KxNDEFGUlHMIUjVQQE702Ohek6TGH74sk+DGt2jjqepyktAsb1TZX211MDt2ZKUg+yqJM+dIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e976f5e17aa14e34c8ab2b4b0d47db6c682d415bd9c7c12ba2af9281752b8461","last_reissued_at":"2026-07-05T02:46:27.526935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:27.526935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Arjun Nitin Bhagoji, Daniel Cullina, Prateek Mittal, Vikash Sehwag","submitted_at":"2021-04-16T21:41:28Z","abstract_excerpt":"Understanding the fundamental limits of robust supervised learning has emerged as a problem of immense interest, from both practical and theoretical standpoints. In particular, it is critical to determine classifier-agnostic bounds on the training loss to establish when learning is possible. In this paper, we determine optimal lower bounds on the cross-entropy loss in the presence of test-time adversaries, along with the corresponding optimal classification outputs. Our formulation of the bound as a solution to an optimization problem is general enough to encompass any loss function depending "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.08382","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/2104.08382/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":"2104.08382","created_at":"2026-07-05T02:46:27.527007+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.08382v2","created_at":"2026-07-05T02:46:27.527007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.08382","created_at":"2026-07-05T02:46:27.527007+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F3PLYL2UFHD","created_at":"2026-07-05T02:46:27.527007+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F3PLYL2UFHDJSFL","created_at":"2026-07-05T02:46:27.527007+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F3PLYL2","created_at":"2026-07-05T02:46:27.527007+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/5F3PLYL2UFHDJSFLFNFQ2R63NR","json":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR.json","graph_json":"https://pith.science/api/pith-number/5F3PLYL2UFHDJSFLFNFQ2R63NR/graph.json","events_json":"https://pith.science/api/pith-number/5F3PLYL2UFHDJSFLFNFQ2R63NR/events.json","paper":"https://pith.science/paper/5F3PLYL2"},"agent_actions":{"view_html":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR","download_json":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR.json","view_paper":"https://pith.science/paper/5F3PLYL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.08382&json=true","fetch_graph":"https://pith.science/api/pith-number/5F3PLYL2UFHDJSFLFNFQ2R63NR/graph.json","fetch_events":"https://pith.science/api/pith-number/5F3PLYL2UFHDJSFLFNFQ2R63NR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR/action/storage_attestation","attest_author":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR/action/author_attestation","sign_citation":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR/action/citation_signature","submit_replication":"https://pith.science/pith/5F3PLYL2UFHDJSFLFNFQ2R63NR/action/replication_record"}},"created_at":"2026-07-05T02:46:27.527007+00:00","updated_at":"2026-07-05T02:46:27.527007+00:00"}