{"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/translation/papers/2","list_of":"/task/translation","task":"Translation","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":124,"rows_per_page":100,"rows":[101,200],"of":12395,"counts":{"archive_papers_tagged":12395,"with_a_code_link":3574,"where_syntology_ran_a_sample":682,"not_listed_spam_title":0,"listed":12395,"listed_where_code_ran":682,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":566,"every_run_a_failure_of_syntologys_instrument":116,"listed_with_a_run_with_no_instrument_failure":566,"listed_every_run_a_failure_of_syntologys_instrument":116,"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/translation","prev":"/task/translation","next":"/task/translation/papers/3","papers":[{"url":"/paper/quicknat-a-fully-convolutional-network-for","slug":"quicknat-a-fully-convolutional-network-for","title":"QuickNAT: A Fully Convolutional Network for Quick and Accurate Segmentation of Neuroanatomy","date":"2018-01-12","arxiv_id":"1801.04161","repositories_listed":6,"syntology":null},{"url":"/paper/a-parallel-corpus-of-python-functions-and","slug":"a-parallel-corpus-of-python-functions-and","title":"A parallel corpus of Python functions and documentation strings for automated code documentation and code generation","date":"2017-07-07","arxiv_id":"1707.02275","repositories_listed":6,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-parallel-corpus-of-python-functions-and#ran","syntology_url":"https://syntology.ai/paper/1707.02275","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.02275"}},"official":{"repos":["Avmb/code-docstring-corpus"],"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/thumt-an-open-source-toolkit-for-neural","slug":"thumt-an-open-source-toolkit-for-neural","title":"THUMT: An Open Source Toolkit for Neural Machine Translation","date":"2017-06-20","arxiv_id":"1706.06415","repositories_listed":6,"syntology":null},{"url":"/paper/virtual-to-real-reinforcement-learning-for","slug":"virtual-to-real-reinforcement-learning-for","title":"Virtual to Real Reinforcement Learning for Autonomous Driving","date":"2017-04-13","arxiv_id":"1704.03952","repositories_listed":6,"syntology":null},{"url":"/paper/offline-bilingual-word-vectors-orthogonal","slug":"offline-bilingual-word-vectors-orthogonal","title":"Offline bilingual word vectors, orthogonal transformations and the inverted softmax","date":"2017-02-13","arxiv_id":"1702.03859","repositories_listed":6,"syntology":null},{"url":"/paper/attention-based-recurrent-neural-network","slug":"attention-based-recurrent-neural-network","title":"Attention-Based Recurrent Neural Network Models for Joint Intent Detection and Slot Filling","date":"2016-09-06","arxiv_id":"1609.01454","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attention-based-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1609.01454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.01454"}},"official":null}},{"url":"/paper/sequence-level-knowledge-distillation","slug":"sequence-level-knowledge-distillation","title":"Sequence-Level Knowledge Distillation","date":"2016-06-25","arxiv_id":"1606.07947","repositories_listed":6,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 1 unverified","sample_list":"/paper/sequence-level-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/1606.07947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.07947"}},"official":{"repos":["harvardnlp/nmt-android","harvardnlp/seq2seq-attn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-to-sequence-learning-as-beam-search","slug":"sequence-to-sequence-learning-as-beam-search","title":"Sequence-to-Sequence Learning as Beam-Search Optimization","date":"2016-06-09","arxiv_id":"1606.02960","repositories_listed":6,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequence-to-sequence-learning-as-beam-search#ran","syntology_url":"https://syntology.ai/paper/1606.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02960"}},"official":{"repos":["harvardnlp/BSO"],"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/palette-image-to-image-diffusion-models-1","slug":"palette-image-to-image-diffusion-models-1","title":"Palette: Image-to-Image Diffusion Models","date":"2021-11-10","arxiv_id":"2111.05826","repositories_listed":5,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/palette-image-to-image-diffusion-models-1#ran","syntology_url":"https://syntology.ai/paper/2111.05826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05826"}},"official":null}},{"url":"/paper/solving-the-electronic-schrodinger-equation","slug":"solving-the-electronic-schrodinger-equation","title":"Solving the electronic Schrödinger equation for multiple nuclear geometries with weight-sharing deep neural networks","date":"2021-05-18","arxiv_id":"2105.08351","repositories_listed":5,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-the-electronic-schrodinger-equation#ran","syntology_url":"https://syntology.ai/paper/2105.08351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08351"}},"official":{"repos":["mipunivie/deeperwin"],"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/informer-transformer-likes-informed-attention","slug":"informer-transformer-likes-informed-attention","title":"RealFormer: Transformer Likes Residual Attention","date":"2020-12-21","arxiv_id":"2012.11747","repositories_listed":5,"syntology":null},{"url":"/paper/unsupervised-monocular-depth-learning-in","slug":"unsupervised-monocular-depth-learning-in","title":"Unsupervised Monocular Depth Learning in Dynamic Scenes","date":"2020-10-30","arxiv_id":"2010.16404","repositories_listed":5,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_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) · 5 unverified","sample_list":"/paper/unsupervised-monocular-depth-learning-in#ran","syntology_url":"https://syntology.ai/paper/2010.16404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.16404"}},"official":{"repos":["google-research/google-research"],"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/fairseq-s2t-fast-speech-to-text-modeling-with","slug":"fairseq-s2t-fast-speech-to-text-modeling-with","title":"fairseq S2T: Fast Speech-to-Text Modeling with fairseq","date":"2020-10-11","arxiv_id":"2010.05171","repositories_listed":5,"syntology":null},{"url":"/paper/nearest-neighbor-machine-translation","slug":"nearest-neighbor-machine-translation","title":"Nearest Neighbor Machine Translation","date":"2020-10-01","arxiv_id":"2010.00710","repositories_listed":5,"syntology":{"n":10,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/nearest-neighbor-machine-translation#ran","syntology_url":"https://syntology.ai/paper/2010.00710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00710"}},"official":{"repos":["urvashik/knnlm"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/se-3-transformers-3d-roto-translation","slug":"se-3-transformers-3d-roto-translation","title":"SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks","date":"2020-06-18","arxiv_id":"2006.10503","repositories_listed":5,"syntology":{"n":28,"n_ran":22,"n_constructed":0,"n_ran_checked":21,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":0,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/se-3-transformers-3d-roto-translation#ran","syntology_url":"https://syntology.ai/paper/2006.10503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10503"}},"official":{"repos":["FabianFuchsML/se3-transformer-public"],"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/editable-neural-networks-1","slug":"editable-neural-networks-1","title":"Editable Neural Networks","date":"2020-04-01","arxiv_id":"2004.00345","repositories_listed":5,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/editable-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2004.00345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00345"}},"official":{"repos":["editable-ICLR2020/editable","xtinkt/editable"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/disrupting-deepfakes-adversarial-attacks","slug":"disrupting-deepfakes-adversarial-attacks","title":"Disrupting Deepfakes: Adversarial Attacks Against Conditional Image Translation Networks and Facial Manipulation Systems","date":"2020-03-03","arxiv_id":"2003.01279","repositories_listed":5,"syntology":null},{"url":"/paper/a-probabilistic-formulation-of-unsupervised-1","slug":"a-probabilistic-formulation-of-unsupervised-1","title":"A Probabilistic Formulation of Unsupervised Text Style Transfer","date":"2020-02-10","arxiv_id":"2002.03912","repositories_listed":5,"syntology":{"n":25,"n_ran":18,"n_constructed":13,"n_ran_checked":11,"n_instrument":7,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":12,"phrase":"18 ran (of which 13 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 7 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-probabilistic-formulation-of-unsupervised-1#ran","syntology_url":"https://syntology.ai/paper/2002.03912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03912"}},"official":{"repos":["cindyxinyiwang/deep-latent-sequence-model"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/transformers-without-tears-improving-the","slug":"transformers-without-tears-improving-the","title":"Transformers without Tears: Improving the Normalization of Self-Attention","date":"2019-10-14","arxiv_id":"1910.05895","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/transformers-without-tears-improving-the#ran","syntology_url":"https://syntology.ai/paper/1910.05895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05895"}},"official":{"repos":["tnq177/transformers_without_tears"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reducing-transformer-depth-on-demand-with-1","slug":"reducing-transformer-depth-on-demand-with-1","title":"Reducing Transformer Depth on Demand with Structured Dropout","date":"2019-09-25","arxiv_id":"1909.11556","repositories_listed":5,"syntology":null},{"url":"/paper/facebook-fairs-wmt19-news-translation-task","slug":"facebook-fairs-wmt19-news-translation-task","title":"Facebook FAIR's WMT19 News Translation Task Submission","date":"2019-07-15","arxiv_id":"1907.06616","repositories_listed":5,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/facebook-fairs-wmt19-news-translation-task#ran","syntology_url":"https://syntology.ai/paper/1907.06616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.06616"}},"official":null}},{"url":"/paper/learning-multimodal-graph-to-graph-1","slug":"learning-multimodal-graph-to-graph-1","title":"Learning Multimodal Graph-to-Graph Translation for Molecular Optimization","date":"2018-12-03","arxiv_id":"1812.01070","repositories_listed":5,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 1 unverified","sample_list":"/paper/learning-multimodal-graph-to-graph-1#ran","syntology_url":"https://syntology.ai/paper/1812.01070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01070"}},"official":{"repos":["wengong-jin/iclr19-graph2graph"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-learning-for-machine-reading","slug":"multi-task-learning-for-machine-reading","title":"Multi-task Learning with Sample Re-weighting for Machine Reading Comprehension","date":"2018-09-18","arxiv_id":"1809.06963","repositories_listed":5,"syntology":null},{"url":"/paper/scaling-neural-machine-translation","slug":"scaling-neural-machine-translation","title":"Scaling Neural Machine Translation","date":"2018-06-01","arxiv_id":"1806.00187","repositories_listed":5,"syntology":null},{"url":"/paper/adafactor-adaptive-learning-rates-with","slug":"adafactor-adaptive-learning-rates-with","title":"Adafactor: Adaptive Learning Rates with Sublinear Memory Cost","date":"2018-04-11","arxiv_id":"1804.04235","repositories_listed":5,"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/adafactor-adaptive-learning-rates-with#ran","syntology_url":"https://syntology.ai/paper/1804.04235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.04235"}},"official":null}},{"url":"/paper/tensor-field-networks-rotation-and","slug":"tensor-field-networks-rotation-and","title":"Tensor field networks: Rotation- and translation-equivariant neural networks for 3D point clouds","date":"2018-02-22","arxiv_id":"1802.08219","repositories_listed":5,"syntology":{"n":19,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":10,"phrase":"4 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; 2 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/tensor-field-networks-rotation-and#ran","syntology_url":"https://syntology.ai/paper/1802.08219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.08219"}},"official":{"repos":["tensorfieldnetworks/tensorfieldnetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":8,"ran_from_kinds":["listed"]}}},{"url":"/paper/weighted-transformer-network-for-machine","slug":"weighted-transformer-network-for-machine","title":"Weighted Transformer Network for Machine Translation","date":"2017-11-06","arxiv_id":"1711.02132","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/weighted-transformer-network-for-machine#ran","syntology_url":"https://syntology.ai/paper/1711.02132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02132"}},"official":null}},{"url":"/paper/neural-machine-translation","slug":"neural-machine-translation","title":"Neural Machine Translation","date":"2017-09-22","arxiv_id":"1709.07809","repositories_listed":5,"syntology":null},{"url":"/paper/learned-in-translation-contextualized-word","slug":"learned-in-translation-contextualized-word","title":"Learned in Translation: Contextualized Word Vectors","date":"2017-08-01","arxiv_id":"1708.00107","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learned-in-translation-contextualized-word#ran","syntology_url":"https://syntology.ai/paper/1708.00107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.00107"}},"official":{"repos":["salesforce/cove"],"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/lidar-camera-calibration-using-3d-3d-point","slug":"lidar-camera-calibration-using-3d-3d-point","title":"LiDAR-Camera Calibration using 3D-3D Point correspondences","date":"2017-05-27","arxiv_id":"1705.09785","repositories_listed":5,"syntology":null},{"url":"/paper/a-convolutional-attention-network-for-extreme","slug":"a-convolutional-attention-network-for-extreme","title":"A Convolutional Attention Network for Extreme Summarization of Source Code","date":"2016-02-09","arxiv_id":"1602.03001","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-convolutional-attention-network-for-extreme#ran","syntology_url":"https://syntology.ai/paper/1602.03001","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.03001"}},"official":null}},{"url":"/paper/addressing-the-rare-word-problem-in-neural","slug":"addressing-the-rare-word-problem-in-neural","title":"Addressing the Rare Word Problem in Neural Machine Translation","date":"2014-10-30","arxiv_id":"1410.8206","repositories_listed":5,"syntology":null},{"url":"/paper/pixelshuffler-a-simple-image-translation","slug":"pixelshuffler-a-simple-image-translation","title":"PixelShuffler: A Simple Image Translation Through Pixel Rearrangement","date":"2024-10-03","arxiv_id":"2410.03021","repositories_listed":4,"syntology":null},{"url":"/paper/tower-an-open-multilingual-large-language","slug":"tower-an-open-multilingual-large-language","title":"Tower: An Open Multilingual Large Language Model for Translation-Related Tasks","date":"2024-02-27","arxiv_id":"2402.17733","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/tower-an-open-multilingual-large-language#ran","syntology_url":"https://syntology.ai/paper/2402.17733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17733"}},"official":{"repos":["deep-spin/tower-eval","epfllm/megatron-llm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/quantifying-the-plausibility-of-context","slug":"quantifying-the-plausibility-of-context","title":"Quantifying the Plausibility of Context Reliance in Neural Machine Translation","date":"2023-10-02","arxiv_id":"2310.01188","repositories_listed":4,"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":2,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/quantifying-the-plausibility-of-context#ran","syntology_url":"https://syntology.ai/paper/2310.01188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01188"}},"official":{"repos":["inseq-team/inseq","gsarti/pecore"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/seamlessm4t-massively-multilingual-multimodal","slug":"seamlessm4t-massively-multilingual-multimodal","title":"SeamlessM4T: Massively Multilingual & Multimodal Machine Translation","date":"2023-08-22","arxiv_id":"2308.11596","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/seamlessm4t-massively-multilingual-multimodal#ran","syntology_url":"https://syntology.ai/paper/2308.11596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11596"}},"official":{"repos":["facebookresearch/seamless_communication"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-models-are-state-of-the-art","slug":"large-language-models-are-state-of-the-art","title":"Large Language Models Are State-of-the-Art Evaluators of Translation Quality","date":"2023-02-28","arxiv_id":"2302.14520","repositories_listed":4,"syntology":null},{"url":"/paper/plug-and-play-diffusion-features-for-text","slug":"plug-and-play-diffusion-features-for-text","title":"Plug-and-Play Diffusion Features for Text-Driven Image-to-Image Translation","date":"2022-11-22","arxiv_id":"2211.12572","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/plug-and-play-diffusion-features-for-text#ran","syntology_url":"https://syntology.ai/paper/2211.12572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12572"}},"official":{"repos":["MichalGeyer/plug-and-play"],"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/model-and-data-transfer-for-cross-lingual","slug":"model-and-data-transfer-for-cross-lingual","title":"Model and Data Transfer for Cross-Lingual Sequence Labelling in Zero-Resource Settings","date":"2022-10-23","arxiv_id":"2210.12623","repositories_listed":4,"syntology":null},{"url":"/paper/a-simple-multi-modality-transfer-learning","slug":"a-simple-multi-modality-transfer-learning","title":"A Simple Multi-Modality Transfer Learning Baseline for Sign Language Translation","date":"2022-03-08","arxiv_id":"2203.04287","repositories_listed":4,"syntology":{"n":10,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/a-simple-multi-modality-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/2203.04287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04287"}},"official":{"repos":["FangyunWei/SLRT"],"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/gemnet-universal-directional-graph-neural","slug":"gemnet-universal-directional-graph-neural","title":"GemNet: Universal Directional Graph Neural Networks for Molecules","date":"2021-06-02","arxiv_id":"2106.08903","repositories_listed":4,"syntology":null},{"url":"/paper/a-practical-method-for-constructing","slug":"a-practical-method-for-constructing","title":"A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups","date":"2021-04-19","arxiv_id":"2104.09459","repositories_listed":4,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/a-practical-method-for-constructing#ran","syntology_url":"https://syntology.ai/paper/2104.09459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09459"}},"official":{"repos":["mfinzi/equivariant-MLP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stylized-neural-painting","slug":"stylized-neural-painting","title":"Stylized Neural Painting","date":"2020-11-16","arxiv_id":"2011.08114","repositories_listed":4,"syntology":null},{"url":"/paper/participatory-research-for-low-resourced","slug":"participatory-research-for-low-resourced","title":"Participatory Research for Low-resourced Machine Translation: A Case Study in African Languages","date":"2020-10-05","arxiv_id":"2010.02353","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/participatory-research-for-low-resourced#ran","syntology_url":"https://syntology.ai/paper/2010.02353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02353"}},"official":{"repos":["masakhane-io/masakhane-mt"],"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/very-deep-transformers-for-neural-machine","slug":"very-deep-transformers-for-neural-machine","title":"Very Deep Transformers for Neural Machine Translation","date":"2020-08-18","arxiv_id":"2008.07772","repositories_listed":4,"syntology":{"n":9,"n_ran":8,"n_constructed":2,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/very-deep-transformers-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2008.07772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07772"}},"official":{"repos":["namisan/exdeep-nmt"],"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/few-shot-knowledge-transfer-for-fine-grained","slug":"few-shot-knowledge-transfer-for-fine-grained","title":"Few-shot Knowledge Transfer for Fine-grained Cartoon Face Generation","date":"2020-07-27","arxiv_id":"2007.13332","repositories_listed":4,"syntology":null},{"url":"/paper/hat-hardware-aware-transformers-for-efficient","slug":"hat-hardware-aware-transformers-for-efficient","title":"HAT: Hardware-Aware Transformers for Efficient Natural Language Processing","date":"2020-05-28","arxiv_id":"2005.14187","repositories_listed":4,"syntology":null},{"url":"/paper/unsupervised-quality-estimation-for-neural","slug":"unsupervised-quality-estimation-for-neural","title":"Unsupervised Quality Estimation for Neural Machine Translation","date":"2020-05-21","arxiv_id":"2005.10608","repositories_listed":4,"syntology":null},{"url":"/paper/accessing-higher-level-representations-in","slug":"accessing-higher-level-representations-in","title":"Addressing Some Limitations of Transformers with Feedback Memory","date":"2020-02-21","arxiv_id":"2002.09402","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accessing-higher-level-representations-in#ran","syntology_url":"https://syntology.ai/paper/2002.09402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09402"}},"official":{"repos":["facebookresearch/transformer-sequential"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/ganilla-generative-adversarial-networks-for","slug":"ganilla-generative-adversarial-networks-for","title":"GANILLA: Generative Adversarial Networks for Image to Illustration Translation","date":"2020-02-13","arxiv_id":"2002.05638","repositories_listed":4,"syntology":null},{"url":"/paper/moverscore-text-generation-evaluating-with","slug":"moverscore-text-generation-evaluating-with","title":"MoverScore: Text Generation Evaluating with Contextualized Embeddings and Earth Mover Distance","date":"2019-09-05","arxiv_id":"1909.02622","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/moverscore-text-generation-evaluating-with#ran","syntology_url":"https://syntology.ai/paper/1909.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.02622"}},"official":null}},{"url":"/paper/when-does-label-smoothing-help","slug":"when-does-label-smoothing-help","title":"When Does Label Smoothing Help?","date":"2019-06-06","arxiv_id":"1906.02629","repositories_listed":4,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/when-does-label-smoothing-help#ran","syntology_url":"https://syntology.ai/paper/1906.02629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02629"}},"official":null}},{"url":"/paper/drit-diverse-image-to-image-translation-via","slug":"drit-diverse-image-to-image-translation-via","title":"DRIT++: Diverse Image-to-Image Translation via Disentangled Representations","date":"2019-05-02","arxiv_id":"1905.01270","repositories_listed":4,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 5 unverified","sample_list":"/paper/drit-diverse-image-to-image-translation-via#ran","syntology_url":"https://syntology.ai/paper/1905.01270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01270"}},"official":null}},{"url":"/paper/transformers-with-convolutional-context-for","slug":"transformers-with-convolutional-context-for","title":"Transformers with convolutional context for ASR","date":"2019-04-26","arxiv_id":"1904.11660","repositories_listed":4,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transformers-with-convolutional-context-for#ran","syntology_url":"https://syntology.ai/paper/1904.11660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11660"}},"official":null}},{"url":"/paper/vatex-a-large-scale-high-quality-multilingual","slug":"vatex-a-large-scale-high-quality-multilingual","title":"VATEX: A Large-Scale, High-Quality Multilingual Dataset for Video-and-Language Research","date":"2019-04-06","arxiv_id":"1904.03493","repositories_listed":4,"syntology":null},{"url":"/paper/stochastic-beams-and-where-to-find-them-the","slug":"stochastic-beams-and-where-to-find-them-the","title":"Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacement","date":"2019-03-14","arxiv_id":"1903.06059","repositories_listed":4,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":17,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/stochastic-beams-and-where-to-find-them-the#ran","syntology_url":"https://syntology.ai/paper/1903.06059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.06059"}},"official":{"repos":["wouterkool/stochastic-beam-search"],"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/memory-efficient-adaptive-optimization-for","slug":"memory-efficient-adaptive-optimization-for","title":"Memory-Efficient Adaptive Optimization","date":"2019-01-30","arxiv_id":"1901.11150","repositories_listed":4,"syntology":null},{"url":"/paper/dgc-net-dense-geometric-correspondence","slug":"dgc-net-dense-geometric-correspondence","title":"DGC-Net: Dense Geometric Correspondence Network","date":"2018-10-19","arxiv_id":"1810.08393","repositories_listed":4,"syntology":null},{"url":"/paper/texar-a-modularized-versatile-and-extensible-1","slug":"texar-a-modularized-versatile-and-extensible-1","title":"Texar: A Modularized, Versatile, and Extensible Toolkit for Text Generation","date":"2018-09-04","arxiv_id":"1809.00794","repositories_listed":4,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/texar-a-modularized-versatile-and-extensible-1#ran","syntology_url":"https://syntology.ai/paper/1809.00794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.00794"}},"official":{"repos":["asyml/texar"],"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/improving-shape-deformation-in-unsupervised","slug":"improving-shape-deformation-in-unsupervised","title":"Improving Shape Deformation in Unsupervised Image-to-Image Translation","date":"2018-08-13","arxiv_id":"1808.04325","repositories_listed":4,"syntology":null},{"url":"/paper/leflow-enabling-flexible-fpga-high-level","slug":"leflow-enabling-flexible-fpga-high-level","title":"LeFlow: Enabling Flexible FPGA High-Level Synthesis of Tensorflow Deep Neural Networks","date":"2018-07-14","arxiv_id":"1807.05317","repositories_listed":4,"syntology":null},{"url":"/paper/a-universal-music-translation-network","slug":"a-universal-music-translation-network","title":"A Universal Music Translation Network","date":"2018-05-21","arxiv_id":"1805.07848","repositories_listed":4,"syntology":null},{"url":"/paper/loss-in-translation-learning-bilingual-word","slug":"loss-in-translation-learning-bilingual-word","title":"Loss in Translation: Learning Bilingual Word Mapping with a Retrieval Criterion","date":"2018-04-20","arxiv_id":"1804.07745","repositories_listed":4,"syntology":null},{"url":"/paper/training-tips-for-the-transformer-model","slug":"training-tips-for-the-transformer-model","title":"Training Tips for the Transformer Model","date":"2018-04-01","arxiv_id":"1804.00247","repositories_listed":4,"syntology":null},{"url":"/paper/multimodal-generative-models-for-scalable","slug":"multimodal-generative-models-for-scalable","title":"Multimodal Generative Models for Scalable Weakly-Supervised Learning","date":"2018-02-14","arxiv_id":"1802.05335","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multimodal-generative-models-for-scalable#ran","syntology_url":"https://syntology.ai/paper/1802.05335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05335"}},"official":null}},{"url":"/paper/non-adversarial-unsupervised-word-translation","slug":"non-adversarial-unsupervised-word-translation","title":"Non-Adversarial Unsupervised Word Translation","date":"2018-01-18","arxiv_id":"1801.06126","repositories_listed":4,"syntology":null},{"url":"/paper/convolutional-image-captioning","slug":"convolutional-image-captioning","title":"Convolutional Image Captioning","date":"2017-11-24","arxiv_id":"1711.09151","repositories_listed":4,"syntology":null},{"url":"/paper/xgan-unsupervised-image-to-image-translation","slug":"xgan-unsupervised-image-to-image-translation","title":"XGAN: Unsupervised Image-to-Image Translation for Many-to-Many Mappings","date":"2017-11-14","arxiv_id":"1711.05139","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"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; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/xgan-unsupervised-image-to-image-translation#ran","syntology_url":"https://syntology.ai/paper/1711.05139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05139"}},"official":null}},{"url":"/paper/improving-lexical-choice-in-neural-machine","slug":"improving-lexical-choice-in-neural-machine","title":"Improving Lexical Choice in Neural Machine Translation","date":"2017-10-03","arxiv_id":"1710.01329","repositories_listed":4,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/improving-lexical-choice-in-neural-machine#ran","syntology_url":"https://syntology.ai/paper/1710.01329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.01329"}},"official":{"repos":["tnq177/improving_lexical_choice_in_nmt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/towards-neural-phrase-based-machine","slug":"towards-neural-phrase-based-machine","title":"Towards Neural Phrase-based Machine Translation","date":"2017-06-17","arxiv_id":"1706.05565","repositories_listed":4,"syntology":null},{"url":"/paper/learning-to-skim-text","slug":"learning-to-skim-text","title":"Learning to Skim Text","date":"2017-04-23","arxiv_id":"1704.06877","repositories_listed":4,"syntology":null},{"url":"/paper/nematus-a-toolkit-for-neural-machine","slug":"nematus-a-toolkit-for-neural-machine","title":"Nematus: a Toolkit for Neural Machine Translation","date":"2017-03-13","arxiv_id":"1703.04357","repositories_listed":4,"syntology":null},{"url":"/paper/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","repositories_listed":4,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 4 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) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}},"official":null}},{"url":"/paper/opennmt-open-source-toolkit-for-neural","slug":"opennmt-open-source-toolkit-for-neural","title":"OpenNMT: Open-Source Toolkit for Neural Machine Translation","date":"2017-01-10","arxiv_id":"1701.02810","repositories_listed":4,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/opennmt-open-source-toolkit-for-neural#ran","syntology_url":"https://syntology.ai/paper/1701.02810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.02810"}},"official":{"repos":["OpenNMT/OpenNMT"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/mlpnp-a-real-time-maximum-likelihood-solution","slug":"mlpnp-a-real-time-maximum-likelihood-solution","title":"MLPnP - A Real-Time Maximum Likelihood Solution to the Perspective-n-Point Problem","date":"2016-07-27","arxiv_id":"1607.08112","repositories_listed":4,"syntology":null},{"url":"/paper/learning-to-transduce-with-unbounded-memory","slug":"learning-to-transduce-with-unbounded-memory","title":"Learning to Transduce with Unbounded Memory","date":"2015-06-08","arxiv_id":"1506.02516","repositories_listed":4,"syntology":null},{"url":"/paper/spectral-networks-and-locally-connected","slug":"spectral-networks-and-locally-connected","title":"Spectral Networks and Locally Connected Networks on Graphs","date":"2013-12-21","arxiv_id":"1312.6203","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spectral-networks-and-locally-connected#ran","syntology_url":"https://syntology.ai/paper/1312.6203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.6203"}},"official":null}},{"url":"/paper/registering-source-tokens-to-target-language","slug":"registering-source-tokens-to-target-language","title":"Registering Source Tokens to Target Language Spaces in Multilingual Neural Machine Translation","date":"2025-01-06","arxiv_id":"2501.02979","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/registering-source-tokens-to-target-language#ran","syntology_url":"https://syntology.ai/paper/2501.02979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.02979"}},"official":{"repos":["zhiqu22/mitre","huggingface.co/naist-nlp/mitre_466m","huggingface.co/naist-nlp/mitre_913m"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rad-a-metric-for-medical-image-distribution","slug":"rad-a-metric-for-medical-image-distribution","title":"Fréchet Radiomic Distance (FRD): A Versatile Metric for Comparing Medical Imaging Datasets","date":"2024-12-02","arxiv_id":"2412.01496","repositories_listed":3,"syntology":null},{"url":"/paper/m-rewardbench-evaluating-reward-models-in","slug":"m-rewardbench-evaluating-reward-models-in","title":"M-RewardBench: Evaluating Reward Models in Multilingual Settings","date":"2024-10-20","arxiv_id":"2410.15522","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/m-rewardbench-evaluating-reward-models-in#ran","syntology_url":"https://syntology.ai/paper/2410.15522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.15522"}},"official":{"repos":["for-ai/m-rewardbench"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/ladder-a-model-agnostic-framework-boosting","slug":"ladder-a-model-agnostic-framework-boosting","title":"Ladder: A Model-Agnostic Framework Boosting LLM-based Machine Translation to the Next Level","date":"2024-06-22","arxiv_id":"2406.15741","repositories_listed":3,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/ladder-a-model-agnostic-framework-boosting#ran","syntology_url":"https://syntology.ai/paper/2406.15741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15741"}},"official":{"repos":["fzp0424/ladder","fzp0424/mt-ladder"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-driven-platform-for-systematic","slug":"ai-driven-platform-for-systematic","title":"ShennongAlpha: an AI-driven sharing and collaboration platform for intelligent curation, acquisition, and translation of natural medicinal material knowledge","date":"2023-12-27","arxiv_id":"2401.00020","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai-driven-platform-for-systematic#ran","syntology_url":"https://syntology.ai/paper/2401.00020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00020"}},"official":{"repos":["shennong-program/pycgs","shennong-program/shennongname","shennong-program/mlmd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/medgen-a-python-natural-language-processing","slug":"medgen-a-python-natural-language-processing","title":"Ascle: A Python Natural Language Processing Toolkit for Medical Text Generation","date":"2023-11-28","arxiv_id":"2311.16588","repositories_listed":3,"syntology":null},{"url":"/paper/xcomet-transparent-machine-translation","slug":"xcomet-transparent-machine-translation","title":"xCOMET: Transparent Machine Translation Evaluation through Fine-grained Error Detection","date":"2023-10-16","arxiv_id":"2310.10482","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/xcomet-transparent-machine-translation#ran","syntology_url":"https://syntology.ai/paper/2310.10482","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10482"}},"official":null}},{"url":"/paper/modality-cycles-with-masked-conditional","slug":"modality-cycles-with-masked-conditional","title":"Modality Cycles with Masked Conditional Diffusion for Unsupervised Anomaly Segmentation in MRI","date":"2023-08-30","arxiv_id":"2308.16150","repositories_listed":3,"syntology":null},{"url":"/paper/autotamp-autoregressive-task-and-motion","slug":"autotamp-autoregressive-task-and-motion","title":"AutoTAMP: Autoregressive Task and Motion Planning with LLMs as Translators and Checkers","date":"2023-06-10","arxiv_id":"2306.06531","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autotamp-autoregressive-task-and-motion#ran","syntology_url":"https://syntology.ai/paper/2306.06531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06531"}},"official":{"repos":["yongchao98/autotamp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-transformer-inference-for","slug":"accelerating-transformer-inference-for","title":"Accelerating Transformer Inference for Translation via Parallel Decoding","date":"2023-05-17","arxiv_id":"2305.10427","repositories_listed":3,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/accelerating-transformer-inference-for#ran","syntology_url":"https://syntology.ai/paper/2305.10427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10427"}},"official":{"repos":["teelinsan/parallel-decoding"],"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/nebla-neural-beer-lambert-for-3d","slug":"nebla-neural-beer-lambert-for-3d","title":"NeBLa: Neural Beer-Lambert for 3D Reconstruction of Oral Structures from Panoramic Radiographs","date":"2023-04-08","arxiv_id":"2304.04027","repositories_listed":3,"syntology":null},{"url":"/paper/otre-where-optimal-transport-guided-unpaired","slug":"otre-where-optimal-transport-guided-unpaired","title":"OTRE: Where Optimal Transport Guided Unpaired Image-to-Image Translation Meets Regularization by Enhancing","date":"2023-02-06","arxiv_id":"2302.03003","repositories_listed":3,"syntology":null},{"url":"/paper/small-100-introducing-shallow-multilingual","slug":"small-100-introducing-shallow-multilingual","title":"SMaLL-100: Introducing Shallow Multilingual Machine Translation Model for Low-Resource Languages","date":"2022-10-20","arxiv_id":"2210.11621","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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","sample_list":"/paper/small-100-introducing-shallow-multilingual#ran","syntology_url":"https://syntology.ai/paper/2210.11621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.11621"}},"official":{"repos":["alirezamshi/small100"],"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"]}}},{"url":"/paper/towards-robust-k-nearest-neighbor-machine","slug":"towards-robust-k-nearest-neighbor-machine","title":"Towards Robust k-Nearest-Neighbor Machine Translation","date":"2022-10-17","arxiv_id":"2210.08808","repositories_listed":3,"syntology":null},{"url":"/paper/ring-roto-translation-invariant-gram-for","slug":"ring-roto-translation-invariant-gram-for","title":"RING++: Roto-translation Invariant Gram for Global Localization on a Sparse Scan Map","date":"2022-10-12","arxiv_id":"2210.05984","repositories_listed":3,"syntology":null},{"url":"/paper/conditional-antibody-design-as-3d-equivariant","slug":"conditional-antibody-design-as-3d-equivariant","title":"Conditional Antibody Design as 3D Equivariant Graph Translation","date":"2022-08-12","arxiv_id":"2208.06073","repositories_listed":3,"syntology":{"n":26,"n_ran":21,"n_constructed":1,"n_ran_checked":14,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":12,"n_pointer_only":11,"phrase":"21 ran (of which 1 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 2 violated, 12 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/conditional-antibody-design-as-3d-equivariant#ran","syntology_url":"https://syntology.ai/paper/2208.06073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06073"}},"official":{"repos":["thunlp-mt/mean"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/dct-net-domain-calibrated-translation-for","slug":"dct-net-domain-calibrated-translation-for","title":"DCT-Net: Domain-Calibrated Translation for Portrait Stylization","date":"2022-07-06","arxiv_id":"2207.02426","repositories_listed":3,"syntology":null},{"url":"/paper/preparing-an-endangered-language-for-the","slug":"preparing-an-endangered-language-for-the","title":"Preparing an Endangered Language for the Digital Age: The Case of Judeo-Spanish","date":"2022-05-31","arxiv_id":"2205.15599","repositories_listed":3,"syntology":null},{"url":"/paper/multilingual-machine-translation-with-hyper","slug":"multilingual-machine-translation-with-hyper","title":"Multilingual Machine Translation with Hyper-Adapters","date":"2022-05-22","arxiv_id":"2205.10835","repositories_listed":3,"syntology":null},{"url":"/paper/neural-optimal-transport","slug":"neural-optimal-transport","title":"Neural Optimal Transport","date":"2022-01-28","arxiv_id":"2201.12220","repositories_listed":3,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/neural-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2201.12220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12220"}},"official":{"repos":["iamalexkorotin/neuraloptimaltransport"],"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/hyperbolic-procrustes-analysis-using","slug":"hyperbolic-procrustes-analysis-using","title":"Hyperbolic Procrustes Analysis Using Riemannian Geometry","date":"2021-12-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/mmd-aggregated-two-sample-test","slug":"mmd-aggregated-two-sample-test","title":"MMD Aggregated Two-Sample Test","date":"2021-10-28","arxiv_id":"2110.15073","repositories_listed":3,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mmd-aggregated-two-sample-test#ran","syntology_url":"https://syntology.ai/paper/2110.15073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15073"}},"official":{"repos":["antoninschrab/mmdagg"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/natural-sql-making-sql-easier-to-infer-from","slug":"natural-sql-making-sql-easier-to-infer-from","title":"Natural SQL: Making SQL Easier to Infer from Natural Language Specifications","date":"2021-09-11","arxiv_id":"2109.05153","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/natural-sql-making-sql-easier-to-infer-from#ran","syntology_url":"https://syntology.ai/paper/2109.05153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05153"}},"official":{"repos":["ygan/natsql"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"b3d0c24d61300f37eb99d5486ce29f93c42453f0093026a7cb4f86fd4fe1b466","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}