{"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/train-test-divide","entry":"train_test_divide","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":0},"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":"2510.06699","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, azencot-group/ImagenI2R when it was checked","code_sha256":"fa0e9e549b6bff3f","code_sha256_prefix":"fa0e9e549b6bff3f","mcp_get_code":{"code_sha256":"fa0e9e549b6bff3f"}},{"arxiv_id":"2412.09328","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1cd2e1e5e6631289","code_sha256_prefix":"1cd2e1e5e6631289","mcp_get_code":{"code_sha256":"1cd2e1e5e6631289"}},{"arxiv_id":"2410.19538","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, azencot-group/ImagenTime when it was checked","code_sha256":"fa0e9e549b6bff3f","code_sha256_prefix":"fa0e9e549b6bff3f","mcp_get_code":{"code_sha256":"fa0e9e549b6bff3f"}},{"arxiv_id":"2409.14013","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1cd2e1e5e6631289","code_sha256_prefix":"1cd2e1e5e6631289","mcp_get_code":{"code_sha256":"1cd2e1e5e6631289"}},{"arxiv_id":"2310.15290","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, muhangtian/timediff when it was checked","code_sha256":"fa0e9e549b6bff3f","code_sha256_prefix":"fa0e9e549b6bff3f","mcp_get_code":{"code_sha256":"fa0e9e549b6bff3f"}},{"arxiv_id":"2309.03755","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yihaoang/tsgbench when it was checked","code_sha256":"4c67aa09d6ef1aed","code_sha256_prefix":"4c67aa09d6ef1aed","mcp_get_code":{"code_sha256":"4c67aa09d6ef1aed"}}],"record_sha256":"616fc8a2e22640c9d11976bf3257102fa75b2c9e3b79b55e551b238ba6f6854c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}