{"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/timeembedding","entry":"TimeEmbedding","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":8,"n_samples_constructed":5,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":8,"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":"2607.06652","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-06652","title":"From Jumps to Signatures: a Generative Method for Temporal Point Processes","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Code-Cornelius/sigtpp","path":"src/nn/nn/sigwgan_modules/rnn_sampling_generator_tpp.py","file_url":"https://github.com/Code-Cornelius/sigtpp/blob/HEAD/src/nn/nn/sigwgan_modules/rnn_sampling_generator_tpp.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":"70cc48c789a59ba2","code_sha256_prefix":"70cc48c789a59ba2","mcp_get_code":{"code_sha256":"70cc48c789a59ba2"}},{"arxiv_id":"2606.12494","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12494","title":"Net-Ev <sup>2</sup> : A Generative Simulator for Network Event Evolution","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Guangyu4/Net-Ev-2","path":"model/denoiser/graphunet.py","file_url":"https://github.com/Guangyu4/Net-Ev-2/blob/HEAD/model/denoiser/graphunet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Guangyu4/Net-Ev-2 when it was checked","code_sha256":"50ac4d82b1a423de","code_sha256_prefix":"50ac4d82b1a423de","mcp_get_code":{"code_sha256":"50ac4d82b1a423de"}},{"arxiv_id":"2606.09257","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-09257","title":"BSTabDiff: Block-Subunit Diffusion Priors for High-Dimensional Tabular Data Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"zadid6pretam/BSTabDiff","path":"bstabdiff/block_subunit_gen.py","file_url":"https://github.com/zadid6pretam/BSTabDiff/blob/HEAD/bstabdiff/block_subunit_gen.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94e17cd5d3180b63","code_sha256_prefix":"94e17cd5d3180b63","mcp_get_code":{"code_sha256":"94e17cd5d3180b63"}},{"arxiv_id":"2605.22851","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22851","title":"VAMP-Diff: VampPrior Latent Diffusion for Photoplethysmography Modeling","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fatighasemi74/VAMP-Diff","path":"vamp-diff/models/vae_diffusion.py","file_url":"https://github.com/fatighasemi74/VAMP-Diff/blob/HEAD/vamp-diff/models/vae_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fatighasemi74/VAMP-Diff when it was checked","code_sha256":"2fdf3c26c39f4b29","code_sha256_prefix":"2fdf3c26c39f4b29","mcp_get_code":{"code_sha256":"2fdf3c26c39f4b29"}},{"arxiv_id":"2605.11246","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11246","title":"Support-Proximity Augmented Diffusion Estimation for Offline Black-Box Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HarryYoung2018/spade","path":"spade/optimize.py","file_url":"https://github.com/HarryYoung2018/spade/blob/HEAD/spade/optimize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4cf430efa36c0fb8","code_sha256_prefix":"4cf430efa36c0fb8","mcp_get_code":{"code_sha256":"4cf430efa36c0fb8"}},{"arxiv_id":"2602.17543","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17543","title":"genriesz: A Python Package for Automatic Debiased Machine Learning with Generalized Riesz Regression","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"MasaKat0/genriesz","path":"src/genriesz/scorematchingriesz.py","file_url":"https://github.com/MasaKat0/genriesz/blob/HEAD/src/genriesz/scorematchingriesz.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, MasaKat0/genriesz, is not in the permissive set Syntology serves inline","code_sha256":"cbfece8c804c3676","code_sha256_prefix":"cbfece8c804c3676","mcp_get_code":{"code_sha256":"cbfece8c804c3676"}},{"arxiv_id":"2310.10196","arxiv_id_is_arxiv":true,"paper":"/paper/large-models-for-time-series-and-spatio","title":"Large Models for Time Series and Spatio-Temporal Data: A Survey and Outlook","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenhaomin/DiffSTG","path":"algorithm/diffstg/ugnet.py","file_url":"https://github.com/wenhaomin/DiffSTG/blob/HEAD/algorithm/diffstg/ugnet.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":"08cf4b00cd097b37","code_sha256_prefix":"08cf4b00cd097b37","mcp_get_code":{"code_sha256":"08cf4b00cd097b37"}},{"arxiv_id":"2107.11350","arxiv_id_is_arxiv":true,"paper":"/paper/heteroscedastic-temporal-variational","title":"Heteroscedastic Temporal Variational Autoencoder For Irregular Time Series","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"reml-lab/hetvae","path":"src/vae_models.py","file_url":"https://github.com/reml-lab/hetvae/blob/HEAD/src/vae_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24b292c4ff8a93c7","code_sha256_prefix":"24b292c4ff8a93c7","mcp_get_code":{"code_sha256":"24b292c4ff8a93c7"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labmlai/annotated_deep_learning_paper_implementations","path":"labml_nn/diffusion/ddpm/unet.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/diffusion/ddpm/unet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39d9dd157784bddd","code_sha256_prefix":"39d9dd157784bddd","mcp_get_code":{"code_sha256":"39d9dd157784bddd"}}],"record_sha256":"01a5a3e57e8ae2f19814619ca0d9ac21efe831145f16b78a64df967c20dc082c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}