Methods › Graphs › Graph Models › GGS-NNs › Papers where code ran, page 1
Gated Graph Sequence Neural Networks
GGS-NNs
Papers archive 2025-07-28
archive papers tagged: 9 · with a code link: 8 · where Syntology ran a sample: 5 (5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (5 of 9 tagged: 5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Syntology We ran code from the paper's repository; we did not isolate this method inside it.
Page 1 of 1: papers 1 to 5 of the 5 tagged papers where Syntology ran at least one harvested sample (5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument), newest first by the archive's date (ties by arXiv id). This is a filter on Syntology's record ordered by date only, not a ranking; a run is not a correctness claim. A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Parameter Prediction for Unseen Deep Architectures 25 Oct 2021 · 1 repository · arXiv:2110.13100Syntology official: harvested, nothing ran · 6 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; 5 where Syntology's instrument failed) · 1 unverified (of 7 harvested samples) · 2 pointer-only (licence)
-
On the Bottleneck of Graph Neural Networks and its Practical Implications 9 Jun 2020 · 3 repositories · arXiv:2006.05205Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)
-
Semantic Graphs for Generating Deep Questions 27 Apr 2020 · 1 repository · arXiv:2004.12704Syntology official (archive's flag): 3 ran · 3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result (of 4 harvested samples)
-
Adversarial Examples for Models of Code 15 Oct 2019 · 4 repositories · arXiv:1910.07517Syntology official (archive's flag): 4 ran · 10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified (of 10 harvested samples) · 4 pointer-only (licence)
-
Gated Graph Sequence Neural Networks 17 Nov 2015 · 13 repositories · arXiv:1511.05493Syntology 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 12 harvested samples)