{"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/generate-causal-mask","entry":"generate_causal_mask","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":6,"n_papers_ran":4,"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":6,"n_samples_ran":4,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2506.17124","paper":null,"title":"arXiv:2506.17124","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"prediction-action-lab/thinking-as-control","path":"policies.py","file_url":"https://github.com/prediction-action-lab/thinking-as-control/blob/HEAD/policies.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"53944b852a452174","mcp_get_code":{"code_sha256":"53944b852a452174"}},{"arxiv_id":"2410.05711","paper":"/paper/diffusion-auto-regressive-transformer-for","title":"Diffusion Auto-regressive Transformer for Effective Self-supervised Time Series Forecasting","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"melmaphother/timedart","path":"models/TimeDART.py","file_url":"https://github.com/melmaphother/timedart/blob/HEAD/models/TimeDART.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"262630fa4aa5f0ac","mcp_get_code":{"code_sha256":"262630fa4aa5f0ac"}},{"arxiv_id":"2402.10450","paper":"/paper/prise-learning-temporal-action-abstractions","title":"PRISE: LLM-Style Sequence Compression for Learning Temporal Action Abstractions in Control","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frankzheng2022/prise","path":"utils/misc.py","file_url":"https://github.com/frankzheng2022/prise/blob/HEAD/utils/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9aa9525da5b3abc","mcp_get_code":{"code_sha256":"a9aa9525da5b3abc"}},{"arxiv_id":"2310.07096","paper":"/paper/sparse-universal-transformer","title":"Sparse Universal Transformer","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willGuimont/transformers","path":"nnet/transformers.py","file_url":"https://github.com/willGuimont/transformers/blob/HEAD/nnet/transformers.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2b689c925fabd814","mcp_get_code":{"code_sha256":"2b689c925fabd814"}},{"arxiv_id":"2308.04352","paper":"/paper/3d-vista-pre-trained-transformer-for-3d","title":"3D-VisTA: Pre-trained Transformer for 3D Vision and Text Alignment","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"3d-vista/3D-VisTA","path":"model/vision/unified_encoder.py","file_url":"https://github.com/3d-vista/3D-VisTA/blob/HEAD/model/vision/unified_encoder.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef7878a2c111e5e2","mcp_get_code":{"code_sha256":"ef7878a2c111e5e2"}},{"arxiv_id":"2209.08212","paper":"/paper/compose-embellish-well-structured-piano","title":"Compose & Embellish: Well-Structured Piano Performance Generation via A Two-Stage Approach","date":"2022-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slseanwu/compose_and_embellish","path":"stage01_compose/model/transformer_helpers.py","file_url":"https://github.com/slseanwu/compose_and_embellish/blob/HEAD/stage01_compose/model/transformer_helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af1231b854ffe10c","mcp_get_code":{"code_sha256":"af1231b854ffe10c"}}]}