{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/maybe-contiguous","entry":"maybe_contiguous","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":5,"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":2,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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","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_interface.py","file_url":"https://github.com/amazon-science/dualkv-flash-attn-for-rl/blob/HEAD/flash-attention/flash_attn/flash_attn_interface.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}},{"arxiv_id":"2604.23798","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_interface.py","file_url":"https://github.com/Dao-AILab/flash-attention/blob/HEAD/flash_attn/flash_attn_interface.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}},{"arxiv_id":"2506.00385","paper":"/paper/magicodec-simple-masked-gaussian-injected","title":"MagiCodec: Simple Masked Gaussian-Injected Codec for High-Fidelity Reconstruction and Generation","date":"2025-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ereboas/MagiCodec","path":"components/ops/flash_attn_2_3_interface.py","file_url":"https://github.com/Ereboas/MagiCodec/blob/HEAD/components/ops/flash_attn_2_3_interface.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58e6542897e7d424","mcp_get_code":{"code_sha256":"58e6542897e7d424"}},{"arxiv_id":"2503.02130","paper":"/paper/forgetting-transformer-softmax-attention-with","title":"Forgetting Transformer: Softmax Attention with a Forget Gate","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/forgetting-transformer","path":"src/forgetting_transformer/ops/forgetting_attention.py","file_url":"https://github.com/zhixuan-lin/forgetting-transformer/blob/HEAD/src/forgetting_transformer/ops/forgetting_attention.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58e6542897e7d424","mcp_get_code":{"code_sha256":"58e6542897e7d424"}},{"arxiv_id":"2502.17421","paper":"/paper/longspec-long-context-speculative-decoding","title":"LongSpec: Long-Context Speculative Decoding with Efficient Drafting and Verification","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/longspec","path":"longspec/train/models/triton_tree_attn.py","file_url":"https://github.com/sail-sg/longspec/blob/HEAD/longspec/train/models/triton_tree_attn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58e6542897e7d424","mcp_get_code":{"code_sha256":"58e6542897e7d424"}},{"arxiv_id":"2407.08608","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_interface.py","file_url":"https://github.com/dao-ailab/flash-attention/blob/HEAD/flash_attn/flash_attn_interface.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}},{"arxiv_id":"2403.04690","paper":"/paper/faster-neighborhood-attention-reducing-the-o","title":"Faster Neighborhood Attention: Reducing the O(n^2) Cost of Self Attention at the Threadblock Level","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/NATTEN","path":"src/natten/_libnatten/torch_wrappers.py","file_url":"https://github.com/SHI-Labs/NATTEN/blob/HEAD/src/natten/_libnatten/torch_wrappers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d1108c2173a5c0de","mcp_get_code":{"code_sha256":"d1108c2173a5c0de"}},{"arxiv_id":"2309.06180","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_interface.py","file_url":"https://github.com/ROCm/flash-attention/blob/HEAD/flash_attn/flash_attn_interface.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}}]}