{"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/log-normal","entry":"log_normal","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":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":2,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":2},"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":"2605.17804","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17804","title":"GenTS: A Comprehensive Benchmark Library for Generative Time Series Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"WillWang1113/GenTS","path":"gents/utils/losses.py","file_url":"https://github.com/WillWang1113/GenTS/blob/HEAD/gents/utils/losses.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":"683472dec5c7b4a0","code_sha256_prefix":"683472dec5c7b4a0","mcp_get_code":{"code_sha256":"683472dec5c7b4a0"}},{"arxiv_id":"2505.04278","arxiv_id_is_arxiv":true,"paper":"/paper/non-stationary-diffusion-for-probabilistic","title":"Non-stationary Diffusion For Probabilistic Time Series Forecasting","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwy155/NsDiff","path":"src/experiments/NsDiff.py","file_url":"https://github.com/wwy155/NsDiff/blob/HEAD/src/experiments/NsDiff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wwy155/NsDiff when it was checked","code_sha256":"fb0b872ca5152a2d","code_sha256_prefix":"fb0b872ca5152a2d","mcp_get_code":{"code_sha256":"fb0b872ca5152a2d"}},{"arxiv_id":"2410.11648","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-accurate-and-stable-gradients-for","title":"Efficient, Accurate and Stable Gradients for Neural ODEs","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sammccallum/reversible","path":"experiments/cnf/cnf.py","file_url":"https://github.com/sammccallum/reversible/blob/HEAD/experiments/cnf/cnf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sammccallum/reversible when it was checked","code_sha256":"74492e355dea1616","code_sha256_prefix":"74492e355dea1616","mcp_get_code":{"code_sha256":"74492e355dea1616"}},{"arxiv_id":"2310.09031","arxiv_id_is_arxiv":true,"paper":"/paper/minde-mutual-information-neural-diffusion","title":"MINDE: Mutual Information Neural Diffusion Estimation","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MustaphaBounoua/minde","path":"src/libs/importance.py","file_url":"https://github.com/MustaphaBounoua/minde/blob/HEAD/src/libs/importance.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, MustaphaBounoua/minde when it was checked","code_sha256":"3386981c26ab7a77","code_sha256_prefix":"3386981c26ab7a77","mcp_get_code":{"code_sha256":"3386981c26ab7a77"}},{"arxiv_id":"2211.03846","arxiv_id_is_arxiv":true,"paper":"/paper/fed-cd-federated-causal-discovery-from","title":"Federated Causal Discovery From Interventions","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aminabyaneh/fed-cd","path":"causal_discovery/multivariable_flow.py","file_url":"https://github.com/aminabyaneh/fed-cd/blob/HEAD/causal_discovery/multivariable_flow.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":"0b6cf2b741a80664","code_sha256_prefix":"0b6cf2b741a80664","mcp_get_code":{"code_sha256":"0b6cf2b741a80664"}},{"arxiv_id":"2102.08248","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-vaes-know-what-they-don-t-know","title":"Hierarchical VAEs Know What They Don't Know","date":"2021-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"larsmaaloee/BIVA","path":"layers/_loss.py","file_url":"https://github.com/larsmaaloee/BIVA/blob/HEAD/layers/_loss.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":"1421d48bfd48d085","code_sha256_prefix":"1421d48bfd48d085","mcp_get_code":{"code_sha256":"1421d48bfd48d085"}},{"arxiv_id":"2002.08376","arxiv_id_is_arxiv":true,"paper":"/paper/a-differentiable-programming-method-for","title":"A differentiable programming method for quantum control","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"frankschae/A-differentiable-programming-method-for-quantum-control","path":"qubit/reinforce/policy_gradient_qubit.py","file_url":"https://github.com/frankschae/A-differentiable-programming-method-for-quantum-control/blob/HEAD/qubit/reinforce/policy_gradient_qubit.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":"2c5697ebeebf54cd","code_sha256_prefix":"2c5697ebeebf54cd","mcp_get_code":{"code_sha256":"2c5697ebeebf54cd"}},{"arxiv_id":"1907.04809","arxiv_id_is_arxiv":true,"paper":"/paper/variational-autoencoders-and-nonlinear-ica-a","title":"Variational Autoencoders and Nonlinear ICA: A Unifying Framework","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilkhem/ivae","path":"models/nets.py","file_url":"https://github.com/ilkhem/ivae/blob/HEAD/models/nets.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":"e717afe80143001a","code_sha256_prefix":"e717afe80143001a","mcp_get_code":{"code_sha256":"e717afe80143001a"}},{"arxiv_id":"Ashesh_uSplit_Image_Decomposition_for_Fluorescence_Microscopy_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ashesh_uSplit_Image_Decomposition_for_Fluorescence_Microscopy_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"juglab/uSplit","path":"usplit/core/likelihoods.py","file_url":"https://github.com/juglab/uSplit/blob/HEAD/usplit/core/likelihoods.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":"de359b2f0879dbcb","code_sha256_prefix":"de359b2f0879dbcb","mcp_get_code":{"code_sha256":"de359b2f0879dbcb"}}],"record_sha256":"5c4564d1d681394b9c022bde2e1eaf8f66be54cdc15781178c32514dc4081c56","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}