{"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":"/paper/theoretically-principled-trade-off-between","title":"Theoretically Principled Trade-off between Robustness and Accuracy","arxiv_id":"1901.08573","date":"2019-01-24","proceeding":null,"authors":["Hongyang Zhang","Yaodong Yu","Jiantao Jiao","Eric P. Xing","Laurent El Ghaoui","Michael. I. Jordan"],"abstract":"We identify a trade-off between robustness and accuracy that serves as a guiding principle in the design of defenses against adversarial examples. Although this problem has been widely studied empirically, much remains unknown concerning the theory underlying this trade-off. In this work, we decompose the prediction error for adversarial examples (robust error) as the sum of the natural (classification) error and boundary error, and provide a differentiable upper bound using the theory of classification-calibrated loss, which is shown to be the tightest possible upper bound uniform over all probability distributions and measurable predictors. Inspired by our theoretical analysis, we also design a new defense method, TRADES, to trade adversarial robustness off against accuracy. Our proposed algorithm performs well experimentally in real-world datasets. The methodology is the foundation of our entry to the NeurIPS 2018 Adversarial Vision Challenge in which we won the 1st place out of ~2,000 submissions, surpassing the runner-up approach by $11.41\\%$ in terms of mean $\\ell_2$ perturbation distance.","url_abs":"https://arxiv.org/abs/1901.08573v3","url_pdf":"https://arxiv.org/pdf/1901.08573v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/yaodongyu/TRADES","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/TonyYaoMSU/TRADES","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/arobey1/advbench","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/goldblum/AdversariallyRobustDistillation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/nutellamok/advrush","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/optimization-for-data-driven-science/dair","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/val-iisc/flss","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/zjfheart/Friendly-Adversarial-Training","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"theoretically-principled-trade-off-between","repo_url":"https://github.com/salomonhotegni/MOREL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"adversarial-attack","task_name":"Adversarial Attack"},{"task_slug":"adversarial-defense","task_name":"Adversarial Defense"},{"task_slug":"adversarial-robustness","task_name":"Adversarial Robustness"},{"task_slug":"classification","task_name":"General Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/adversarial-attack-on-cifar-10","task":"Adversarial Attack","dataset":"CIFAR-10","model":"TRADES [zhang2019b]","rank_in_archive_order":3,"of":6,"metrics":{"Attack: PGD20":"45.900"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.08573","atlas_url":"https://app.syntology.ai/?focus=1901.08573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08573"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.08573"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.08573"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.08573\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1901.08573"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.08573\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.08573"},"call":"get_concepts_for_paper(arxiv_id=\"1901.08573\")"}],"by_repo":[{"repo":"yaodongyu/TRADES","kind":"official","samples":1,"ran":1,"instrument":1,"unverified":0,"placed_by_identical_code":1},{"repo":"TonyYaoMSU/TRADES","kind":"listed","samples":1,"ran":1,"instrument":1,"unverified":0},{"repo":"arobey1/advbench","kind":"listed","samples":9,"ran":7,"instrument":1,"unverified":2},{"repo":"goldblum/AdversariallyRobustDistillation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.09747"],"harvested_for_calls":[{"arxiv_id":"1905.09747","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.09747"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.09747\")"}]},{"repo":"nutellamok/advrush","kind":"listed","samples":1,"ran":1,"instrument":1,"unverified":0},{"repo":"optimization-for-data-driven-science/dair","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"val-iisc/flss","kind":"listed","samples":1,"ran":1,"instrument":0,"unverified":0},{"repo":"zjfheart/Friendly-Adversarial-Training","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1,"placed_by_identical_code":1},{"repo":"salomonhotegni/MOREL","kind":"listed","samples":1,"ran":1,"instrument":1,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"0b959dd53ffac202","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"The paper claims this code implements a theoretically principled loss function that balances the trade-off between robustness and accuracy in adversarial training.","centrality":"contribution","entry":"trades_loss","entry_sha256":"4f4e01ae4a9aeecf","n_bricks":1,"bricks":[{"entry":"trades_loss","code_sha256":"4f4e01ae4a9aeecf","role":"entry","order":0,"level":1,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"3a4996f37e0b947e","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"The code implements the TRADES loss function, which balances natural and robust adversarial training by combining cross-entropy loss with a Kullback-Leibler divergence term.","centrality":"contribution","entry":"TRADES_loss","entry_sha256":"310d3d6ec0329c05","n_bricks":1,"bricks":[{"entry":"TRADES_loss","code_sha256":"310d3d6ec0329c05","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"695b8c6c9fdd5c2c","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"The paper claims this code implements a method that balances the trade-off between robustness and accuracy in adversarial training by minimizing a KL divergence loss between clean and adversarial logits.","centrality":"contribution","entry":"TRADES","entry_sha256":"8af50e8650fba9a4","n_bricks":11,"bricks":[{"entry":"TRADES","code_sha256":"8af50e8650fba9a4","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"Algorithm","code_sha256":"afdbbd69eb450e7d","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"AverageMeter","code_sha256":"61308ee90996cb91","role":"helper","order":2,"level":1,"status":"ran"},{"entry":"TRADES_Linf","code_sha256":"4cce9cc92ffa9b07","role":"loss","order":3,"level":1,"status":"ran"},{"entry":"Classifier","code_sha256":"95d7d9e951192fbe","role":"helper","order":4,"level":1,"status":"ran_fixture"},{"entry":"Attack_Linf","code_sha256":"808053223b371f29","role":"helper","order":5,"level":1,"status":"ran"},{"entry":"MNISTNet","code_sha256":"cc62770b8a2f07cb","role":"helper","order":6,"level":1,"status":"ran"},{"entry":"ResNet18","code_sha256":"35e1414137593b9e","role":"helper","order":7,"level":1,"status":"ran"},{"entry":"Attack","code_sha256":"bca439beb127432f","role":"helper","order":8,"level":1,"status":"ran"},{"entry":"BasicBlock","code_sha256":"e33f907725fe74f0","role":"helper","order":9,"level":1,"status":"ran"},{"entry":"ResNet","code_sha256":"a0485d54af2ef2ac","role":"helper","order":10,"level":1,"status":"ran"}],"ran_individually":9,"ran_individually_constructed":7,"ran_individually_by_status":{"ran":8,"ran_fixture":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"a5dc2a8ffc220498","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"The code implements the TRADES method, which optimizes a trade-off between robustness and accuracy by incorporating adversarial weight perturbation during training.","centrality":"contribution","entry":"TradesAWP","entry_sha256":"c1b3357620672711","n_bricks":3,"bricks":[{"entry":"TradesAWP","code_sha256":"c1b3357620672711","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"add_into_weights","code_sha256":"c4d59bb1cb0ef29e","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"diff_in_weights","code_sha256":"4170809219439d13","role":"helper","order":2,"level":1,"status":"ran_draft_wrong"}],"ran_individually":2,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1,"ran_draft_wrong":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"b5b045c79bb39568","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"The paper claims this code implements TRADES, a method that balances robustness and accuracy by optimizing a combined loss function of natural and adversarial examples.","centrality":"contribution","entry":"trades_loss","entry_sha256":"0dbf499b0160d7e3","n_bricks":1,"bricks":[{"entry":"trades_loss","code_sha256":"0dbf499b0160d7e3","role":"entry","order":0,"level":1,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"d43ec3e40e179dff","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"Implements the TRADES method, which optimizes a trade-off between robustness and accuracy by incorporating an adversarial loss term into the training objective.","centrality":"contribution","entry":"trades_loss","entry_sha256":"ae05ac36b5660867","n_bricks":1,"bricks":[{"entry":"trades_loss","code_sha256":"ae05ac36b5660867","role":"entry","order":0,"level":1,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"d71030f2d34e6ed1","source_kind":"harvested","method_name":"TRADES","realizes_method":"TRADES","graph_method":"TRADES","realizes_severed":false,"claim":"The code implements the TRADES method, which optimizes a trade-off between robustness and accuracy by incorporating an adversarial loss term into the training objective.","centrality":"contribution","entry":"trades_loss","entry_sha256":"e79913f3ab121c59","n_bricks":1,"bricks":[{"entry":"trades_loss","code_sha256":"e79913f3ab121c59","role":"entry","order":0,"level":1,"status":"ran_draft_wrong"}],"ran_individually":1,"ran_individually_constructed":0,"ran_individually_by_status":{"ran_draft_wrong":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"fa96d39dfdb5","n_siblings":6,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"fa96d39dfdb5","realizes_method":"TRADES","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["0b959dd53ffac202","3a4996f37e0b947e","695b8c6c9fdd5c2c","a5dc2a8ffc220498","b5b045c79bb39568","d43ec3e40e179dff","d71030f2d34e6ed1"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"1901.08573"},"call":"assembly(arxiv_id=\"1901.08573\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1901.08573.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1901.08573.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zjfheart/Friendly-Adversarial-Training","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nutellamok/advrush","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/goldblum/AdversariallyRobustDistillation","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/optimization-for-data-driven-science/dair","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/yaodongyu/TRADES","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/salomonhotegni/MOREL","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/TonyYaoMSU/TRADES","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/val-iisc/flss","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/arobey1/advbench","reach":null}],"summary":{"ran":7,"ran_fixture":1,"ran_draft_wrong":4,"unverified":3},"n_samples":15,"n_ran":12,"n_constructed":6,"n_ran_checked":7,"n_instrument":5,"n_unverified":3,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"repositories":1},"listed":{"samples":14,"ran":11,"n_ran_checked":7,"n_instrument":4,"repositories":6}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing","signature_not_shown":"the graph records a signature for this sample and it is not shown; signature_not_shown_because names why, as the export's field-exclusion reason","signature_not_shown_because":{"signature_is_harness_probe_not_fixture_args":"for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments"}},"n_ran_with_level_date":11,"n_ran_without_level_date":1,"n_ran_signature_not_shown":1,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"bca439beb127432f","code_sha256_prefix":"bca439beb127432f","entry":"Attack","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Attack","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/attack-2","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bca439beb127432f"}},{"code_sha256":"808053223b371f29","code_sha256_prefix":"808053223b371f29","entry":"Attack_Linf","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Attack_Linf","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"808053223b371f29"}},{"code_sha256":"61308ee90996cb91","code_sha256_prefix":"61308ee90996cb91","entry":"AverageMeter","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"AverageMeter","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/averagemeter","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"61308ee90996cb91"}},{"code_sha256":"95d7d9e951192fbe","code_sha256_prefix":"95d7d9e951192fbe","entry":"Classifier","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"input_shape:tuple/1/int, num_classes:int/0/int, hparams:dict/0/?","fixture_out_type":"MNISTNet","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/classifier","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"95d7d9e951192fbe"}},{"code_sha256":"cc62770b8a2f07cb","code_sha256_prefix":"cc62770b8a2f07cb","entry":"MNISTNet","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"MNISTNet","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"cc62770b8a2f07cb"}},{"code_sha256":"35e1414137593b9e","code_sha256_prefix":"35e1414137593b9e","entry":"ResNet18","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"ResNet","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/resnet18-2","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"35e1414137593b9e"}},{"code_sha256":"4cce9cc92ffa9b07","code_sha256_prefix":"4cce9cc92ffa9b07","entry":"TRADES_Linf","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature_not_shown":true,"signature_not_shown_because":"signature_is_harness_probe_not_fixture_args","fixture_out_type":"TRADES_Linf","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"4cce9cc92ffa9b07"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4cce9cc92ffa9b07"}},{"code_sha256":"c1b3357620672711","code_sha256_prefix":"c1b3357620672711","entry":"TradesAWP","repo":"val-iisc/flss","repo_kind":"listed","path":"CIFAR10/Train/utils_awp.py","file_url":"https://github.com/val-iisc/flss/blob/HEAD/CIFAR10/Train/utils_awp.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"TradesAWP","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, val-iisc/flss when it was checked","mcp_get_code":{"code_sha256":"c1b3357620672711"}},{"code_sha256":"0dbf499b0160d7e3","code_sha256_prefix":"0dbf499b0160d7e3","entry":"trades_loss","repo":null,"repo_kind":"official","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Tensor","code_page":"/code/trades-loss","census":null,"placed_by_identical_code":{"repo":"yaodongyu/TRADES","path":"trades.py","file_url":"https://github.com/yaodongyu/TRADES/blob/HEAD/trades.py","papers":["1910.09338"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"0dbf499b0160d7e3"}},{"code_sha256":"4f4e01ae4a9aeecf","code_sha256_prefix":"4f4e01ae4a9aeecf","entry":"trades_loss","repo":"TonyYaoMSU/TRADES","repo_kind":"listed","path":"TRADES-master/trades.py","file_url":"https://github.com/TonyYaoMSU/TRADES/blob/HEAD/TRADES-master/trades.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"model:callable/0/?, x_natural:Tensor/4/float, y:Tensor/1/int, optimizer:SGD/0/?, step_size:float/0/float, epsilon:float/0/float, perturb_steps:int/0/int, beta:float/0/float, distance:str/0/str","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/trades-loss","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TonyYaoMSU/TRADES when it was checked","mcp_get_code":{"code_sha256":"4f4e01ae4a9aeecf"}},{"code_sha256":"ae05ac36b5660867","code_sha256_prefix":"ae05ac36b5660867","entry":"trades_loss","repo":"nutellamok/advrush","repo_kind":"listed","path":"advrush/trades.py","file_url":"https://github.com/nutellamok/advrush/blob/HEAD/advrush/trades.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/trades-loss","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ae05ac36b5660867"}},{"code_sha256":"e79913f3ab121c59","code_sha256_prefix":"e79913f3ab121c59","entry":"trades_loss","repo":"salomonhotegni/MOREL","repo_kind":"listed","path":"src/advermorel/losses/trades.py","file_url":"https://github.com/salomonhotegni/MOREL/blob/HEAD/src/advermorel/losses/trades.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/trades-loss","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e79913f3ab121c59"}},{"code_sha256":"afdbbd69eb450e7d","code_sha256_prefix":"afdbbd69eb450e7d","entry":"Algorithm","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/algorithm","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"afdbbd69eb450e7d"}},{"code_sha256":"8af50e8650fba9a4","code_sha256_prefix":"8af50e8650fba9a4","entry":"TRADES","repo":"arobey1/advbench","repo_kind":"listed","path":"advbench/algorithms.py","file_url":"https://github.com/arobey1/advbench/blob/HEAD/advbench/algorithms.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8af50e8650fba9a4"}},{"code_sha256":"310d3d6ec0329c05","code_sha256_prefix":"310d3d6ec0329c05","entry":"TRADES_loss","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"placed_by_identical_code":{"repo":"zjfheart/Friendly-Adversarial-Training","path":"FAT_for_TRADES.py","file_url":"https://github.com/zjfheart/Friendly-Adversarial-Training/blob/HEAD/FAT_for_TRADES.py","papers":["1706.06083"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"310d3d6ec0329c05"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1b603b6c35809c0b0839f0d535e77a173001cf83798fc2666eae73f2f7c8a5ef","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}