1 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 0 failures of our instrument; 4 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2404.02882.json · badge: /api/ran/2404.02882.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| opennlplab/lasp | canonical (classifier label) classifier basis: census |
1 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| build_slope_tensor | Ran ran, honoured the contract we drafted |
opennlplab/lasp/lasp/utils/module_utils.py code served (permissive licence) · get_code("0bdf3bb1ce2d8de0") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 3, dtype family float, shape (8, 1, 1) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| get_data_parallel_group | Not yet run unverified (harvested, no recorded run) |
opennlplab/lasp/lasp/utils/seq_parallel_manager.py code served (permissive licence) · get_code("33d7fdd3c984d26e") How it ranno invocation recorded. |
| get_data_parallel_rank | Not yet run unverified (harvested, no recorded run) |
opennlplab/lasp/lasp/utils/seq_parallel_manager.py code served (permissive licence) · get_code("bb048ad9524cb03a") How it ranno invocation recorded. |
| get_data_parallel_world_size | Not yet run unverified (harvested, no recorded run) |
opennlplab/lasp/lasp/utils/seq_parallel_manager.py code served (permissive licence) · get_code("31fd5efa0779b688") How it ranno invocation recorded. |
| get_memory | Not yet run unverified (harvested, no recorded run) |
opennlplab/lasp/lasp/utils/module_utils.py code served (permissive licence) · get_code("d74763ca1f8b4730") How it ranno invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 5 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Sequence parallelism (SP) serves as a prevalent strategy to handle long sequences that exceed the memory limit of a single device. However, for linear sequence modeling methods like linear attention, existing SP approaches do not take advantage of their right-product-first feature, resulting in sub-optimal communication efficiency and usability. In this paper, we introduce Linear Attention Sequence Parallelism (LASP), an efficient SP approach designed for linear attention-based transformer models. Specifically, we design an efficient point-to-point ring-style communication mechanism to leverage the right-product kernel trick of linear attention, which sharply decreases the communication overhead, comparing with existing SP methods. We enhance the computation efficiency of LASP by performing kernel fusion and intermediate state caching, making the implementation of LASP hardware-friendly on GPUs. Furthermore, we meticulously ensure the compatibility of sequence-level LASP with all types of batch-level data parallel methods, which is vital for distributed training on large clusters with very-long sequences. We also discuss the generalization of LASP on other linear sequence modeling methods. Extensive experiments on linear attention-based models are conducted with varying sequence lengths from 2K to 4096K. LASP scales sequence length up to 4096K on 128 GPUs, which is 8$\times$ longer than existing SP methods. Code is available at: https://github.com/OpenNLPLab/LASP.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2404.02882")
get_code_for_paper("2404.02882")
have("2404.02882")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2404.02882.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2404.02882)
Connect an agent — have() is free.