{"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":"/code/batcher","entry":"batcher","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":7,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"unverified":2},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2305.19141","arxiv_id_is_arxiv":true,"paper":"/paper/taylorformer-probabilistic-predictions-for","title":"Taylorformer: Probabilistic Modelling for Random Processes including Time Series","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oremnirv/Taylorformer","path":"data_wrangler/batcher.py","file_url":"https://github.com/oremnirv/Taylorformer/blob/HEAD/data_wrangler/batcher.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dc7e83587205280e","code_sha256_prefix":"dc7e83587205280e","mcp_get_code":{"code_sha256":"dc7e83587205280e"}},{"arxiv_id":"2207.09572","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-multivariate-time-series","title":"Robust Multivariate Time-Series Forecasting: Adversarial Attacks and Defense Mechanisms","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/gluonts","path":"src/gluonts/itertools.py","file_url":"https://github.com/awslabs/gluonts/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9441ca1a63b924c3","code_sha256_prefix":"9441ca1a63b924c3","mcp_get_code":{"code_sha256":"9441ca1a63b924c3"}},{"arxiv_id":"2112.14436","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-em-for-deep-time-series-anomaly","title":"Monte Carlo EM for Deep Time Series Anomaly Detection","date":"2021-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Francois-Aubet/gluon-ts","path":"src/gluonts/itertools.py","file_url":"https://github.com/Francois-Aubet/gluon-ts/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"668d3b50df5c6b08","code_sha256_prefix":"668d3b50df5c6b08","mcp_get_code":{"code_sha256":"668d3b50df5c6b08"}},{"arxiv_id":"2108.00981","arxiv_id_is_arxiv":true,"paper":"/paper/psa-gan-progressive-self-attention-gans-for","title":"PSA-GAN: Progressive Self Attention GANs for Synthetic Time Series","date":"2021-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/gluon-ts","path":"src/gluonts/itertools.py","file_url":"https://github.com/awslabs/gluon-ts/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9441ca1a63b924c3","code_sha256_prefix":"9441ca1a63b924c3","mcp_get_code":{"code_sha256":"9441ca1a63b924c3"}},{"arxiv_id":"2103.15316","arxiv_id_is_arxiv":true,"paper":"/paper/whitening-sentence-representations-for-better","title":"Whitening Sentence Representations for Better Semantics and Faster Retrieval","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autoliuweijie/bert-whitening-pytorch","path":"eval_with_whitening(nli).py","file_url":"https://github.com/autoliuweijie/bert-whitening-pytorch/blob/HEAD/eval_with_whitening%28nli%29.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85db364c67187a22","code_sha256_prefix":"85db364c67187a22","mcp_get_code":{"code_sha256":"85db364c67187a22"}},{"arxiv_id":"1910.03002","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-multivariate-forecasting","title":"High-Dimensional Multivariate Forecasting with Low-Rank Gaussian Copula Processes","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbohlkeschneider/gluon-ts","path":"src/gluonts/itertools.py","file_url":"https://github.com/mbohlkeschneider/gluon-ts/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"668d3b50df5c6b08","code_sha256_prefix":"668d3b50df5c6b08","mcp_get_code":{"code_sha256":"668d3b50df5c6b08"}},{"arxiv_id":"1909.00142","arxiv_id_is_arxiv":true,"paper":"/paper/evaluation-benchmarks-and-learning","title":"Evaluation Benchmarks and Learning Criteria for Discourse-Aware Sentence Representations","date":"2019-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZeweiChu/DiscoEval","path":"train/discoeval_example.py","file_url":"https://github.com/ZeweiChu/DiscoEval/blob/HEAD/train/discoeval_example.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ZeweiChu/DiscoEval (NOASSERTION)","code_sha256":"c852fb3cac0794ad","code_sha256_prefix":"c852fb3cac0794ad","mcp_get_code":{"code_sha256":"c852fb3cac0794ad"}},{"arxiv_id":"1906.05264","arxiv_id_is_arxiv":true,"paper":"/paper/gluonts-probabilistic-time-series-models-in","title":"GluonTS: Probabilistic Time Series Models in Python","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbohlkeschneider/psa-gan","path":"src/gluonts/itertools.py","file_url":"https://github.com/mbohlkeschneider/psa-gan/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"668d3b50df5c6b08","code_sha256_prefix":"668d3b50df5c6b08","mcp_get_code":{"code_sha256":"668d3b50df5c6b08"}},{"arxiv_id":"1906.05264","arxiv_id_is_arxiv":true,"paper":"/paper/gluonts-probabilistic-time-series-models-in","title":"GluonTS: Probabilistic Time Series Models in Python","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"canerturkmen/gluon-ts","path":"src/gluonts/itertools.py","file_url":"https://github.com/canerturkmen/gluon-ts/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f11db9afe0156686","code_sha256_prefix":"f11db9afe0156686","mcp_get_code":{"code_sha256":"f11db9afe0156686"}},{"arxiv_id":"1906.05264","arxiv_id_is_arxiv":true,"paper":"/paper/gluonts-probabilistic-time-series-models-in","title":"GluonTS: Probabilistic Time Series Models in Python","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elenaehrlich/gluon-ts","path":"src/gluonts/itertools.py","file_url":"https://github.com/elenaehrlich/gluon-ts/blob/HEAD/src/gluonts/itertools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32cf67ab3871ffdc","code_sha256_prefix":"32cf67ab3871ffdc","mcp_get_code":{"code_sha256":"32cf67ab3871ffdc"}},{"arxiv_id":"1905.07790","arxiv_id_is_arxiv":true,"paper":"/paper/correlation-coefficients-and-semantic-textual","title":"Correlation Coefficients and Semantic Textual Similarity","date":"2019-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Babylonpartners/corrsim","path":"evaluation/corrsim_eval.py","file_url":"https://github.com/Babylonpartners/corrsim/blob/HEAD/evaluation/corrsim_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e51eada32278286d","code_sha256_prefix":"e51eada32278286d","mcp_get_code":{"code_sha256":"e51eada32278286d"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BinWang28/BERT_Sentence_Embedding","path":"SBERT_WK.py","file_url":"https://github.com/BinWang28/BERT_Sentence_Embedding/blob/HEAD/SBERT_WK.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"41ef4758bed26d28","code_sha256_prefix":"41ef4758bed26d28","mcp_get_code":{"code_sha256":"41ef4758bed26d28"}},{"arxiv_id":"1805.01070","arxiv_id_is_arxiv":true,"paper":"/paper/what-you-can-cram-into-a-single-vector","title":"What you can cram into a single vector: Probing sentence embeddings for linguistic properties","date":"2018-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ff910817bb9f0411","code_sha256_prefix":"ff910817bb9f0411","mcp_get_code":{"code_sha256":"ff910817bb9f0411"}},{"arxiv_id":"1804.00079","arxiv_id_is_arxiv":true,"paper":"/paper/learning-general-purpose-distributed-sentence","title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","date":"2018-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ff910817bb9f0411","code_sha256_prefix":"ff910817bb9f0411","mcp_get_code":{"code_sha256":"ff910817bb9f0411"}},{"arxiv_id":"1803.05449","arxiv_id_is_arxiv":true,"paper":"/paper/senteval-an-evaluation-toolkit-for-universal","title":"SentEval: An Evaluation Toolkit for Universal Sentence Representations","date":"2018-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e1c6e7d12d71cb6b","code_sha256_prefix":"e1c6e7d12d71cb6b","mcp_get_code":{"code_sha256":"e1c6e7d12d71cb6b"}},{"arxiv_id":"1803.05449","arxiv_id_is_arxiv":true,"paper":"/paper/senteval-an-evaluation-toolkit-for-universal","title":"SentEval: An Evaluation Toolkit for Universal Sentence Representations","date":"2018-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ff910817bb9f0411","code_sha256_prefix":"ff910817bb9f0411","mcp_get_code":{"code_sha256":"ff910817bb9f0411"}},{"arxiv_id":"1710.10916","arxiv_id_is_arxiv":true,"paper":"/paper/stackgan-realistic-image-synthesis-with","title":"StackGAN++: Realistic Image Synthesis with Stacked Generative Adversarial Networks","date":"2017-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akanimax/T2F","path":"implementation/networks/InferSent/mutils.py","file_url":"https://github.com/akanimax/T2F/blob/HEAD/implementation/networks/InferSent/mutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7fe5da253d02512","code_sha256_prefix":"b7fe5da253d02512","mcp_get_code":{"code_sha256":"b7fe5da253d02512"}},{"arxiv_id":"1705.02364","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-learning-of-universal-sentence","title":"Supervised Learning of Universal Sentence Representations from Natural Language Inference Data","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sidak/SentEval","path":"examples/infersent.py","file_url":"https://github.com/sidak/SentEval/blob/HEAD/examples/infersent.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sidak/SentEval (NOASSERTION)","code_sha256":"e1c6e7d12d71cb6b","code_sha256_prefix":"e1c6e7d12d71cb6b","mcp_get_code":{"code_sha256":"e1c6e7d12d71cb6b"}},{"arxiv_id":"1705.02364","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-learning-of-universal-sentence","title":"Supervised Learning of Universal Sentence Representations from Natural Language Inference Data","date":"2017-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/SentEval","path":"examples/bow.py","file_url":"https://github.com/facebookresearch/SentEval/blob/HEAD/examples/bow.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/SentEval (NOASSERTION)","code_sha256":"ff910817bb9f0411","code_sha256_prefix":"ff910817bb9f0411","mcp_get_code":{"code_sha256":"ff910817bb9f0411"}}],"record_sha256":"02cdd840b700e28f7393f946d624240be2608be8a7f2d5f945f821ec472f45c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}