{"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/eval-decorator","entry":"eval_decorator","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":15,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":3,"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":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"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":"2406.18051","arxiv_id_is_arxiv":true,"paper":"/paper/vit-1-58b-mobile-vision-transformers-in-the-1","title":"ViT-1.58b: Mobile Vision Transformers in the 1-bit Era","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlyuangod/vit-1.58b","path":"BitNet/bitnet/at.py","file_url":"https://github.com/dlyuangod/vit-1.58b/blob/HEAD/BitNet/bitnet/at.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, dlyuangod/vit-1.58b when it was checked","code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2406.07368","arxiv_id_is_arxiv":true,"paper":"/paper/when-linear-attention-meets-autoregressive","title":"When Linear Attention Meets Autoregressive Decoding: Towards More Effective and Efficient Linearized Large Language Models","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gatech-eic/linearized-llm","path":"autoregressive_wrapper.py","file_url":"https://github.com/gatech-eic/linearized-llm/blob/HEAD/autoregressive_wrapper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2107ce5c9a769398","code_sha256_prefix":"2107ce5c9a769398","mcp_get_code":{"code_sha256":"2107ce5c9a769398"}},{"arxiv_id":"2403.04822","arxiv_id_is_arxiv":true,"paper":"/paper/unitable-towards-a-unified-framework-for","title":"UniTable: Towards a Unified Framework for Table Recognition via Self-Supervised Pretraining","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"poloclub/unitable","path":"src/model/vqvae.py","file_url":"https://github.com/poloclub/unitable/blob/HEAD/src/model/vqvae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2402.17532","arxiv_id_is_arxiv":true,"paper":"/paper/retrieval-is-accurate-generation","title":"Retrieval is Accurate Generation","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/retro-pytorch","path":"retro_pytorch/training.py","file_url":"https://github.com/lucidrains/retro-pytorch/blob/HEAD/retro_pytorch/training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2310.02980","arxiv_id_is_arxiv":true,"paper":"/paper/never-train-from-scratch-fair-comparison-of","title":"Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priors","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idoamos/not-from-scratch","path":"local_attention/transformer.py","file_url":"https://github.com/idoamos/not-from-scratch/blob/HEAD/local_attention/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2306.08276","arxiv_id_is_arxiv":true,"paper":"/paper/tryondiffusion-a-tale-of-two-unets-1","title":"TryOnDiffusion: A Tale of Two UNets","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fashn-AI/tryondiffusion","path":"tryondiffusion/common/torch_helpers.py","file_url":"https://github.com/fashn-AI/tryondiffusion/blob/HEAD/tryondiffusion/common/torch_helpers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2305.18565","arxiv_id_is_arxiv":true,"paper":"/paper/pali-x-on-scaling-up-a-multilingual-vision","title":"PaLI-X: On Scaling up a Multilingual Vision and Language Model","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyegomez/PALI","path":"pali/autoregressive_wrapper.py","file_url":"https://github.com/kyegomez/PALI/blob/HEAD/pali/autoregressive_wrapper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5444a7d75d38878d","code_sha256_prefix":"5444a7d75d38878d","mcp_get_code":{"code_sha256":"5444a7d75d38878d"}},{"arxiv_id":"2305.02541","arxiv_id_is_arxiv":true,"paper":"/paper/catch-missing-details-image-reconstruction","title":"Catch Missing Details: Image Reconstruction with Frequency Augmented Variational Autoencoder","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oppo-us-research/FA-VAE","path":"models/gpt_ca.py","file_url":"https://github.com/oppo-us-research/FA-VAE/blob/HEAD/models/gpt_ca.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2301.00704","arxiv_id_is_arxiv":true,"paper":"/paper/muse-text-to-image-generation-via-masked","title":"Muse: Text-To-Image Generation via Masked Generative Transformers","date":"2023-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/muse-pytorch","path":"muse_maskgit_pytorch/muse_maskgit_pytorch.py","file_url":"https://github.com/lucidrains/muse-pytorch/blob/HEAD/muse_maskgit_pytorch/muse_maskgit_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2207.06881","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-memory-transformer","title":"Recurrent Memory Transformer","date":"2022-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/recurrent-memory-transformer-pytorch","path":"recurrent_memory_transformer_pytorch/recurrent_memory_transformer.py","file_url":"https://github.com/lucidrains/recurrent-memory-transformer-pytorch/blob/HEAD/recurrent_memory_transformer_pytorch/recurrent_memory_transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5444a7d75d38878d","code_sha256_prefix":"5444a7d75d38878d","mcp_get_code":{"code_sha256":"5444a7d75d38878d"}},{"arxiv_id":"2206.10789","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-autoregressive-models-for-content","title":"Scaling Autoregressive Models for Content-Rich Text-to-Image Generation","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2203.07852","arxiv_id_is_arxiv":true,"paper":"/paper/block-recurrent-transformers","title":"Block-Recurrent Transformers","date":"2022-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"5444a7d75d38878d","code_sha256_prefix":"5444a7d75d38878d","mcp_get_code":{"code_sha256":"5444a7d75d38878d"}},{"arxiv_id":"2112.05682","arxiv_id_is_arxiv":true,"paper":"/paper/self-attention-does-not-need-o-n-2-memory","title":"Self-attention Does Not Need $O(n^2)$ Memory","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/memory-efficient-attention-pytorch","path":"memory_efficient_attention_pytorch/autoregressive_wrapper.py","file_url":"https://github.com/lucidrains/memory-efficient-attention-pytorch/blob/HEAD/memory_efficient_attention_pytorch/autoregressive_wrapper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"2107.11906","arxiv_id_is_arxiv":true,"paper":"/paper/h-transformer-1d-fast-one-dimensional","title":"H-Transformer-1D: Fast One-Dimensional Hierarchical Attention for Sequences","date":"2021-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/h-transformer-1d","path":"h_transformer_1d/autoregressive_wrapper.py","file_url":"https://github.com/lucidrains/h-transformer-1d/blob/HEAD/h_transformer_1d/autoregressive_wrapper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}},{"arxiv_id":"1907.05242","arxiv_id_is_arxiv":true,"paper":"/paper/large-memory-layers-with-product-keys","title":"Large Memory Layers with Product Keys","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/product-key-memory","path":"product_key_memory/transformer.py","file_url":"https://github.com/lucidrains/product-key-memory/blob/HEAD/product_key_memory/transformer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c16aee9490eb8729","code_sha256_prefix":"c16aee9490eb8729","mcp_get_code":{"code_sha256":"c16aee9490eb8729"}}],"record_sha256":"f1c773287be67ffcc3d63b4b6687b91e58f017b7e57bbf00452091df22c64b84","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}