{"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":"/task/adversarial-robustness/papers/ran/3","list_of":"/task/adversarial-robustness","task":"Adversarial Robustness","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,261],"of":261,"counts":{"archive_papers_tagged":1746,"with_a_code_link":788,"where_syntology_ran_a_sample":261,"not_listed_spam_title":0,"listed":1746,"listed_where_code_ran":261,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":205,"every_run_a_failure_of_syntologys_instrument":56,"listed_with_a_run_with_no_instrument_failure":205,"listed_every_run_a_failure_of_syntologys_instrument":56,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/adversarial-robustness/papers/ran/1","prev":"/task/adversarial-robustness/papers/ran/2","next":null,"papers":[{"url":"/paper/robust-pre-training-by-adversarial","slug":"robust-pre-training-by-adversarial","title":"Robust Pre-Training by Adversarial Contrastive Learning","date":"2020-10-26","arxiv_id":"2010.13337","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/robust-pre-training-by-adversarial#ran","syntology_url":"https://syntology.ai/paper/2010.13337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13337"}},"official":{"repos":["VITA-Group/Adversarial-Contrastive-Learning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-power-of-abstention-and-data-driven-1","slug":"on-the-power-of-abstention-and-data-driven-1","title":"An Analysis of Robustness of Non-Lipschitz Networks","date":"2020-10-13","arxiv_id":"2010.06154","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-power-of-abstention-and-data-driven-1#ran","syntology_url":"https://syntology.ai/paper/2010.06154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06154"}},"official":{"repos":["dravyanshsharma/adversarial-contrastive"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/shape-texture-debiased-neural-network-1","slug":"shape-texture-debiased-neural-network-1","title":"Shape-Texture Debiased Neural Network Training","date":"2020-10-12","arxiv_id":"2010.05981","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/shape-texture-debiased-neural-network-1#ran","syntology_url":"https://syntology.ai/paper/2010.05981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05981"}},"official":{"repos":["LiYingwei/ShapeTextureDebiasedTraining"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bag-of-tricks-for-adversarial-training","slug":"bag-of-tricks-for-adversarial-training","title":"Bag of Tricks for Adversarial Training","date":"2020-10-01","arxiv_id":"2010.00467","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bag-of-tricks-for-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2010.00467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00467"}},"official":{"repos":["P2333/Bag-of-Tricks-for-AT","fra31/auto-attack"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/adversarial-concurrent-training-optimizing","slug":"adversarial-concurrent-training-optimizing","title":"Adversarial Concurrent Training: Optimizing Robustness and Accuracy Trade-off of Deep Neural Networks","date":"2020-08-16","arxiv_id":"2008.07015","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-concurrent-training-optimizing#ran","syntology_url":"https://syntology.ai/paper/2008.07015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07015"}},"official":{"repos":["NeurAI-Lab/ACT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-networks-with-recurrent-generative","slug":"neural-networks-with-recurrent-generative","title":"Neural Networks with Recurrent Generative Feedback","date":"2020-07-17","arxiv_id":"2007.09200","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/neural-networks-with-recurrent-generative#ran","syntology_url":"https://syntology.ai/paper/2007.09200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09200"}},"official":{"repos":["yjhuangcd/CNNF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-via-robust-low-rank","slug":"adversarial-robustness-via-robust-low-rank","title":"Adversarial robustness via robust low rank representations","date":"2020-07-13","arxiv_id":"2007.06555","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-via-robust-low-rank#ran","syntology_url":"https://syntology.ai/paper/2007.06555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06555"}},"official":null}},{"url":"/paper/delving-into-the-adversarial-robustness-on","slug":"delving-into-the-adversarial-robustness-on","title":"RobFR: Benchmarking Adversarial Robustness on Face Recognition","date":"2020-07-08","arxiv_id":"2007.04118","repositories_listed":2,"syntology":{"n":23,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/delving-into-the-adversarial-robustness-on#ran","syntology_url":"https://syntology.ai/paper/2007.04118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04118"}},"official":{"repos":["ShawnXYang/Face-Robustness-Benchmark"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/improving-uncertainty-estimates-through-the","slug":"improving-uncertainty-estimates-through-the","title":"Improving Calibration through the Relationship with Adversarial Robustness","date":"2020-06-29","arxiv_id":"2006.16375","repositories_listed":0,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-uncertainty-estimates-through-the#ran","syntology_url":"https://syntology.ai/paper/2006.16375","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16375"}},"official":null}},{"url":"/paper/proper-network-interpretability-helps","slug":"proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","arxiv_id":"2006.14748","repositories_listed":1,"syntology":{"n":17,"n_ran":6,"n_constructed":1,"n_ran_checked":3,"n_instrument":3,"n_unverified":11,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/proper-network-interpretability-helps#ran","syntology_url":"https://syntology.ai/paper/2006.14748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14748"}},"official":{"repos":["AkhilanB/Proper-Interpretability"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/smooth-adversarial-training","slug":"smooth-adversarial-training","title":"Smooth Adversarial Training","date":"2020-06-25","arxiv_id":"2006.14536","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/smooth-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2006.14536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14536"}},"official":{"repos":["cihangxie/SmoothAdversarialTraining"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/imbalanced-gradients-a-new-cause-of","slug":"imbalanced-gradients-a-new-cause-of","title":"Imbalanced Gradients: A Subtle Cause of Overestimated Adversarial Robustness","date":"2020-06-24","arxiv_id":"2006.13726","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/imbalanced-gradients-a-new-cause-of#ran","syntology_url":"https://syntology.ai/paper/2006.13726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13726"}},"official":{"repos":["hanxunh/mdattack"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/perceptual-adversarial-robustness-defense","slug":"perceptual-adversarial-robustness-defense","title":"Perceptual Adversarial Robustness: Defense Against Unseen Threat Models","date":"2020-06-22","arxiv_id":"2006.12655","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":9,"n_ran_checked":10,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"11 ran (of which 9 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/perceptual-adversarial-robustness-defense#ran","syntology_url":"https://syntology.ai/paper/2006.12655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12655"}},"official":{"repos":["cassidylaidlaw/perceptual-advex"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":7,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-self-supervised-approach-for-adversarial-1","slug":"a-self-supervised-approach-for-adversarial-1","title":"A Self-supervised Approach for Adversarial Robustness","date":"2020-06-08","arxiv_id":"2006.04924","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-self-supervised-approach-for-adversarial-1#ran","syntology_url":"https://syntology.ai/paper/2006.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04924"}},"official":{"repos":["Muzammal-Naseer/NRP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/consistency-regularization-for-certified","slug":"consistency-regularization-for-certified","title":"Consistency Regularization for Certified Robustness of Smoothed Classifiers","date":"2020-06-07","arxiv_id":"2006.04062","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/consistency-regularization-for-certified#ran","syntology_url":"https://syntology.ai/paper/2006.04062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04062"}},"official":{"repos":["jh-jeong/smoothing-consistency"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improve-robustness-of-dnn-for-ecg-signal","slug":"improve-robustness-of-dnn-for-ecg-signal","title":"Improve robustness of DNN for ECG signal classification:a noise-to-signal ratio perspective","date":"2020-05-18","arxiv_id":"2005.09134","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improve-robustness-of-dnn-for-ecg-signal#ran","syntology_url":"https://syntology.ai/paper/2005.09134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09134"}},"official":{"repos":["SarielMa/ICLR2020_AI4AH"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-exact-verification-of-binarized","slug":"efficient-exact-verification-of-binarized","title":"Efficient Exact Verification of Binarized Neural Networks","date":"2020-05-07","arxiv_id":"2005.03597","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-exact-verification-of-binarized#ran","syntology_url":"https://syntology.ai/paper/2005.03597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03597"}},"official":{"repos":["jia-kai/eevbnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/proper-measure-for-adversarial-robustness","slug":"proper-measure-for-adversarial-robustness","title":"Measuring Adversarial Robustness using a Voronoi-Epsilon Adversary","date":"2020-05-06","arxiv_id":"2005.02540","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/proper-measure-for-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2005.02540","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02540"}},"official":{"repos":["hjk92g/proper_measure_robustness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-intrinsic-adversarial-robustness","slug":"enhancing-intrinsic-adversarial-robustness","title":"Enhancing Intrinsic Adversarial Robustness via Feature Pyramid Decoder","date":"2020-05-06","arxiv_id":"2005.02552","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-intrinsic-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2005.02552","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02552"}},"official":{"repos":["GuanlinLee/FPD-for-Adversarial-Robustness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/bridging-mode-connectivity-in-loss-landscapes-1","slug":"bridging-mode-connectivity-in-loss-landscapes-1","title":"Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness","date":"2020-04-30","arxiv_id":"2005.00060","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-mode-connectivity-in-loss-landscapes-1#ran","syntology_url":"https://syntology.ai/paper/2005.00060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00060"}},"official":{"repos":["IBM/model-sanitization"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-loss-landscape-for-adversarial","slug":"revisiting-loss-landscape-for-adversarial","title":"Adversarial Weight Perturbation Helps Robust Generalization","date":"2020-04-13","arxiv_id":"2004.05884","repositories_listed":3,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-loss-landscape-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2004.05884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05884"}},"official":{"repos":["csdongxian/AWP","fra31/auto-attack"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-guarantees-for-random","slug":"adversarial-robustness-guarantees-for-random","title":"Adversarial Robustness Guarantees for Random Deep Neural Networks","date":"2020-04-13","arxiv_id":"2004.05923","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-robustness-guarantees-for-random#ran","syntology_url":"https://syntology.ai/paper/2004.05923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05923"}},"official":{"repos":["bkiani/Adversarial-robustness-guarantees-for-random-deep-neural-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/approximate-manifold-defense-against-multiple","slug":"approximate-manifold-defense-against-multiple","title":"Approximate Manifold Defense Against Multiple Adversarial Perturbations","date":"2020-04-05","arxiv_id":"2004.02183","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/approximate-manifold-defense-against-multiple#ran","syntology_url":"https://syntology.ai/paper/2004.02183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02183"}},"official":{"repos":["jayjaynandy/RBF-CNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/reliable-evaluation-of-adversarial-robustness","slug":"reliable-evaluation-of-adversarial-robustness","title":"Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks","date":"2020-03-03","arxiv_id":"2003.01690","repositories_listed":8,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/reliable-evaluation-of-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2003.01690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01690"}},"official":{"repos":["fra31/auto-attack","max-andr/square-attack"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learn2perturb-an-end-to-end-feature","slug":"learn2perturb-an-end-to-end-feature","title":"Learn2Perturb: an End-to-end Feature Perturbation Learning to Improve Adversarial Robustness","date":"2020-03-02","arxiv_id":"2003.01090","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learn2perturb-an-end-to-end-feature#ran","syntology_url":"https://syntology.ai/paper/2003.01090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01090"}},"official":null}},{"url":"/paper/understanding-the-intrinsic-robustness-of","slug":"understanding-the-intrinsic-robustness-of","title":"Understanding the Intrinsic Robustness of Image Distributions using Conditional Generative Models","date":"2020-03-01","arxiv_id":"2003.00378","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/understanding-the-intrinsic-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2003.00378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00378"}},"official":{"repos":["xiaozhanguva/Intrinsic-Rob"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/invariance-vs-robustness-of-neural-networks-1","slug":"invariance-vs-robustness-of-neural-networks-1","title":"Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks","date":"2020-02-26","arxiv_id":"2002.11318","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/invariance-vs-robustness-of-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.11318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.11318"}},"official":{"repos":["ksandeshk/spatial-vs-robustness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hold-me-tight-influence-of-discriminative","slug":"hold-me-tight-influence-of-discriminative","title":"Hold me tight! Influence of discriminative features on deep network boundaries","date":"2020-02-15","arxiv_id":"2002.06349","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hold-me-tight-influence-of-discriminative#ran","syntology_url":"https://syntology.ai/paper/2002.06349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06349"}},"official":{"repos":["LTS4/hold-me-tight"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robustness-for-code","slug":"adversarial-robustness-for-code","title":"Adversarial Robustness for Code","date":"2020-02-11","arxiv_id":"2002.04694","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-for-code#ran","syntology_url":"https://syntology.ai/paper/2002.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04694"}},"official":null}},{"url":"/paper/random-smoothing-might-be-unable-to-certify","slug":"random-smoothing-might-be-unable-to-certify","title":"Random Smoothing Might be Unable to Certify $\\ell_\\infty$ Robustness for High-Dimensional Images","date":"2020-02-10","arxiv_id":"2002.03517","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/random-smoothing-might-be-unable-to-certify#ran","syntology_url":"https://syntology.ai/paper/2002.03517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03517"}},"official":{"repos":["hongyanz/TRADES-smoothing"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/what-it-thinks-is-important-is-important","slug":"what-it-thinks-is-important-is-important","title":"What it Thinks is Important is Important: Robustness Transfers through Input Gradients","date":"2019-12-11","arxiv_id":"1912.05699","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/what-it-thinks-is-important-is-important#ran","syntology_url":"https://syntology.ai/paper/1912.05699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05699"}},"official":{"repos":["alvinchangw/IGAM_CVPR2020"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/preventing-gradient-attenuation-in-lipschitz","slug":"preventing-gradient-attenuation-in-lipschitz","title":"Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networks","date":"2019-11-03","arxiv_id":"1911.00937","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 8 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/preventing-gradient-attenuation-in-lipschitz#ran","syntology_url":"https://syntology.ai/paper/1911.00937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00937"}},"official":{"repos":["ColinQiyangLi/LConvNet"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-patches-exploiting-contextual","slug":"adversarial-patches-exploiting-contextual","title":"Role of Spatial Context in Adversarial Robustness for Object Detection","date":"2019-09-30","arxiv_id":"1910.00068","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-patches-exploiting-contextual#ran","syntology_url":"https://syntology.ai/paper/1910.00068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00068"}},"official":{"repos":["UMBCvision/Contextual-Adversarial-Patches"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mixup-inference-better-exploiting-mixup-to","slug":"mixup-inference-better-exploiting-mixup-to","title":"Mixup Inference: Better Exploiting Mixup to Defend Adversarial Attacks","date":"2019-09-25","arxiv_id":"1909.11515","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mixup-inference-better-exploiting-mixup-to#ran","syntology_url":"https://syntology.ai/paper/1909.11515","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11515"}},"official":{"repos":["P2333/Mixup-Inference"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sign-opt-a-query-efficient-hard-label","slug":"sign-opt-a-query-efficient-hard-label","title":"Sign-OPT: A Query-Efficient Hard-label Adversarial Attack","date":"2019-09-24","arxiv_id":"1909.10773","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sign-opt-a-query-efficient-hard-label#ran","syntology_url":"https://syntology.ai/paper/1909.10773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10773"}},"official":{"repos":["cmhcbb/attackbox"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/190808016","slug":"190808016","title":"Testing Robustness Against Unforeseen Adversaries","date":"2019-08-21","arxiv_id":"1908.08016","repositories_listed":3,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":13,"n_pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 1 violated, 13 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190808016#ran","syntology_url":"https://syntology.ai/paper/1908.08016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08016"}},"official":{"repos":["centerforaisafety/adversarial-corruptions","ddkang/advex-uar"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/protecting-neural-networks-with-hierarchical","slug":"protecting-neural-networks-with-hierarchical","title":"Protecting Neural Networks with Hierarchical Random Switching: Towards Better Robustness-Accuracy Trade-off for Stochastic Defenses","date":"2019-08-20","arxiv_id":"1908.07116","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/protecting-neural-networks-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1908.07116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07116"}},"official":{"repos":["KieranXWang/HRS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robustness-properties-of-facebooks-resnext","slug":"robustness-properties-of-facebooks-resnext","title":"Robustness properties of Facebook's ResNeXt WSL models","date":"2019-07-17","arxiv_id":"1907.07640","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robustness-properties-of-facebooks-resnext#ran","syntology_url":"https://syntology.ai/paper/1907.07640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07640"}},"official":{"repos":["eminorhan/resnext-wsl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/interpolated-adversarial-training-achieving","slug":"interpolated-adversarial-training-achieving","title":"Interpolated Adversarial Training: Achieving Robust Neural Networks without Sacrificing Too Much Accuracy","date":"2019-06-16","arxiv_id":"1906.06784","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/interpolated-adversarial-training-achieving#ran","syntology_url":"https://syntology.ai/paper/1906.06784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06784"}},"official":null}},{"url":"/paper/beyond-adversarial-training-min-max","slug":"beyond-adversarial-training-min-max","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","date":"2019-06-09","arxiv_id":"1906.03563","repositories_listed":1,"syntology":{"n":25,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":14,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/beyond-adversarial-training-min-max#ran","syntology_url":"https://syntology.ai/paper/1906.03563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03563"}},"official":{"repos":["wangjksjtu/minmax-adv"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":14,"ran_from_kinds":["official"]}}},{"url":"/paper/provably-robust-boosted-decision-stumps-and","slug":"provably-robust-boosted-decision-stumps-and","title":"Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks","date":"2019-06-08","arxiv_id":"1906.03526","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/provably-robust-boosted-decision-stumps-and#ran","syntology_url":"https://syntology.ai/paper/1906.03526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03526"}},"official":{"repos":["max-andr/provably-robust-boosting"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mnist-c-a-robustness-benchmark-for-computer","slug":"mnist-c-a-robustness-benchmark-for-computer","title":"MNIST-C: A Robustness Benchmark for Computer Vision","date":"2019-06-05","arxiv_id":"1906.02337","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mnist-c-a-robustness-benchmark-for-computer#ran","syntology_url":"https://syntology.ai/paper/1906.02337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02337"}},"official":{"repos":["google-research/mnist-c"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/unlabeled-data-improves-adversarial","slug":"unlabeled-data-improves-adversarial","title":"Unlabeled Data Improves Adversarial Robustness","date":"2019-05-31","arxiv_id":"1905.13736","repositories_listed":4,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unlabeled-data-improves-adversarial#ran","syntology_url":"https://syntology.ai/paper/1905.13736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13736"}},"official":{"repos":["yaircarmon/semisup-adv","worksheets.codalab.org/worksheets/0x9df253b24dac4a2b930108be9c6e5496"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/me-net-towards-effective-adversarial","slug":"me-net-towards-effective-adversarial","title":"ME-Net: Towards Effective Adversarial Robustness with Matrix Estimation","date":"2019-05-28","arxiv_id":"1905.11971","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/me-net-towards-effective-adversarial#ran","syntology_url":"https://syntology.ai/paper/1905.11971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11971"}},"official":{"repos":["YyzHarry/ME-Net"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scaleable-input-gradient-regularization-for","slug":"scaleable-input-gradient-regularization-for","title":"Scaleable input gradient regularization for adversarial robustness","date":"2019-05-27","arxiv_id":"1905.11468","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/scaleable-input-gradient-regularization-for#ran","syntology_url":"https://syntology.ai/paper/1905.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11468"}},"official":{"repos":["cfinlay/tulip"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-softmax-cross-entropy-loss-for","slug":"rethinking-softmax-cross-entropy-loss-for","title":"Rethinking Softmax Cross-Entropy Loss for Adversarial Robustness","date":"2019-05-25","arxiv_id":"1905.10626","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-softmax-cross-entropy-loss-for#ran","syntology_url":"https://syntology.ai/paper/1905.10626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10626"}},"official":{"repos":["P2333/Max-Mahalanobis-Training"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/190509747","slug":"190509747","title":"Adversarially Robust Distillation","date":"2019-05-23","arxiv_id":"1905.09747","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190509747#ran","syntology_url":"https://syntology.ai/paper/1905.09747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09747"}},"official":{"repos":["goldblum/AdversariallyRobustDistillation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-connection-between-adversarial","slug":"on-the-connection-between-adversarial","title":"On the Connection Between Adversarial Robustness and Saliency Map Interpretability","date":"2019-05-10","arxiv_id":"1905.04172","repositories_listed":1,"syntology":{"n":16,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/on-the-connection-between-adversarial#ran","syntology_url":"https://syntology.ai/paper/1905.04172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04172"}},"official":{"repos":["cetmann/robustness-interpretability"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-training-and-robustness-for","slug":"adversarial-training-and-robustness-for","title":"Adversarial Training and Robustness for Multiple Perturbations","date":"2019-04-30","arxiv_id":"1904.13000","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-training-and-robustness-for#ran","syntology_url":"https://syntology.ai/paper/1904.13000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.13000"}},"official":{"repos":["ftramer/MultiRobustness"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-evaluation-of-adversarial-perturbations","slug":"on-evaluation-of-adversarial-perturbations","title":"On Evaluation of Adversarial Perturbations for Sequence-to-Sequence Models","date":"2019-03-15","arxiv_id":"1903.06620","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-evaluation-of-adversarial-perturbations#ran","syntology_url":"https://syntology.ai/paper/1903.06620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.06620"}},"official":{"repos":["pmichel31415/teapot-nlp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/wasserstein-adversarial-examples-via","slug":"wasserstein-adversarial-examples-via","title":"Wasserstein Adversarial Examples via Projected Sinkhorn Iterations","date":"2019-02-21","arxiv_id":"1902.07906","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wasserstein-adversarial-examples-via#ran","syntology_url":"https://syntology.ai/paper/1902.07906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07906"}},"official":{"repos":["locuslab/projected_sinkhorn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/using-pre-training-can-improve-model","slug":"using-pre-training-can-improve-model","title":"Using Pre-Training Can Improve Model Robustness and Uncertainty","date":"2019-01-28","arxiv_id":"1901.09960","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/using-pre-training-can-improve-model#ran","syntology_url":"https://syntology.ai/paper/1901.09960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09960"}},"official":{"repos":["hendrycks/pre-training"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-adversarial-robustness-via","slug":"improving-adversarial-robustness-via","title":"Improving Adversarial Robustness via Promoting Ensemble Diversity","date":"2019-01-25","arxiv_id":"1901.08846","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-adversarial-robustness-via#ran","syntology_url":"https://syntology.ai/paper/1901.08846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08846"}},"official":{"repos":["P2333/Adaptive-Diversity-Promoting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/theoretically-principled-trade-off-between","slug":"theoretically-principled-trade-off-between","title":"Theoretically Principled Trade-off between Robustness and Accuracy","date":"2019-01-24","arxiv_id":"1901.08573","repositories_listed":9,"syntology":{"n":15,"n_ran":12,"n_constructed":6,"n_ran_checked":7,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"12 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/theoretically-principled-trade-off-between#ran","syntology_url":"https://syntology.ai/paper/1901.08573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08573"}},"official":{"repos":["yaodongyu/TRADES"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sorting-out-lipschitz-function-approximation","slug":"sorting-out-lipschitz-function-approximation","title":"Sorting out Lipschitz function approximation","date":"2018-11-13","arxiv_id":"1811.05381","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sorting-out-lipschitz-function-approximation#ran","syntology_url":"https://syntology.ai/paper/1811.05381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05381"}},"official":null}},{"url":"/paper/logit-pairing-methods-can-fool-gradient-based","slug":"logit-pairing-methods-can-fool-gradient-based","title":"Logit Pairing Methods Can Fool Gradient-Based Attacks","date":"2018-10-29","arxiv_id":"1810.12042","repositories_listed":1,"syntology":{"n":24,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":21,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 21 unverified","sample_list":"/paper/logit-pairing-methods-can-fool-gradient-based#ran","syntology_url":"https://syntology.ai/paper/1810.12042","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.12042"}},"official":{"repos":["uds-lsv/evaluating-logit-pairing-methods"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":21,"ran_from_kinds":["official"]}}},{"url":"/paper/second-order-adversarial-attack-and","slug":"second-order-adversarial-attack-and","title":"Certified Adversarial Robustness with Additive Noise","date":"2018-09-10","arxiv_id":"1809.03113","repositories_listed":3,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/second-order-adversarial-attack-and#ran","syntology_url":"https://syntology.ai/paper/1809.03113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03113"}},"official":{"repos":["Bai-Li/STN-Code"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/autozoom-autoencoder-based-zeroth-order","slug":"autozoom-autoencoder-based-zeroth-order","title":"AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networks","date":"2018-05-30","arxiv_id":"1805.11770","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autozoom-autoencoder-based-zeroth-order#ran","syntology_url":"https://syntology.ai/paper/1805.11770","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11770"}},"official":{"repos":["IBM/Autozoom-Attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/genattack-practical-black-box-attacks-with","slug":"genattack-practical-black-box-attacks-with","title":"GenAttack: Practical Black-box Attacks with Gradient-Free Optimization","date":"2018-05-28","arxiv_id":"1805.11090","repositories_listed":3,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/genattack-practical-black-box-attacks-with#ran","syntology_url":"https://syntology.ai/paper/1805.11090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11090"}},"official":{"repos":["nesl/adversarial_genattack"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-the-first-adversarially-robust-neural","slug":"towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","arxiv_id":"1805.09190","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-the-first-adversarially-robust-neural#ran","syntology_url":"https://syntology.ai/paper/1805.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09190"}},"official":null}},{"url":"/paper/towards-deep-learning-models-resistant-to","slug":"towards-deep-learning-models-resistant-to","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","date":"2017-06-19","arxiv_id":"1706.06083","repositories_listed":59,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":8,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":13,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/towards-deep-learning-models-resistant-to#ran","syntology_url":"https://syntology.ai/paper/1706.06083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.06083"}},"official":{"repos":["MadryLab/cifar10_challenge","MadryLab/mnist_challenge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"7dd6e3377df1c19c29cfc3a8ebd1081a13566d5b80902c19564c3cfd803e4b05","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}