{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/fgsm","entry":"fgsm","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":14,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":13,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":5,"n_samples_fingerprinted":4,"n_places":16,"n_places_pointer_only":8,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2406.18062","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-barrier-enhanced-utility-and","title":"Breaking the Barrier: Enhanced Utility and Robustness in Smoothed DRL Agents","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustworthy-ml-lab/robust_highutil_smoothed_drl","path":"SDQN/attacks.py","file_url":"https://github.com/trustworthy-ml-lab/robust_highutil_smoothed_drl/blob/HEAD/SDQN/attacks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trustworthy-ml-lab/robust_highutil_smoothed_drl when it was checked","code_sha256":"85a898709da49405","code_sha256_prefix":"85a898709da49405","mcp_get_code":{"code_sha256":"85a898709da49405"}},{"arxiv_id":"2403.04050","arxiv_id_is_arxiv":true,"paper":"/paper/belief-enriched-pessimistic-q-learning","title":"Belief-Enriched Pessimistic Q-Learning against Adversarial State Perturbations","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SliencerX/Belief-enriched-robust-Q-learning","path":"attacks.py","file_url":"https://github.com/SliencerX/Belief-enriched-robust-Q-learning/blob/HEAD/attacks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SliencerX/Belief-enriched-robust-Q-learning when it was checked","code_sha256":"85a898709da49405","code_sha256_prefix":"85a898709da49405","mcp_get_code":{"code_sha256":"85a898709da49405"}},{"arxiv_id":"2206.07179","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-splitting-adversarial-attacks-for","title":"Proximal Splitting Adversarial Attacks for Semantic Segmentation","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeromerony/alma_prox_segmentation","path":"attacks/fast_gradient.py","file_url":"https://github.com/jeromerony/alma_prox_segmentation/blob/HEAD/attacks/fast_gradient.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa2856a8d3db1703","code_sha256_prefix":"fa2856a8d3db1703","mcp_get_code":{"code_sha256":"fa2856a8d3db1703"}},{"arxiv_id":"2110.14068","arxiv_id_is_arxiv":true,"paper":"/paper/drawing-robust-scratch-tickets-subnetworks","title":"Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networks","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICE-EIC/Robust-Scratch-Ticket","path":"trainers/default.py","file_url":"https://github.com/RICE-EIC/Robust-Scratch-Ticket/blob/HEAD/trainers/default.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6071f5c0529621f1","code_sha256_prefix":"6071f5c0529621f1","mcp_get_code":{"code_sha256":"6071f5c0529621f1"}},{"arxiv_id":"2106.10196","arxiv_id_is_arxiv":true,"paper":"/paper/federated-robustness-propagation-sharing","title":"Federated Robustness Propagation: Sharing Robustness in Heterogeneous Federated Learning","date":"2021-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"illidanlab/FedRBN","path":"utils/attack.py","file_url":"https://github.com/illidanlab/FedRBN/blob/HEAD/utils/attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e964320f8a75d974","code_sha256_prefix":"e964320f8a75d974","mcp_get_code":{"code_sha256":"e964320f8a75d974"}},{"arxiv_id":"2004.10162","arxiv_id_is_arxiv":true,"paper":"/paper/empir-ensembles-of-mixed-precision-deep-1","title":"EMPIR: Ensembles of Mixed Precision Deep Networks for Increased Robustness against Adversarial Attacks","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sancharisen/EMPIR","path":"cleverhans/attacks.py","file_url":"https://github.com/sancharisen/EMPIR/blob/HEAD/cleverhans/attacks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, sancharisen/EMPIR, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"669a4a70d107c4a4","code_sha256_prefix":"669a4a70d107c4a4","mcp_get_code":{"code_sha256":"669a4a70d107c4a4"}},{"arxiv_id":"2004.10162","arxiv_id_is_arxiv":true,"paper":"/paper/empir-ensembles-of-mixed-precision-deep-1","title":"EMPIR: Ensembles of Mixed Precision Deep Networks for Increased Robustness against Adversarial Attacks","date":"2020-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sancharisen/EMPIR","path":"cleverhans/attacks_tf.py","file_url":"https://github.com/sancharisen/EMPIR/blob/HEAD/cleverhans/attacks_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, sancharisen/EMPIR, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ab300465511282c2","code_sha256_prefix":"ab300465511282c2","mcp_get_code":{"code_sha256":"ab300465511282c2"}},{"arxiv_id":"2003.10596","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-perturbations-fool-deepfake","title":"Adversarial Perturbations Fool Deepfake Detectors","date":"2020-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ApGa/adversarial_deepfakes","path":"adv_examples.py","file_url":"https://github.com/ApGa/adversarial_deepfakes/blob/HEAD/adv_examples.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"969781f75548142e","code_sha256_prefix":"969781f75548142e","mcp_get_code":{"code_sha256":"969781f75548142e"}},{"arxiv_id":"2003.01090","arxiv_id_is_arxiv":true,"paper":"/paper/learn2perturb-an-end-to-end-feature","title":"Learn2Perturb: an End-to-end Feature Perturbation Learning to Improve Adversarial Robustness","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ahmadreza-Jeddi/Learn2Perturb","path":"attacks/fgsm.py","file_url":"https://github.com/Ahmadreza-Jeddi/Learn2Perturb/blob/HEAD/attacks/fgsm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd1f0b10f905c6a8","code_sha256_prefix":"fd1f0b10f905c6a8","mcp_get_code":{"code_sha256":"fd1f0b10f905c6a8"}},{"arxiv_id":"1904.08489","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-adversarial-attacks-parametric","title":"Semantic Adversarial Attacks: Parametric Transformations That Fool Deep Classifiers","date":"2019-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ameya005/Semantic_Adversarial_Attacks","path":"simple_classifier.py","file_url":"https://github.com/ameya005/Semantic_Adversarial_Attacks/blob/HEAD/simple_classifier.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"abbf22147fdaa2af","code_sha256_prefix":"abbf22147fdaa2af","mcp_get_code":{"code_sha256":"abbf22147fdaa2af"}},{"arxiv_id":"1711.00449","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-binarized-neural-networks","title":"Attacking Binarized Neural Networks","date":"2017-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AngusG/cleverhans-attacking-bnns","path":"cleverhans/attacks.py","file_url":"https://github.com/AngusG/cleverhans-attacking-bnns/blob/HEAD/cleverhans/attacks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, AngusG/cleverhans-attacking-bnns, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"669a4a70d107c4a4","code_sha256_prefix":"669a4a70d107c4a4","mcp_get_code":{"code_sha256":"669a4a70d107c4a4"}},{"arxiv_id":"1711.00449","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-binarized-neural-networks","title":"Attacking Binarized Neural Networks","date":"2017-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AngusG/cleverhans-attacking-bnns","path":"cleverhans/attacks_tf.py","file_url":"https://github.com/AngusG/cleverhans-attacking-bnns/blob/HEAD/cleverhans/attacks_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, AngusG/cleverhans-attacking-bnns, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ab300465511282c2","code_sha256_prefix":"ab300465511282c2","mcp_get_code":{"code_sha256":"ab300465511282c2"}},{"arxiv_id":"1610.00768","arxiv_id_is_arxiv":true,"paper":"/paper/technical-report-on-the-cleverhans-v210","title":"Technical Report on the CleverHans v2.1.0 Adversarial Examples Library","date":"2016-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnsonkee/graduate_design","path":"cleverhans/attacks_tf.py","file_url":"https://github.com/johnsonkee/graduate_design/blob/HEAD/cleverhans/attacks_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, johnsonkee/graduate_design, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"0ea7edb2e2e15307","code_sha256_prefix":"0ea7edb2e2e15307","mcp_get_code":{"code_sha256":"0ea7edb2e2e15307"}},{"arxiv_id":"1412.6572","arxiv_id_is_arxiv":true,"paper":"/paper/explaining-and-harnessing-adversarial","title":"Explaining and Harnessing Adversarial Examples","date":"2014-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LawrenceMMStewart/Adversarial_Attack","path":"FGSM_LeNet5.py","file_url":"https://github.com/LawrenceMMStewart/Adversarial_Attack/blob/HEAD/FGSM_LeNet5.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LawrenceMMStewart/Adversarial_Attack when it was checked","code_sha256":"4cb25a22c32d9e0a","code_sha256_prefix":"4cb25a22c32d9e0a","mcp_get_code":{"code_sha256":"4cb25a22c32d9e0a"}},{"arxiv_id":"Wilson_SAFE_Sensitivity-Aware_Features_for_Out-of-Distribution_Object_Detection_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wilson_SAFE_Sensitivity-Aware_Features_for_Out-of-Distribution_Object_Detection_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamWilso/SAFE_Official","path":"SAFE/transforms_detr.py","file_url":"https://github.com/SamWilso/SAFE_Official/blob/HEAD/SAFE/transforms_detr.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b1bd6764c6d2103a","code_sha256_prefix":"b1bd6764c6d2103a","mcp_get_code":{"code_sha256":"b1bd6764c6d2103a"}},{"arxiv_id":"Wang_Cant_Slow_Me_Down_Learning_Robust_and_Hardware-Adaptive_Object_Detectors_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Cant_Slow_Me_Down_Learning_Robust_and_Hardware-Adaptive_Object_Detectors_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hill-Wu-1998/underload","path":"latency_attack.py","file_url":"https://github.com/Hill-Wu-1998/underload/blob/HEAD/latency_attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d050dc7ddd4e0e36","code_sha256_prefix":"d050dc7ddd4e0e36","mcp_get_code":{"code_sha256":"d050dc7ddd4e0e36"}}],"record_sha256":"e0d43b95ada07f7a529579d5165bb67766203569409833bc3e542e96ab0ba317","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}