{"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/init-to-zero","entry":"init_to_zero","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":17,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":17,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":15,"n_places_pointer_only_link_open":8,"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":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":"2605.15422","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15422","title":"DualKV: Shared-Prompt Flash Attention for Efficient RL Training with Large Rollouts and Long Contexts","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"amazon-science/dualkv-flash-attn-for-rl","path":"flash-attention/flash_attn/flash_attn_triton.py","file_url":"https://github.com/amazon-science/dualkv-flash-attn-for-rl/blob/HEAD/flash-attention/flash_attn/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, amazon-science/dualkv-flash-attn-for-rl (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2604.23798","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23798","title":"ELSA: Exact Linear-Scan Attention for Fast and Memory-Light Vision Transformers","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Dao-AILab/flash-attention","path":"flash_attn/flash_attn_triton.py","file_url":"https://github.com/Dao-AILab/flash-attention/blob/HEAD/flash_attn/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2604.07658","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-07658","title":"Optimal Decay Spectra for Linear Recurrences","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"SiLifen/PoST","path":"post_kernels/ssd_chunk_state.py","file_url":"https://github.com/SiLifen/PoST/blob/HEAD/post_kernels/ssd_chunk_state.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7a500c0f491fa7a","code_sha256_prefix":"f7a500c0f491fa7a","mcp_get_code":{"code_sha256":"f7a500c0f491fa7a"}},{"arxiv_id":"2601.06891","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06891","title":"Contrastive Language-Image Mamba Pretraining","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"NimrodShabtay/CLIMP","path":"models/vmamba/mamba2/ssd_bmm.py","file_url":"https://github.com/NimrodShabtay/CLIMP/blob/HEAD/models/vmamba/mamba2/ssd_bmm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, NimrodShabtay/CLIMP when it was checked","code_sha256":"f7a500c0f491fa7a","code_sha256_prefix":"f7a500c0f491fa7a","mcp_get_code":{"code_sha256":"f7a500c0f491fa7a"}},{"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/flash_attn_triton.py","file_url":"https://github.com/MAGICS-LAB/GERM/blob/HEAD/DNABERT2/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2503.14493","arxiv_id_is_arxiv":true,"paper":"/paper/state-space-model-meets-transformer-a-new-1","title":"State Space Model Meets Transformer: A New Paradigm for 3D Object Detection","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenSpaceAI/DEST3D","path":"issm_triton/issm_chunk_scan.py","file_url":"https://github.com/OpenSpaceAI/DEST3D/blob/HEAD/issm_triton/issm_chunk_scan.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f7a500c0f491fa7a","code_sha256_prefix":"f7a500c0f491fa7a","mcp_get_code":{"code_sha256":"f7a500c0f491fa7a"}},{"arxiv_id":"2411.12537","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-state-tracking-in-linear-rnns","title":"Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/unlocking_state_tracking","path":"mamba_dev/mamba_ssm/ops/triton/ssd_chunk_state.py","file_url":"https://github.com/automl/unlocking_state_tracking/blob/HEAD/mamba_dev/mamba_ssm/ops/triton/ssd_chunk_state.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, automl/unlocking_state_tracking when it was checked","code_sha256":"f7a500c0f491fa7a","code_sha256_prefix":"f7a500c0f491fa7a","mcp_get_code":{"code_sha256":"f7a500c0f491fa7a"}},{"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/flash_attn_triton.py","file_url":"https://github.com/goombalab/hydra/blob/HEAD/hydra/bert/src/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2407.08608","arxiv_id_is_arxiv":true,"paper":"/paper/flashattention-3-fast-and-accurate-attention","title":"FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision","date":"2024-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dao-ailab/flash-attention","path":"flash_attn/flash_attn_triton.py","file_url":"https://github.com/dao-ailab/flash-attention/blob/HEAD/flash_attn/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2407.05483","arxiv_id_is_arxiv":true,"paper":"/paper/just-read-twice-closing-the-recall-gap-for","title":"Just read twice: closing the recall gap for recurrent language models","date":"2024-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/prefix-linear-attention","path":"based/ops/triton/linear.py","file_url":"https://github.com/HazyResearch/prefix-linear-attention/blob/HEAD/based/ops/triton/linear.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, HazyResearch/prefix-linear-attention when it was checked","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2402.18376","arxiv_id_is_arxiv":true,"paper":"/paper/tokenization-is-more-than-compression","title":"Tokenization Is More Than Compression","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kensho-technologies/timtc_vocabs_models","path":"models/1.3b/bpe_merge_3_40960/flash_attn_triton.py","file_url":"https://github.com/kensho-technologies/timtc_vocabs_models/blob/HEAD/models/1.3b/bpe_merge_3_40960/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, kensho-technologies/timtc_vocabs_models when it was checked","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2402.13561","arxiv_id_is_arxiv":true,"paper":"/paper/cognitive-visual-language-mapper-advancing","title":"Cognitive Visual-Language Mapper: Advancing Multimodal Comprehension with Enhanced Visual Knowledge Alignment","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hitsz-tmg/cognitive-visual-language-mapper","path":"LLaVA/llava/model/language_model/mpt/flash_attn_triton.py","file_url":"https://github.com/hitsz-tmg/cognitive-visual-language-mapper/blob/HEAD/LLaVA/llava/model/language_model/mpt/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, hitsz-tmg/cognitive-visual-language-mapper when it was checked","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"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/flash_attn_triton.py","file_url":"https://github.com/magics-lab/dnabert_s/blob/HEAD/evaluate/model_codes/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2312.15685","arxiv_id_is_arxiv":true,"paper":"/paper/what-makes-good-data-for-alignment-a","title":"What Makes Good Data for Alignment? A Comprehensive Study of Automatic Data Selection in Instruction Tuning","date":"2023-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-nlp/deita","path":"src/deita/alignment/flash_attn/triton_flash_attention.py","file_url":"https://github.com/hkust-nlp/deita/blob/HEAD/src/deita/alignment/flash_attn/triton_flash_attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2310.05869","arxiv_id_is_arxiv":true,"paper":"/paper/hyperattention-long-context-attention-in-near","title":"HyperAttention: Long-context Attention in Near-Linear Time","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amirzandieh/HyperAttention","path":"src/flash_attn_triton.py","file_url":"https://github.com/amirzandieh/HyperAttention/blob/HEAD/src/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2309.06180","arxiv_id_is_arxiv":true,"paper":"/paper/2309-06180","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ROCm/flash-attention","path":"flash_attn/flash_attn_triton.py","file_url":"https://github.com/ROCm/flash-attention/blob/HEAD/flash_attn/flash_attn_triton.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}},{"arxiv_id":"2304.11277","arxiv_id_is_arxiv":true,"paper":"/paper/pytorch-fsdp-experiences-on-scaling-fully","title":"PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallel","date":"2023-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch-labs/applied-ai","path":"kernels/needs_perf_help/fp8_rowwise_tma_persistent.py","file_url":"https://github.com/pytorch-labs/applied-ai/blob/HEAD/kernels/needs_perf_help/fp8_rowwise_tma_persistent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 amazon-science/dualkv-flash-attn-for-rl, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"1586b639a5abd0b0","code_sha256_prefix":"1586b639a5abd0b0","mcp_get_code":{"code_sha256":"1586b639a5abd0b0"}}],"record_sha256":"224ec3af618a1df593e2dc2ae22e99a8a36f0a9038b2376a2e3f039c25ee29c6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}