{"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-key-pad-mask","entry":"get_attn_key_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":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":12,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":6,"ran_draft_wrong":1,"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":"2112.09174","arxiv_id_is_arxiv":true,"paper":"/paper/learning-bounded-context-free-grammar-via","title":"Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanations","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shihui2010/learn_cfg_with_neural_network","path":"models/transformer.py","file_url":"https://github.com/shihui2010/learn_cfg_with_neural_network/blob/HEAD/models/transformer.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":"d3a9b19c6089233c","code_sha256_prefix":"d3a9b19c6089233c","mcp_get_code":{"code_sha256":"d3a9b19c6089233c"}},{"arxiv_id":"2006.09623","arxiv_id_is_arxiv":true,"paper":"/paper/learning-visual-commonsense-for-robust-scene","title":"Learning Visual Commonsense for Robust Scene Graph Generation","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhecanJamesWang/GLAT_SGG","path":"lib/models_kern.py","file_url":"https://github.com/ZhecanJamesWang/GLAT_SGG/blob/HEAD/lib/models_kern.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f18f207a73aa64a","code_sha256_prefix":"6f18f207a73aa64a","mcp_get_code":{"code_sha256":"6f18f207a73aa64a"}},{"arxiv_id":"1911.02613","arxiv_id_is_arxiv":true,"paper":"/paper/hyper-sagnn-a-self-attention-based-graph-1","title":"Hyper-SAGNN: a self-attention based graph neural network for hypergraphs","date":"2019-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ma-compbio/Hyper-SAGNN","path":"Code/Modules.py","file_url":"https://github.com/ma-compbio/Hyper-SAGNN/blob/HEAD/Code/Modules.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Fuchai/language, and GitHub detected no licence in that repository when it was checked","code_sha256":"e0ba079bc599626f","code_sha256_prefix":"e0ba079bc599626f","mcp_get_code":{"code_sha256":"e0ba079bc599626f"}},{"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":"emanuele-progr/PSSP","path":"transformer.py","file_url":"https://github.com/emanuele-progr/PSSP/blob/HEAD/transformer.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, emanuele-progr/PSSP when it was checked","code_sha256":"aebd1d5fbde8ed54","code_sha256_prefix":"aebd1d5fbde8ed54","mcp_get_code":{"code_sha256":"aebd1d5fbde8ed54"}},{"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":"yueyongjiao/Transformer-Contextual","path":"transformer/Models.py","file_url":"https://github.com/yueyongjiao/Transformer-Contextual/blob/HEAD/transformer/Models.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":"f04747d4c95cdf6b","code_sha256_prefix":"f04747d4c95cdf6b","mcp_get_code":{"code_sha256":"f04747d4c95cdf6b"}},{"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":"text-machine-lab/transformerpy","path":"transformer/Models.py","file_url":"https://github.com/text-machine-lab/transformerpy/blob/HEAD/transformer/Models.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":"2ca24065f182e91c","code_sha256_prefix":"2ca24065f182e91c","mcp_get_code":{"code_sha256":"2ca24065f182e91c"}},{"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":"MohamedAbdelsalam9/TT-Transformer","path":"transformer/Models.py","file_url":"https://github.com/MohamedAbdelsalam9/TT-Transformer/blob/HEAD/transformer/Models.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":"8558e623afb00642","code_sha256_prefix":"8558e623afb00642","mcp_get_code":{"code_sha256":"8558e623afb00642"}},{"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":"Fuchai/language","path":"deeplearning/modeltran.py","file_url":"https://github.com/Fuchai/language/blob/HEAD/deeplearning/modeltran.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, Fuchai/language when it was checked","code_sha256":"e0ba079bc599626f","code_sha256_prefix":"e0ba079bc599626f","mcp_get_code":{"code_sha256":"e0ba079bc599626f"}},{"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":"Matthewdowney18/Transformer_Dialogue","path":"src/transformer/Models.py","file_url":"https://github.com/Matthewdowney18/Transformer_Dialogue/blob/HEAD/src/transformer/Models.py","status":"unverified","verification_level":0,"contract_check":null,"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, Matthewdowney18/Transformer_Dialogue when it was checked","code_sha256":"79e1b19ea0f880a3","code_sha256_prefix":"79e1b19ea0f880a3","mcp_get_code":{"code_sha256":"79e1b19ea0f880a3"}},{"arxiv_id":"1603.08983","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-computation-time-for-recurrent","title":"Adaptive Computation Time for Recurrent Neural Networks","date":"2016-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreamad8/Universal-Transformer-Pytorch","path":"models/UTransformer.py","file_url":"https://github.com/andreamad8/Universal-Transformer-Pytorch/blob/HEAD/models/UTransformer.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, andreamad8/Universal-Transformer-Pytorch when it was checked","code_sha256":"095dea140acd99f6","code_sha256_prefix":"095dea140acd99f6","mcp_get_code":{"code_sha256":"095dea140acd99f6"}},{"arxiv_id":"2023.findings-emnlp.672","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.672","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"guihuzhang/FactSpotter","path":"g2t_gen_code/code/modeling_kgpt.py","file_url":"https://github.com/guihuzhang/FactSpotter/blob/HEAD/g2t_gen_code/code/modeling_kgpt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01d7142796d717bd","code_sha256_prefix":"01d7142796d717bd","mcp_get_code":{"code_sha256":"01d7142796d717bd"}},{"arxiv_id":"2020.emnlp-main.697","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.emnlp-main.697","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wenhuchen/KGPT","path":"code/Model.py","file_url":"https://github.com/wenhuchen/KGPT/blob/HEAD/code/Model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01d7142796d717bd","code_sha256_prefix":"01d7142796d717bd","mcp_get_code":{"code_sha256":"01d7142796d717bd"}}],"record_sha256":"e11bb3567eda08c3b1d33a49a5b5aa92c002eb717d2f1728d7b78f638c55151d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}