{"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/power-iteration","entry":"power_iteration","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":30,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":25,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":7,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":30,"n_places_pointer_only":5,"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":5,"ran_fixture":2,"ran":2,"unverified":1},"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":"2602.06694","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06694","title":"NANOQUANT: Efficient Sub-1-Bit Quantization of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"SamsungLabs/NanoQuant","path":"src/nanoquant/core/admm_nq.py","file_url":"https://github.com/SamsungLabs/NanoQuant/blob/HEAD/src/nanoquant/core/admm_nq.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fbf2e7de4ef108c7","code_sha256_prefix":"fbf2e7de4ef108c7","mcp_get_code":{"code_sha256":"fbf2e7de4ef108c7"}},{"arxiv_id":"2412.06209","arxiv_id_is_arxiv":true,"paper":"/paper/sound2vision-generating-diverse-visuals-from","title":"Sound2Vision: Generating Diverse Visuals from Audio through Cross-Modal Latent Alignment","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"postech-ami/Sound2Scene","path":"BigGAN_PyTorch/layers.py","file_url":"https://github.com/postech-ami/Sound2Scene/blob/HEAD/BigGAN_PyTorch/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2410.19294","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-zero-shot-vision-models-by-label","title":"Enhancing Zero-Shot Vision Models by Label-Free Prompt Distribution Learning and Bias Correcting","date":"2024-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuhsingyuu/Frolic","path":"main_zeroshot.py","file_url":"https://github.com/zhuhsingyuu/Frolic/blob/HEAD/main_zeroshot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, zhuhsingyuu/Frolic when it was checked","code_sha256":"589b2c2591399402","code_sha256_prefix":"589b2c2591399402","mcp_get_code":{"code_sha256":"589b2c2591399402"}},{"arxiv_id":"2312.14461","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-byzantine-robust-aggregation-in","title":"Attacking Byzantine Robust Aggregation in High Dimensions","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sarthak-choudhary/hidra","path":"src/utils.py","file_url":"https://github.com/sarthak-choudhary/hidra/blob/HEAD/src/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sarthak-choudhary/hidra (NOASSERTION)","code_sha256":"fa0f36a2e9c675c9","code_sha256_prefix":"fa0f36a2e9c675c9","mcp_get_code":{"code_sha256":"fa0f36a2e9c675c9"}},{"arxiv_id":"2310.19342","arxiv_id_is_arxiv":true,"paper":"/paper/label-only-model-inversion-attacks-via-1","title":"Label-Only Model Inversion Attacks via Knowledge Transfer","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanPeng0897/Defend_MI","path":"VMI/layers.py","file_url":"https://github.com/AlanPeng0897/Defend_MI/blob/HEAD/VMI/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2306.07179","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-neural-network-training","title":"Benchmarking Neural Network Training Algorithms","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/optax","path":"optax/_src/linear_algebra.py","file_url":"https://github.com/deepmind/optax/blob/HEAD/optax/_src/linear_algebra.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":"ed4ddeade9eb2eee","code_sha256_prefix":"ed4ddeade9eb2eee","mcp_get_code":{"code_sha256":"ed4ddeade9eb2eee"}},{"arxiv_id":"2304.13742","arxiv_id_is_arxiv":true,"paper":"/paper/tr0n-translator-networks-for-0-shot-plug-and","title":"TR0N: Translator Networks for 0-Shot Plug-and-Play Conditional Generation","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gnobitab/FuseDream","path":"BigGAN_utils/layers.py","file_url":"https://github.com/gnobitab/FuseDream/blob/HEAD/BigGAN_utils/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2303.15269","arxiv_id_is_arxiv":true,"paper":"/paper/handwritten-text-generation-from-visual","title":"Handwritten Text Generation from Visual Archetypes","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hnam-1765/writevit","path":"models/BigGAN_layers.py","file_url":"https://github.com/hnam-1765/writevit/blob/HEAD/models/BigGAN_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2211.08453","arxiv_id_is_arxiv":true,"paper":"/paper/improved-techniques-for-deterministic-l2","title":"Improved techniques for deterministic l2 robustness","date":"2022-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"singlasahil14/improved_l2_robustness","path":"block_ortho_conv.py","file_url":"https://github.com/singlasahil14/improved_l2_robustness/blob/HEAD/block_ortho_conv.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, singlasahil14/improved_l2_robustness when it was checked","code_sha256":"596e8fdbd9c6e7cf","code_sha256_prefix":"596e8fdbd9c6e7cf","mcp_get_code":{"code_sha256":"596e8fdbd9c6e7cf"}},{"arxiv_id":"2206.05483","arxiv_id_is_arxiv":true,"paper":"/paper/bilateral-dependency-optimization-defending","title":"Bilateral Dependency Optimization: Defending Against Model-inversion Attacks","date":"2022-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpeng9719/defend_mi","path":"VMI/layers.py","file_url":"https://github.com/xpeng9719/defend_mi/blob/HEAD/VMI/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2205.15677","arxiv_id_is_arxiv":true,"paper":"/paper/augmentation-aware-self-supervision-for-data-1","title":"Augmentation-Aware Self-Supervision for Data-Efficient GAN Training","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liang-hou/augself-gan","path":"augself-biggan/layers.py","file_url":"https://github.com/liang-hou/augself-gan/blob/HEAD/augself-biggan/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2201.12179","arxiv_id_is_arxiv":true,"paper":"/paper/plug-play-attacks-towards-robust-and-flexible","title":"Plug & Play Attacks: Towards Robust and Flexible Model Inversion Attacks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajbrock/BigGAN-PyTorch","path":"layers.py","file_url":"https://github.com/ajbrock/BigGAN-PyTorch/blob/HEAD/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2106.03194","arxiv_id_is_arxiv":true,"paper":"/paper/robust-implicit-networks-via-non-euclidean","title":"Robust Implicit Networks via Non-Euclidean Contractions","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davydovalexander/non-euclidean_mon_op_net","path":"utils.py","file_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net/blob/HEAD/utils.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":"1ecf9b50659d7670","code_sha256_prefix":"1ecf9b50659d7670","mcp_get_code":{"code_sha256":"1ecf9b50659d7670"}},{"arxiv_id":"2102.06696","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-conditional-gan-transfer-with","title":"Efficient Conditional GAN Transfer with Knowledge Propagation across Classes","date":"2021-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshahbazi72/cGANTransfer","path":"BigGAN.py","file_url":"https://github.com/mshahbazi72/cGANTransfer/blob/HEAD/BigGAN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mshahbazi72/cGANTransfer when it was checked","code_sha256":"9d88cf6296bed90f","code_sha256_prefix":"9d88cf6296bed90f","mcp_get_code":{"code_sha256":"9d88cf6296bed90f"}},{"arxiv_id":"2009.05475","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-score-matching-and-improved","title":"Adversarial score matching and improved sampling for image generation","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexiaJM/AdversarialConsistentScoreMatching","path":"models/layers_biggan.py","file_url":"https://github.com/AlexiaJM/AdversarialConsistentScoreMatching/blob/HEAD/models/layers_biggan.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2003.13659","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-deep-generative-prior-for","title":"Exploiting Deep Generative Prior for Versatile Image Restoration and Manipulation","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XingangPan/deep-generative-prior","path":"models/layers.py","file_url":"https://github.com/XingangPan/deep-generative-prior/blob/HEAD/models/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"2003.10557","arxiv_id_is_arxiv":true,"paper":"/paper/scrabblegan-semi-supervised-varying-length","title":"ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generation","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/convolutional-handwriting-gan","path":"models/BigGAN_layers.py","file_url":"https://github.com/amzn/convolutional-handwriting-gan/blob/HEAD/models/BigGAN_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"1912.05270","arxiv_id_is_arxiv":true,"paper":"/paper/minegan-effective-knowledge-transfer-from","title":"MineGAN: effective knowledge transfer from GANs to target domains with few images","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaxingwang/MineGAN","path":"layers.py","file_url":"https://github.com/yaxingwang/MineGAN/blob/HEAD/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"1912.00953","arxiv_id_is_arxiv":true,"paper":"/paper/logan-latent-optimisation-for-generative-1","title":"LOGAN: Latent Optimisation for Generative Adversarial Networks","date":"2019-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hosein47/LOGAN","path":"layers.py","file_url":"https://github.com/Hosein47/LOGAN/blob/HEAD/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"1911.00937","arxiv_id_is_arxiv":true,"paper":"/paper/preventing-gradient-attenuation-in-lipschitz","title":"Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networks","date":"2019-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ColinQiyangLi/LConvNet","path":"lconvnet/layers/bcop.py","file_url":"https://github.com/ColinQiyangLi/LConvNet/blob/HEAD/lconvnet/layers/bcop.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"264dacf0aae30538","code_sha256_prefix":"264dacf0aae30538","mcp_get_code":{"code_sha256":"264dacf0aae30538"}},{"arxiv_id":"1910.05852","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-competitive-regularization-in-gans-1","title":"Implicit competitive regularization in GANs","date":"2019-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devzhk/Implicit-Competitive-Regularization","path":"GANs/layers.py","file_url":"https://github.com/devzhk/Implicit-Competitive-Regularization/blob/HEAD/GANs/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"1811.10597","arxiv_id_is_arxiv":true,"paper":"/paper/gan-dissection-visualizing-and-understanding","title":"GAN Dissection: Visualizing and Understanding Generative Adversarial Networks","date":"2018-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexandonian/ganocracy","path":"gan_training/ganocracy/layers/norm.py","file_url":"https://github.com/alexandonian/ganocracy/blob/HEAD/gan_training/ganocracy/layers/norm.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":"c14a1db70dacc94a","code_sha256_prefix":"c14a1db70dacc94a","mcp_get_code":{"code_sha256":"c14a1db70dacc94a"}},{"arxiv_id":"1809.11096","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-gan-training-for-high-fidelity","title":"Large Scale GAN Training for High Fidelity Natural Image Synthesis","date":"2018-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kidist-amde/biggan-pytorch","path":"layers.py","file_url":"https://github.com/kidist-amde/biggan-pytorch/blob/HEAD/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"1802.08241","arxiv_id_is_arxiv":true,"paper":"/paper/hessian-based-analysis-of-large-batch","title":"Hessian-based Analysis of Large Batch Training and Robustness to Adversaries","date":"2018-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ABadCandy/HessianDL","path":"hessian_eigenthings/power_iter.py","file_url":"https://github.com/ABadCandy/HessianDL/blob/HEAD/hessian_eigenthings/power_iter.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"604f7701e0559dac","code_sha256_prefix":"604f7701e0559dac","mcp_get_code":{"code_sha256":"604f7701e0559dac"}},{"arxiv_id":"1707.02670","arxiv_id_is_arxiv":true,"paper":"/paper/accelerated-stochastic-power-iteration","title":"Accelerated Stochastic Power Iteration","date":"2017-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"604f7701e0559dac","code_sha256_prefix":"604f7701e0559dac","mcp_get_code":{"code_sha256":"604f7701e0559dac"}},{"arxiv_id":"aaai_32174","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32174","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"VectorInstitute/GenerativeSSL","path":"data_generation/icgan/BigGAN_PyTorch/layers.py","file_url":"https://github.com/VectorInstitute/GenerativeSSL/blob/HEAD/data_generation/icgan/BigGAN_PyTorch/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"aaai_20902","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20902","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bxz9200/CLPA","path":"layers.py","file_url":"https://github.com/bxz9200/CLPA/blob/HEAD/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"aaai_20247","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20247","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"csmiler/ProbeGAN","path":"layers.py","file_url":"https://github.com/csmiler/ProbeGAN/blob/HEAD/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"aaai_16917","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16917","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ganji15/HiGAN","path":"networks/BigGAN_layers.py","file_url":"https://github.com/ganji15/HiGAN/blob/HEAD/networks/BigGAN_layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28d3a35157f2916d","code_sha256_prefix":"28d3a35157f2916d","mcp_get_code":{"code_sha256":"28d3a35157f2916d"}},{"arxiv_id":"Zhang_Generative_Gradient_Inversion_via_Over-Parameterized_Networks_in_Federated_Learning_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Zhang_Generative_Gradient_Inversion_via_Over-Parameterized_Networks_in_Federated_Learning_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"czhang024/CI-Net","path":"layers/norm.py","file_url":"https://github.com/czhang024/CI-Net/blob/HEAD/layers/norm.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":"c14a1db70dacc94a","code_sha256_prefix":"c14a1db70dacc94a","mcp_get_code":{"code_sha256":"c14a1db70dacc94a"}}],"record_sha256":"90c19eb46342b45c1e52c3fb03d34c65a12eb34bc77d4316d1dc1fe37a9b9b7c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}