{"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":"/task/graph-to-sequence/papers/ran/1","list_of":"/task/graph-to-sequence","task":"Graph-to-Sequence","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"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.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,11],"of":11,"counts":{"archive_papers_tagged":48,"with_a_code_link":29,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":48,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":11,"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"},"first_page":"/task/graph-to-sequence/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/ontology-free-general-domain-knowledge-graph","slug":"ontology-free-general-domain-knowledge-graph","title":"Ontology-Free General-Domain Knowledge Graph-to-Text Generation Dataset Synthesis using Large Language Model","date":"2024-09-11","arxiv_id":"2409.07088","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ontology-free-general-domain-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2409.07088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.07088"}},"official":{"repos":["daehuikim/WikiOFGraph"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/permutation-invariant-graph-to-sequence-model-1","slug":"permutation-invariant-graph-to-sequence-model-1","title":"Permutation invariant graph-to-sequence model for template-free retrosynthesis and reaction prediction","date":"2021-10-19","arxiv_id":"2110.09681","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/permutation-invariant-graph-to-sequence-model-1#ran","syntology_url":"https://syntology.ai/paper/2110.09681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09681"}},"official":{"repos":["coleygroup/graph2smiles"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gpt-too-a-language-model-first-approach-for","slug":"gpt-too-a-language-model-first-approach-for","title":"GPT-too: A language-model-first approach for AMR-to-text generation","date":"2020-05-18","arxiv_id":"2005.09123","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gpt-too-a-language-model-first-approach-for#ran","syntology_url":"https://syntology.ai/paper/2005.09123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09123"}},"official":{"repos":["IBM/GPT-too-AMR2text"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-transformer-for-graph-to-sequence","slug":"graph-transformer-for-graph-to-sequence","title":"Graph Transformer for Graph-to-Sequence Learning","date":"2019-11-18","arxiv_id":"1911.07470","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-transformer-for-graph-to-sequence#ran","syntology_url":"https://syntology.ai/paper/1911.07470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07470"}},"official":{"repos":["jcyk/gtos"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-based-graph-to","slug":"reinforcement-learning-based-graph-to","title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","date":"2019-08-14","arxiv_id":"1908.04942","repositories_listed":1,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 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) · 7 unverified","sample_list":"/paper/reinforcement-learning-based-graph-to#ran","syntology_url":"https://syntology.ai/paper/1908.04942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04942"}},"official":{"repos":["hugochan/RL-based-Graph2Seq-for-NQG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/step-by-step-separating-planning-from","slug":"step-by-step-separating-planning-from","title":"Step-by-Step: Separating Planning from Realization in Neural Data-to-Text Generation","date":"2019-04-06","arxiv_id":"1904.03396","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/step-by-step-separating-planning-from#ran","syntology_url":"https://syntology.ai/paper/1904.03396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.03396"}},"official":{"repos":["AmitMY/chimera"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-graph-convolutional-encoders-for","slug":"deep-graph-convolutional-encoders-for","title":"Deep Graph Convolutional Encoders for Structured Data to Text Generation","date":"2018-10-23","arxiv_id":"1810.09995","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-graph-convolutional-encoders-for#ran","syntology_url":"https://syntology.ai/paper/1810.09995","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09995"}},"official":{"repos":["diegma/graph-2-text"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sql-to-text-generation-with-graph-to-sequence","slug":"sql-to-text-generation-with-graph-to-sequence","title":"SQL-to-Text Generation with Graph-to-Sequence Model","date":"2018-09-14","arxiv_id":"1809.05255","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sql-to-text-generation-with-graph-to-sequence#ran","syntology_url":"https://syntology.ai/paper/1809.05255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.05255"}},"official":{"repos":["IBM/SQL-to-Text"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-rich-syntactic-information-for","slug":"exploiting-rich-syntactic-information-for","title":"Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model","date":"2018-08-23","arxiv_id":"1808.07624","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploiting-rich-syntactic-information-for#ran","syntology_url":"https://syntology.ai/paper/1808.07624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.07624"}},"official":{"repos":["IBM/Text-to-LogicForm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-to-sequence-learning-using-gated-graph","slug":"graph-to-sequence-learning-using-gated-graph","title":"Graph-to-Sequence Learning using Gated Graph Neural Networks","date":"2018-06-26","arxiv_id":"1806.09835","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-to-sequence-learning-using-gated-graph#ran","syntology_url":"https://syntology.ai/paper/1806.09835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09835"}},"official":{"repos":["beckdaniel/acl2018_graph2seq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph2seq-graph-to-sequence-learning-with","slug":"graph2seq-graph-to-sequence-learning-with","title":"Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks","date":"2018-04-03","arxiv_id":"1804.00823","repositories_listed":4,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph2seq-graph-to-sequence-learning-with#ran","syntology_url":"https://syntology.ai/paper/1804.00823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00823"}},"official":{"repos":["IBM/Graph2Seq"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}}],"record_sha256":"6463bb759c0821f90a24765ef7dc1fa1b171d918616b7bbea0d0c1a1dcb25e59","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}