{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/argparser","entry":"argparser","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":4,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2403.04050","paper":"/paper/belief-enriched-pessimistic-q-learning","title":"Belief-Enriched Pessimistic Q-Learning against Adversarial State Perturbations","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SliencerX/Belief-enriched-robust-Q-learning","path":"argparser.py","file_url":"https://github.com/SliencerX/Belief-enriched-robust-Q-learning/blob/HEAD/argparser.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"62000ff4e804fe8d","mcp_get_code":{"code_sha256":"62000ff4e804fe8d"}},{"arxiv_id":"2010.11929","paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Thanusan19/Vision_Transformer","path":"vit_jax/flags.py","file_url":"https://github.com/Thanusan19/Vision_Transformer/blob/HEAD/vit_jax/flags.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"394a62fbbb1cef3a","mcp_get_code":{"code_sha256":"394a62fbbb1cef3a"}},{"arxiv_id":"2008.06081","paper":"/paper/adversarial-training-and-provable-robustness","title":"Adversarial Training and Provable Robustness: A Tale of Two Objectives","date":"2020-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JmfanBU/AdvIBP","path":"IBP_Adv_Training/utils/argparser.py","file_url":"https://github.com/JmfanBU/AdvIBP/blob/HEAD/IBP_Adv_Training/utils/argparser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28fd9484122ade47","mcp_get_code":{"code_sha256":"28fd9484122ade47"}},{"arxiv_id":"2002.12920","paper":"/paper/automatic-perturbation-analysis-on-general","title":"Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond","date":"2020-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/CROWN-IBP","path":"argparser.py","file_url":"https://github.com/huanzhang12/CROWN-IBP/blob/HEAD/argparser.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"62000ff4e804fe8d","mcp_get_code":{"code_sha256":"62000ff4e804fe8d"}},{"arxiv_id":"1810.12715","paper":"/paper/on-the-effectiveness-of-interval-bound","title":"On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Models","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungyoon-lee/bcp","path":"utils.py","file_url":"https://github.com/sungyoon-lee/bcp/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"846b8ce1a0cef2b3","mcp_get_code":{"code_sha256":"846b8ce1a0cef2b3"}}]}