{"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/pgd-attack","entry":"pgd_attack","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":4,"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":4,"ran_fixture":0,"ran":4,"unverified":1},"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":"2605.08464","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08464","title":"The Geometric Structure of Models Learning Sparse Data","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ThomasWalker1/RFAM","path":"utils/rfm.py","file_url":"https://github.com/ThomasWalker1/RFAM/blob/HEAD/utils/rfm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ThomasWalker1/RFAM when it was checked","code_sha256":"a09edc93d11c9d93","code_sha256_prefix":"a09edc93d11c9d93","mcp_get_code":{"code_sha256":"a09edc93d11c9d93"}},{"arxiv_id":"2404.07956","arxiv_id_is_arxiv":true,"paper":"/paper/lyapunov-stable-neural-control-for-state-and","title":"Lyapunov-stable Neural Control for State and Output Feedback: A Novel Formulation","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"verified-intelligence/lyapunov_stable_nn_controllers","path":"neural_lyapunov_training/train_utils.py","file_url":"https://github.com/verified-intelligence/lyapunov_stable_nn_controllers/blob/HEAD/neural_lyapunov_training/train_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f22fdfcea32d0553","code_sha256_prefix":"f22fdfcea32d0553","mcp_get_code":{"code_sha256":"f22fdfcea32d0553"}},{"arxiv_id":"2403.10801","arxiv_id_is_arxiv":true,"paper":"/paper/securely-fine-tuning-pre-trained-encoders","title":"Securely Fine-tuning Pre-trained Encoders Against Adversarial Examples","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/gen-af","path":"adversarial_fine-tuning.py","file_url":"https://github.com/cgcl-codes/gen-af/blob/HEAD/adversarial_fine-tuning.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, cgcl-codes/gen-af when it was checked","code_sha256":"3527afe1b9c5395e","code_sha256_prefix":"3527afe1b9c5395e","mcp_get_code":{"code_sha256":"3527afe1b9c5395e"}},{"arxiv_id":"2401.12532","arxiv_id_is_arxiv":true,"paper":"/paper/dafa-distance-aware-fair-adversarial-training","title":"DAFA: Distance-Aware Fair Adversarial Training","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ee1e48fc088d1214","code_sha256_prefix":"ee1e48fc088d1214","mcp_get_code":{"code_sha256":"ee1e48fc088d1214"}},{"arxiv_id":"2310.04655","arxiv_id_is_arxiv":true,"paper":"/paper/vlattack-multimodal-adversarial-attacks-on","title":"VLATTACK: Multimodal Adversarial Attacks on Vision-Language Tasks via Pre-trained Models","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericyinyzy/VLAttack","path":"CLIP_attack/clip_attack.py","file_url":"https://github.com/ericyinyzy/VLAttack/blob/HEAD/CLIP_attack/clip_attack.py","status":"unverified","verification_level":0,"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":"5691c1c466b2b0ff","code_sha256_prefix":"5691c1c466b2b0ff","mcp_get_code":{"code_sha256":"5691c1c466b2b0ff"}},{"arxiv_id":"2304.13098","arxiv_id_is_arxiv":true,"paper":"/paper/uncovering-the-representation-of-spiking","title":"Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/snncka","path":"main_cka.py","file_url":"https://github.com/intelligent-computing-lab-yale/snncka/blob/HEAD/main_cka.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":"1cd06c5112c03ed6","code_sha256_prefix":"1cd06c5112c03ed6","mcp_get_code":{"code_sha256":"1cd06c5112c03ed6"}},{"arxiv_id":"2010.06121","arxiv_id_is_arxiv":true,"paper":"/paper/to-be-robust-or-to-be-fair-towards-fairness-1","title":"To be Robust or to be Fair: Towards Fairness in Adversarial Training","date":"2020-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannxu123/fair_robust","path":"utils_frl.py","file_url":"https://github.com/hannxu123/fair_robust/blob/HEAD/utils_frl.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, hannxu123/fair_robust when it was checked","code_sha256":"ee1e48fc088d1214","code_sha256_prefix":"ee1e48fc088d1214","mcp_get_code":{"code_sha256":"ee1e48fc088d1214"}},{"arxiv_id":"1909.01492","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-verified-robustness-to-symbol","title":"Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagation","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/interval-bound-propagation","path":"interval_bound_propagation/src/attacks.py","file_url":"https://github.com/deepmind/interval-bound-propagation/blob/HEAD/interval_bound_propagation/src/attacks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cde1139d55d20376","code_sha256_prefix":"cde1139d55d20376","mcp_get_code":{"code_sha256":"cde1139d55d20376"}},{"arxiv_id":"aaai_26027","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26027","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UCAS-LCH/Twin-Rep","path":"attack.py","file_url":"https://github.com/UCAS-LCH/Twin-Rep/blob/HEAD/attack.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":"3740b6bfd95f35f0","code_sha256_prefix":"3740b6bfd95f35f0","mcp_get_code":{"code_sha256":"3740b6bfd95f35f0"}},{"arxiv_id":"Zhang_Towards_Adversarial_Robustness_via_Debiased_High-Confidence_Logit_Alignment_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhang_Towards_Adversarial_Robustness_via_Debiased_High-Confidence_Logit_Alignment_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KejiaZhang-Robust/DHAT","path":"attacks/pgd.py","file_url":"https://github.com/KejiaZhang-Robust/DHAT/blob/HEAD/attacks/pgd.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":"d101fe77bd873ee2","code_sha256_prefix":"d101fe77bd873ee2","mcp_get_code":{"code_sha256":"d101fe77bd873ee2"}}],"record_sha256":"62906058c8470e9497ff8d92780971888432c4b40936b4fbbe7d3cccefef668c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}