{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NAJJTB3OWONIVH77BV6PWVGPK3","short_pith_number":"pith:NAJJTB3O","canonical_record":{"source":{"id":"1901.08573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T18:43:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3e5fb8db73d6c546e7abc2e247f5582b1e1d86f293d29461f0b03c2731a63616","abstract_canon_sha256":"c97b850eabbd1da1ceb680de4bfcbb7ab22744ff66d708cc320e793b8a393ebe"},"schema_version":"1.0"},"canonical_sha256":"681299876eb39a8a9fff0d7cfb54cf56e101c755edf43ebb0244ae403020d283","source":{"kind":"arxiv","id":"1901.08573","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08573","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08573v3","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08573","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"NAJJTB3OWONI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NAJJTB3OWONIVH77","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NAJJTB3O","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NAJJTB3OWONIVH77BV6PWVGPK3","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T18:43:57Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3e5fb8db73d6c546e7abc2e247f5582b1e1d86f293d29461f0b03c2731a63616","abstract_canon_sha256":"c97b850eabbd1da1ceb680de4bfcbb7ab22744ff66d708cc320e793b8a393ebe"},"schema_version":"1.0"},"canonical_sha256":"681299876eb39a8a9fff0d7cfb54cf56e101c755edf43ebb0244ae403020d283","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:42.450392Z","signature_b64":"qOAv9iGra1w+6ZvyNT0G8bCHZstum2ytXrmKogRXd/Gn1XazBLEi0pU59zzoimq1M8OuD/Ajf7z2VVRElYt+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"681299876eb39a8a9fff0d7cfb54cf56e101c755edf43ebb0244ae403020d283","last_reissued_at":"2026-05-17T23:42:42.449751Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:42.449751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08573","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAqCe3IQO3uO89hul0hH0MCN7OS+3+wR0oG+ZejXNvYN4S3b7anDZ7BX2SgOohRtiVoSti4xxBUGFivq+BJFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:58:58.977473Z"},"content_sha256":"480c6028e5172d233a589f62cbedf26e469561d17cdd794961c6af7e7b73c0a2","schema_version":"1.0","event_id":"sha256:480c6028e5172d233a589f62cbedf26e469561d17cdd794961c6af7e7b73c0a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NAJJTB3OWONIVH77BV6PWVGPK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Theoretically Principled Trade-off between Robustness and Accuracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric P. Xing, Hongyang Zhang, Jiantao Jiao, Laurent El Ghaoui, Michael I. Jordan, Yaodong Yu","submitted_at":"2019-01-24T18:43:57Z","abstract_excerpt":"We identify a trade-off between robustness and accuracy that serves as a guiding principle in the design of defenses against adversarial examples. Although this problem has been widely studied empirically, much remains unknown concerning the theory underlying this trade-off. In this work, we decompose the prediction error for adversarial examples (robust error) as the sum of the natural (classification) error and boundary error, and provide a differentiable upper bound using the theory of classification-calibrated loss, which is shown to be the tightest possible upper bound uniform over all pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08573","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnaxFNZJBJt7Mw49GgAC6KJoeP6zFsLk6fkqjBlt+AgWoCIF/o7UPW/FMx/FmqJn4RAKlAr/e9sJUXeqQX+rDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:58:58.977824Z"},"content_sha256":"70fdeab02ca8cb61e183f6f74e18d620580c874a0415a3d74e18c39ec13918db","schema_version":"1.0","event_id":"sha256:70fdeab02ca8cb61e183f6f74e18d620580c874a0415a3d74e18c39ec13918db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NAJJTB3OWONIVH77BV6PWVGPK3/bundle.json","state_url":"https://pith.science/pith/NAJJTB3OWONIVH77BV6PWVGPK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NAJJTB3OWONIVH77BV6PWVGPK3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T03:58:58Z","links":{"resolver":"https://pith.science/pith/NAJJTB3OWONIVH77BV6PWVGPK3","bundle":"https://pith.science/pith/NAJJTB3OWONIVH77BV6PWVGPK3/bundle.json","state":"https://pith.science/pith/NAJJTB3OWONIVH77BV6PWVGPK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NAJJTB3OWONIVH77BV6PWVGPK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NAJJTB3OWONIVH77BV6PWVGPK3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c97b850eabbd1da1ceb680de4bfcbb7ab22744ff66d708cc320e793b8a393ebe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T18:43:57Z","title_canon_sha256":"3e5fb8db73d6c546e7abc2e247f5582b1e1d86f293d29461f0b03c2731a63616"},"schema_version":"1.0","source":{"id":"1901.08573","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08573","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08573v3","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08573","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"NAJJTB3OWONI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NAJJTB3OWONIVH77","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NAJJTB3O","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:70fdeab02ca8cb61e183f6f74e18d620580c874a0415a3d74e18c39ec13918db","target":"graph","created_at":"2026-05-17T23:42:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We identify a trade-off between robustness and accuracy that serves as a guiding principle in the design of defenses against adversarial examples. Although this problem has been widely studied empirically, much remains unknown concerning the theory underlying this trade-off. In this work, we decompose the prediction error for adversarial examples (robust error) as the sum of the natural (classification) error and boundary error, and provide a differentiable upper bound using the theory of classification-calibrated loss, which is shown to be the tightest possible upper bound uniform over all pr","authors_text":"Eric P. Xing, Hongyang Zhang, Jiantao Jiao, Laurent El Ghaoui, Michael I. Jordan, Yaodong Yu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T18:43:57Z","title":"Theoretically Principled Trade-off between Robustness and Accuracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08573","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:480c6028e5172d233a589f62cbedf26e469561d17cdd794961c6af7e7b73c0a2","target":"record","created_at":"2026-05-17T23:42:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c97b850eabbd1da1ceb680de4bfcbb7ab22744ff66d708cc320e793b8a393ebe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T18:43:57Z","title_canon_sha256":"3e5fb8db73d6c546e7abc2e247f5582b1e1d86f293d29461f0b03c2731a63616"},"schema_version":"1.0","source":{"id":"1901.08573","kind":"arxiv","version":3}},"canonical_sha256":"681299876eb39a8a9fff0d7cfb54cf56e101c755edf43ebb0244ae403020d283","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"681299876eb39a8a9fff0d7cfb54cf56e101c755edf43ebb0244ae403020d283","first_computed_at":"2026-05-17T23:42:42.449751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:42.449751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOAv9iGra1w+6ZvyNT0G8bCHZstum2ytXrmKogRXd/Gn1XazBLEi0pU59zzoimq1M8OuD/Ajf7z2VVRElYt+Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:42.450392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08573","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480c6028e5172d233a589f62cbedf26e469561d17cdd794961c6af7e7b73c0a2","sha256:70fdeab02ca8cb61e183f6f74e18d620580c874a0415a3d74e18c39ec13918db"],"state_sha256":"197542c6ddd2db42d954ec84ea96f4de3fd19174dcf68dd067aef77be7077610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3caQ+LPO0a0/8v9jVPMaKlhpOAEkU1l8tdPBFgffOBreoNiLh+TK+9RLAdhM1iG/QiDGADRqqKRFrNltMsGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:58:58.979743Z","bundle_sha256":"65d88e995e67dcd9a00e471683159703b5f1cc1abfe8d5d3204eb924dc4d2ebd"}}