{"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/var-func-vp","entry":"var_func_vp","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":8,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":0,"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":"2508.19857","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-19857","title":"Quantum latent distributions in deep generative models","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"NVlabs/denoising-diffusion-gan","path":"train_ddgan.py","file_url":"https://github.com/NVlabs/denoising-diffusion-gan/blob/HEAD/train_ddgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NVlabs/denoising-diffusion-gan when it was checked","code_sha256":"6d7acf7b44dc5061","code_sha256_prefix":"6d7acf7b44dc5061","mcp_get_code":{"code_sha256":"6d7acf7b44dc5061"}},{"arxiv_id":"2503.11050","arxiv_id_is_arxiv":true,"paper":"/paper/distance-based-tree-sliced-wasserstein","title":"Distance-Based Tree-Sliced Wasserstein Distance","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Fsoft-AIC/DbTSW","path":"experiments/denoising-diffusion-gan/train_ddgan.py","file_url":"https://github.com/Fsoft-AIC/DbTSW/blob/HEAD/experiments/denoising-diffusion-gan/train_ddgan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37f4a211c7f3b70a","code_sha256_prefix":"37f4a211c7f3b70a","mcp_get_code":{"code_sha256":"37f4a211c7f3b70a"}},{"arxiv_id":"2405.14449","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-schrodinger-bridge-matching","title":"Adversarial Schrödinger Bridge Matching","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daniil-selikhanovych/asbm","path":"posteriors.py","file_url":"https://github.com/daniil-selikhanovych/asbm/blob/HEAD/posteriors.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, daniil-selikhanovych/asbm when it was checked","code_sha256":"6d7acf7b44dc5061","code_sha256_prefix":"6d7acf7b44dc5061","mcp_get_code":{"code_sha256":"6d7acf7b44dc5061"}},{"arxiv_id":"2401.15889","arxiv_id_is_arxiv":true,"paper":"/paper/sliced-wasserstein-with-random-path","title":"Sliced Wasserstein with Random-Path Projecting Directions","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khainb/rpsw","path":"denoising-diffusion-gan/train_ddgan.py","file_url":"https://github.com/khainb/rpsw/blob/HEAD/denoising-diffusion-gan/train_ddgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, khainb/rpsw when it was checked","code_sha256":"6d7acf7b44dc5061","code_sha256_prefix":"6d7acf7b44dc5061","mcp_get_code":{"code_sha256":"6d7acf7b44dc5061"}},{"arxiv_id":"2303.05456","arxiv_id_is_arxiv":true,"paper":"/paper/restoration-based-generative-models","title":"Restoration based Generative Models","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jae-Moo/RGM","path":"forward.py","file_url":"https://github.com/Jae-Moo/RGM/blob/HEAD/forward.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from khainb/rpsw, and GitHub detected no licence in that repository when it was checked","code_sha256":"6d7acf7b44dc5061","code_sha256_prefix":"6d7acf7b44dc5061","mcp_get_code":{"code_sha256":"6d7acf7b44dc5061"}},{"arxiv_id":"2210.05559","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-diffusion-models-latent-space-with","title":"Unifying Diffusion Models' Latent Space, with Applications to CycleDiffusion and Guidance","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"6d7acf7b44dc5061","code_sha256_prefix":"6d7acf7b44dc5061","mcp_get_code":{"code_sha256":"6d7acf7b44dc5061"}},{"arxiv_id":"2207.05876","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-diffusion-priors-for-accelerated-mri","title":"Adaptive Diffusion Priors for Accelerated MRI Reconstruction","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"6d7acf7b44dc5061","code_sha256_prefix":"6d7acf7b44dc5061","mcp_get_code":{"code_sha256":"6d7acf7b44dc5061"}},{"arxiv_id":"2112.07804","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-the-generative-learning-trilemma-1","title":"Tackling the Generative Learning Trilemma with Denoising Diffusion GANs","date":"2021-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taki0112/denoising-diffusion-gan-Tensorflow","path":"src/ops.py","file_url":"https://github.com/taki0112/denoising-diffusion-gan-Tensorflow/blob/HEAD/src/ops.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":"bfea3e00a742cd88","code_sha256_prefix":"bfea3e00a742cd88","mcp_get_code":{"code_sha256":"bfea3e00a742cd88"}}],"record_sha256":"98deeec5c3aa1d7753e7c376116074cfc30b79fb5cf8df1e4e8ec252681265aa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}