{"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-mask","entry":"get_attn_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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":5,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"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":1,"ran_violates":2,"ran_draft_wrong":1,"ran_fixture":1,"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":"2608.19735","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-19735","title":"RecPFN: Prior-Fitted Networks for In-Context-Based Recommendations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"SAP-samples/tabular-ai-recpfn","path":"src/architecture/recpfn.py","file_url":"https://github.com/SAP-samples/tabular-ai-recpfn/blob/HEAD/src/architecture/recpfn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9244bdcd6bb60758","code_sha256_prefix":"9244bdcd6bb60758","mcp_get_code":{"code_sha256":"9244bdcd6bb60758"}},{"arxiv_id":"2505.23878","arxiv_id_is_arxiv":true,"paper":"/paper/actor-critic-based-online-data-mixing-for","title":"Actor-Critic based Online Data Mixing For Language Model Pre-Training","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DANG-ai/AC-ODM","path":"megatron/training.py","file_url":"https://github.com/DANG-ai/AC-ODM/blob/HEAD/megatron/training.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d07354138fd6bf68","code_sha256_prefix":"d07354138fd6bf68","mcp_get_code":{"code_sha256":"d07354138fd6bf68"}},{"arxiv_id":"2303.13817","arxiv_id_is_arxiv":true,"paper":"/paper/able-nerf-attention-based-rendering-with","title":"ABLE-NeRF: Attention-Based Rendering with Learnable Embeddings for Neural Radiance Field","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TangZJ/able-nerf","path":"models/able_nerf.py","file_url":"https://github.com/TangZJ/able-nerf/blob/HEAD/models/able_nerf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, TangZJ/able-nerf when it was checked","code_sha256":"3c45ff0195307234","code_sha256_prefix":"3c45ff0195307234","mcp_get_code":{"code_sha256":"3c45ff0195307234"}},{"arxiv_id":"2109.07812","arxiv_id_is_arxiv":true,"paper":"/paper/transductive-learning-for-unsupervised-text","title":"Transductive Learning for Unsupervised Text Style Transfer","date":"2021-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaofei05/tsst","path":"model/TSST.py","file_url":"https://github.com/xiaofei05/tsst/blob/HEAD/model/TSST.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5fe0d00c1b5657fd","code_sha256_prefix":"5fe0d00c1b5657fd","mcp_get_code":{"code_sha256":"5fe0d00c1b5657fd"}},{"arxiv_id":"2102.07074","arxiv_id_is_arxiv":true,"paper":"/paper/transgan-two-transformers-can-make-one-strong","title":"TransGAN: Two Pure Transformers Can Make One Strong GAN, and That Can Scale Up","date":"2021-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hungtrankhanh/CS5260_project","path":"models/TransGAN_8_8_1.py","file_url":"https://github.com/hungtrankhanh/CS5260_project/blob/HEAD/models/TransGAN_8_8_1.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, hungtrankhanh/CS5260_project (NOASSERTION)","code_sha256":"6b6b6f726f8ac029","code_sha256_prefix":"6b6b6f726f8ac029","mcp_get_code":{"code_sha256":"6b6b6f726f8ac029"}},{"arxiv_id":"2007.08095","arxiv_id_is_arxiv":true,"paper":"/paper/synthesize-execute-and-debug-learning-to","title":"Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesis","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunblaze-ucb/SED","path":"program_synthesis/models/base.py","file_url":"https://github.com/sunblaze-ucb/SED/blob/HEAD/program_synthesis/models/base.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":"a09108fab4b8d1b4","code_sha256_prefix":"a09108fab4b8d1b4","mcp_get_code":{"code_sha256":"a09108fab4b8d1b4"}},{"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":"haydlite/sparse-bert-ner","path":"bert_sparse/attention.py","file_url":"https://github.com/haydlite/sparse-bert-ner/blob/HEAD/bert_sparse/attention.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b87767b29ecb8027","code_sha256_prefix":"b87767b29ecb8027","mcp_get_code":{"code_sha256":"b87767b29ecb8027"}},{"arxiv_id":"1807.03168","arxiv_id_is_arxiv":true,"paper":"/paper/naps-natural-program-synthesis-dataset","title":"NAPS: Natural Program Synthesis Dataset","date":"2018-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nearai/program_synthesis","path":"program_synthesis/algolisp/models/base.py","file_url":"https://github.com/nearai/program_synthesis/blob/HEAD/program_synthesis/algolisp/models/base.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":"3069133773737990","code_sha256_prefix":"3069133773737990","mcp_get_code":{"code_sha256":"3069133773737990"}}],"record_sha256":"19e5dc43e2ca4b25f5975c26b789db98edf9c4da404b6928d313ab984c596712","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}