{"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/uniform-weights","entry":"uniform_weights","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":0,"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":5,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2205.09665","paper":"/paper/automated-crossword-solving-1","title":"Automated Crossword Solving","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertkx/berkeley-crossword-solver","path":"DrQA/drqa/reader/layers.py","file_url":"https://github.com/albertkx/berkeley-crossword-solver/blob/HEAD/DrQA/drqa/reader/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d5761bf2b769f3cf","mcp_get_code":{"code_sha256":"d5761bf2b769f3cf"}},{"arxiv_id":"1905.05733","paper":"/paper/multi-step-retriever-reader-interaction-for-1","title":"Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answering","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajarshd/Multi-Step-Reasoning","path":"msr/reader/layers.py","file_url":"https://github.com/rajarshd/Multi-Step-Reasoning/blob/HEAD/msr/reader/layers.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":"9f1455d03e97305c","mcp_get_code":{"code_sha256":"9f1455d03e97305c"}},{"arxiv_id":"1905.05733","paper":"/paper/multi-step-retriever-reader-interaction-for-1","title":"Multi-step Retriever-Reader Interaction for Scalable Open-domain Question Answering","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajarshd/Multi-Step-Reasoning","path":"paragraph_encoder/model/layers.py","file_url":"https://github.com/rajarshd/Multi-Step-Reasoning/blob/HEAD/paragraph_encoder/model/layers.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":"9c735215d357a2c9","mcp_get_code":{"code_sha256":"9c735215d357a2c9"}},{"arxiv_id":"1904.13000","paper":"/paper/adversarial-training-and-robustness-for","title":"Adversarial Training and Robustness for Multiple Perturbations","date":"2019-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ftramer/MultiRobustness","path":"pgd_attack.py","file_url":"https://github.com/ftramer/MultiRobustness/blob/HEAD/pgd_attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f5fa09b884f0c0d3","mcp_get_code":{"code_sha256":"f5fa09b884f0c0d3"}},{"arxiv_id":"1810.04805","paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goldenbili/Bert_Test3","path":"drqa/reader/layers.py","file_url":"https://github.com/goldenbili/Bert_Test3/blob/HEAD/drqa/reader/layers.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":"9f1455d03e97305c","mcp_get_code":{"code_sha256":"9f1455d03e97305c"}},{"arxiv_id":"2021.acl-long.164","paper":null,"title":"arXiv:2021.acl-long.164","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/OpenQA","path":"src/reader/layers.py","file_url":"https://github.com/thunlp/OpenQA/blob/HEAD/src/reader/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"724fc0467cff298f","mcp_get_code":{"code_sha256":"724fc0467cff298f"}}]}