{"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/attention-mask-func","entry":"attention_mask_func","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":8,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":6,"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":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":2,"ran_fixture":0,"ran":1,"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":"2411.04168","arxiv_id_is_arxiv":true,"paper":"/paper/dimsum-diffusion-mamba-a-scalable-and-unified","title":"DiMSUM: Diffusion Mamba -- A Scalable and Unified Spatial-Frequency Method for Image Generation","date":"2024-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinairesearch/dimsum","path":"dimsum/bias_gelu.py","file_url":"https://github.com/vinairesearch/dimsum/blob/HEAD/dimsum/bias_gelu.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d3b0933503154c4d","code_sha256_prefix":"d3b0933503154c4d","mcp_get_code":{"code_sha256":"d3b0933503154c4d"}},{"arxiv_id":"2410.11289","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-optimization-for-large-language","title":"Subspace Optimization for Large Language Models with Convergence Guarantees","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pkumelon/Golore","path":"peft_pretraining/modeling_pythia.py","file_url":"https://github.com/pkumelon/Golore/blob/HEAD/peft_pretraining/modeling_pythia.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, pkumelon/Golore, is not in the permissive set Syntology serves inline","code_sha256":"4397f33726a2999e","code_sha256_prefix":"4397f33726a2999e","mcp_get_code":{"code_sha256":"4397f33726a2999e"}},{"arxiv_id":"2409.01193","arxiv_id_is_arxiv":true,"paper":"/paper/clibe-detecting-dynamic-backdoors-in","title":"CLIBE: Detecting Dynamic Backdoors in Transformer-based NLP Models","date":"2024-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raytsang123/clibe","path":"generative_backdoors/detection/modeling_gpt_neox.py","file_url":"https://github.com/raytsang123/clibe/blob/HEAD/generative_backdoors/detection/modeling_gpt_neox.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from pkumelon/Golore, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"4397f33726a2999e","code_sha256_prefix":"4397f33726a2999e","mcp_get_code":{"code_sha256":"4397f33726a2999e"}},{"arxiv_id":"2403.19928","arxiv_id_is_arxiv":true,"paper":"/paper/dijiang-efficient-large-language-models","title":"DiJiang: Efficient Large Language Models through Compact Kernelization","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuchuantian/dijiang","path":"modeling/pythia-160M-dijiang/modeling_gpt_neox_dijiang.py","file_url":"https://github.com/yuchuantian/dijiang/blob/HEAD/modeling/pythia-160M-dijiang/modeling_gpt_neox_dijiang.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, yuchuantian/dijiang when it was checked","code_sha256":"4397f33726a2999e","code_sha256_prefix":"4397f33726a2999e","mcp_get_code":{"code_sha256":"4397f33726a2999e"}},{"arxiv_id":"2311.13230","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-uncertainty-based-hallucination","title":"Enhancing Uncertainty-Based Hallucination Detection with Stronger Focus","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zthang/focus","path":"models/modeling_gpt_neox.py","file_url":"https://github.com/zthang/focus/blob/HEAD/models/modeling_gpt_neox.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, zthang/focus when it was checked","code_sha256":"4397f33726a2999e","code_sha256_prefix":"4397f33726a2999e","mcp_get_code":{"code_sha256":"4397f33726a2999e"}},{"arxiv_id":"2307.05695","arxiv_id_is_arxiv":true,"paper":"/paper/stack-more-layers-differently-high-rank","title":"ReLoRA: High-Rank Training Through Low-Rank Updates","date":"2023-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guitaricet/peft_pretraining","path":"peft_pretraining/modeling_pythia.py","file_url":"https://github.com/guitaricet/peft_pretraining/blob/HEAD/peft_pretraining/modeling_pythia.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from pkumelon/Golore, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"4397f33726a2999e","code_sha256_prefix":"4397f33726a2999e","mcp_get_code":{"code_sha256":"4397f33726a2999e"}},{"arxiv_id":"2203.01670","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-hash-based-early-exiting-approach-1","title":"A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"txsun1997/hashee","path":"models/modeling_elasticbert_approx_hashee.py","file_url":"https://github.com/txsun1997/hashee/blob/HEAD/models/modeling_elasticbert_approx_hashee.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce106170b591f393","code_sha256_prefix":"ce106170b591f393","mcp_get_code":{"code_sha256":"ce106170b591f393"}},{"arxiv_id":"aaai_33874","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_33874","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"txsun1997/Black-Box-Tuning","path":"models/deep_modeling_cpt.py","file_url":"https://github.com/txsun1997/Black-Box-Tuning/blob/HEAD/models/deep_modeling_cpt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ce106170b591f393","code_sha256_prefix":"ce106170b591f393","mcp_get_code":{"code_sha256":"ce106170b591f393"}}],"record_sha256":"d1681a9a5cce1cbff024690fb4f7f951f3cd88ac3b12e330c7c0c999cc2db7a0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}