{"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/same-padding","entry":"same_padding","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":10,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":3,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":2,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"ran":3,"unverified":0},"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":"2606.03118","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03118","title":"Learning to see via epiretinal implant stimulation in silico with model-based deep reinforcement learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"NECOTIS/rlretina","path":"src/misc.py","file_url":"https://github.com/NECOTIS/rlretina/blob/HEAD/src/misc.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a996ec7a7d5ccdcc","code_sha256_prefix":"a996ec7a7d5ccdcc","mcp_get_code":{"code_sha256":"a996ec7a7d5ccdcc"}},{"arxiv_id":"2109.06620","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-attentive-graph-learning-for-image","title":"Dynamic Attentive Graph Learning for Image Restoration","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianzhangcs/DAGL","path":"CAR/model/dagl.py","file_url":"https://github.com/jianzhangcs/DAGL/blob/HEAD/CAR/model/dagl.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, jianzhangcs/DAGL when it was checked","code_sha256":"79ada952b2a051a0","code_sha256_prefix":"79ada952b2a051a0","mcp_get_code":{"code_sha256":"79ada952b2a051a0"}},{"arxiv_id":"2108.11084","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-transformer-for-single-image-super","title":"Transformer for Single Image Super-Resolution","date":"2021-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luissen/esrt","path":"util/tools.py","file_url":"https://github.com/luissen/esrt/blob/HEAD/util/tools.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":"fd1ff803fc207b8e","code_sha256_prefix":"fd1ff803fc207b8e","mcp_get_code":{"code_sha256":"fd1ff803fc207b8e"}},{"arxiv_id":"2104.00298","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DavidLandup0/deepvision","path":"deepvision/models/classification/efficientnet/efficientnetv2.py","file_url":"https://github.com/DavidLandup0/deepvision/blob/HEAD/deepvision/models/classification/efficientnet/efficientnetv2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec08335b5c6ecfc3","code_sha256_prefix":"ec08335b5c6ecfc3","mcp_get_code":{"code_sha256":"ec08335b5c6ecfc3"}},{"arxiv_id":"2103.11511","arxiv_id_is_arxiv":true,"paper":"/paper/movinets-mobile-video-networks-for-efficient","title":"MoViNets: Mobile Video Networks for Efficient Video Recognition","date":"2021-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Atze00/MoViNet-pytorch","path":"movinets/models.py","file_url":"https://github.com/Atze00/MoViNet-pytorch/blob/HEAD/movinets/models.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1679ae00114efb03","code_sha256_prefix":"1679ae00114efb03","mcp_get_code":{"code_sha256":"1679ae00114efb03"}},{"arxiv_id":"2007.03109","arxiv_id_is_arxiv":true,"paper":"/paper/cycle-starnet-bridging-the-gap-between-theory","title":"Cycle-StarNet: Bridging the gap between theory and data by leveraging large datasets","date":"2020-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teaghan/cycle_sn","path":"network.py","file_url":"https://github.com/teaghan/cycle_sn/blob/HEAD/network.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, teaghan/cycle_sn, is not in the permissive set Syntology serves inline","code_sha256":"d91f62268a99501f","code_sha256_prefix":"d91f62268a99501f","mcp_get_code":{"code_sha256":"d91f62268a99501f"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rdbch/tutorial_simclr","path":"core/nn/blocks/utils.py","file_url":"https://github.com/rdbch/tutorial_simclr/blob/HEAD/core/nn/blocks/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":"122255f68540f240","code_sha256_prefix":"122255f68540f240","mcp_get_code":{"code_sha256":"122255f68540f240"}},{"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":"model.py","file_url":"https://github.com/Lornatang/CSNLN-PyTorch/blob/HEAD/model.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":"4373e1ddd1bd3573","code_sha256_prefix":"4373e1ddd1bd3573","mcp_get_code":{"code_sha256":"4373e1ddd1bd3573"}},{"arxiv_id":"1606.05328","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-image-generation-with-pixelcnn","title":"Conditional Image Generation with PixelCNN Decoders","date":"2016-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkleidal/gatedpixelcnnpytorch","path":"models/components/pixelcnn.py","file_url":"https://github.com/kkleidal/gatedpixelcnnpytorch/blob/HEAD/models/components/pixelcnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2d883de2fd93619","code_sha256_prefix":"b2d883de2fd93619","mcp_get_code":{"code_sha256":"b2d883de2fd93619"}},{"arxiv_id":"Guo_Painting_From_Part_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Guo_Painting_From_Part_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zhenglab/partpainting","path":"src/utils.py","file_url":"https://github.com/zhenglab/partpainting/blob/HEAD/src/utils.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":"fd1ff803fc207b8e","code_sha256_prefix":"fd1ff803fc207b8e","mcp_get_code":{"code_sha256":"fd1ff803fc207b8e"}}],"record_sha256":"dcae6daaef1cc84149d639bf4bd5fffcb7d393d8125864a8e5e4ffd5fd571846","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}