{"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/tensor2image","entry":"tensor2image","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":0,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2308.14575","arxiv_id_is_arxiv":true,"paper":"/paper/referring-image-segmentation-using-text","title":"Referring Image Segmentation Using Text Supervision","date":"2023-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fawnliu/tris","path":"IRNet/imutils.py","file_url":"https://github.com/fawnliu/tris/blob/HEAD/IRNet/imutils.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":"c6139a8991439dca","code_sha256_prefix":"c6139a8991439dca","mcp_get_code":{"code_sha256":"c6139a8991439dca"}},{"arxiv_id":"2203.12691","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-generate-line-drawings-that","title":"Learning to generate line drawings that convey geometry and semantics","date":"2022-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carolineec/informative-drawings","path":"utils.py","file_url":"https://github.com/carolineec/informative-drawings/blob/HEAD/utils.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":"0ee3f9ee92d8a8c6","code_sha256_prefix":"0ee3f9ee92d8a8c6","mcp_get_code":{"code_sha256":"0ee3f9ee92d8a8c6"}},{"arxiv_id":"2008.11062","arxiv_id_is_arxiv":true,"paper":"/paper/gan-slimming-all-in-one-gan-compression-by-a","title":"GAN Slimming: All-in-One GAN Compression by A Unified Optimization Framework","date":"2020-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TAMU-VITA/GAN-Slimming","path":"utils/utils.py","file_url":"https://github.com/TAMU-VITA/GAN-Slimming/blob/HEAD/utils/utils.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":"0ee3f9ee92d8a8c6","code_sha256_prefix":"0ee3f9ee92d8a8c6","mcp_get_code":{"code_sha256":"0ee3f9ee92d8a8c6"}},{"arxiv_id":"2006.08198","arxiv_id_is_arxiv":true,"paper":"/paper/autogan-distiller-searching-to-compress","title":"AutoGAN-Distiller: Searching to Compress Generative Adversarial Networks","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gan-slimming","path":"utils/utils.py","file_url":"https://github.com/vita-group/gan-slimming/blob/HEAD/utils/utils.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":"0ee3f9ee92d8a8c6","code_sha256_prefix":"0ee3f9ee92d8a8c6","mcp_get_code":{"code_sha256":"0ee3f9ee92d8a8c6"}},{"arxiv_id":"2005.12597","arxiv_id_is_arxiv":true,"paper":"/paper/perceptual-extreme-super-resolution-network","title":"Perceptual Extreme Super Resolution Network with Receptive Field Block","date":"2020-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/RFB_ESRGAN-PyTorch","path":"imgproc.py","file_url":"https://github.com/Lornatang/RFB_ESRGAN-PyTorch/blob/HEAD/imgproc.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":"dd73a13fd75b72d0","code_sha256_prefix":"dd73a13fd75b72d0","mcp_get_code":{"code_sha256":"dd73a13fd75b72d0"}},{"arxiv_id":"1904.03377","arxiv_id_is_arxiv":true,"paper":"/paper/blind-super-resolution-with-iterative-kernel","title":"Blind Super-Resolution With Iterative Kernel Correction","date":"2019-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/SFTMD-PyTorch","path":"imgproc.py","file_url":"https://github.com/Lornatang/SFTMD-PyTorch/blob/HEAD/imgproc.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":"bc562954fab9c9fb","code_sha256_prefix":"bc562954fab9c9fb","mcp_get_code":{"code_sha256":"bc562954fab9c9fb"}},{"arxiv_id":"1807.02758","arxiv_id_is_arxiv":true,"paper":"/paper/image-super-resolution-using-very-deep","title":"Image Super-Resolution Using Very Deep Residual Channel Attention Networks","date":"2018-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/CSNLN-PyTorch","path":"imgproc.py","file_url":"https://github.com/Lornatang/CSNLN-PyTorch/blob/HEAD/imgproc.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":"dd73a13fd75b72d0","code_sha256_prefix":"dd73a13fd75b72d0","mcp_get_code":{"code_sha256":"dd73a13fd75b72d0"}},{"arxiv_id":"1609.04802","arxiv_id_is_arxiv":true,"paper":"/paper/photo-realistic-single-image-super-resolution","title":"Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network","date":"2016-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/SRCNN-PyTorch","path":"imgproc.py","file_url":"https://github.com/Lornatang/SRCNN-PyTorch/blob/HEAD/imgproc.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":"dd73a13fd75b72d0","code_sha256_prefix":"dd73a13fd75b72d0","mcp_get_code":{"code_sha256":"dd73a13fd75b72d0"}},{"arxiv_id":"1608.00367","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-the-super-resolution","title":"Accelerating the Super-Resolution Convolutional Neural Network","date":"2016-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/FSRCNN-PyTorch","path":"imgproc.py","file_url":"https://github.com/Lornatang/FSRCNN-PyTorch/blob/HEAD/imgproc.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":"bc562954fab9c9fb","code_sha256_prefix":"bc562954fab9c9fb","mcp_get_code":{"code_sha256":"bc562954fab9c9fb"}},{"arxiv_id":"1511.04587","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-image-super-resolution-using-very","title":"Accurate Image Super-Resolution Using Very Deep Convolutional Networks","date":"2015-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/DRRN-PyTorch","path":"imgproc.py","file_url":"https://github.com/Lornatang/DRRN-PyTorch/blob/HEAD/imgproc.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":"bc562954fab9c9fb","code_sha256_prefix":"bc562954fab9c9fb","mcp_get_code":{"code_sha256":"bc562954fab9c9fb"}}],"record_sha256":"82f3bbd2e489231ff7e2548cdc6ee3b2ce249b3be23b5e90a43bd82259da7011","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}