3 of 3 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; 1 honoured the contract we drafted, 2 violated it and 0 have no contract verdict; 0 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/2104.14917.json · badge: /api/ran/2104.14917.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 |
|---|---|---|
| tsinghua-fib-lab/Traffic-Benchmark | canonical (classifier label) classifier basis: census |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| asym_adj | Ran ran, violated the contract we drafted |
tsinghua-fib-lab/Traffic-Benchmark/methods/DGCRN/util.py code served (permissive licence) · get_code("b2bde59f87bab41d") 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 matrix, ndim 2, dtype family float, shape (4, 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.
|
| normal_std | Ran ran, honoured the contract we drafted |
tsinghua-fib-lab/Traffic-Benchmark/methods/DGCRN/util.py code served (permissive licence) · get_code("1ef18a710e2babf6") 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 float64, ndim 0, dtype family float; 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.
|
| sym_adj | Ran ran, violated the contract we drafted |
tsinghua-fib-lab/Traffic-Benchmark/methods/DGCRN/util.py code served (permissive licence) · get_code("9a7928795f74526c") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Sonnet 4.5, prompt python_fixture_v1) and returned matrix, ndim 2, dtype family float, shape (5, 5) 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.
|
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 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 |
|---|---|---|---|
| asym_adj | 6 other papers 1 dated earlier, 5 later |
1906.00121 (2019-06) Graph WaveNet for Deep Spatial-Temporal Graph Modeling |
2202.08408 (2022-02) Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs 2401.03138 (2024-01) TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling and 3 more not named here |
| sym_adj | 4 other papers 1 dated earlier, 3 later |
1906.00121 (2019-06) Graph WaveNet for Deep Spatial-Temporal Graph Modeling |
2202.08408 (2022-02) Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs 2403.02600 (2024-03) TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts and 1 more not named here |
| normal_std | 2 other papers 1 dated earlier, 1 later |
1703.07015 (2017-03) Modeling Long- and Short-Term Temporal Patterns with Deep Neural Networks |
2202.08408 (2022-02) Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs |
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.
Traffic prediction is the cornerstone of an intelligent transportation system. Accurate traffic forecasting is essential for the applications of smart cities, i.e., intelligent traffic management and urban planning. Although various methods are proposed for spatio-temporal modeling, they ignore the dynamic characteristics of correlations among locations on road networks. Meanwhile, most Recurrent Neural Network (RNN) based works are not efficient enough due to their recurrent operations. Additionally, there is a severe lack of fair comparison among different methods on the same datasets. To address the above challenges, in this paper, we propose a novel traffic prediction framework, named Dynamic Graph Convolutional Recurrent Network (DGCRN). In DGCRN, hyper-networks are designed to leverage and extract dynamic characteristics from node attributes, while the parameters of dynamic filters are generated at each time step. We filter the node embeddings and then use them to generate a dynamic graph, which is integrated with a pre-defined static graph. As far as we know, we are the first to employ a generation method to model fine topology of dynamic graph at each time step. Further, to enhance efficiency and performance, we employ a training strategy for DGCRN by restricting the iteration number of decoder during forward and backward propagation. Finally, a reproducible standardized benchmark and a brand new representative traffic dataset are opened for fair comparison and further research. Extensive experiments on three datasets demonstrate that our model outperforms 15 baselines consistently.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.14917")
get_code_for_paper("2104.14917")
have("2104.14917")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.14917.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.14917)
Connect an agent — have() is free.