SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2206.12781 · 2022

Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network

arXiv · PDF · Open in the Atlas

Code that ran

4 of 4 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; 2 failures of our instrument; 0 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/2206.12781.json · badge: /api/ran/2206.12781.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.

RepositoryRoleRan
Peiyance/Atten-Mixer-torch canonical (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
copy not recorded community
not in the paper's declared repositories
2 ran · 0 no recorded run
FunctionStatusWhere it lives
forward Ran
ran; our contract draft was wrong, not the code
Peiyance/Atten-Mixer-torch/GNN-AM/model.py
pointer only (licence: NONE) · get_code("194d86fad5383c8a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Peiyance/Atten-Mixer-torch 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.

forward Ran
ran; our contract draft was wrong, not the code
Peiyance/Atten-Mixer-torch/SGNN-HN-AM/model_star.py
pointer only (licence: NONE) · get_code("f13817c7862b4eb7")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Peiyance/Atten-Mixer-torch 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.

trans_to_cpu Ran
ran, honoured the contract we drafted
this paper's copy was not recorded; identical code first harvested from CCIIPLab/GCE-GNN
pointer only; the stored copy get_code serves, from CCIIPLab/GCE-GNN, is pointer only (licence: NONE) · get_code("c653657a12ab28d4")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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.

trans_to_cuda Ran
ran, honoured the contract we drafted
this paper's copy was not recorded; identical code first harvested from CCIIPLab/GCE-GNN
pointer only; the stored copy get_code serves, from CCIIPLab/GCE-GNN, is pointer only (licence: NONE) · get_code("7a27709bcab8b8f3")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 later) and 2 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.

FunctionAlso present inEarliest-datedOthers named
trans_to_cuda 6 other papers
4 dated earlier, 2 later
1802.05591 (2018-02)
Towards End-to-End Lane Detection: an Instance Segmentation Approach
2005.02844 (2020-05)
TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation
2012.06852 (2020-12)
Self-Supervised Hypergraph Convolutional Networks for Session-based Recommendation
and 3 more not named here
trans_to_cpu 5 other papers
3 dated earlier, 2 later
2005.02844 (2020-05)
TAGNN: Target Attentive Graph Neural Networks for Session-based Recommendation
2012.06852 (2020-12)
Self-Supervised Hypergraph Convolutional Networks for Session-based Recommendation
2106.05081 (2021-06)
Global Context Enhanced Graph Neural Networks for Session-based 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.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Session-based recommendation (SBR) aims to predict the user's next action based on short and dynamic sessions. Recently, there has been an increasing interest in utilizing various elaborately designed graph neural networks (GNNs) to capture the pair-wise relationships among items, seemingly suggesting the design of more complicated models is the panacea for improving the empirical performance. However, these models achieve relatively marginal improvements with exponential growth in model complexity. In this paper, we dissect the classical GNN-based SBR models and empirically find that some sophisticated GNN propagations are redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we intuitively propose to remove the GNN propagation part, while the readout module will take on more responsibility in the model reasoning process. To this end, we propose the Multi-Level Attention Mixture Network (Atten-Mixer), which leverages both concept-view and instance-view readouts to achieve multi-level reasoning over item transitions. As simply enumerating all possible high-level concepts is infeasible for large real-world recommender systems, we further incorporate SBR-related inductive biases, i.e., local invariance and inherent priority to prune the search space. Experiments on three benchmarks demonstrate the effectiveness and efficiency of our proposal. We also have already launched the proposed techniques to a large-scale e-commercial online service since April 2021, with significant improvements of top-tier business metrics demonstrated in the online experiments on live traffic.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2206.12781")
get_code_for_paper("2206.12781")
have("2206.12781")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2206.12781.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2206.12781.svg)](https://syntology.ai/paper/2206.12781)

Connect an agent — have() is free.