{"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-2","entry":"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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"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":3,"ran_fixture":0,"ran":3,"unverified":2},"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.21999","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21999","title":"Toward Understanding Adversarial Distillation: Why Robust Teachers Fail","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HongsinLee/why-robust-teachers-fail","path":"real_exp/attacks.py","file_url":"https://github.com/HongsinLee/why-robust-teachers-fail/blob/HEAD/real_exp/attacks.py","status":"ran","verification_level":1,"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, HongsinLee/why-robust-teachers-fail when it was checked","code_sha256":"a648902a7268d3fd","code_sha256_prefix":"a648902a7268d3fd","mcp_get_code":{"code_sha256":"a648902a7268d3fd"}},{"arxiv_id":"2512.10275","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-10275","title":"Sample-wise Adaptive Weighting for Transfer Consistency in Adversarial Distillation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"HongsinLee/saad","path":"attacks.py","file_url":"https://github.com/HongsinLee/saad/blob/HEAD/attacks.py","status":"ran","verification_level":1,"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, HongsinLee/saad when it was checked","code_sha256":"3bdbafb6e1f3cfe8","code_sha256_prefix":"3bdbafb6e1f3cfe8","mcp_get_code":{"code_sha256":"3bdbafb6e1f3cfe8"}},{"arxiv_id":"2501.17151","arxiv_id_is_arxiv":true,"paper":"/paper/scanning-trojaned-models-using-out-of","title":"Scanning Trojaned Models Using Out-of-Distribution Samples","date":"2025-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohban-lab/trodo","path":"src/evaluate.py","file_url":"https://github.com/rohban-lab/trodo/blob/HEAD/src/evaluate.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, rohban-lab/trodo when it was checked","code_sha256":"944b6daf2fbff670","code_sha256_prefix":"944b6daf2fbff670","mcp_get_code":{"code_sha256":"944b6daf2fbff670"}},{"arxiv_id":"2303.00250","arxiv_id_is_arxiv":true,"paper":"/paper/combating-exacerbated-heterogeneity-for","title":"Combating Exacerbated Heterogeneity for Robust Models in Federated Learning","date":"2023-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zfancy/sfat","path":"update.py","file_url":"https://github.com/zfancy/sfat/blob/HEAD/update.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":"215ed3150f0298e6","code_sha256_prefix":"215ed3150f0298e6","mcp_get_code":{"code_sha256":"215ed3150f0298e6"}},{"arxiv_id":"2302.03857","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-adversarial-contrastive-learning-1","title":"Efficient Adversarial Contrastive Learning via Robustness-Aware Coreset Selection","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"godxuxilie/efficient_acl_via_rcs","path":"ACL_RCS/ImageNet_32/RCS.py","file_url":"https://github.com/godxuxilie/efficient_acl_via_rcs/blob/HEAD/ACL_RCS/ImageNet_32/RCS.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, godxuxilie/efficient_acl_via_rcs when it was checked","code_sha256":"73ccccfd9181a1bf","code_sha256_prefix":"73ccccfd9181a1bf","mcp_get_code":{"code_sha256":"73ccccfd9181a1bf"}},{"arxiv_id":"2106.04928","arxiv_id_is_arxiv":true,"paper":"/paper/reliable-adversarial-distillation-with","title":"Reliable Adversarial Distillation with Unreliable Teachers","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zfancy/iad","path":"attack_generator.py","file_url":"https://github.com/zfancy/iad/blob/HEAD/attack_generator.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":"6c62112efeaf8abe","code_sha256_prefix":"6c62112efeaf8abe","mcp_get_code":{"code_sha256":"6c62112efeaf8abe"}},{"arxiv_id":"2104.00671","arxiv_id_is_arxiv":true,"paper":"/paper/trs-transferability-reduced-ensemble-via","title":"TRS: Transferability Reduced Ensemble via Encouraging Gradient Diversity and Model Smoothness","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI-secure/Transferability-Reduced-Smooth-Ensemble","path":"train/Empirical/trainer.py","file_url":"https://github.com/AI-secure/Transferability-Reduced-Smooth-Ensemble/blob/HEAD/train/Empirical/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, AI-secure/Transferability-Reduced-Smooth-Ensemble when it was checked","code_sha256":"55b27593beb14f70","code_sha256_prefix":"55b27593beb14f70","mcp_get_code":{"code_sha256":"55b27593beb14f70"}},{"arxiv_id":"2010.02432","arxiv_id_is_arxiv":true,"paper":"/paper/a-panda-no-it-s-a-sloth-slowdown-attacks-on-1","title":"A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inference","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanghyun-hong/deepsloth","path":"attacks/PGDs.py","file_url":"https://github.com/sanghyun-hong/deepsloth/blob/HEAD/attacks/PGDs.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":"de06046620195b86","code_sha256_prefix":"de06046620195b86","mcp_get_code":{"code_sha256":"de06046620195b86"}}],"record_sha256":"02ec92615d3ab38269b3f68e74e6cb912015c169a7dd1ad7f72b473f172f0b70","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}