{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-attn-pad-mask","entry":"get_attn_pad_mask","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":2,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2501.08537","arxiv_id_is_arxiv":true,"paper":"/paper/complexity-control-facilitates-reasoning","title":"Complexity Control Facilitates Reasoning-Based Compositional Generalization in Transformers","date":"2025-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtuzzw/complexity_control","path":"code_for_anchor_func/model/GPT2_init_for_diff_part_prenorm.py","file_url":"https://github.com/sjtuzzw/complexity_control/blob/HEAD/code_for_anchor_func/model/GPT2_init_for_diff_part_prenorm.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sjtuzzw/complexity_control when it was checked","code_sha256":"e6aecf6de669e5bf","code_sha256_prefix":"e6aecf6de669e5bf","mcp_get_code":{"code_sha256":"e6aecf6de669e5bf"}},{"arxiv_id":"2108.05997","arxiv_id_is_arxiv":true,"paper":"/paper/musiq-multi-scale-image-quality-transformer","title":"MUSIQ: Multi-scale Image Quality Transformer","date":"2021-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anse3832/MUSIQ","path":"model/model_main.py","file_url":"https://github.com/anse3832/MUSIQ/blob/HEAD/model/model_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, anse3832/MUSIQ when it was checked","code_sha256":"1d46b5657fff1e67","code_sha256_prefix":"1d46b5657fff1e67","mcp_get_code":{"code_sha256":"1d46b5657fff1e67"}},{"arxiv_id":"2106.00920","arxiv_id_is_arxiv":true,"paper":"/paper/dialograph-incorporating-interpretable-1","title":"DialoGraph: Incorporating Interpretable Strategy-Graph Networks into Negotiation Dialogues","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rishabhjoshi/DialoGraph_ICLR21","path":"src/bot/higru_model.py","file_url":"https://github.com/rishabhjoshi/DialoGraph_ICLR21/blob/HEAD/src/bot/higru_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ca85dff48190064","code_sha256_prefix":"4ca85dff48190064","mcp_get_code":{"code_sha256":"4ca85dff48190064"}},{"arxiv_id":"2009.10815","arxiv_id_is_arxiv":true,"paper":"/paper/keeping-up-appearances-computational-modeling","title":"Keeping Up Appearances: Computational Modeling of Face Acts in Persuasion Oriented Discussions","date":"2020-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wxjiao/HiGRUs","path":"Modules.py","file_url":"https://github.com/wxjiao/HiGRUs/blob/HEAD/Modules.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wxjiao/HiGRUs when it was checked","code_sha256":"e242b89c818f18de","code_sha256_prefix":"e242b89c818f18de","mcp_get_code":{"code_sha256":"e242b89c818f18de"}},{"arxiv_id":"2002.02562","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-transducer-a-streamable-speech","title":"Transformer Transducer: A Streamable Speech Recognition Model with Transformer Encoders and RNN-T Loss","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hasangchun/Transformer-Transducer","path":"transformer_transducer/mask.py","file_url":"https://github.com/hasangchun/Transformer-Transducer/blob/HEAD/transformer_transducer/mask.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28a3e8504a42f9e8","code_sha256_prefix":"28a3e8504a42f9e8","mcp_get_code":{"code_sha256":"28a3e8504a42f9e8"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"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":"graykode/nlp-tutorial","path":"5-2.BERT/BERT.py","file_url":"https://github.com/graykode/nlp-tutorial/blob/HEAD/5-2.BERT/BERT.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fae58f94f84bd6c2","code_sha256_prefix":"fae58f94f84bd6c2","mcp_get_code":{"code_sha256":"fae58f94f84bd6c2"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"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":"lvyufeng/mindspore-nlp-tutorial","path":"5-1.Transformer/Transformer.py","file_url":"https://github.com/lvyufeng/mindspore-nlp-tutorial/blob/HEAD/5-1.Transformer/Transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e1d7c4bb776fe62","code_sha256_prefix":"0e1d7c4bb776fe62","mcp_get_code":{"code_sha256":"0e1d7c4bb776fe62"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Skumarr53/Attention-is-All-you-Need-PyTorch","path":"transformer/model.py","file_url":"https://github.com/Skumarr53/Attention-is-All-you-Need-PyTorch/blob/HEAD/transformer/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Skumarr53/Attention-is-All-you-Need-PyTorch when it was checked","code_sha256":"8ffa7a54d0f36d6a","code_sha256_prefix":"8ffa7a54d0f36d6a","mcp_get_code":{"code_sha256":"8ffa7a54d0f36d6a"}}],"record_sha256":"5e108886f884e9b4dc76af6ebf28997cd422f4afdc47e140dd7bfd58bc42c459","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}