{"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/maybe-contiguous","entry":"maybe_contiguous","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":3,"n_papers_ran_instrument_only":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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":3,"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":"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_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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"19ad2ccd82e378c1","code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}},{"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_interface.py","file_url":"https://github.com/Dao-AILab/flash-attention/blob/HEAD/flash_attn/flash_attn_interface.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"19ad2ccd82e378c1","code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}},{"arxiv_id":"2506.00385","arxiv_id_is_arxiv":true,"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":"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":"58e6542897e7d424","code_sha256_prefix":"58e6542897e7d424","mcp_get_code":{"code_sha256":"58e6542897e7d424"}},{"arxiv_id":"2503.02130","arxiv_id_is_arxiv":true,"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":"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":"58e6542897e7d424","code_sha256_prefix":"58e6542897e7d424","mcp_get_code":{"code_sha256":"58e6542897e7d424"}},{"arxiv_id":"2502.17421","arxiv_id_is_arxiv":true,"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":"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":"58e6542897e7d424","code_sha256_prefix":"58e6542897e7d424","mcp_get_code":{"code_sha256":"58e6542897e7d424"}},{"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_interface.py","file_url":"https://github.com/dao-ailab/flash-attention/blob/HEAD/flash_attn/flash_attn_interface.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"19ad2ccd82e378c1","code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}},{"arxiv_id":"2403.04690","arxiv_id_is_arxiv":true,"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_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":"d1108c2173a5c0de","code_sha256_prefix":"d1108c2173a5c0de","mcp_get_code":{"code_sha256":"d1108c2173a5c0de"}},{"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_interface.py","file_url":"https://github.com/ROCm/flash-attention/blob/HEAD/flash_attn/flash_attn_interface.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"19ad2ccd82e378c1","code_sha256_prefix":"19ad2ccd82e378c1","mcp_get_code":{"code_sha256":"19ad2ccd82e378c1"}}],"record_sha256":"91ee00e65fd70455a23c3e6e3225ff6951f0c59a584330cb398e7620d09c9d1c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}