{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/batch-generator","entry":"batch_generator","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":4,"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":7,"n_samples_ran":4,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":1,"unverified":3},"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":"2510.06699","paper":"/paper/arxiv-2510-06699","title":"A Diffusion Model for Regular Time Series Generation from Irregular Data with Completion and Masking","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"azencot-group/ImagenI2R","path":"metrics/discriminative_torch.py","file_url":"https://github.com/azencot-group/ImagenI2R/blob/HEAD/metrics/discriminative_torch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6d5f0a137745e47e","mcp_get_code":{"code_sha256":"6d5f0a137745e47e"}},{"arxiv_id":"2412.09328","paper":"/paper/auto-regressive-moving-diffusion-models-for","title":"Auto-Regressive Moving Diffusion Models for Time Series Forecasting","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxin007/armd","path":"Utils/discriminative_metric.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Utils/discriminative_metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16dc8797fafc754b","mcp_get_code":{"code_sha256":"16dc8797fafc754b"}},{"arxiv_id":"2411.07506","paper":"/paper/fm-ts-flow-matching-for-time-series","title":"FM-TS: Flow Matching for Time Series Generation","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/fmts","path":"FMTS/Utils/discriminative_metric.py","file_url":"https://github.com/unites-lab/fmts/blob/HEAD/FMTS/Utils/discriminative_metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"16dc8797fafc754b","mcp_get_code":{"code_sha256":"16dc8797fafc754b"}},{"arxiv_id":"2410.19538","paper":"/paper/utilizing-image-transforms-and-diffusion","title":"Utilizing Image Transforms and Diffusion Models for Generative Modeling of Short and Long Time Series","date":"2024-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azencot-group/ImagenTime","path":"metrics/discriminative_torch.py","file_url":"https://github.com/azencot-group/ImagenTime/blob/HEAD/metrics/discriminative_torch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6d5f0a137745e47e","mcp_get_code":{"code_sha256":"6d5f0a137745e47e"}},{"arxiv_id":"2210.02040","paper":"/paper/gt-gan-general-purpose-time-series-synthesis","title":"GT-GAN: General Purpose Time Series Synthesis with Generative Adversarial Networks","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jsyoon0823/TimeGAN","path":"timegan.py","file_url":"https://github.com/jsyoon0823/TimeGAN/blob/HEAD/timegan.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b7509396578eb343","mcp_get_code":{"code_sha256":"b7509396578eb343"}},{"arxiv_id":"2004.05160","paper":"/paper/on-the-language-neutrality-of-pre-trained","title":"On the Language Neutrality of Pre-trained Multilingual Representations","date":"2020-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jlibovicky/assess-multilingual-bert","path":"save_centroids.py","file_url":"https://github.com/jlibovicky/assess-multilingual-bert/blob/HEAD/save_centroids.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"49169613387052ef","mcp_get_code":{"code_sha256":"49169613387052ef"}},{"arxiv_id":"1711.11053","paper":"/paper/a-multi-horizon-quantile-recurrent-forecaster","title":"A Multi-Horizon Quantile Recurrent Forecaster","date":"2017-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingw2/demand_forecast","path":"mq_rnn.py","file_url":"https://github.com/jingw2/demand_forecast/blob/HEAD/mq_rnn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d469f0d2103c926","mcp_get_code":{"code_sha256":"7d469f0d2103c926"}},{"arxiv_id":"1711.11053","paper":"/paper/a-multi-horizon-quantile-recurrent-forecaster","title":"A Multi-Horizon Quantile Recurrent Forecaster","date":"2017-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingw2/demand_forecast","path":"deepar.py","file_url":"https://github.com/jingw2/demand_forecast/blob/HEAD/deepar.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7bbe0c2f4213aba9","mcp_get_code":{"code_sha256":"7bbe0c2f4213aba9"}},{"arxiv_id":"1505.07818","paper":"/paper/domain-adversarial-training-of-neural","title":"Domain-Adversarial Training of Neural Networks","date":"2015-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AKASH2907/Forgery-Classification-via-Domain-Adaptation","path":"DANN/dann_keras.py","file_url":"https://github.com/AKASH2907/Forgery-Classification-via-Domain-Adaptation/blob/HEAD/DANN/dann_keras.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4a9bc68de4ae0c55","mcp_get_code":{"code_sha256":"4a9bc68de4ae0c55"}}]}