{"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/pixel-norm","entry":"pixel_norm","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":13,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":9,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":9,"n_places":16,"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":1,"ran_draft_wrong":5,"ran_fixture":0,"ran":3,"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.11983","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11983","title":"QDSB: Quantized Diffusion Schrödinger Bridges","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mathefuchs/qdsb","path":"ALAE/net.py","file_url":"https://github.com/mathefuchs/qdsb/blob/HEAD/ALAE/net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a320e6151da0b774","code_sha256_prefix":"a320e6151da0b774","mcp_get_code":{"code_sha256":"a320e6151da0b774"}},{"arxiv_id":"2602.02241","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02241","title":"Variational Entropic Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"DrEternity/VarEOT","path":"ALAE/net.py","file_url":"https://github.com/DrEternity/VarEOT/blob/HEAD/ALAE/net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a320e6151da0b774","code_sha256_prefix":"a320e6151da0b774","mcp_get_code":{"code_sha256":"a320e6151da0b774"}},{"arxiv_id":"2511.06856","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-06856","title":"Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"ngushchin/LightSB","path":"ALAE/net.py","file_url":"https://github.com/ngushchin/LightSB/blob/HEAD/ALAE/net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a320e6151da0b774","code_sha256_prefix":"a320e6151da0b774","mcp_get_code":{"code_sha256":"a320e6151da0b774"}},{"arxiv_id":"2507.03738","arxiv_id_is_arxiv":true,"paper":"/paper/flow-anchored-consistency-models","title":"Flow-Anchored Consistency Models","date":"2025-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ali-vilab/FACM","path":"ldit/lightningdit.py","file_url":"https://github.com/ali-vilab/FACM/blob/HEAD/ldit/lightningdit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ffded33c11b4d7f","code_sha256_prefix":"4ffded33c11b4d7f","mcp_get_code":{"code_sha256":"4ffded33c11b4d7f"}},{"arxiv_id":"2402.03207","arxiv_id_is_arxiv":true,"paper":"/paper/light-and-optimal-schrodinger-bridge-matching","title":"Light and Optimal Schrödinger Bridge Matching","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skholkin/lightsb-matching","path":"ALAE/net.py","file_url":"https://github.com/skholkin/lightsb-matching/blob/HEAD/ALAE/net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a320e6151da0b774","code_sha256_prefix":"a320e6151da0b774","mcp_get_code":{"code_sha256":"a320e6151da0b774"}},{"arxiv_id":"2312.02696","arxiv_id_is_arxiv":true,"paper":"/paper/analyzing-and-improving-the-training-dynamics","title":"Analyzing and Improving the Training Dynamics of Diffusion Models","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mmathew23/improved_edm","path":"model_a.py","file_url":"https://github.com/mmathew23/improved_edm/blob/HEAD/model_a.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":"a0d505b2d6c56221","code_sha256_prefix":"a0d505b2d6c56221","mcp_get_code":{"code_sha256":"a0d505b2d6c56221"}},{"arxiv_id":"2310.13545","arxiv_id_is_arxiv":true,"paper":"/paper/scalelong-towards-more-stable-training-of-1","title":"ScaleLong: Towards More Stable Training of Diffusion Model via Scaling Network Long Skip Connection","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YichengDWu/tinyedm","path":"src/tinyedm/networks.py","file_url":"https://github.com/YichengDWu/tinyedm/blob/HEAD/src/tinyedm/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"029abee41f338892","code_sha256_prefix":"029abee41f338892","mcp_get_code":{"code_sha256":"029abee41f338892"}},{"arxiv_id":"2310.01174","arxiv_id_is_arxiv":true,"paper":"/paper/light-schrodinger-bridge","title":"Light Schrödinger Bridge","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/lightsb","path":"ALAE/net.py","file_url":"https://github.com/ngushchin/lightsb/blob/HEAD/ALAE/net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a320e6151da0b774","code_sha256_prefix":"a320e6151da0b774","mcp_get_code":{"code_sha256":"a320e6151da0b774"}},{"arxiv_id":"2211.04446","arxiv_id_is_arxiv":true,"paper":"/paper/private-set-generation-with-discriminative","title":"Private Set Generation with Discriminative Information","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/Private-Set","path":"utils/gan_models.py","file_url":"https://github.com/DingfanChen/Private-Set/blob/HEAD/utils/gan_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":"2923c1cac02c9741","code_sha256_prefix":"2923c1cac02c9741","mcp_get_code":{"code_sha256":"2923c1cac02c9741"}},{"arxiv_id":"2006.08265","arxiv_id_is_arxiv":true,"paper":"/paper/gs-wgan-a-gradient-sanitized-approach-for","title":"GS-WGAN: A Gradient-Sanitized Approach for Learning Differentially Private Generators","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/GS-WGAN","path":"source/models.py","file_url":"https://github.com/DingfanChen/GS-WGAN/blob/HEAD/source/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8806db0f5a8e90fe","code_sha256_prefix":"8806db0f5a8e90fe","mcp_get_code":{"code_sha256":"8806db0f5a8e90fe"}},{"arxiv_id":"1903.06048","arxiv_id_is_arxiv":true,"paper":"/paper/msg-gan-multi-scale-gradients-gan-for-more","title":"MSG-GAN: Multi-Scale Gradients for Generative Adversarial Networks","date":"2019-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"denizalperacar/MSG-GAN","path":"src/custom.py","file_url":"https://github.com/denizalperacar/MSG-GAN/blob/HEAD/src/custom.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":"968fdef6839bc97b","code_sha256_prefix":"968fdef6839bc97b","mcp_get_code":{"code_sha256":"968fdef6839bc97b"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ariel415el/ALAE","path":"dnn/models/ALAE.py","file_url":"https://github.com/ariel415el/ALAE/blob/HEAD/dnn/models/ALAE.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, ariel415el/ALAE when it was checked","code_sha256":"53cbc9807252d6bb","code_sha256_prefix":"53cbc9807252d6bb","mcp_get_code":{"code_sha256":"53cbc9807252d6bb"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"itsuki8914/stylegan-TensorFlow","path":"model.py","file_url":"https://github.com/itsuki8914/stylegan-TensorFlow/blob/HEAD/model.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, itsuki8914/stylegan-TensorFlow when it was checked","code_sha256":"23853da12048dc7b","code_sha256_prefix":"23853da12048dc7b","mcp_get_code":{"code_sha256":"23853da12048dc7b"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LignumResearch/stylewood-model-usage","path":"training/networks_progan.py","file_url":"https://github.com/LignumResearch/stylewood-model-usage/blob/HEAD/training/networks_progan.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, LignumResearch/stylewood-model-usage (NOASSERTION)","code_sha256":"7097a717f49d5fcf","code_sha256_prefix":"7097a717f49d5fcf","mcp_get_code":{"code_sha256":"7097a717f49d5fcf"}},{"arxiv_id":"1812.04948","arxiv_id_is_arxiv":true,"paper":"/paper/a-style-based-generator-architecture-for","title":"A Style-Based Generator Architecture for Generative Adversarial Networks","date":"2018-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"comp-imaging-sci/pic-recon","path":"stylegan2/training/networks_stylegan.py","file_url":"https://github.com/comp-imaging-sci/pic-recon/blob/HEAD/stylegan2/training/networks_stylegan.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":"b2c9a27d23830a25","code_sha256_prefix":"b2c9a27d23830a25","mcp_get_code":{"code_sha256":"b2c9a27d23830a25"}},{"arxiv_id":"1807.07543","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-interpolation-in","title":"Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer","date":"2018-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivanvovk/controllable-face-generation","path":"modules.py","file_url":"https://github.com/ivanvovk/controllable-face-generation/blob/HEAD/modules.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a320e6151da0b774","code_sha256_prefix":"a320e6151da0b774","mcp_get_code":{"code_sha256":"a320e6151da0b774"}}],"record_sha256":"a183b958cf059a4d92f4e4ac2f9ae6be583308df8e1bcfbceb618d1946bab918","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}