{"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/unpad-input-only","entry":"unpad_input_only","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":7,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":3,"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":4,"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":"2601.05776","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05776","title":"One Script Instead of Hundreds? On Pretraining Romanized Encoder Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"AnswerDotAI/ModernBERT","path":"src/bert_padding.py","file_url":"https://github.com/AnswerDotAI/ModernBERT/blob/HEAD/src/bert_padding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7df9e4a71a03583","code_sha256_prefix":"e7df9e4a71a03583","mcp_get_code":{"code_sha256":"e7df9e4a71a03583"}},{"arxiv_id":"2505.00598","arxiv_id_is_arxiv":true,"paper":"/paper/fast-and-low-cost-genomic-foundation-models","title":"Fast and Low-Cost Genomic Foundation Models via Outlier Removal","date":"2025-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MAGICS-LAB/GERM","path":"DNABERT2/bert_padding.py","file_url":"https://github.com/MAGICS-LAB/GERM/blob/HEAD/DNABERT2/bert_padding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 magics-lab/dnabert_s, and GitHub detected no licence in that repository when it was checked","code_sha256":"a41fa8c40b551ec1","code_sha256_prefix":"a41fa8c40b551ec1","mcp_get_code":{"code_sha256":"a41fa8c40b551ec1"}},{"arxiv_id":"2407.09941","arxiv_id_is_arxiv":true,"paper":"/paper/hydra-bidirectional-state-space-models","title":"Hydra: Bidirectional State Space Models Through Generalized Matrix Mixers","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goombalab/hydra","path":"hydra/bert/src/bert_padding.py","file_url":"https://github.com/goombalab/hydra/blob/HEAD/hydra/bert/src/bert_padding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7df9e4a71a03583","code_sha256_prefix":"e7df9e4a71a03583","mcp_get_code":{"code_sha256":"e7df9e4a71a03583"}},{"arxiv_id":"2402.08777","arxiv_id_is_arxiv":true,"paper":"/paper/dnabert-s-learning-species-aware-dna","title":"DNABERT-S: Pioneering Species Differentiation with Species-Aware DNA Embeddings","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magics-lab/dnabert_s","path":"evaluate/model_codes/bert_padding.py","file_url":"https://github.com/magics-lab/dnabert_s/blob/HEAD/evaluate/model_codes/bert_padding.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, magics-lab/dnabert_s when it was checked","code_sha256":"a41fa8c40b551ec1","code_sha256_prefix":"a41fa8c40b551ec1","mcp_get_code":{"code_sha256":"a41fa8c40b551ec1"}},{"arxiv_id":"2311.12570","arxiv_id_is_arxiv":true,"paper":"/paper/bend-benchmarking-dna-language-models-on","title":"BEND: Benchmarking DNA Language Models on biologically meaningful tasks","date":"2023-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frederikkemarin/BEND","path":"bend/models/dnabert2_padding.py","file_url":"https://github.com/frederikkemarin/BEND/blob/HEAD/bend/models/dnabert2_padding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from magics-lab/dnabert_s, and GitHub detected no licence in that repository when it was checked","code_sha256":"a41fa8c40b551ec1","code_sha256_prefix":"a41fa8c40b551ec1","mcp_get_code":{"code_sha256":"a41fa8c40b551ec1"}},{"arxiv_id":"2306.15006","arxiv_id_is_arxiv":true,"paper":"/paper/dnabert-2-efficient-foundation-model-and","title":"DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frederikkemarin/bend","path":"bend/utils/embedders.py","file_url":"https://github.com/frederikkemarin/bend/blob/HEAD/bend/utils/embedders.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c99ec96528c0f00","code_sha256_prefix":"9c99ec96528c0f00","mcp_get_code":{"code_sha256":"9c99ec96528c0f00"}},{"arxiv_id":"2108.12409","arxiv_id_is_arxiv":true,"paper":"/paper/train-short-test-long-attention-with-linear","title":"Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation","date":"2021-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"answerdotai/modernbert","path":"src/bert_layers/attention.py","file_url":"https://github.com/answerdotai/modernbert/blob/HEAD/src/bert_layers/attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e534e11984c06b5","code_sha256_prefix":"4e534e11984c06b5","mcp_get_code":{"code_sha256":"4e534e11984c06b5"}}],"record_sha256":"74000c04be3b28031e834856094091f3d5bc60e3bcfd531929ff1ba53cdd4514","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}