{"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/convert-slow-tokenizer","entry":"convert_slow_tokenizer","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":14,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":9,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":0,"ran_fixture":0,"ran":0,"unverified":9},"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":"2409.15647","arxiv_id_is_arxiv":true,"paper":"/paper/looped-transformers-for-length-generalization","title":"Looped Transformers for Length Generalization","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UW-Madison-Lee-Lab/looped-tf","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/UW-Madison-Lee-Lab/looped-tf/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"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, UW-Madison-Lee-Lab/looped-tf when it was checked","code_sha256":"11edc6c69e396f6c","code_sha256_prefix":"11edc6c69e396f6c","mcp_get_code":{"code_sha256":"11edc6c69e396f6c"}},{"arxiv_id":"2407.01320","arxiv_id_is_arxiv":true,"paper":"/paper/increasing-model-capacity-for-free-a-simple","title":"Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LINs-lab/CapaBoost","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/LINs-lab/CapaBoost/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"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":"561495a2688b60b1","code_sha256_prefix":"561495a2688b60b1","mcp_get_code":{"code_sha256":"561495a2688b60b1"}},{"arxiv_id":"2402.14789","arxiv_id_is_arxiv":true,"paper":"/paper/self-guided-masked-autoencoders-for-domain","title":"Self-Guided Masked Autoencoders for Domain-Agnostic Self-Supervised Learning","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johnathan-xie/sma","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/johnathan-xie/sma/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"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":"9d93436a1b858d0e","code_sha256_prefix":"9d93436a1b858d0e","mcp_get_code":{"code_sha256":"9d93436a1b858d0e"}},{"arxiv_id":"2311.06761","arxiv_id_is_arxiv":true,"paper":"/paper/learning-knowledge-enhanced-contextual","title":"Learning Knowledge-Enhanced Contextual Language Representations for Domain Natural Language Understanding","date":"2023-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba/EasyNLP","path":"easynlp/modelzoo/convert_slow_tokenizer.py","file_url":"https://github.com/alibaba/EasyNLP/blob/HEAD/easynlp/modelzoo/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"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":"9339ca51cea1f469","code_sha256_prefix":"9339ca51cea1f469","mcp_get_code":{"code_sha256":"9339ca51cea1f469"}},{"arxiv_id":"2305.10614","arxiv_id_is_arxiv":true,"paper":"/paper/token-wise-decomposition-of-autoregressive","title":"Token-wise Decomposition of Autoregressive Language Model Hidden States for Analyzing Model Predictions","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byungdoh/llm_decomposition","path":"huggingface/src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/byungdoh/llm_decomposition/blob/HEAD/huggingface/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"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":"9d93436a1b858d0e","code_sha256_prefix":"9d93436a1b858d0e","mcp_get_code":{"code_sha256":"9d93436a1b858d0e"}},{"arxiv_id":"2212.11185","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-and-distance-based-predictors-from","title":"Entropy- and Distance-Based Predictors From GPT-2 Attention Patterns Predict Reading Times Over and Above GPT-2 Surprisal","date":"2022-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byungdoh/attn_dist","path":"huggingface/src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/byungdoh/attn_dist/blob/HEAD/huggingface/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"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":"82e5a32c9b2414f3","code_sha256_prefix":"82e5a32c9b2414f3","mcp_get_code":{"code_sha256":"82e5a32c9b2414f3"}},{"arxiv_id":"2212.00921","arxiv_id_is_arxiv":true,"paper":"/paper/agro-adversarial-discovery-of-error-prone","title":"AGRO: Adversarial Discovery of Error-prone groups for Robust Optimization","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bhargaviparanjape/robust-transformers","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/bhargaviparanjape/robust-transformers/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, bhargaviparanjape/robust-transformers, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"303c695a12e16704","code_sha256_prefix":"303c695a12e16704","mcp_get_code":{"code_sha256":"303c695a12e16704"}},{"arxiv_id":"2211.05392","arxiv_id_is_arxiv":true,"paper":"/paper/events-realm-event-reasoning-of-entity-states","title":"EvEntS ReaLM: Event Reasoning of Entity States via Language Models","date":"2022-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spilioeve/eventsrealm","path":"transformers-single-all-attribute-prompt-experiments/src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/spilioeve/eventsrealm/blob/HEAD/transformers-single-all-attribute-prompt-experiments/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from UW-Madison-Lee-Lab/looped-tf, and GitHub detected no licence in that repository when it was checked","code_sha256":"11edc6c69e396f6c","code_sha256_prefix":"11edc6c69e396f6c","mcp_get_code":{"code_sha256":"11edc6c69e396f6c"}},{"arxiv_id":"2202.00666","arxiv_id_is_arxiv":true,"paper":"/paper/typical-decoding-for-natural-language","title":"Locally Typical Sampling","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cimeister/typical-sampling","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/cimeister/typical-sampling/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, cimeister/typical-sampling, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"4e643fa0b277f39b","code_sha256_prefix":"4e643fa0b277f39b","mcp_get_code":{"code_sha256":"4e643fa0b277f39b"}},{"arxiv_id":"2111.05498","arxiv_id_is_arxiv":true,"paper":"/paper/attention-approximates-sparse-distributed","title":"Attention Approximates Sparse Distributed Memory","date":"2021-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trentbrick/attention-approximates-sdm","path":"HugFace/src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/trentbrick/attention-approximates-sdm/blob/HEAD/HugFace/src/transformers/convert_slow_tokenizer.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":"9339ca51cea1f469","code_sha256_prefix":"9339ca51cea1f469","mcp_get_code":{"code_sha256":"9339ca51cea1f469"}},{"arxiv_id":"2111.00160","arxiv_id_is_arxiv":true,"paper":"/paper/dsee-dually-sparsity-embedded-efficient-1","title":"DSEE: Dually Sparsity-embedded Efficient Tuning of Pre-trained Language Models","date":"2021-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/dsee","path":"non-GPT-2/src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/vita-group/dsee/blob/HEAD/non-GPT-2/src/transformers/convert_slow_tokenizer.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":"5513be821f28f6c5","code_sha256_prefix":"5513be821f28f6c5","mcp_get_code":{"code_sha256":"5513be821f28f6c5"}},{"arxiv_id":"2107.00910","arxiv_id_is_arxiv":true,"paper":"/paper/learned-token-pruning-for-transformers","title":"Learned Token Pruning for Transformers","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kssteven418/ltp","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/kssteven418/ltp/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, kssteven418/ltp, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"5de43db1a351fd89","code_sha256_prefix":"5de43db1a351fd89","mcp_get_code":{"code_sha256":"5de43db1a351fd89"}},{"arxiv_id":"2007.07779","arxiv_id_is_arxiv":true,"paper":"/paper/adapterhub-a-framework-for-adapting","title":"AdapterHub: A Framework for Adapting Transformers","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mklimasz/language-arithmetic","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/mklimasz/language-arithmetic/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, mklimasz/language-arithmetic, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"9d93436a1b858d0e","code_sha256_prefix":"9d93436a1b858d0e","mcp_get_code":{"code_sha256":"9d93436a1b858d0e"}},{"arxiv_id":"2022.naacl-main.130","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.naacl-main.130","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"parovicm/BADX","path":"src/transformers/convert_slow_tokenizer.py","file_url":"https://github.com/parovicm/BADX/blob/HEAD/src/transformers/convert_slow_tokenizer.py","status":"unverified","verification_level":0,"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":"9339ca51cea1f469","code_sha256_prefix":"9339ca51cea1f469","mcp_get_code":{"code_sha256":"9339ca51cea1f469"}}],"record_sha256":"4ca3fe17cbf56b557a4ec0d080cd8eb216cdeadba3a705222d13b96d0b75c71e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}