2 of 2 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; 0 failures of our instrument; 0 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/2012.06852.json · badge: /api/ran/2012.06852.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 |
|---|---|---|
| xiaxin1998/DHCN | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| trans_to_cpu | Ran ran, honoured the contract we drafted |
xiaxin1998/DHCN/model.py pointer only (licence: NONE) · get_code("5e9c13a07f73ec7c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiaxin1998/DHCN 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 |
xiaxin1998/DHCN/model.py pointer only (licence: NONE) · get_code("dcbfda3adaa66a2f") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, xiaxin1998/DHCN 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 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 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 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 |
|---|---|---|---|
| trans_to_cuda | 6 other papers 2 dated earlier, 4 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 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 1 dated earlier, 4 later |
2005.02844 (2020-05) TAGNN: Target Attentive Graph Neural 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 |
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 (SBR) focuses on next-item prediction at a certain time point. As user profiles are generally not available in this scenario, capturing the user intent lying in the item transitions plays a pivotal role. Recent graph neural networks (GNNs) based SBR methods regard the item transitions as pairwise relations, which neglect the complex high-order information among items. Hypergraph provides a natural way to capture beyond-pairwise relations, while its potential for SBR has remained unexplored. In this paper, we fill this gap by modeling session-based data as a hypergraph and then propose a hypergraph convolutional network to improve SBR. Moreover, to enhance hypergraph modeling, we devise another graph convolutional network which is based on the line graph of the hypergraph and then integrate self-supervised learning into the training of the networks by maximizing mutual information between the session representations learned via the two networks, serving as an auxiliary task to improve the recommendation task. Since the two types of networks both are based on hypergraph, which can be seen as two channels for hypergraph modeling, we name our model \textbf{DHCN} (Dual Channel Hypergraph Convolutional Networks). Extensive experiments on three benchmark datasets demonstrate the superiority of our model over the SOTA methods, and the results validate the effectiveness of hypergraph modeling and self-supervised task. The implementation of our model is available at https://github.com/xiaxin1998/DHCN
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2012.06852")
get_code_for_paper("2012.06852")
have("2012.06852")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2012.06852.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2012.06852)
Connect an agent — have() is free.