{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/ggs-nns","slug":"ggs-nns","name":"GGS-NNs","full_name":"Gated Graph Sequence Neural Networks","full_name_withheld":false,"description_markdown":"Gated Graph Sequence Neural Networks (GGS-NNs) is a novel graph-based neural network model. GGS-NNs modifies Graph Neural Networks (Scarselli et al., 2009) to use gated recurrent units and modern optimization techniques and then extend to output sequences.\r\n\r\nSource: [Li et al.](https://arxiv.org/pdf/1511.05493v4.pdf)\r\n\r\nImage source: [Li et al.](https://arxiv.org/pdf/1511.05493v4.pdf)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"http://arxiv.org/abs/1511.05493v4","title":"Gated Graph Sequence Neural Networks","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]}],"n_papers_tagged":9,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/parameter-prediction-for-unseen-deep","slug":"parameter-prediction-for-unseen-deep","title":"Parameter Prediction for Unseen Deep Architectures","date":"2021-10-25","arxiv_id":"2110.13100","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":1,"n_instrument":5,"unverified":1,"pointer_only":2,"phrase":"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","official":{"repos":["facebookresearch/ppuda"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["community","found_in_text"]}}},{"paper":null,"slug":"dynamic-planning-of-bicycle-stations-in","title":"Dynamic Planning of Bicycle Stations in Dockless Public Bicycle-sharing System Using Gated Graph Neural Network","date":"2021-01-19","arxiv_id":"2101.07425","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-generalizability-of-neural-program","slug":"on-the-generalizability-of-neural-program","title":"On the Generalizability of Neural Program Models with respect to Semantic-Preserving Program Transformations","date":"2020-07-31","arxiv_id":"2008.01566","n_code_links":1,"syntology":null},{"paper":"/paper/on-the-bottleneck-of-graph-neural-networks","slug":"on-the-bottleneck-of-graph-neural-networks","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","date":"2020-06-09","arxiv_id":"2006.05205","n_code_links":3,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"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","official":{"repos":["tech-srl/bottleneck"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/semantic-graphs-for-generating-deep-questions","slug":"semantic-graphs-for-generating-deep-questions","title":"Semantic Graphs for Generating Deep Questions","date":"2020-04-27","arxiv_id":"2004.12704","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"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","official":{"repos":["WING-NUS/SG-Deep-Question-Generation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/visual-relationship-detection-with-relative","slug":"visual-relationship-detection-with-relative","title":"Visual Relationship Detection with Relative Location Mining","date":"2019-11-02","arxiv_id":"1911.00713","n_code_links":1,"syntology":null},{"paper":"/paper/adversarial-examples-for-models-of-code","slug":"adversarial-examples-for-models-of-code","title":"Adversarial Examples for Models of Code","date":"2019-10-15","arxiv_id":"1910.07517","n_code_links":4,"syntology":{"ran":10,"of":10,"n_ran_checked":5,"n_instrument":5,"unverified":0,"pointer_only":4,"phrase":"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","official":{"repos":["tech-srl/adversarial-examples"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/learning-to-represent-programs-with-graphs","slug":"learning-to-represent-programs-with-graphs","title":"Learning to Represent Programs with Graphs","date":"2017-11-01","arxiv_id":"1711.00740","n_code_links":2,"syntology":null},{"paper":"/paper/gated-graph-sequence-neural-networks","slug":"gated-graph-sequence-neural-networks","title":"Gated Graph Sequence Neural Networks","date":"2015-11-17","arxiv_id":"1511.05493","n_code_links":13,"syntology":{"ran":9,"of":12,"n_ran_checked":9,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"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","official":null}}],"papers_shown":9,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":9,"with_a_code_link":8,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":9,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/method/ggs-nns/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/ggs-nns/papers/ran/1","json":"/method/ggs-nns/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":3},{"task":"/task/prediction","name":"Prediction","papers":2},{"task":null,"name":"CPU","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/drug-discovery","name":"Drug Discovery","papers":1},{"task":"/task/graph-classification","name":"Graph Classification","papers":1},{"task":"/task/management","name":"Management","papers":1},{"task":"/task/method-name-prediction","name":"Method name prediction","papers":1},{"task":"/task/node-classification","name":"Node Classification","papers":1},{"task":"/task/object","name":"Object","papers":1},{"task":"/task/parameter-prediction","name":"Parameter Prediction","papers":1},{"task":"/task/question-generation","name":"Question Generation","papers":1},{"task":"/task/question-generation","name":"Question-Generation","papers":1},{"task":"/task/relationship-detection","name":"Relationship Detection","papers":1},{"task":"/task/sql-to-text","name":"SQL-to-Text","papers":1},{"task":"/task/visual-relationship-detection","name":"Visual Relationship Detection","papers":1}],"tasks_shown":16,"n_tasks":16,"usage_by_year":[{"year":"2015","papers":1},{"year":"2017","papers":1},{"year":"2019","papers":2},{"year":"2020","papers":3},{"year":"2021","papers":2}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/ggs-nns"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=GGS-NNs","read_at":"2026-10-05T00:56:48+00:00","query":"GGS-NNs","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'GGS-NNs' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"4577bf30c8087831ef00c31b52f30301e58d340937b8cb50626af1fd70819a75","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}