4 of 6 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 1 has no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-21; 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/2005.02844.json · badge: /api/ran/2005.02844.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 |
|---|---|---|
| CRIPAC-DIG/TAGNN | canonical (classifier label) classifier basis: census |
4 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| forward | Ran ran on a synthesized input |
CRIPAC-DIG/TAGNN/model.py code served (permissive licence) · get_code("65806d9881d0fec6") 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 tuple. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is 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.
|
| split_validation | Ran ran; our contract draft was wrong, not the code |
CRIPAC-DIG/TAGNN/utils.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from zhang-xiaokun/finerec, is pointer only (licence: NONE) · get_code("ab41533f85ff63ce") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from zhang-xiaokun/finerec, 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. |
| trans_to_cpu | Ran ran, honoured the contract we drafted |
CRIPAC-DIG/TAGNN/model.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from CCIIPLab/GCE-GNN, is pointer only (licence: NONE) · get_code("c653657a12ab28d4") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from CCIIPLab/GCE-GNN, 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. |
| trans_to_cuda | Ran ran, honoured the contract we drafted |
CRIPAC-DIG/TAGNN/model.py pointer only (licence: Apache-2.0); the stored copy get_code serves, from CCIIPLab/GCE-GNN, is pointer only (licence: NONE) · get_code("7a27709bcab8b8f3") How it ranThe body of this sample is withheld: this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from CCIIPLab/GCE-GNN, 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. |
| build_graph | Not yet run unverified (harvested, no recorded run) |
CRIPAC-DIG/TAGNN/utils.py code served (permissive licence) · get_code("62fa0eabd16730ce") How it ranno invocation recorded. |
| data_masks | Not yet run unverified (harvested, no recorded run) |
CRIPAC-DIG/TAGNN/utils.py code served (permissive licence) · get_code("d00d2724457e5fc9") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 4 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 4 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| trans_to_cuda | 6 other papers 1 dated earlier, 5 later |
1802.05591 (2018-02) Towards End-to-End Lane Detection: an Instance Segmentation Approach |
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 3 more not named here |
| trans_to_cpu | 5 other papers 5 later |
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 2206.12781 (2022-06) Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network and 2 more not named here |
| split_validation | 2 other papers 2 later |
aaai_16593 (2021 (year only)) Dual Sparse Attention Network For Session-based Recommendation |
2404.12975 (2024-04) FineRec:Exploring Fine-grained Sequential Recommendation |
| data_masks | 1 other paper 1 later |
aaai_16593 (2021 (year only)) Dual Sparse Attention Network For Session-based 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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Session-based recommendation nowadays plays a vital role in many websites, which aims to predict users' actions based on anonymous sessions. There have emerged many studies that model a session as a sequence or a graph via investigating temporal transitions of items in a session. However, these methods compress a session into one fixed representation vector without considering the target items to be predicted. The fixed vector will restrict the representation ability of the recommender model, considering the diversity of target items and users' interests. In this paper, we propose a novel target attentive graph neural network (TAGNN) model for session-based recommendation. In TAGNN, target-aware attention adaptively activates different user interests with respect to varied target items. The learned interest representation vector varies with different target items, greatly improving the expressiveness of the model. Moreover, TAGNN harnesses the power of graph neural networks to capture rich item transitions in sessions. Comprehensive experiments conducted on real-world datasets demonstrate its superiority over state-of-the-art methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.02844")
get_code_for_paper("2005.02844")
have("2005.02844")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.02844.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.02844)
Connect an agent — have() is free.