{"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","name":"Graph-to-Sequence","slug":"graph-to-sequence","description_markdown":"Mapping an input graph to a sequence of vectors.","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":48,"papers_with_code":29,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":4,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-to-sequence-on-ldc2015e86","slug":"graph-to-sequence-on-ldc2015e86","dataset":"LDC2015E86:","dataset_url":null,"rows_in_archive":2,"metrics":["BLEU"],"first_row_in_archive_order":{"model":"GRN","paper_title":"A Graph-to-Sequence Model for AMR-to-Text Generation","paper_url":"/paper/a-graph-to-sequence-model-for-amr-to-text","paper_date":"2018-05-07","arxiv_id":"1805.02473","code_links":[{"title":"freesunshine0316/neural-graph-to-seq-mp","url":"https://github.com/freesunshine0316/neural-graph-to-seq-mp"}],"syntology":null}},{"leaderboard":"/sota/graph-to-sequence-on-webnlg","slug":"graph-to-sequence-on-webnlg","dataset":"WebNLG","dataset_url":"/dataset/webnlg","rows_in_archive":1,"metrics":["BLEU"],"first_row_in_archive_order":{"model":"CGE-LW","paper_title":"Modeling Global and Local Node Contexts for Text Generation from Knowledge Graphs","paper_url":"/paper/modeling-global-and-local-node-contexts-for","paper_date":"2020-01-29","arxiv_id":"2001.11003","code_links":[{"title":"UKPLab/kg2text","url":"https://github.com/UKPLab/kg2text"}],"syntology":null}}],"datasets":[{"url":"/dataset/webnlg","name":"WebNLG","full_name":"","num_papers_in_archive":149},{"url":"/dataset/eventnarrative","name":"EventNarrative","full_name":"","num_papers_in_archive":3},{"url":"/dataset/ent-desc","name":"ENT-DESC","full_name":"","num_papers_in_archive":1},{"url":"/dataset/wikiofgraph","name":"WikiOFGraph","full_name":"Wikipedia Ontology-Free Graph-Text","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":48,"of":48,"of_with_code":29,"tagged_in_all":48,"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"},"items":[{"url":"/paper/neural-amr-sequence-to-sequence-models-for","slug":"neural-amr-sequence-to-sequence-models-for","title":"Neural AMR: Sequence-to-Sequence Models for Parsing and Generation","date":"2017-04-26","arxiv_id":"1704.08381","repositories_listed":5,"syntology":null},{"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"]}}},{"url":"/paper/a-physics-informed-neural-network-for-wind","slug":"a-physics-informed-neural-network-for-wind","title":"A physics-informed neural network for wind turbine main bearing fatigue","date":"2020-05-05","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/physics-informed-neural-networks-for-1","slug":"physics-informed-neural-networks-for-1","title":"Physics-informed neural networks for corrosion-fatigue prognosis","date":"2019-09-22","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/structural-neural-encoders-for-amr-to-text","slug":"structural-neural-encoders-for-amr-to-text","title":"Structural Neural Encoders for AMR-to-text Generation","date":"2019-03-27","arxiv_id":"1903.11410","repositories_listed":2,"syntology":null},{"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/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/pdg2seq-periodic-dynamic-graph-to-sequence","slug":"pdg2seq-periodic-dynamic-graph-to-sequence","title":"PDG2Seq: Periodic Dynamic Graph to Sequence Model for Traffic Flow Prediction","date":"2024-12-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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":2,"n_instrument":3,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 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":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ask-questions-with-double-hints-visual","slug":"ask-questions-with-double-hints-visual","title":"Ask Questions with Double Hints: Visual Question Generation with Answer-awareness and Region-reference","date":"2024-07-06","arxiv_id":"2407.05100","repositories_listed":1,"syntology":null},{"url":"/paper/ualign-pushing-the-limit-of-template-free","slug":"ualign-pushing-the-limit-of-template-free","title":"UAlign: Pushing the Limit of Template-free Retrosynthesis Prediction with Unsupervised SMILES Alignment","date":"2024-03-25","arxiv_id":"2404.00044","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-parking-lot-availability-by-graph","slug":"predicting-parking-lot-availability-by-graph","title":"Predicting Parking Lot Availability by Graph-to-Sequence Model: A Case Study with SmartSantander","date":"2022-06-21","arxiv_id":"2206.10160","repositories_listed":1,"syntology":null},{"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/knowledge-graph-empowered-entity-description","slug":"knowledge-graph-empowered-entity-description","title":"ENT-DESC: Entity Description Generation by Exploring Knowledge Graph","date":"2020-04-30","arxiv_id":"2004.14813","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-global-and-local-node-contexts-for","slug":"modeling-global-and-local-node-contexts-for","title":"Modeling Global and Local Node Contexts for Text Generation from Knowledge Graphs","date":"2020-01-29","arxiv_id":"2001.11003","repositories_listed":1,"syntology":null},{"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/natural-question-generation-with","slug":"natural-question-generation-with","title":"Natural Question Generation with Reinforcement Learning Based Graph-to-Sequence Model","date":"2019-10-19","arxiv_id":"1910.08832","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-amr-to-text-generation-with-dual","slug":"enhancing-amr-to-text-generation-with-dual","title":"Enhancing AMR-to-Text Generation with Dual Graph Representations","date":"2019-09-01","arxiv_id":"1909.00352","repositories_listed":1,"syntology":null},{"url":"/paper/densely-connected-graph-convolutional-1","slug":"densely-connected-graph-convolutional-1","title":"Densely Connected Graph Convolutional Networks for Graph-to-Sequence Learning","date":"2019-08-16","arxiv_id":"1908.05957","repositories_listed":1,"syntology":null},{"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/coherent-comments-generation-for-chinese","slug":"coherent-comments-generation-for-chinese","title":"Coherent Comments Generation for Chinese Articles with a Graph-to-Sequence Model","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/coherent-comment-generation-for-chinese","slug":"coherent-comment-generation-for-chinese","title":"Coherent Comment Generation for Chinese Articles with a Graph-to-Sequence Model","date":"2019-06-04","arxiv_id":"1906.01231","repositories_listed":1,"syntology":null},{"url":"/paper/stg2seq-spatial-temporal-graph-to-sequence","slug":"stg2seq-spatial-temporal-graph-to-sequence","title":"STG2Seq: Spatial-temporal Graph to Sequence Model for Multi-step Passenger Demand Forecasting","date":"2019-05-24","arxiv_id":"1905.10069","repositories_listed":1,"syntology":null},{"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/fleet-prognosis-with-physics-informed","slug":"fleet-prognosis-with-physics-informed","title":"Fleet Prognosis with Physics-informed Recurrent Neural Networks","date":"2019-01-16","arxiv_id":"1901.05512","repositories_listed":1,"syntology":null},{"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/a-graph-to-sequence-model-for-amr-to-text","slug":"a-graph-to-sequence-model-for-amr-to-text","title":"A Graph-to-Sequence Model for AMR-to-Text Generation","date":"2018-05-07","arxiv_id":"1805.02473","repositories_listed":1,"syntology":null},{"url":null,"slug":"fragmentnet-adaptive-graph-fragmentation-for","title":"FragmentNet: Adaptive Graph Fragmentation for Graph-to-Sequence Molecular Representation Learning","date":"2025-02-03","arxiv_id":"2502.01184","repositories_listed":0,"syntology":null},{"url":null,"slug":"ezsql-an-sql-intermediate-representation-for","title":"EzSQL: An SQL intermediate representation for improving SQL-to-text Generation","date":"2024-11-28","arxiv_id":"2411.18923","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-to-sequence-model-for-joint-intent","title":"A Graph-to-Sequence Model for Joint Intent Detection and Slot Filling in Task-Oriented Dialogue Systems","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphmr-graph-neural-network-for-mathematical","title":"GraphMR: Graph Neural Network for Mathematical Reasoning","date":"2021-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-guided-abstractive-multi-document","title":"Topic-Guided Abstractive Multi-Document Summarization","date":"2021-10-21","arxiv_id":"2110.11207","repositories_listed":0,"syntology":null},{"url":null,"slug":"amr-to-text-generation-with-graph-structure","title":"AMR-to-text Generation with Graph Structure Reconstruction and Coverage","date":"2021-09-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proving-equivalence-between-complex","title":"Proving Equivalence Between Complex Expressions Using Graph-to-Sequence Neural Models","date":"2021-06-01","arxiv_id":"2106.02452","repositories_listed":0,"syntology":null},{"url":null,"slug":"ask-question-with-double-hints-visual","title":"Ask Question with Double Hints: Visual Question Generation with Answer-awareness and Region-reference","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-axioms-to-compute-verifiable","title":"Learning Axioms to Compute Verifiable Symbolic Expression Equivalence Proofs Using Graph-to-Sequence Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphpb-graphical-representations-of-prosody","title":"GraphPB: Graphical Representations of Prosody Boundary in Speech Synthesis","date":"2020-12-03","arxiv_id":"2012.02626","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-to-sequence-neural-machine-translation","title":"Graph-to-Sequence Neural Machine Translation","date":"2020-09-16","arxiv_id":"2009.07489","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-graph-to-sequence-learning-for-vision","title":"Sparse Graph to Sequence Learning for Vision Conditioned Long Textual Sequence Generation","date":"2020-07-12","arxiv_id":"2007.06077","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-graph-transformer-for-graph-to","title":"Heterogeneous Graph Transformer for Graph-to-Sequence Learning","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"line-graph-enhanced-amr-to-text-generation","title":"Line Graph Enhanced AMR-to-Text Generation with Mix-Order Graph Attention Networks","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-encode-evolutionary-knowledge-for","title":"Learning to Encode Evolutionary Knowledge for Automatic Commenting Long Novels","date":"2020-04-21","arxiv_id":"2004.09974","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphtts-graph-to-sequence-modelling-in","title":"GraphTTS: graph-to-sequence modelling in neural text-to-speech","date":"2020-03-04","arxiv_id":"2003.01924","repositories_listed":0,"syntology":null},{"url":null,"slug":"equivalence-of-dataflow-graphs-via-rewrite","title":"Equivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model","date":"2020-02-17","arxiv_id":"2002.06799","repositories_listed":0,"syntology":null},{"url":null,"slug":"amr-to-text-generation-with-graph-transformer","title":"AMR-To-Text Generation with Graph Transformer","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dyngraph2seq-dynamic-graph-to-sequence","title":"DynGraph2Seq: Dynamic-Graph-to-Sequence Interpretable Learning for Health Stage Prediction in Online Health Forums","date":"2019-08-22","arxiv_id":"1908.08497","repositories_listed":0,"syntology":null}],"syntology_records":11,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/task/graph-to-sequence/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/graph-to-sequence/papers/ran/1","json":"/task/graph-to-sequence/papers/ran/1.json","rows":11}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"53de7fc27467a48221f8fcfd3d93423df82f862176616ef590b44df0aabdde18","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}