{"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/replicate-input","entry":"replicate_input","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2606.02267","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02267","title":"A combination of noise and bilateral filters achieve supralinear and scalable adversarial robustness in CNNs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"wzekai99/DM-Improves-AT","path":"core/attacks/utils.py","file_url":"https://github.com/wzekai99/DM-Improves-AT/blob/HEAD/core/attacks/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"096e065144e00e11","code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}},{"arxiv_id":"2406.13283","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-dataset-pruning-in-adversarial","title":"Large-Scale Dataset Pruning in Adversarial Training through Data Importance Extrapolation","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BjoernNieth/LS-Dataset-pruning-in-AT","path":"core/attacks/utils.py","file_url":"https://github.com/BjoernNieth/LS-Dataset-pruning-in-AT/blob/HEAD/core/attacks/utils.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, BjoernNieth/LS-Dataset-pruning-in-AT when it was checked","code_sha256":"096e065144e00e11","code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}},{"arxiv_id":"2405.16260","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-consistency-based-image-generation","title":"Enhancing Consistency-Based Image Generation via Adversarialy-Trained Classification and Energy-Based Discrimination","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Shelley-Golan/Boosting-via-Joint-Model","path":"adversaries.py","file_url":"https://github.com/Shelley-Golan/Boosting-via-Joint-Model/blob/HEAD/adversaries.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, Shelley-Golan/Boosting-via-Joint-Model when it was checked","code_sha256":"096e065144e00e11","code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}},{"arxiv_id":"2302.03015","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-and-exploiting-decision-boundary","title":"Exploring and Exploiting Decision Boundary Dynamics for Adversarial Robustness","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuancheng-xu/dynamics-aware-robust-training","path":"core/DyART/DyART_Linf.py","file_url":"https://github.com/yuancheng-xu/dynamics-aware-robust-training/blob/HEAD/core/DyART/DyART_Linf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e78e41a8926dc30","code_sha256_prefix":"4e78e41a8926dc30","mcp_get_code":{"code_sha256":"4e78e41a8926dc30"}},{"arxiv_id":"2110.09468","arxiv_id_is_arxiv":true,"paper":"/paper/improving-robustness-using-generated-data","title":"Improving Robustness using Generated Data","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imrahulr/adversarial_robustness_pytorch","path":"core/attacks/utils.py","file_url":"https://github.com/imrahulr/adversarial_robustness_pytorch/blob/HEAD/core/attacks/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"096e065144e00e11","code_sha256_prefix":"096e065144e00e11","mcp_get_code":{"code_sha256":"096e065144e00e11"}}],"record_sha256":"3122a6e73503fe0bc4f47758e8a36838e92c5e822a21875a2a7562ba647baa51","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}