{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XC6HBITQGEARPTKNQWOAIXAGEW","short_pith_number":"pith:XC6HBITQ","schema_version":"1.0","canonical_sha256":"b8bc70a270310117cd4d859c045c0625a1e4048192062945b1a77c68c2bbe4e2","source":{"kind":"arxiv","id":"1909.11515","version":2},"attestation_state":"computed","paper":{"title":"Mixup Inference: Better Exploiting Mixup to Defend Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jun Zhu, Kun Xu, Tianyu Pang","submitted_at":"2019-09-25T14:21:55Z","abstract_excerpt":"It has been widely recognized that adversarial examples can be easily crafted to fool deep networks, which mainly root from the locally non-linear behavior nearby input examples. Applying mixup in training provides an effective mechanism to improve generalization performance and model robustness against adversarial perturbations, which introduces the globally linear behavior in-between training examples. However, in previous work, the mixup-trained models only passively defend adversarial attacks in inference by directly classifying the inputs, where the induced global linearity is not well ex"},"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.11515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-25T14:21:55Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"be2f5db19b34d5fce2ef123b45c8454807394464b2c9cca7b8dcbe75b2f59720","abstract_canon_sha256":"44c860605eb503a4a0186f2c4477e6cac45c4c0ff4682f52b023c419cf0ae4fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:32.424351Z","signature_b64":"7im4t6TV1OA20MY5RwxVBbZ3gRGYdpw9WqH3oQ2LaDKcVVJQVG1el4uh4wowPUdFm8FvmQq2N6YFymzipR6GBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8bc70a270310117cd4d859c045c0625a1e4048192062945b1a77c68c2bbe4e2","last_reissued_at":"2026-07-05T00:42:32.423874Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:32.423874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixup Inference: Better Exploiting Mixup to Defend Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jun Zhu, Kun Xu, Tianyu Pang","submitted_at":"2019-09-25T14:21:55Z","abstract_excerpt":"It has been widely recognized that adversarial examples can be easily crafted to fool deep networks, which mainly root from the locally non-linear behavior nearby input examples. Applying mixup in training provides an effective mechanism to improve generalization performance and model robustness against adversarial perturbations, which introduces the globally linear behavior in-between training examples. However, in previous work, the mixup-trained models only passively defend adversarial attacks in inference by directly classifying the inputs, where the induced global linearity is not well ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.11515","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.11515/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.11515","created_at":"2026-07-05T00:42:32.423931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.11515v2","created_at":"2026-07-05T00:42:32.423931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.11515","created_at":"2026-07-05T00:42:32.423931+00:00"},{"alias_kind":"pith_short_12","alias_value":"XC6HBITQGEAR","created_at":"2026-07-05T00:42:32.423931+00:00"},{"alias_kind":"pith_short_16","alias_value":"XC6HBITQGEARPTKN","created_at":"2026-07-05T00:42:32.423931+00:00"},{"alias_kind":"pith_short_8","alias_value":"XC6HBITQ","created_at":"2026-07-05T00:42:32.423931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01025","citing_title":"Towards Adversarially Robust Deep Metric Learning","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW","json":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW.json","graph_json":"https://pith.science/api/pith-number/XC6HBITQGEARPTKNQWOAIXAGEW/graph.json","events_json":"https://pith.science/api/pith-number/XC6HBITQGEARPTKNQWOAIXAGEW/events.json","paper":"https://pith.science/paper/XC6HBITQ"},"agent_actions":{"view_html":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW","download_json":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW.json","view_paper":"https://pith.science/paper/XC6HBITQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.11515&json=true","fetch_graph":"https://pith.science/api/pith-number/XC6HBITQGEARPTKNQWOAIXAGEW/graph.json","fetch_events":"https://pith.science/api/pith-number/XC6HBITQGEARPTKNQWOAIXAGEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW/action/storage_attestation","attest_author":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW/action/author_attestation","sign_citation":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW/action/citation_signature","submit_replication":"https://pith.science/pith/XC6HBITQGEARPTKNQWOAIXAGEW/action/replication_record"}},"created_at":"2026-07-05T00:42:32.423931+00:00","updated_at":"2026-07-05T00:42:32.423931+00:00"}