{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/var-func-geometric","entry":"var_func_geometric","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":8,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2503.11050","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2405.14449","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2401.15889","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2303.05456","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2210.05559","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2207.05876","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}},{"arxiv_id":"2112.07804","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"65846ba5525a01b5","mcp_get_code":{"code_sha256":"65846ba5525a01b5"}}]}