{"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/weight-norm","entry":"weight_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":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":6,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":15,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":3,"ran_fixture":1,"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":"2603.00478","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00478","title":"Benchmarking Few-shot Transferability of Pre-trained Models with Improved Evaluation Protocols","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Frankluox/FewTrans","path":"architectures/classifier/finetune.py","file_url":"https://github.com/Frankluox/FewTrans/blob/HEAD/architectures/classifier/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2471db1563b59f62","code_sha256_prefix":"2471db1563b59f62","mcp_get_code":{"code_sha256":"2471db1563b59f62"}},{"arxiv_id":"2602.03024","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03024","title":"Consistency Deep Equilibrium Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"landrarwolf/CDEQ","path":"CDEQ-src/lib/optimizations.py","file_url":"https://github.com/landrarwolf/CDEQ/blob/HEAD/CDEQ-src/lib/optimizations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, landrarwolf/CDEQ when it was checked","code_sha256":"4bf00e788db9f349","code_sha256_prefix":"4bf00e788db9f349","mcp_get_code":{"code_sha256":"4bf00e788db9f349"}},{"arxiv_id":"2512.23278","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-23278","title":"Flow2GAN: Hybrid Flow Matching and GAN with Multi-Resolution Network for Few-step High-Fidelity Audio Generation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"k2-fsa/Flow2GAN","path":"flow2gan/models/discriminators.py","file_url":"https://github.com/k2-fsa/Flow2GAN/blob/HEAD/flow2gan/models/discriminators.py","status":"unverified","verification_level":0,"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":"353e388680850619","code_sha256_prefix":"353e388680850619","mcp_get_code":{"code_sha256":"353e388680850619"}},{"arxiv_id":"2411.00899","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-for-deep-equilibrium-1","title":"Certified Robustness for Deep Equilibrium Models via Serialized Random Smoothing","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeizhiGao/Serialized-Randomized-Smoothing","path":"DEQ/lib/optimizations.py","file_url":"https://github.com/WeizhiGao/Serialized-Randomized-Smoothing/blob/HEAD/DEQ/lib/optimizations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 landrarwolf/CDEQ, and GitHub detected no licence in that repository when it was checked","code_sha256":"4bf00e788db9f349","code_sha256_prefix":"4bf00e788db9f349","mcp_get_code":{"code_sha256":"4bf00e788db9f349"}},{"arxiv_id":"2407.00626","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-entropy-inverse-reinforcement-1","title":"Maximum Entropy Inverse Reinforcement Learning of Diffusion Models with Energy-Based Models","date":"2024-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swyoon/Diffusion-by-MaxEntIRL","path":"models/utils.py","file_url":"https://github.com/swyoon/Diffusion-by-MaxEntIRL/blob/HEAD/models/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ffd7b0f9be1df615","code_sha256_prefix":"ffd7b0f9be1df615","mcp_get_code":{"code_sha256":"ffd7b0f9be1df615"}},{"arxiv_id":"2308.10873","arxiv_id_is_arxiv":true,"paper":"/paper/spikingbert-distilling-bert-to-train-spiking","title":"SpikingBERT: Distilling BERT to Train Spiking Language Models Using Implicit Differentiation","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurocomplab-psu/spikingbert","path":"implicit_bert/modules/optimizations.py","file_url":"https://github.com/neurocomplab-psu/spikingbert/blob/HEAD/implicit_bert/modules/optimizations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, neurocomplab-psu/spikingbert when it was checked","code_sha256":"f0fda38cdd52aefb","code_sha256_prefix":"f0fda38cdd52aefb","mcp_get_code":{"code_sha256":"f0fda38cdd52aefb"}},{"arxiv_id":"2111.05177","arxiv_id_is_arxiv":true,"paper":"/paper/on-training-implicit-models","title":"On Training Implicit Models","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsunshine/phantom_grad","path":"MDEQ/MDEQ_ImageNet/modules/optimizations.py","file_url":"https://github.com/gsunshine/phantom_grad/blob/HEAD/MDEQ/MDEQ_ImageNet/modules/optimizations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 neurocomplab-psu/spikingbert, and GitHub detected no licence in that repository when it was checked","code_sha256":"f0fda38cdd52aefb","code_sha256_prefix":"f0fda38cdd52aefb","mcp_get_code":{"code_sha256":"f0fda38cdd52aefb"}},{"arxiv_id":"2010.16417","arxiv_id_is_arxiv":true,"paper":"/paper/michigan-multi-input-conditioned-hair-image","title":"MichiGAN: Multi-Input-Conditioned Hair Image Generation for Portrait Editing","date":"2020-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tzt101/MichiGAN","path":"models/networks/normalization.py","file_url":"https://github.com/tzt101/MichiGAN/blob/HEAD/models/networks/normalization.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":"c94542e9e790ad7b","code_sha256_prefix":"c94542e9e790ad7b","mcp_get_code":{"code_sha256":"c94542e9e790ad7b"}},{"arxiv_id":"2007.01628","arxiv_id_is_arxiv":true,"paper":"/paper/hdr-gan-hdr-image-reconstruction-from-multi","title":"HDR-GAN: HDR Image Reconstruction from Multi-Exposed LDR Images with Large Motions","date":"2020-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nonu116/HDR-GAN","path":"model/ops.py","file_url":"https://github.com/nonu116/HDR-GAN/blob/HEAD/model/ops.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":"eee2c043144fd19a","code_sha256_prefix":"eee2c043144fd19a","mcp_get_code":{"code_sha256":"eee2c043144fd19a"}},{"arxiv_id":"2006.08656","arxiv_id_is_arxiv":true,"paper":"/paper/multiscale-deep-equilibrium-models","title":"Multiscale Deep Equilibrium Models","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/deq","path":"MDEQ-Vision/lib/models/mdeq_core.py","file_url":"https://github.com/locuslab/deq/blob/HEAD/MDEQ-Vision/lib/models/mdeq_core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a27206c36724f1c4","code_sha256_prefix":"a27206c36724f1c4","mcp_get_code":{"code_sha256":"a27206c36724f1c4"}},{"arxiv_id":"2001.08514","arxiv_id_is_arxiv":true,"paper":"/paper/filter-sketch-for-network-pruning","title":"Filter Sketch for Network Pruning","date":"2020-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmbxmu/FilterSketch","path":"sketch_cifar.py","file_url":"https://github.com/lmbxmu/FilterSketch/blob/HEAD/sketch_cifar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, lmbxmu/FilterSketch when it was checked","code_sha256":"b6636a7e0eab3af9","code_sha256_prefix":"b6636a7e0eab3af9","mcp_get_code":{"code_sha256":"b6636a7e0eab3af9"}},{"arxiv_id":"2001.01565","arxiv_id_is_arxiv":true,"paper":"/paper/stance-detection-benchmark-how-robust-is-your","title":"Stance Detection Benchmark: How Robust Is Your Stance Detection?","date":"2020-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/mdl-stance-robustness","path":"module/my_optim.py","file_url":"https://github.com/UKPLab/mdl-stance-robustness/blob/HEAD/module/my_optim.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":"0f9a0dbc776dbc60","code_sha256_prefix":"0f9a0dbc776dbc60","mcp_get_code":{"code_sha256":"0f9a0dbc776dbc60"}},{"arxiv_id":"1810.06682","arxiv_id_is_arxiv":true,"paper":"/paper/trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/trellisnet","path":"TrellisNet/optimizations.py","file_url":"https://github.com/locuslab/trellisnet/blob/HEAD/TrellisNet/optimizations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 landrarwolf/CDEQ, and GitHub detected no licence in that repository when it was checked","code_sha256":"4bf00e788db9f349","code_sha256_prefix":"4bf00e788db9f349","mcp_get_code":{"code_sha256":"4bf00e788db9f349"}},{"arxiv_id":"1803.01814","arxiv_id_is_arxiv":true,"paper":"/paper/norm-matters-efficient-and-accurate","title":"Norm matters: efficient and accurate normalization schemes in deep networks","date":"2018-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eladhoffer/norm_matters","path":"models/bwn.py","file_url":"https://github.com/eladhoffer/norm_matters/blob/HEAD/models/bwn.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":"363938bd90a2ba98","code_sha256_prefix":"363938bd90a2ba98","mcp_get_code":{"code_sha256":"363938bd90a2ba98"}},{"arxiv_id":"1803.01814","arxiv_id_is_arxiv":true,"paper":"/paper/norm-matters-efficient-and-accurate","title":"Norm matters: efficient and accurate normalization schemes in deep networks","date":"2018-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eladhoffer/norm_matters","path":"models/bwn_alt.py","file_url":"https://github.com/eladhoffer/norm_matters/blob/HEAD/models/bwn_alt.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":"4113d38a24b49013","code_sha256_prefix":"4113d38a24b49013","mcp_get_code":{"code_sha256":"4113d38a24b49013"}}],"record_sha256":"cee22714ba0ba2d3ec2de8e283149e64ac886d3174499ec5651ab7be55bda259","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}