{"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/time-series-1/papers/ran/7","list_of":"/task/time-series-1","task":"Time Series","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":7,"pages_in_order":7,"rows_per_page":100,"rows":[601,647],"of":647,"counts":{"archive_papers_tagged":9169,"with_a_code_link":2973,"where_syntology_ran_a_sample":647,"not_listed_spam_title":0,"listed":9169,"listed_where_code_ran":647,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":559,"every_run_a_failure_of_syntologys_instrument":88,"listed_with_a_run_with_no_instrument_failure":559,"listed_every_run_a_failure_of_syntologys_instrument":88,"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/time-series-1/papers/ran/1","prev":"/task/time-series-1/papers/ran/6","next":null,"papers":[{"url":"/paper/recurrent-kalman-networks-factorized","slug":"recurrent-kalman-networks-factorized","title":"Recurrent Kalman Networks: Factorized Inference in High-Dimensional Deep Feature Spaces","date":"2019-05-17","arxiv_id":"1905.07357","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/recurrent-kalman-networks-factorized#ran","syntology_url":"https://syntology.ai/paper/1905.07357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07357"}},"official":null}},{"url":"/paper/think-globally-act-locally-a-deep-neural","slug":"think-globally-act-locally-a-deep-neural","title":"Think Globally, Act Locally: A Deep Neural Network Approach to High-Dimensional Time Series Forecasting","date":"2019-05-09","arxiv_id":"1905.03806","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/think-globally-act-locally-a-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1905.03806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.03806"}},"official":{"repos":["rajatsen91/deepglo"],"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","unlocated"]}}},{"url":"/paper/190409406","slug":"190409406","title":"DeepMoD: Deep learning for Model Discovery in noisy data","date":"2019-04-20","arxiv_id":"1904.09406","repositories_listed":2,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/190409406#ran","syntology_url":"https://syntology.ai/paper/1904.09406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09406"}},"official":{"repos":["PhIMaL/DeePyMoD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/forecasting-with-time-series-imaging","slug":"forecasting-with-time-series-imaging","title":"Forecasting with time series imaging","date":"2019-04-17","arxiv_id":"1904.08064","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/forecasting-with-time-series-imaging#ran","syntology_url":"https://syntology.ai/paper/1904.08064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08064"}},"official":{"repos":["lixixibj/forecasting-with-time-series-imaging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/time-series-deconfounder-estimating-treatment","slug":"time-series-deconfounder-estimating-treatment","title":"Time Series Deconfounder: Estimating Treatment Effects over Time in the Presence of Hidden Confounders","date":"2019-02-01","arxiv_id":"1902.00450","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/time-series-deconfounder-estimating-treatment#ran","syntology_url":"https://syntology.ai/paper/1902.00450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00450"}},"official":{"repos":["bitbucket.org/mvdschaar/mlforhealthlabpub","ioanabica/Time-Series-Deconfounder"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-scalable-representation-learning","slug":"unsupervised-scalable-representation-learning","title":"Unsupervised Scalable Representation Learning for Multivariate Time Series","date":"2019-01-30","arxiv_id":"1901.10738","repositories_listed":1,"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/unsupervised-scalable-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1901.10738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10738"}},"official":{"repos":["White-Link/UnsupervisedScalableRepresentationLearningTimeSeries"],"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/recurrent-neural-filters-learning-independent","slug":"recurrent-neural-filters-learning-independent","title":"Recurrent Neural Filters: Learning Independent Bayesian Filtering Steps for Time Series Prediction","date":"2019-01-23","arxiv_id":"1901.08096","repositories_listed":1,"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":1,"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/recurrent-neural-filters-learning-independent#ran","syntology_url":"https://syntology.ai/paper/1901.08096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08096"}},"official":{"repos":["sjblim/rnf-ijcnn-2020"],"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/kernel-change-point-detection-with-auxiliary","slug":"kernel-change-point-detection-with-auxiliary","title":"Kernel Change-point Detection with Auxiliary Deep Generative Models","date":"2019-01-18","arxiv_id":"1901.06077","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kernel-change-point-detection-with-auxiliary#ran","syntology_url":"https://syntology.ai/paper/1901.06077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.06077"}},"official":{"repos":["OctoberChang/klcpd_code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/robuststl-a-robust-seasonal-trend","slug":"robuststl-a-robust-seasonal-trend","title":"RobustSTL: A Robust Seasonal-Trend Decomposition Algorithm for Long Time Series","date":"2018-12-05","arxiv_id":"1812.01767","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robuststl-a-robust-seasonal-trend#ran","syntology_url":"https://syntology.ai/paper/1812.01767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01767"}},"official":null}},{"url":"/paper/a-deep-neural-network-for-unsupervised","slug":"a-deep-neural-network-for-unsupervised","title":"A Deep Neural Network for Unsupervised Anomaly Detection and Diagnosis in Multivariate Time Series Data","date":"2018-11-20","arxiv_id":"1811.08055","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/a-deep-neural-network-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1811.08055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.08055"}},"official":null}},{"url":"/paper/t-cgan-conditional-generative-adversarial","slug":"t-cgan-conditional-generative-adversarial","title":"T-CGAN: Conditional Generative Adversarial Network for Data Augmentation in Noisy Time Series with Irregular Sampling","date":"2018-11-20","arxiv_id":"1811.08295","repositories_listed":2,"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":1,"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/t-cgan-conditional-generative-adversarial#ran","syntology_url":"https://syntology.ai/paper/1811.08295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.08295"}},"official":null}},{"url":"/paper/the-uea-multivariate-time-series","slug":"the-uea-multivariate-time-series","title":"The UEA multivariate time series classification archive, 2018","date":"2018-10-31","arxiv_id":"1811.00075","repositories_listed":3,"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/the-uea-multivariate-time-series#ran","syntology_url":"https://syntology.ai/paper/1811.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00075"}},"official":null}},{"url":"/paper/on-line-learning-of-linear-dynamical-systems","slug":"on-line-learning-of-linear-dynamical-systems","title":"On-Line Learning of Linear Dynamical Systems: Exponential Forgetting in Kalman Filters","date":"2018-09-16","arxiv_id":"1809.05870","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/on-line-learning-of-linear-dynamical-systems#ran","syntology_url":"https://syntology.ai/paper/1809.05870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.05870"}},"official":null}},{"url":"/paper/deep-learning-for-time-series-classification","slug":"deep-learning-for-time-series-classification","title":"Deep learning for time series classification: a review","date":"2018-09-12","arxiv_id":"1809.04356","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-learning-for-time-series-classification#ran","syntology_url":"https://syntology.ai/paper/1809.04356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.04356"}},"official":{"repos":["hfawaz/dl-4-tsc"],"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","unlocated"]}}},{"url":"/paper/constrained-generation-of-semantically-valid","slug":"constrained-generation-of-semantically-valid","title":"Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoders","date":"2018-09-07","arxiv_id":"1809.02630","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/constrained-generation-of-semantically-valid#ran","syntology_url":"https://syntology.ai/paper/1809.02630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02630"}},"official":{"repos":["Microsoft/constrained-graph-variational-autoencoder"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/data-augmentation-using-synthetic-data-for","slug":"data-augmentation-using-synthetic-data-for","title":"Data augmentation using synthetic data for time series classification with deep residual networks","date":"2018-08-07","arxiv_id":"1808.02455","repositories_listed":2,"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":3,"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/data-augmentation-using-synthetic-data-for#ran","syntology_url":"https://syntology.ai/paper/1808.02455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.02455"}},"official":{"repos":["hfawaz/aaltd18"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/inferring-multidimensional-rates-of-aging","slug":"inferring-multidimensional-rates-of-aging","title":"Inferring Multidimensional Rates of Aging from Cross-Sectional Data","date":"2018-07-12","arxiv_id":"1807.04709","repositories_listed":1,"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/inferring-multidimensional-rates-of-aging#ran","syntology_url":"https://syntology.ai/paper/1807.04709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.04709"}},"official":{"repos":["epierson9/multiphenotype_methods"],"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/multilevel-wavelet-decomposition-network-for","slug":"multilevel-wavelet-decomposition-network-for","title":"Multilevel Wavelet Decomposition Network for Interpretable Time Series Analysis","date":"2018-06-23","arxiv_id":"1806.08946","repositories_listed":2,"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/multilevel-wavelet-decomposition-network-for#ran","syntology_url":"https://syntology.ai/paper/1806.08946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08946"}},"official":null}},{"url":"/paper/complex-gated-recurrent-neural-networks","slug":"complex-gated-recurrent-neural-networks","title":"Complex Gated Recurrent Neural Networks","date":"2018-06-21","arxiv_id":"1806.08267","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/complex-gated-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1806.08267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08267"}},"official":{"repos":["v0lta/Complex-gated-recurrent-neural-networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiable-compositional-kernel-learning","slug":"differentiable-compositional-kernel-learning","title":"Differentiable Compositional Kernel Learning for Gaussian Processes","date":"2018-06-12","arxiv_id":"1806.04326","repositories_listed":4,"syntology":{"n":15,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 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; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/differentiable-compositional-kernel-learning#ran","syntology_url":"https://syntology.ai/paper/1806.04326","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.04326"}},"official":null}},{"url":"/paper/som-vae-interpretable-discrete-representation","slug":"som-vae-interpretable-discrete-representation","title":"SOM-VAE: Interpretable Discrete Representation Learning on Time Series","date":"2018-06-06","arxiv_id":"1806.02199","repositories_listed":6,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/som-vae-interpretable-discrete-representation#ran","syntology_url":"https://syntology.ai/paper/1806.02199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02199"}},"official":{"repos":["ratschlab/SOM-VAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/brits-bidirectional-recurrent-imputation-for","slug":"brits-bidirectional-recurrent-imputation-for","title":"BRITS: Bidirectional Recurrent Imputation for Time Series","date":"2018-05-27","arxiv_id":"1805.10572","repositories_listed":5,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/brits-bidirectional-recurrent-imputation-for#ran","syntology_url":"https://syntology.ai/paper/1805.10572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.10572"}},"official":{"repos":["WenjieDu/PyPOTS"],"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/newma-a-new-method-for-scalable-model-free","slug":"newma-a-new-method-for-scalable-model-free","title":"NEWMA: a new method for scalable model-free online change-point detection","date":"2018-05-21","arxiv_id":"1805.08061","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/newma-a-new-method-for-scalable-model-free#ran","syntology_url":"https://syntology.ai/paper/1805.08061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08061"}},"official":{"repos":["lightonai/newma"],"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/deep-generative-markov-state-models","slug":"deep-generative-markov-state-models","title":"Deep Generative Markov State Models","date":"2018-05-19","arxiv_id":"1805.07601","repositories_listed":2,"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/deep-generative-markov-state-models#ran","syntology_url":"https://syntology.ai/paper/1805.07601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.07601"}},"official":{"repos":["amardt/DeepGenMSM","markovmodel/deep_gen_msm"],"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/inferring-network-connectivity-from-event","slug":"inferring-network-connectivity-from-event","title":"Inferring network connectivity from event timing patterns","date":"2018-03-27","arxiv_id":"1803.09974","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":1,"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/inferring-network-connectivity-from-event#ran","syntology_url":"https://syntology.ai/paper/1803.09974","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.09974"}},"official":{"repos":["gitlab.com/di.ma/Connectivity_from_event_timing_patterns"],"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/reservoir-computing-approaches-for","slug":"reservoir-computing-approaches-for","title":"Reservoir computing approaches for representation and classification of multivariate time series","date":"2018-03-21","arxiv_id":"1803.07870","repositories_listed":3,"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/reservoir-computing-approaches-for#ran","syntology_url":"https://syntology.ai/paper/1803.07870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07870"}},"official":{"repos":["FilippoMB/Reservoir-Computing-framework-for-multivariate-time-series-classification","FilippoMB/Reservoir-model-space-classifier"],"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/multivariate-lstm-fcns-for-time-series","slug":"multivariate-lstm-fcns-for-time-series","title":"Multivariate LSTM-FCNs for Time Series Classification","date":"2018-01-14","arxiv_id":"1801.04503","repositories_listed":7,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multivariate-lstm-fcns-for-time-series#ran","syntology_url":"https://syntology.ai/paper/1801.04503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.04503"}},"official":{"repos":["houshd/MLSTM-FCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-multi-horizon-quantile-recurrent-forecaster","slug":"a-multi-horizon-quantile-recurrent-forecaster","title":"A Multi-Horizon Quantile Recurrent Forecaster","date":"2017-11-29","arxiv_id":"1711.11053","repositories_listed":5,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-multi-horizon-quantile-recurrent-forecaster#ran","syntology_url":"https://syntology.ai/paper/1711.11053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.11053"}},"official":{"repos":["tianchen101/MQRNN"],"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/variational-encoding-of-complex-dynamics","slug":"variational-encoding-of-complex-dynamics","title":"Variational Encoding of Complex Dynamics","date":"2017-11-23","arxiv_id":"1711.08576","repositories_listed":2,"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/variational-encoding-of-complex-dynamics#ran","syntology_url":"https://syntology.ai/paper/1711.08576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.08576"}},"official":{"repos":["msmbuilder/vde"],"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/spatio-temporal-graph-convolutional-networks","slug":"spatio-temporal-graph-convolutional-networks","title":"Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecasting","date":"2017-09-14","arxiv_id":"1709.04875","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spatio-temporal-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/1709.04875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.04875"}},"official":{"repos":["VeritasYin/STGCN_IJCAI-18"],"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/lstm-fully-convolutional-networks-for-time","slug":"lstm-fully-convolutional-networks-for-time","title":"LSTM Fully Convolutional Networks for Time Series Classification","date":"2017-09-08","arxiv_id":"1709.05206","repositories_listed":9,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lstm-fully-convolutional-networks-for-time#ran","syntology_url":"https://syntology.ai/paper/1709.05206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.05206"}},"official":{"repos":["titu1994/LSTM-FCN"],"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/deep-and-confident-prediction-for-time-series","slug":"deep-and-confident-prediction-for-time-series","title":"Deep and Confident Prediction for Time Series at Uber","date":"2017-09-06","arxiv_id":"1709.01907","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"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: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-and-confident-prediction-for-time-series#ran","syntology_url":"https://syntology.ai/paper/1709.01907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.01907"}},"official":null}},{"url":"/paper/timenet-pre-trained-deep-recurrent-neural","slug":"timenet-pre-trained-deep-recurrent-neural","title":"TimeNet: Pre-trained deep recurrent neural network for time series classification","date":"2017-06-23","arxiv_id":"1706.08838","repositories_listed":2,"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/timenet-pre-trained-deep-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1706.08838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.08838"}},"official":null}},{"url":"/paper/real-valued-medical-time-series-generation","slug":"real-valued-medical-time-series-generation","title":"Real-valued (Medical) Time Series Generation with Recurrent Conditional GANs","date":"2017-06-08","arxiv_id":"1706.02633","repositories_listed":8,"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":0,"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/real-valued-medical-time-series-generation#ran","syntology_url":"https://syntology.ai/paper/1706.02633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02633"}},"official":{"repos":["ratschlab/RGAN"],"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/deepar-probabilistic-forecasting-with","slug":"deepar-probabilistic-forecasting-with","title":"DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks","date":"2017-04-13","arxiv_id":"1704.04110","repositories_listed":19,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepar-probabilistic-forecasting-with#ran","syntology_url":"https://syntology.ai/paper/1704.04110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.04110"}},"official":null}},{"url":"/paper/a-dual-stage-attention-based-recurrent-neural","slug":"a-dual-stage-attention-based-recurrent-neural","title":"A Dual-Stage Attention-Based Recurrent Neural Network for Time Series Prediction","date":"2017-04-07","arxiv_id":"1704.02971","repositories_listed":13,"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-dual-stage-attention-based-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1704.02971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02971"}},"official":null}},{"url":"/paper/multitask-learning-and-benchmarking-with","slug":"multitask-learning-and-benchmarking-with","title":"Multitask learning and benchmarking with clinical time series data","date":"2017-03-22","arxiv_id":"1703.07771","repositories_listed":11,"syntology":{"n":40,"n_ran":25,"n_constructed":0,"n_ran_checked":21,"n_instrument":4,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":21,"n_pointer_only":5,"phrase":"25 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; 4 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/multitask-learning-and-benchmarking-with#ran","syntology_url":"https://syntology.ai/paper/1703.07771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07771"}},"official":{"repos":["yerevann/mimic3-benchmarks"],"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":["listed","official"]}}},{"url":"/paper/modeling-long-and-short-term-temporal","slug":"modeling-long-and-short-term-temporal","title":"Modeling Long- and Short-Term Temporal Patterns with Deep Neural Networks","date":"2017-03-21","arxiv_id":"1703.07015","repositories_listed":21,"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":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) · 0 unverified","sample_list":"/paper/modeling-long-and-short-term-temporal#ran","syntology_url":"https://syntology.ai/paper/1703.07015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07015"}},"official":{"repos":["laiguokun/LSTNet","laiguokun/multivariate-time-series-data"],"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":["listed","official"]}}},{"url":"/paper/conditional-time-series-forecasting-with","slug":"conditional-time-series-forecasting-with","title":"Conditional Time Series Forecasting with Convolutional Neural Networks","date":"2017-03-14","arxiv_id":"1703.04691","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":1,"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/conditional-time-series-forecasting-with#ran","syntology_url":"https://syntology.ai/paper/1703.04691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04691"}},"official":null}},{"url":"/paper/soft-dtw-a-differentiable-loss-function-for","slug":"soft-dtw-a-differentiable-loss-function-for","title":"Soft-DTW: a Differentiable Loss Function for Time-Series","date":"2017-03-05","arxiv_id":"1703.01541","repositories_listed":9,"syntology":{"n":11,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 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; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/soft-dtw-a-differentiable-loss-function-for#ran","syntology_url":"https://syntology.ai/paper/1703.01541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01541"}},"official":{"repos":["mblondel/soft-dtw"],"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":["listed","official"]}}},{"url":"/paper/time-series-classification-from-scratch-with","slug":"time-series-classification-from-scratch-with","title":"Time Series Classification from Scratch with Deep Neural Networks: A Strong Baseline","date":"2016-11-20","arxiv_id":"1611.06455","repositories_listed":12,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/time-series-classification-from-scratch-with#ran","syntology_url":"https://syntology.ai/paper/1611.06455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.06455"}},"official":{"repos":["cauchyturing/UCR_Time_Series_Classification_Deep_Learning_Baseline"],"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":["listed","official"]}}},{"url":"/paper/lstm-based-encoder-decoder-for-multi-sensor","slug":"lstm-based-encoder-decoder-for-multi-sensor","title":"LSTM-based Encoder-Decoder for Multi-sensor Anomaly Detection","date":"2016-07-01","arxiv_id":"1607.00148","repositories_listed":8,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/lstm-based-encoder-decoder-for-multi-sensor#ran","syntology_url":"https://syntology.ai/paper/1607.00148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.00148"}},"official":null}},{"url":"/paper/a-scalable-end-to-end-gaussian-process","slug":"a-scalable-end-to-end-gaussian-process","title":"A scalable end-to-end Gaussian process adapter for irregularly sampled time series classification","date":"2016-06-14","arxiv_id":"1606.04443","repositories_listed":1,"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/a-scalable-end-to-end-gaussian-process#ran","syntology_url":"https://syntology.ai/paper/1606.04443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04443"}},"official":null}},{"url":"/paper/recurrent-neural-networks-for-multivariate","slug":"recurrent-neural-networks-for-multivariate","title":"Recurrent Neural Networks for Multivariate Time Series with Missing Values","date":"2016-06-06","arxiv_id":"1606.01865","repositories_listed":7,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recurrent-neural-networks-for-multivariate#ran","syntology_url":"https://syntology.ai/paper/1606.01865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01865"}},"official":{"repos":["WenjieDu/PyPOTS"],"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/evaluating-real-time-anomaly-detection","slug":"evaluating-real-time-anomaly-detection","title":"Evaluating Real-time Anomaly Detection Algorithms - the Numenta Anomaly Benchmark","date":"2015-10-12","arxiv_id":"1510.03336","repositories_listed":3,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/evaluating-real-time-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/1510.03336","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.03336"}},"official":{"repos":["numenta/NAB"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-construction-and-natural-language","slug":"automatic-construction-and-natural-language","title":"Automatic Construction and Natural-Language Description of Nonparametric Regression Models","date":"2014-02-18","arxiv_id":"1402.4304","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/automatic-construction-and-natural-language#ran","syntology_url":"https://syntology.ai/paper/1402.4304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1402.4304"}},"official":{"repos":["jamesrobertlloyd/gpss-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/bayesian-online-changepoint-detection","slug":"bayesian-online-changepoint-detection","title":"Bayesian Online Changepoint Detection","date":"2007-10-19","arxiv_id":"0710.3742","repositories_listed":8,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/bayesian-online-changepoint-detection#ran","syntology_url":"https://syntology.ai/paper/0710.3742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0710.3742"}},"official":null}}],"record_sha256":"850610523c44913bc7adbf04f57a2a1136bde43f709e977866b59abfb3388292","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}