3 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; 1 failure of our instrument; 2 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/2304.09184.json · badge: /api/ran/2304.09184.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 |
|---|---|---|
| sudaada/fearec | canonical (classifier label) classifier basis: census |
3 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| activation_layer | Ran ran; our contract draft was wrong, not the code |
sudaada/fearec/recbole/model/layers.py code served (permissive licence) · get_code("b5b0bb176f34b7a4") 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 ReLU. The image it ran in was not recorded. If your copy returns the same type 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_frequency_modes | Ran ran, honoured the contract we drafted |
sudaada/fearec/recbole/model/layers.py code served (permissive licence) · get_code("592ea8b254b006db") 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 list, ndim 1, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.
|
| hit_ | Ran ran, honoured the contract we drafted |
sudaada/fearec/recbole/evaluator/metrics.py code served (permissive licence) · get_code("83ba6af9d18dc931") 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 ndarray, ndim 2, dtype family int, shape (2, 4) 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.
|
| map_ | Not yet run unverified (harvested, no recorded run) |
sudaada/fearec/recbole/evaluator/metrics.py code served (permissive licence) · get_code("b789b2a14dd19e0c") How it ranno invocation recorded. |
| mrr_ | Not yet run unverified (harvested, no recorded run) |
sudaada/fearec/recbole/evaluator/metrics.py code served (permissive licence) · get_code("a7dd48dfe868e2d3") 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, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 1 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 |
|---|---|---|---|
| get_frequency_modes | 27 other papers 1 dated earlier, 26 later · 1 only as an assembly brick |
2201.12740 (2022-01) FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting |
2305.13036 (2023-05) Disentangling Structured Components: Towards Adaptive, Interpretable and Scalable Time Series Forecasting 2307.01616 (2023-07) SageFormer: Series-Aware Framework for Long-term Multivariate Time Series Forecasting and 24 more not named here |
| activation_layer | 18 other papers 5 dated earlier, 1 the same month, 12 later |
2110.05730 (2021-10) Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation |
2204.11046 (2022-04) Decoupled Side Information Fusion for Sequential Recommendation 2205.08776 (2022-05) AdaMCT: Adaptive Mixture of CNN-Transformer for Sequential Recommendation and 15 more not named here |
| hit_ | 4 other papers 2 dated earlier, 2 later |
2110.05730 (2021-10) Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation |
2206.12811 (2022-06) Towards Representation Alignment and Uniformity in Collaborative Filtering 2401.15635 (2024-01) RecDCL: Dual Contrastive Learning for Recommendation and 1 more not named here |
| map_ | 3 other papers 2 dated earlier, 1 later |
2110.05730 (2021-10) Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation |
2206.12811 (2022-06) Towards Representation Alignment and Uniformity in Collaborative Filtering 2401.15635 (2024-01) RecDCL: Dual Contrastive Learning for Recommendation |
| mrr_ | 3 other papers 2 dated earlier, 1 later |
2110.05730 (2021-10) Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation |
2206.12811 (2022-06) Towards Representation Alignment and Uniformity in Collaborative Filtering 2401.15635 (2024-01) RecDCL: Dual Contrastive Learning for Recommendation |
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 self-attention mechanism, which equips with a strong capability of modeling long-range dependencies, is one of the extensively used techniques in the sequential recommendation field. However, many recent studies represent that current self-attention based models are low-pass filters and are inadequate to capture high-frequency information. Furthermore, since the items in the user behaviors are intertwined with each other, these models are incomplete to distinguish the inherent periodicity obscured in the time domain. In this work, we shift the perspective to the frequency domain, and propose a novel Frequency Enhanced Hybrid Attention Network for Sequential Recommendation, namely FEARec. In this model, we firstly improve the original time domain self-attention in the frequency domain with a ramp structure to make both low-frequency and high-frequency information could be explicitly learned in our approach. Moreover, we additionally design a similar attention mechanism via auto-correlation in the frequency domain to capture the periodic characteristics and fuse the time and frequency level attention in a union model. Finally, both contrastive learning and frequency regularization are utilized to ensure that multiple views are aligned in both the time domain and frequency domain. Extensive experiments conducted on four widely used benchmark datasets demonstrate that the proposed model performs significantly better than the state-of-the-art approaches.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2304.09184")
get_code_for_paper("2304.09184")
have("2304.09184")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2304.09184.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2304.09184)
Connect an agent — have() is free.