{"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/attack-pgd","entry":"attack_pgd","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":4,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":3,"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":10,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":5,"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":1,"ran_fixture":0,"ran":1,"unverified":8},"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":"2512.12997","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-12997","title":"Calibrating Uncertainty for Zero-Shot Adversarial CLIP","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"VivienLu/UCAT","path":"attacks.py","file_url":"https://github.com/VivienLu/UCAT/blob/HEAD/attacks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, VivienLu/UCAT when it was checked","code_sha256":"6a6111640475b80b","code_sha256_prefix":"6a6111640475b80b","mcp_get_code":{"code_sha256":"6a6111640475b80b"}},{"arxiv_id":"2512.12997","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-12997","title":"Calibrating Uncertainty for Zero-Shot Adversarial CLIP","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"VivienLu/UCAT","path":"attacks_multilabel.py","file_url":"https://github.com/VivienLu/UCAT/blob/HEAD/attacks_multilabel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, VivienLu/UCAT when it was checked","code_sha256":"3a8a760ecfb5b55a","code_sha256_prefix":"3a8a760ecfb5b55a","mcp_get_code":{"code_sha256":"3a8a760ecfb5b55a"}},{"arxiv_id":"2410.21802","arxiv_id_is_arxiv":true,"paper":"/paper/text-guided-attention-is-all-you-need-for","title":"Text-Guided Attention is All You Need for Zero-Shot Robustness in Vision-Language Models","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyblue424/TGA-ZSR","path":"attacks.py","file_url":"https://github.com/zhyblue424/TGA-ZSR/blob/HEAD/attacks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhyblue424/TGA-ZSR when it was checked","code_sha256":"19cc15407084e347","code_sha256_prefix":"19cc15407084e347","mcp_get_code":{"code_sha256":"19cc15407084e347"}},{"arxiv_id":"2404.19287","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-adversarial-robustness-of","title":"Revisiting the Adversarial Robustness of Vision Language Models: a Multimodal Perspective","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ellezwq/mmcoa","path":"attacks.py","file_url":"https://github.com/ellezwq/mmcoa/blob/HEAD/attacks.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":"7c90002916e1665a","code_sha256_prefix":"7c90002916e1665a","mcp_get_code":{"code_sha256":"7c90002916e1665a"}},{"arxiv_id":"2403.14774","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-adversarial-prompt-learning-on","title":"Few-Shot Adversarial Prompt Learning on Vision-Language Models","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lionel-w2/FAP","path":"attack/pgd.py","file_url":"https://github.com/lionel-w2/FAP/blob/HEAD/attack/pgd.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":"43334d2162325a01","code_sha256_prefix":"43334d2162325a01","mcp_get_code":{"code_sha256":"43334d2162325a01"}},{"arxiv_id":"2302.12480","arxiv_id_is_arxiv":true,"paper":"/paper/robust-weight-signatures-gaining-robustness","title":"Robust Weight Signatures: Gaining Robustness as Easy as Patching Weights?","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/Robust_Weight_Signatures","path":"trainer/engine_pgd.py","file_url":"https://github.com/VITA-Group/Robust_Weight_Signatures/blob/HEAD/trainer/engine_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":"28cadfa8650befa7","code_sha256_prefix":"28cadfa8650befa7","mcp_get_code":{"code_sha256":"28cadfa8650befa7"}},{"arxiv_id":"2110.14871","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-depthwise-separable-convolutions","title":"Generalized Depthwise-Separable Convolutions for Adversarially Robust and Efficient Neural Networks","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hsndbk4/gdws","path":"eval_robustness.py","file_url":"https://github.com/hsndbk4/gdws/blob/HEAD/eval_robustness.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hsndbk4/gdws when it was checked","code_sha256":"5d11d79b4e03238d","code_sha256_prefix":"5d11d79b4e03238d","mcp_get_code":{"code_sha256":"5d11d79b4e03238d"}},{"arxiv_id":"2108.07969","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-adversarial-robustness","title":"Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Better","date":"2021-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zibojia/RSLAD","path":"rslad_loss.py","file_url":"https://github.com/zibojia/RSLAD/blob/HEAD/rslad_loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57555b28180e36f9","code_sha256_prefix":"57555b28180e36f9","mcp_get_code":{"code_sha256":"57555b28180e36f9"}},{"arxiv_id":"2105.14785","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-training-with-rectified-rejection","title":"Two Coupled Rejection Metrics Can Tell Adversarial Examples Apart","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P2333/Rectified-Rejection","path":"train_cifar.py","file_url":"https://github.com/P2333/Rectified-Rejection/blob/HEAD/train_cifar.py","status":"unverified","verification_level":0,"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":"7b266a334ce73354","code_sha256_prefix":"7b266a334ce73354","mcp_get_code":{"code_sha256":"7b266a334ce73354"}},{"arxiv_id":"2105.14785","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-training-with-rectified-rejection","title":"Two Coupled Rejection Metrics Can Tell Adversarial Examples Apart","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P2333/Rectified-Rejection","path":"eval_cifar.py","file_url":"https://github.com/P2333/Rectified-Rejection/blob/HEAD/eval_cifar.py","status":"unverified","verification_level":0,"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":"d59b09f0d6dcdcff","code_sha256_prefix":"d59b09f0d6dcdcff","mcp_get_code":{"code_sha256":"d59b09f0d6dcdcff"}},{"arxiv_id":"1905.09747","arxiv_id_is_arxiv":true,"paper":"/paper/190509747","title":"Adversarially Robust Distillation","date":"2019-05-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":null,"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":"57555b28180e36f9","code_sha256_prefix":"57555b28180e36f9","mcp_get_code":{"code_sha256":"57555b28180e36f9"}},{"arxiv_id":"1706.06083","arxiv_id_is_arxiv":true,"paper":"/paper/towards-deep-learning-models-resistant-to","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","date":"2017-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zibojia/rslad","path":"rslad_loss.py","file_url":"https://github.com/zibojia/rslad/blob/HEAD/rslad_loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57555b28180e36f9","code_sha256_prefix":"57555b28180e36f9","mcp_get_code":{"code_sha256":"57555b28180e36f9"}}],"record_sha256":"fa3167f845a15aacc7885d66cb1e14bdf1279d65080dd6dc633f2bdcf2cad57e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}