{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OREQZJYKY4TZGPQZZX2KWMFELQ","short_pith_number":"pith:OREQZJYK","canonical_record":{"source":{"id":"1810.12042","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T10:30:20Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"28e0cb9a4bc2ed5619560b72446f211772c171fca8fecb1d9804b4a83b09aa75","abstract_canon_sha256":"d94629f4c7ea690a0a9579bc933a623573a2a3b0fcd89b48489d8b285acf33be"},"schema_version":"1.0"},"canonical_sha256":"74490ca70ac727933e19cdf4ab30a45c341338a33ebfbf15a4d747d858ac4443","source":{"kind":"arxiv","id":"1810.12042","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12042","created_at":"2026-05-17T23:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12042v3","created_at":"2026-05-17T23:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12042","created_at":"2026-05-17T23:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"OREQZJYKY4TZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OREQZJYKY4TZGPQZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OREQZJYK","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OREQZJYKY4TZGPQZZX2KWMFELQ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12042","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T10:30:20Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"28e0cb9a4bc2ed5619560b72446f211772c171fca8fecb1d9804b4a83b09aa75","abstract_canon_sha256":"d94629f4c7ea690a0a9579bc933a623573a2a3b0fcd89b48489d8b285acf33be"},"schema_version":"1.0"},"canonical_sha256":"74490ca70ac727933e19cdf4ab30a45c341338a33ebfbf15a4d747d858ac4443","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:32.930532Z","signature_b64":"5H3YNXMawjf+eLVf1L3y4R8lwxy6/9izioQWSqqD0Bg/2QuAb1wbVSOWbuIvr8CVL5qBEDJ38j4RiNHHz5L/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74490ca70ac727933e19cdf4ab30a45c341338a33ebfbf15a4d747d858ac4443","last_reissued_at":"2026-05-17T23:51:32.929887Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:32.929887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12042","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:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PBjnWAMm4oL9nmbMgyHySfWj1N9W0InwZ4fIUWA4xpeVvuAW4VUE/IaU6eXqN4i/IANSxxLUWCIVhXu617UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:23:05.430125Z"},"content_sha256":"9178a01b16c395b20b6bbc0ac483fd6c0c1b7e159c1538730148795bd5d3df03","schema_version":"1.0","event_id":"sha256:9178a01b16c395b20b6bbc0ac483fd6c0c1b7e159c1538730148795bd5d3df03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OREQZJYKY4TZGPQZZX2KWMFELQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Logit Pairing Methods Can Fool Gradient-Based Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dietrich Klakow, Maksym Andriushchenko, Marius Mosbach, Matthias Hein, Thomas Trost","submitted_at":"2018-10-29T10:30:20Z","abstract_excerpt":"Recently, Kannan et al. [2018] proposed several logit regularization methods to improve the adversarial robustness of classifiers. We show that the computationally fast methods they propose - Clean Logit Pairing (CLP) and Logit Squeezing (LSQ) - just make the gradient-based optimization problem of crafting adversarial examples harder without providing actual robustness. We find that Adversarial Logit Pairing (ALP) may indeed provide robustness against adversarial examples, especially when combined with adversarial training, and we examine it in a variety of settings. However, the increase in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12042","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:51:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NiiLf4Vq7F+G4oNJCFMPWAodmgxDe90+9cqoL+8WL00Z6eHeolF8Z7mVvNL7RaCXSVWoloiQbdOpWblTL3pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:23:05.430871Z"},"content_sha256":"e543c58a94fb2c0ac7b00e13fc7ca29f3ba3796b76f6c1efc0ea2872c929187c","schema_version":"1.0","event_id":"sha256:e543c58a94fb2c0ac7b00e13fc7ca29f3ba3796b76f6c1efc0ea2872c929187c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OREQZJYKY4TZGPQZZX2KWMFELQ/bundle.json","state_url":"https://pith.science/pith/OREQZJYKY4TZGPQZZX2KWMFELQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OREQZJYKY4TZGPQZZX2KWMFELQ/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-05-26T21:23:05Z","links":{"resolver":"https://pith.science/pith/OREQZJYKY4TZGPQZZX2KWMFELQ","bundle":"https://pith.science/pith/OREQZJYKY4TZGPQZZX2KWMFELQ/bundle.json","state":"https://pith.science/pith/OREQZJYKY4TZGPQZZX2KWMFELQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OREQZJYKY4TZGPQZZX2KWMFELQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OREQZJYKY4TZGPQZZX2KWMFELQ","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":"d94629f4c7ea690a0a9579bc933a623573a2a3b0fcd89b48489d8b285acf33be","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T10:30:20Z","title_canon_sha256":"28e0cb9a4bc2ed5619560b72446f211772c171fca8fecb1d9804b4a83b09aa75"},"schema_version":"1.0","source":{"id":"1810.12042","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12042","created_at":"2026-05-17T23:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12042v3","created_at":"2026-05-17T23:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12042","created_at":"2026-05-17T23:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"OREQZJYKY4TZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OREQZJYKY4TZGPQZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OREQZJYK","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:e543c58a94fb2c0ac7b00e13fc7ca29f3ba3796b76f6c1efc0ea2872c929187c","target":"graph","created_at":"2026-05-17T23:51:32Z","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":"Recently, Kannan et al. [2018] proposed several logit regularization methods to improve the adversarial robustness of classifiers. We show that the computationally fast methods they propose - Clean Logit Pairing (CLP) and Logit Squeezing (LSQ) - just make the gradient-based optimization problem of crafting adversarial examples harder without providing actual robustness. We find that Adversarial Logit Pairing (ALP) may indeed provide robustness against adversarial examples, especially when combined with adversarial training, and we examine it in a variety of settings. However, the increase in a","authors_text":"Dietrich Klakow, Maksym Andriushchenko, Marius Mosbach, Matthias Hein, Thomas Trost","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T10:30:20Z","title":"Logit Pairing Methods Can Fool Gradient-Based Attacks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12042","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:9178a01b16c395b20b6bbc0ac483fd6c0c1b7e159c1538730148795bd5d3df03","target":"record","created_at":"2026-05-17T23:51:32Z","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":"d94629f4c7ea690a0a9579bc933a623573a2a3b0fcd89b48489d8b285acf33be","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T10:30:20Z","title_canon_sha256":"28e0cb9a4bc2ed5619560b72446f211772c171fca8fecb1d9804b4a83b09aa75"},"schema_version":"1.0","source":{"id":"1810.12042","kind":"arxiv","version":3}},"canonical_sha256":"74490ca70ac727933e19cdf4ab30a45c341338a33ebfbf15a4d747d858ac4443","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74490ca70ac727933e19cdf4ab30a45c341338a33ebfbf15a4d747d858ac4443","first_computed_at":"2026-05-17T23:51:32.929887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:32.929887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5H3YNXMawjf+eLVf1L3y4R8lwxy6/9izioQWSqqD0Bg/2QuAb1wbVSOWbuIvr8CVL5qBEDJ38j4RiNHHz5L/CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:32.930532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12042","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9178a01b16c395b20b6bbc0ac483fd6c0c1b7e159c1538730148795bd5d3df03","sha256:e543c58a94fb2c0ac7b00e13fc7ca29f3ba3796b76f6c1efc0ea2872c929187c"],"state_sha256":"a0ccf40a08c38c2c1a255b5e457a3f786aad7f45af381104e3b41241f41a6c0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owEDWA/POiSKnW6chbC6D9I1d/v5nxPzMUEnlTDw6rvQqwotrPm7Kd5oBEx/ev//s2KsF+IjAI0bF9x7ybZ/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:23:05.434368Z","bundle_sha256":"735d18ed051c17c1bde194a4f0559f3694754aecadcef05faa5528d7b9261cb5"}}