{"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/conv1d-with-init","entry":"Conv1d_with_init","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":6,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":1,"unverified":1},"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":"2509.19885","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19885","title":"Towards Self-Supervised Foundation Models for Critical Care Time Series","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"rvandewater/YAIB","path":"icu_benchmarks/imputation/csdi.py","file_url":"https://github.com/rvandewater/YAIB/blob/HEAD/icu_benchmarks/imputation/csdi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7340b482ffe44836","code_sha256_prefix":"7340b482ffe44836","mcp_get_code":{"code_sha256":"7340b482ffe44836"}},{"arxiv_id":"2306.06138","arxiv_id_is_arxiv":true,"paper":"/paper/extraction-and-recovery-of-spatio-temporal-1","title":"Extraction and Recovery of Spatio-Temporal Structure in Latent Dynamics Alignment with Diffusion Models","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexwangntl/erdiff","path":"models/diffusion.py","file_url":"https://github.com/alexwangntl/erdiff/blob/HEAD/models/diffusion.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":"6bd07470db31cdd1","code_sha256_prefix":"6bd07470db31cdd1","mcp_get_code":{"code_sha256":"6bd07470db31cdd1"}},{"arxiv_id":"2306.05109","arxiv_id_is_arxiv":true,"paper":"/paper/yet-another-icu-benchmark-a-flexible-multi","title":"Yet Another ICU Benchmark: A Flexible Multi-Center Framework for Clinical ML","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rvandewater/yaib","path":"icu_benchmarks/imputation/csdi.py","file_url":"https://github.com/rvandewater/yaib/blob/HEAD/icu_benchmarks/imputation/csdi.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7340b482ffe44836","code_sha256_prefix":"7340b482ffe44836","mcp_get_code":{"code_sha256":"7340b482ffe44836"}},{"arxiv_id":"2304.06707","arxiv_id_is_arxiv":true,"paper":"/paper/toward-reliable-human-pose-forecasting-with","title":"Toward Reliable Human Pose Forecasting with Uncertainty","date":"2023-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/unposed","path":"models/st_trans/ST_Trans.py","file_url":"https://github.com/vita-epfl/unposed/blob/HEAD/models/st_trans/ST_Trans.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, vita-epfl/unposed, is not in the permissive set Syntology serves inline","code_sha256":"c3de5c4478a6d64d","code_sha256_prefix":"c3de5c4478a6d64d","mcp_get_code":{"code_sha256":"c3de5c4478a6d64d"}},{"arxiv_id":"2210.17128","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-missing-value-imputation","title":"Diffusion models for missing value imputation in tabular data","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/CSDI_T","path":"src/main_model_table.py","file_url":"https://github.com/pfnet-research/CSDI_T/blob/HEAD/src/main_model_table.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7340b482ffe44836","code_sha256_prefix":"7340b482ffe44836","mcp_get_code":{"code_sha256":"7340b482ffe44836"}},{"arxiv_id":"2210.17128","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-for-missing-value-imputation","title":"Diffusion models for missing value imputation in tabular data","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pfnet-research/TabCSDI","path":"src/diff_models_table.py","file_url":"https://github.com/pfnet-research/TabCSDI/blob/HEAD/src/diff_models_table.py","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e025f56ec3385c61","code_sha256_prefix":"e025f56ec3385c61","mcp_get_code":{"code_sha256":"e025f56ec3385c61"}},{"arxiv_id":"2202.08516","arxiv_id_is_arxiv":true,"paper":"/paper/saits-self-attention-based-imputation-for","title":"SAITS: Self-Attention-based Imputation for Time Series","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorgen2020/LSSDM_imputation","path":"diff_models.py","file_url":"https://github.com/gorgen2020/LSSDM_imputation/blob/HEAD/diff_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7340b482ffe44836","code_sha256_prefix":"7340b482ffe44836","mcp_get_code":{"code_sha256":"7340b482ffe44836"}},{"arxiv_id":"2107.03502","arxiv_id_is_arxiv":true,"paper":"/paper/csdi-conditional-score-based-diffusion-models","title":"CSDI: Conditional Score-based Diffusion Models for Probabilistic Time Series Imputation","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ermongroup/CSDI","path":"diff_models.py","file_url":"https://github.com/ermongroup/CSDI/blob/HEAD/diff_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7340b482ffe44836","code_sha256_prefix":"7340b482ffe44836","mcp_get_code":{"code_sha256":"7340b482ffe44836"}}],"record_sha256":"27e40f941482b9b9ab9d6d7cec2290ad5d3aa7e1d19f69ef4598171743f6b414","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}