{"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/create-padding-mask","entry":"create_padding_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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":10,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":0,"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":2,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":6,"unverified":0},"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":"2608.10288","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10288","title":"Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"burcgokden/lm-evaluation-harness-with-PLDR-LLM","path":"lm_eval/models/pldrllm.py","file_url":"https://github.com/burcgokden/lm-evaluation-harness-with-PLDR-LLM/blob/HEAD/lm_eval/models/pldrllm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d15ced8abf730e0f","code_sha256_prefix":"d15ced8abf730e0f","mcp_get_code":{"code_sha256":"d15ced8abf730e0f"}},{"arxiv_id":"2306.05143","arxiv_id_is_arxiv":true,"paper":"/paper/genomic-interpreter-a-hierarchical-genomic","title":"Genomic Interpreter: A Hierarchical Genomic Deep Neural Network with 1D Shifted Window Transformer","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehui127/1d-swin","path":"swin1d/module/one_dimensional_swin.py","file_url":"https://github.com/zehui127/1d-swin/blob/HEAD/swin1d/module/one_dimensional_swin.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c5de323df2b4798","code_sha256_prefix":"2c5de323df2b4798","mcp_get_code":{"code_sha256":"2c5de323df2b4798"}},{"arxiv_id":"2205.13571","arxiv_id_is_arxiv":true,"paper":"/paper/low-rank-lottery-tickets-finding-efficient","title":"Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equations","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scsteffen/dlrt-net","path":"src/networks/transformer_dlrt.py","file_url":"https://github.com/scsteffen/dlrt-net/blob/HEAD/src/networks/transformer_dlrt.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":"b96fc548499f7aef","code_sha256_prefix":"b96fc548499f7aef","mcp_get_code":{"code_sha256":"b96fc548499f7aef"}},{"arxiv_id":"2203.13573","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-temporal","title":"Unsupervised Learning of Temporal Abstractions with Slot-based Transformers","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agopal42/slottar","path":"slottar_modules.py","file_url":"https://github.com/agopal42/slottar/blob/HEAD/slottar_modules.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":"a40c36a3801e0a48","code_sha256_prefix":"a40c36a3801e0a48","mcp_get_code":{"code_sha256":"a40c36a3801e0a48"}},{"arxiv_id":"2110.10054","arxiv_id_is_arxiv":true,"paper":"/paper/generating-symbolic-reasoning-problems-with-1","title":"Generating Symbolic Reasoning Problems with Transformer GANs","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/TGAN-SR","path":"impl/tgan_sr/transformer/common.py","file_url":"https://github.com/reactive-systems/TGAN-SR/blob/HEAD/impl/tgan_sr/transformer/common.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":"23d0a4ea8b244957","code_sha256_prefix":"23d0a4ea8b244957","mcp_get_code":{"code_sha256":"23d0a4ea8b244957"}},{"arxiv_id":"2003.04218","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reactive-systems/deepltl","path":"deepltl/models/transformer.py","file_url":"https://github.com/reactive-systems/deepltl/blob/HEAD/deepltl/models/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09cfa39c1a945b25","code_sha256_prefix":"09cfa39c1a945b25","mcp_get_code":{"code_sha256":"09cfa39c1a945b25"}},{"arxiv_id":"2003.04218","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-temporal-logics-to-neural-networks","title":"Teaching Temporal Logics to Neural Networks","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"necrashter/deepltl-pytorch","path":"deepltl/models/transformer.py","file_url":"https://github.com/necrashter/deepltl-pytorch/blob/HEAD/deepltl/models/transformer.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":"f1c292f469811841","code_sha256_prefix":"f1c292f469811841","mcp_get_code":{"code_sha256":"f1c292f469811841"}},{"arxiv_id":"2002.04745","arxiv_id_is_arxiv":true,"paper":"/paper/on-layer-normalization-in-the-transformer-1","title":"On Layer Normalization in the Transformer Architecture","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"colorfulscoop/tfdlg","path":"tfdlg/models.py","file_url":"https://github.com/colorfulscoop/tfdlg/blob/HEAD/tfdlg/models.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":"fd2b714b8c2af39e","code_sha256_prefix":"fd2b714b8c2af39e","mcp_get_code":{"code_sha256":"fd2b714b8c2af39e"}},{"arxiv_id":"1910.02562","arxiv_id_is_arxiv":true,"paper":"/paper/master-multi-aspect-non-local-network-for","title":"MASTER: Multi-Aspect Non-local Network for Scene Text Recognition","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangxiluning/MASTER-TF","path":"src/model/transformer_tf.py","file_url":"https://github.com/jiangxiluning/MASTER-TF/blob/HEAD/src/model/transformer_tf.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":"436719c2595f1c54","code_sha256_prefix":"436719c2595f1c54","mcp_get_code":{"code_sha256":"436719c2595f1c54"}},{"arxiv_id":"1905.09904","arxiv_id_is_arxiv":true,"paper":"/paper/cdsa-cross-dimensional-self-attention-for","title":"CDSA: Cross-Dimensional Self-Attention for Multivariate, Geo-tagged Time Series Imputation","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gabriel-Macias/cdsa_imputation","path":"models.py","file_url":"https://github.com/Gabriel-Macias/cdsa_imputation/blob/HEAD/models.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":"436719c2595f1c54","code_sha256_prefix":"436719c2595f1c54","mcp_get_code":{"code_sha256":"436719c2595f1c54"}},{"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":"reactive-systems/circuit-repair","path":"ml2/models/transformer.py","file_url":"https://github.com/reactive-systems/circuit-repair/blob/HEAD/ml2/models/transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09cfa39c1a945b25","code_sha256_prefix":"09cfa39c1a945b25","mcp_get_code":{"code_sha256":"09cfa39c1a945b25"}},{"arxiv_id":"1502.03044","arxiv_id_is_arxiv":true,"paper":"/paper/show-attend-and-tell-neural-image-caption","title":"Show, Attend and Tell: Neural Image Caption Generation with Visual Attention","date":"2015-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"krasserm/fairseq-image-captioning","path":"model/caption.py","file_url":"https://github.com/krasserm/fairseq-image-captioning/blob/HEAD/model/caption.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f93be7ac25d7dac1","code_sha256_prefix":"f93be7ac25d7dac1","mcp_get_code":{"code_sha256":"f93be7ac25d7dac1"}}],"record_sha256":"e5e23ed12ff3e2b0152475a5ee8dc4a4598aec34f34f8bedf9938d68b8eb5309","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}