{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ACIP2KFKTT4XKEMMBXM236CZXL","short_pith_number":"pith:ACIP2KFK","canonical_record":{"source":{"id":"2405.11904","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-20T09:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"aac2f74239dbb52fae469ce9a8f118d333a20982f2b231daa745c88a85bf3007","abstract_canon_sha256":"a6fcefca7d8e6aa8c566bf3f4e53870490ba196e2b96e5eb6be7f47af438a5b9"},"schema_version":"1.0"},"canonical_sha256":"0090fd28aa9cf975118c0dd9adf859baed5a3c8d4f056dc5090fc7e7c64fa5f6","source":{"kind":"arxiv","id":"2405.11904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.11904","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"2405.11904v1","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11904","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"ACIP2KFKTT4X","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"pith_short_16","alias_value":"ACIP2KFKTT4XKEMM","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"pith_short_8","alias_value":"ACIP2KFK","created_at":"2026-07-05T08:20:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ACIP2KFKTT4XKEMMBXM236CZXL","target":"record","payload":{"canonical_record":{"source":{"id":"2405.11904","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-20T09:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"aac2f74239dbb52fae469ce9a8f118d333a20982f2b231daa745c88a85bf3007","abstract_canon_sha256":"a6fcefca7d8e6aa8c566bf3f4e53870490ba196e2b96e5eb6be7f47af438a5b9"},"schema_version":"1.0"},"canonical_sha256":"0090fd28aa9cf975118c0dd9adf859baed5a3c8d4f056dc5090fc7e7c64fa5f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:57.781949Z","signature_b64":"zS+CGsNwyF42ArH79vWHesprX2dGWQeyVxaATlvxVcjfpwbTBAz1Rqno0rppphdYm4kxUI4b6CdGqT56q/qNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0090fd28aa9cf975118c0dd9adf859baed5a3c8d4f056dc5090fc7e7c64fa5f6","last_reissued_at":"2026-07-05T08:20:57.781476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:57.781476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.11904","source_version":1,"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-07-05T08:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6OfIkSYBtOzoi71NGcYMH/P2aXTwCUerG82UZgSy6uK5wVcChudq4Cw9r4vF23FhyO7H52chymF+2NaAG29Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:19:20.867658Z"},"content_sha256":"385c9c2ffdc7182a63448cc21971bd8bf7046b3326cd77c944d66f75e87a5596","schema_version":"1.0","event_id":"sha256:385c9c2ffdc7182a63448cc21971bd8bf7046b3326cd77c944d66f75e87a5596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ACIP2KFKTT4XKEMMBXM236CZXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint-Enforcing Reward for Adversarial Attacks on Text Classifiers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alsharif Abuadbba, Inigo Jauregi Unanue, Massimo Piccardi, Tom Roth","submitted_at":"2024-05-20T09:33:43Z","abstract_excerpt":"Text classifiers are vulnerable to adversarial examples -- correctly-classified examples that are deliberately transformed to be misclassified while satisfying acceptability constraints. The conventional approach to finding adversarial examples is to define and solve a combinatorial optimisation problem over a space of allowable transformations. While effective, this approach is slow and limited by the choice of transformations. An alternate approach is to directly generate adversarial examples by fine-tuning a pre-trained language model, as is commonly done for other text-to-text tasks. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11904","kind":"arxiv","version":1},"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/2405.11904/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"},"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-07-05T08:20:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvEkywtwECkcAhNlQAf8QgyKbaQ2/Bb+/D32e95qR2/ijaTjqjxWnKzmsU/ocsodUCiG0YMTjv2RhsbYq4ZGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:19:20.868170Z"},"content_sha256":"d6b4096459654a1462d59753589d0f5b9d7b1ac2d1acd5a586591068687e45da","schema_version":"1.0","event_id":"sha256:d6b4096459654a1462d59753589d0f5b9d7b1ac2d1acd5a586591068687e45da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACIP2KFKTT4XKEMMBXM236CZXL/bundle.json","state_url":"https://pith.science/pith/ACIP2KFKTT4XKEMMBXM236CZXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACIP2KFKTT4XKEMMBXM236CZXL/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-08-09T19:19:20Z","links":{"resolver":"https://pith.science/pith/ACIP2KFKTT4XKEMMBXM236CZXL","bundle":"https://pith.science/pith/ACIP2KFKTT4XKEMMBXM236CZXL/bundle.json","state":"https://pith.science/pith/ACIP2KFKTT4XKEMMBXM236CZXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACIP2KFKTT4XKEMMBXM236CZXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ACIP2KFKTT4XKEMMBXM236CZXL","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":"a6fcefca7d8e6aa8c566bf3f4e53870490ba196e2b96e5eb6be7f47af438a5b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-20T09:33:43Z","title_canon_sha256":"aac2f74239dbb52fae469ce9a8f118d333a20982f2b231daa745c88a85bf3007"},"schema_version":"1.0","source":{"id":"2405.11904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.11904","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"arxiv_version","alias_value":"2405.11904v1","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11904","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"pith_short_12","alias_value":"ACIP2KFKTT4X","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"pith_short_16","alias_value":"ACIP2KFKTT4XKEMM","created_at":"2026-07-05T08:20:57Z"},{"alias_kind":"pith_short_8","alias_value":"ACIP2KFK","created_at":"2026-07-05T08:20:57Z"}],"graph_snapshots":[{"event_id":"sha256:d6b4096459654a1462d59753589d0f5b9d7b1ac2d1acd5a586591068687e45da","target":"graph","created_at":"2026-07-05T08:20:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.11904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Text classifiers are vulnerable to adversarial examples -- correctly-classified examples that are deliberately transformed to be misclassified while satisfying acceptability constraints. The conventional approach to finding adversarial examples is to define and solve a combinatorial optimisation problem over a space of allowable transformations. While effective, this approach is slow and limited by the choice of transformations. An alternate approach is to directly generate adversarial examples by fine-tuning a pre-trained language model, as is commonly done for other text-to-text tasks. This ","authors_text":"Alsharif Abuadbba, Inigo Jauregi Unanue, Massimo Piccardi, Tom Roth","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-20T09:33:43Z","title":"A Constraint-Enforcing Reward for Adversarial Attacks on Text Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11904","kind":"arxiv","version":1},"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:385c9c2ffdc7182a63448cc21971bd8bf7046b3326cd77c944d66f75e87a5596","target":"record","created_at":"2026-07-05T08:20:57Z","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":"a6fcefca7d8e6aa8c566bf3f4e53870490ba196e2b96e5eb6be7f47af438a5b9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-05-20T09:33:43Z","title_canon_sha256":"aac2f74239dbb52fae469ce9a8f118d333a20982f2b231daa745c88a85bf3007"},"schema_version":"1.0","source":{"id":"2405.11904","kind":"arxiv","version":1}},"canonical_sha256":"0090fd28aa9cf975118c0dd9adf859baed5a3c8d4f056dc5090fc7e7c64fa5f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0090fd28aa9cf975118c0dd9adf859baed5a3c8d4f056dc5090fc7e7c64fa5f6","first_computed_at":"2026-07-05T08:20:57.781476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:57.781476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zS+CGsNwyF42ArH79vWHesprX2dGWQeyVxaATlvxVcjfpwbTBAz1Rqno0rppphdYm4kxUI4b6CdGqT56q/qNCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:57.781949Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.11904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:385c9c2ffdc7182a63448cc21971bd8bf7046b3326cd77c944d66f75e87a5596","sha256:d6b4096459654a1462d59753589d0f5b9d7b1ac2d1acd5a586591068687e45da"],"state_sha256":"7569ec9b4ae16acc01db758857a8f1c2dabbaeb93ceed4ddbaeab41cc83d3d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F+4F2NP11xBKvKkv5IO1idgvUTsAwiTfOLbhtcht8SmPgDir9+ZQqQxwDEP7xUAzY61QTP5dUw80zMxVGM+ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:19:20.872223Z","bundle_sha256":"251efa8796bc6c17a1bf74e3405cc6b3c016a4e47a1752f9d8e21c5d891a873f"}}