{"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/analytic-kernel","entry":"analytic_kernel","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":6,"n_papers_ran":5,"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":2,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2312.07330","paper":"/paper/learned-representation-guided-diffusion","title":"Learned representation-guided diffusion models for large-image generation","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvlab-stonybrook/large-image-diffusion","path":"ldm/modules/image_degradation/bsrgan.py","file_url":"https://github.com/cvlab-stonybrook/large-image-diffusion/blob/HEAD/ldm/modules/image_degradation/bsrgan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b04722a19845dc90","mcp_get_code":{"code_sha256":"b04722a19845dc90"}},{"arxiv_id":"2310.19011","paper":"/paper/efficient-test-time-adaptation-for-super-1","title":"Efficient Test-Time Adaptation for Super-Resolution with Second-Order Degradation and Reconstruction","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dengzeshuai/srtta","path":"src/utils/utils_blindsr.py","file_url":"https://github.com/dengzeshuai/srtta/blob/HEAD/src/utils/utils_blindsr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b04722a19845dc90","mcp_get_code":{"code_sha256":"b04722a19845dc90"}},{"arxiv_id":"2308.02228","paper":"/paper/painterly-image-harmonization-using-diffusion","title":"Painterly Image Harmonization using Diffusion Model","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bcmi/phdiffusion-painterly-image-harmonization","path":"ldm/modules/image_degradation/bsrgan.py","file_url":"https://github.com/bcmi/phdiffusion-painterly-image-harmonization/blob/HEAD/ldm/modules/image_degradation/bsrgan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b04722a19845dc90","mcp_get_code":{"code_sha256":"b04722a19845dc90"}},{"arxiv_id":"2305.01644","paper":"/paper/key-locked-rank-one-editing-for-text-to-image","title":"Key-Locked Rank One Editing for Text-to-Image Personalization","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenDarYen/Key-Locked-Rank-One-Editing-for-Text-to-Image-Personalization","path":"ldm/modules/image_degradation/bsrgan.py","file_url":"https://github.com/ChenDarYen/Key-Locked-Rank-One-Editing-for-Text-to-Image-Personalization/blob/HEAD/ldm/modules/image_degradation/bsrgan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b04722a19845dc90","mcp_get_code":{"code_sha256":"b04722a19845dc90"}},{"arxiv_id":"2103.14006","paper":"/paper/designing-a-practical-degradation-model-for","title":"Designing a Practical Degradation Model for Deep Blind Image Super-Resolution","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadirnar/bsrgan-pip","path":"bsrgan/utils/utils_blindsr.py","file_url":"https://github.com/kadirnar/bsrgan-pip/blob/HEAD/bsrgan/utils/utils_blindsr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b04722a19845dc90","mcp_get_code":{"code_sha256":"b04722a19845dc90"}},{"arxiv_id":"2010.00879","paper":"/paper/understanding-approximate-fisher-information","title":"Understanding Approximate Fisher Information for Fast Convergence of Natural Gradient Descent in Wide Neural Networks","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kazukiosawa/ngd_in_wide_nn","path":"numpy-based/analytical.py","file_url":"https://github.com/kazukiosawa/ngd_in_wide_nn/blob/HEAD/numpy-based/analytical.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"06a25a41e742052f","mcp_get_code":{"code_sha256":"06a25a41e742052f"}}]}