{"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/conv2d-3","entry":"Conv2D","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":7,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":4,"n_places":10,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":6,"unverified":3},"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":"2405.14739","arxiv_id_is_arxiv":true,"paper":"/paper/flora-low-rank-core-space-for-n-dimension","title":"FLoRA: Low-Rank Core Space for N-dimension","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtu-deepvisionlab/flora","path":"flora/flora.py","file_url":"https://github.com/sjtu-deepvisionlab/flora/blob/HEAD/flora/flora.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sjtu-deepvisionlab/flora when it was checked","code_sha256":"a5f23dee099716f5","code_sha256_prefix":"a5f23dee099716f5","mcp_get_code":{"code_sha256":"a5f23dee099716f5"}},{"arxiv_id":"2307.12493","arxiv_id_is_arxiv":true,"paper":"/paper/tf-icon-diffusion-based-training-free-cross","title":"TF-ICON: Diffusion-Based Training-Free Cross-Domain Image Composition","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shilin-lu/vine","path":"vine/src/vine_turbo.py","file_url":"https://github.com/shilin-lu/vine/blob/HEAD/vine/src/vine_turbo.py","status":"ran","verification_level":1,"contract_check":null,"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, shilin-lu/vine (NOASSERTION)","code_sha256":"32745d47d7d2e2d9","code_sha256_prefix":"32745d47d7d2e2d9","mcp_get_code":{"code_sha256":"32745d47d7d2e2d9"}},{"arxiv_id":"2211.06291","arxiv_id_is_arxiv":true,"paper":"/paper/do-bayesian-neural-networks-need-to-be-fully","title":"Do Bayesian Neural Networks Need To Be Fully Stochastic?","date":"2022-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MrinankSharma/do_bnns_need_to_be_fully_stochastic","path":"VI/baselines/cifar/partially_stochastic_models/partially_stochastic_variational_wide_resnet.py","file_url":"https://github.com/MrinankSharma/do_bnns_need_to_be_fully_stochastic/blob/HEAD/VI/baselines/cifar/partially_stochastic_models/partially_stochastic_variational_wide_resnet.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":"2016192a8b36e38a","code_sha256_prefix":"2016192a8b36e38a","mcp_get_code":{"code_sha256":"2016192a8b36e38a"}},{"arxiv_id":"2203.13963","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-empowered-multi-scale-contextual","title":"Transformer-empowered Multi-scale Contextual Matching and Aggregation for Multi-contrast MRI Super-resolution","date":"2022-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XAIMI-Lab/McMRSR","path":"networks/network_mcmrsr.py","file_url":"https://github.com/XAIMI-Lab/McMRSR/blob/HEAD/networks/network_mcmrsr.py","status":"ran","verification_level":1,"contract_check":null,"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, XAIMI-Lab/McMRSR when it was checked","code_sha256":"c04bdcaa6bd60f73","code_sha256_prefix":"c04bdcaa6bd60f73","mcp_get_code":{"code_sha256":"c04bdcaa6bd60f73"}},{"arxiv_id":"2201.05125","arxiv_id_is_arxiv":true,"paper":"/paper/gradmax-growing-neural-networks-using-1","title":"GradMax: Growing Neural Networks using Gradient Information","date":"2022-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/growneuron","path":"growneuron/cifar/wide_resnet.py","file_url":"https://github.com/google-research/growneuron/blob/HEAD/growneuron/cifar/wide_resnet.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":"2016192a8b36e38a","code_sha256_prefix":"2016192a8b36e38a","mcp_get_code":{"code_sha256":"2016192a8b36e38a"}},{"arxiv_id":"2010.00654","arxiv_id_is_arxiv":true,"paper":"/paper/vaebm-a-symbiosis-between-variational","title":"VAEBM: A Symbiosis between Variational Autoencoders and Energy-based Models","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/VAEBM","path":"ebm_models.py","file_url":"https://github.com/NVlabs/VAEBM/blob/HEAD/ebm_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NVlabs/VAEBM (NOASSERTION)","code_sha256":"7278a7b671e05581","code_sha256_prefix":"7278a7b671e05581","mcp_get_code":{"code_sha256":"7278a7b671e05581"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/NVAE","path":"model.py","file_url":"https://github.com/NVlabs/NVAE/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, NVlabs/NVAE (NOASSERTION)","code_sha256":"a674092cc931b81d","code_sha256_prefix":"a674092cc931b81d","mcp_get_code":{"code_sha256":"a674092cc931b81d"}},{"arxiv_id":"2006.06280","arxiv_id_is_arxiv":true,"paper":"/paper/nanoflow-scalable-normalizing-flows-with","title":"NanoFlow: Scalable Normalizing Flows with Sublinear Parameter Complexity","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"L0SG/NanoFlow","path":"models/nanoflow.py","file_url":"https://github.com/L0SG/NanoFlow/blob/HEAD/models/nanoflow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57d37eb7da3b2ecf","code_sha256_prefix":"57d37eb7da3b2ecf","mcp_get_code":{"code_sha256":"57d37eb7da3b2ecf"}},{"arxiv_id":"1409.1556","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-large","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","date":"2014-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lornatang/tensorflow-vgg","path":"vgg19.py","file_url":"https://github.com/Lornatang/tensorflow-vgg/blob/HEAD/vgg19.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":"b8c8d8eca3e7ec25","code_sha256_prefix":"b8c8d8eca3e7ec25","mcp_get_code":{"code_sha256":"b8c8d8eca3e7ec25"}},{"arxiv_id":"1312.5602","arxiv_id_is_arxiv":true,"paper":"/paper/playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorpack/tensorpack","path":"tensorpack/models/conv2d.py","file_url":"https://github.com/tensorpack/tensorpack/blob/HEAD/tensorpack/models/conv2d.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":"c1adecea275c4a2d","code_sha256_prefix":"c1adecea275c4a2d","mcp_get_code":{"code_sha256":"c1adecea275c4a2d"}}],"record_sha256":"f1128e55eef0a9166fa98c547afd356110098ee71f619bed65cdb054674175e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}