{"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/train-test-divide","entry":"train_test_divide","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":6,"n_papers_ran":1,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"fa0e9e549b6bff3f","mcp_get_code":{"code_sha256":"fa0e9e549b6bff3f"}},{"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/metric_utils.py","file_url":"https://github.com/daxin007/armd/blob/HEAD/Utils/metric_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1cd2e1e5e6631289","mcp_get_code":{"code_sha256":"1cd2e1e5e6631289"}},{"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":"fa0e9e549b6bff3f","mcp_get_code":{"code_sha256":"fa0e9e549b6bff3f"}},{"arxiv_id":"2409.14013","paper":"/paper/chronogan-supervised-and-embedded-generative","title":"ChronoGAN: Supervised and Embedded Generative Adversarial Networks for Time Series Generation","date":"2024-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samresume/ChronoGAN","path":"utils.py","file_url":"https://github.com/samresume/ChronoGAN/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1cd2e1e5e6631289","mcp_get_code":{"code_sha256":"1cd2e1e5e6631289"}},{"arxiv_id":"2310.15290","paper":"/paper/fast-and-reliable-generation-of-ehr-time","title":"Reliable Generation of Privacy-preserving Synthetic Electronic Health Record Time Series via Diffusion Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhangtian/timediff","path":"baselines/gtgan_train.py","file_url":"https://github.com/muhangtian/timediff/blob/HEAD/baselines/gtgan_train.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fa0e9e549b6bff3f","mcp_get_code":{"code_sha256":"fa0e9e549b6bff3f"}},{"arxiv_id":"2309.03755","paper":"/paper/tsgbench-time-series-generation-benchmark","title":"TSGBench: Time Series Generation Benchmark","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihaoang/tsgbench","path":"src/ds_ps.py","file_url":"https://github.com/yihaoang/tsgbench/blob/HEAD/src/ds_ps.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c67aa09d6ef1aed","mcp_get_code":{"code_sha256":"4c67aa09d6ef1aed"}}]}