5 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; 2 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, 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/2203.15508.json · badge: /api/ran/2203.15508.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 |
|---|---|---|
| salesforce/srma | canonical (classifier label) classifier basis not recorded on the link |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| swish | Ran ran; our contract draft was wrong, not the code |
salesforce/srma/src/modules.py code served (permissive licence) · get_code("0f786c407fb1ee4c") How it ranRan in Syntology's jail on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. The comparison behind this sample's level is a different run: the peer-agreement lane ran it again on the host, not in the jail (report dated 2026-09-04T22:33:52Z). 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.
|
| gelu | Ran ran; our contract draft was wrong, not the code |
salesforce/srma/src/modules.py pointer only (licence: BSD-3-Clause); the stored copy get_code serves, from RUCAIBox/CIKM2020-S3Rec, is pointer only (licence: NONE) · get_code("fbd63a1fd03f517c") How it ranThe body of this sample is withheld: this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from RUCAIBox/CIKM2020-S3Rec, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| kmax_pooling | Ran ran; our contract draft was wrong, not the code |
salesforce/srma/src/utils.py pointer only (licence: BSD-3-Clause); the stored copy get_code serves, from RUCAIBox/CIKM2020-S3Rec, is pointer only (licence: NONE) · get_code("11e0bc26b5cfda51") How it ranThe body of this sample is withheld: this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from RUCAIBox/CIKM2020-S3Rec, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| nCr | Ran ran, honoured the contract we drafted |
salesforce/srma/src/utils.py pointer only (licence: BSD-3-Clause); the stored copy get_code serves, from graph-team/apgl4sr, is pointer only (licence: NONE) · get_code("941f08ce28f5a2ff") How it ranThe body of this sample is withheld: this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from graph-team/apgl4sr, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| neg_sample | Ran ran, honoured the contract we drafted |
salesforce/srma/src/utils.py pointer only (licence: BSD-3-Clause); the stored copy get_code serves, from RUCAIBox/CIKM2020-S3Rec, is pointer only (licence: NONE) · get_code("ff0f6a85cdaf16a5") How it ranThe body of this sample is withheld: this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from RUCAIBox/CIKM2020-S3Rec, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is 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, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 2 the same month, 5 later) and 0 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| swish | 206 other papers 95 dated earlier, 9 the same month, 98 later, 4 same year, order not determinable · 44 only as an assembly brick |
1408.5882 (2014-08) Convolutional Neural Networks for Sentence Classification |
1805.12114 (2018-05) Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models 1809.01357 (2018-09) Zero Shot Learning for Code Education: Rubric Sampling with Deep Learning Inference and 203 more not named here |
| gelu | 198 other papers 101 dated earlier, 10 the same month, 83 later, 4 same year, order not determinable · 32 only as an assembly brick |
1408.5882 (2014-08) Convolutional Neural Networks for Sentence Classification |
1810.04805 (2018-10) BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 1901.10125 (2019-01) Glyce: Glyph-vectors for Chinese Character Representations and 195 more not named here |
| neg_sample | 7 other papers 1 dated earlier, 6 later |
2202.02519 (2022-02) Intent Contrastive Learning for Sequential Recommendation |
aaai_25540 (2023 (year only)) Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation 2310.14318 (2023-10) Intent Contrastive Learning with Cross Subsequences for Sequential Recommendation and 4 more not named here |
| kmax_pooling | 6 other papers 1 dated earlier, 5 later |
2202.02519 (2022-02) Intent Contrastive Learning for Sequential Recommendation |
aaai_25540 (2023 (year only)) Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation 2310.14318 (2023-10) Intent Contrastive Learning with Cross Subsequences for Sequential Recommendation and 3 more not named here |
| nCr | 5 other papers 1 dated earlier, 4 later |
2202.02519 (2022-02) Intent Contrastive Learning for Sequential Recommendation |
aaai_25540 (2023 (year only)) Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation 2310.14318 (2023-10) Intent Contrastive Learning with Cross Subsequences for Sequential Recommendation and 2 more not named here |
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.
The sequential recommendation aims at predicting the next items in user behaviors, which can be solved by characterizing item relationships in sequences. Due to the data sparsity and noise issues in sequences, a new self-supervised learning (SSL) paradigm is proposed to improve the performance, which employs contrastive learning between positive and negative views of sequences. However, existing methods all construct views by adopting augmentation from data perspectives, while we argue that 1) optimal data augmentation methods are hard to devise, 2) data augmentation methods destroy sequential correlations, and 3) data augmentation fails to incorporate comprehensive self-supervised signals. Therefore, we investigate the possibility of model augmentation to construct view pairs. We propose three levels of model augmentation methods: neuron masking, layer dropping, and encoder complementing. This work opens up a novel direction in constructing views for contrastive SSL. Experiments verify the efficacy of model augmentation for the SSL in the sequential recommendation. Code is available\footnote{\url{https://github.com/salesforce/SRMA}}.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2203.15508")
get_code_for_paper("2203.15508")
have("2203.15508")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2203.15508.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2203.15508)
Connect an agent — have() is free.