Papers › Structured Sequence Modeling with Graph Convolutional Recurrent Networks

Structured Sequence Modeling with Graph Convolutional Recurrent Networks

22 Dec 2016arXiv:1612.07659archive 2025-07-28

Youngjoo Seo, Michaël Defferrard, Pierre Vandergheynst, Xavier Bresson

This paper introduces Graph Convolutional Recurrent Network (GCRN), a deep learning model able to predict structured sequences of data. Precisely, GCRN is a generalization of classical recurrent neural networks (RNN) to data structured by an arbitrary graph. Such structured sequences can represent series of frames in videos, spatio-temporal measurements on a network of sensors, or random walks on a vocabulary graph for natural language modeling. The proposed model combines convolutional neural networks (CNN) on graphs to identify spatial structures and RNN to find dynamic patterns. We study two possible architectures of GCRN, and apply the models to two practical problems: predicting moving MNIST data, and modeling natural language with the Penn Treebank dataset. Experiments show that exploiting simultaneously graph spatial and dynamic information about data can improve both precision and learning speed.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 3 repositories linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 1 sample from 1 repository, 1 ran (0 with no instrument failure; 1 where Syntology's instrument failed); community (archive-listed): 7 samples from 2 repositories, 7 ran (7 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:

Levels written between 2026-09-22 and 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 1 of the 8 samples that ran has no recorded date.

youngjoo-epfl/gconvRNN officialmentioned on GitHubtfSyntology: 1 sample, 1 ran (1 instrument-failed) · 0 unverified report
andymogul/gcrnn_revised mentioned on GitHubtfMITSyntology: 6 samples, 6 ran (0 instrument-failed) · 0 unverified report
benedekrozemberczki/pytorch_geometric_temporal mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting (arXiv:1707.01926; that paper's own run record: 17 ran (of which 7 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 8 where Syntology's instrument failed) · 18 unverified), Predicting Path Failure In Time-Evolving Graphs (arXiv:1905.03994; that paper's own run record: 3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified) and Adaptive Graph Convolutional Recurrent Network for Traffic Forecasting (arXiv:2007.02842; that paper's own run record: 5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result); nothing checks that they implement this paper's method. report
dariush-salami/gcn-gesture-recognition mentioned on GitHubpytorchMITSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
mdeff/paper-cnn-graph-recurrent-iclr2017 mentioned on GitHubCC-BY-4.0Syntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

8 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · violated contract
1ran · our draft was wrong
6ran

Licence: 1 of the 8 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 1 sample that ran, the graph records a signature this page does not show: an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

youngjoo-epfl/gconvRNN official repository 1 sample, 1 ran (1 instrument-failed) · 0 unverified
add_argument_group in 31 papers config.py ran · our draft was wrong MIT (permissive) · ae8c11cb85308517 · report fixture: signature name:str/0/str · returned _ArgumentGroup · level recorded 2026-09-22
andymogul/gcrnn_revised community (archive-listed) 6 samples, 6 ran (0 instrument-failed) · 0 unverified
convert_to_one_hot in 10 papers utils.py ran MIT (permissive) · 660f5f33fc38af17 · report fixture: signature a:ndarray/2/int, max_val:int/0/int · returned ndarray · level recorded 2026-09-26
distance_scipy_spatial graph.py ran MIT (permissive) · 01d4be9c45f5d3f2 · report fixture: signature z:ndarray/2/float, k:int/0/int, metric:str/0/str · returned tuple · level recorded 2026-09-25
distance_sklearn_metrics in 5 papers graph.py ran MIT (permissive) · ebb82619c724ec7f · report fixture: signature z:ndarray/2/float, k:int/0/int, metric:str/0/str · returned tuple · level recorded 2026-09-25
grid in 20 papers graph.py ran MIT (permissive) · 00b211ed8d329331 · report fixture: returned ndarray · level recorded 2026-09-25
pklLoad utils.py ran MIT (permissive) · bb4755c946a9be63 · report fixture: signature fname:str/0/str · returned dict · level recorded 2026-09-26
str2bool in 533 papers config.py ran · violated contract MIT (permissive) here; the stored copy is pointer only · 248284f69adfeaad · report fixture: signature v:str/0/str · returned bool · level recorded, date not recorded
dariush-salami/gcn-gesture-recognition community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
MLP in 375 papers PointRNNGeo/model.py ran MIT (permissive) · 6a3d86408ed7015d · report fixture: signature channels:list/1/int, batch_norm:bool/0/bool · returned Sequential · level recorded 2026-09-26

Tasks

Language ModelingLanguage Modelling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections