{"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-fixed-padding","entry":"conv2d_fixed_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":12,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":8,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":0,"unverified":8},"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":"2402.01887","arxiv_id_is_arxiv":true,"paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/CDAN","path":"tensorflow/network.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/tensorflow/network.py","status":"unverified","verification_level":0,"contract_check":null,"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, thuml/CDAN when it was checked","code_sha256":"c756a6986ed2d1b8","code_sha256_prefix":"c756a6986ed2d1b8","mcp_get_code":{"code_sha256":"c756a6986ed2d1b8"}},{"arxiv_id":"2106.05304","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-point-cloud-shape-classification","title":"Revisiting Point Cloud Shape Classification with a Simple and Effective Baseline","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/SimpleView","path":"ScanObjectNN/SimpleView/multi_model.py","file_url":"https://github.com/princeton-vl/SimpleView/blob/HEAD/ScanObjectNN/SimpleView/multi_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a5cb548e4b581359","code_sha256_prefix":"a5cb548e4b581359","mcp_get_code":{"code_sha256":"a5cb548e4b581359"}},{"arxiv_id":"2001.06268","arxiv_id_is_arxiv":true,"paper":"/paper/compounding-the-performance-improvements-of","title":"Compounding the Performance Improvements of Assembled Techniques in a Convolutional Neural Network","date":"2020-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/assembled-cnn","path":"nets/model_helper.py","file_url":"https://github.com/clovaai/assembled-cnn/blob/HEAD/nets/model_helper.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":"c756a6986ed2d1b8","code_sha256_prefix":"c756a6986ed2d1b8","mcp_get_code":{"code_sha256":"c756a6986ed2d1b8"}},{"arxiv_id":"1912.06126","arxiv_id_is_arxiv":true,"paper":"/paper/deep-structured-implicit-functions","title":"Local Deep Implicit Functions for 3D Shape","date":"2019-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google/ldif","path":"ldif/nets/resnet_unet.py","file_url":"https://github.com/google/ldif/blob/HEAD/ldif/nets/resnet_unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from arcelien/pba, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"09f6f950522b2929","code_sha256_prefix":"09f6f950522b2929","mcp_get_code":{"code_sha256":"09f6f950522b2929"}},{"arxiv_id":"1907.10701","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-tpu-gpu-and-cpu-platforms-for","title":"Benchmarking TPU, GPU, and CPU Platforms for Deep Learning","date":"2019-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Emma926/paradnn","path":"paradnn/resnet_model.py","file_url":"https://github.com/Emma926/paradnn/blob/HEAD/paradnn/resnet_model.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":"543e9e36a2b9d04a","code_sha256_prefix":"543e9e36a2b9d04a","mcp_get_code":{"code_sha256":"543e9e36a2b9d04a"}},{"arxiv_id":"1906.01444","arxiv_id_is_arxiv":true,"paper":"/paper/heterogeneous-gaussian-mechanism-preserving","title":"Heterogeneous Gaussian Mechanism: Preserving Differential Privacy in Deep Learning with Provable Robustness","date":"2019-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haiphanNJIT/StoBatch","path":"StoBatchTinyImageNet/resnet_utils.py","file_url":"https://github.com/haiphanNJIT/StoBatch/blob/HEAD/StoBatchTinyImageNet/resnet_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":"60ed1730c5f4efa0","code_sha256_prefix":"60ed1730c5f4efa0","mcp_get_code":{"code_sha256":"60ed1730c5f4efa0"}},{"arxiv_id":"1905.05393","arxiv_id_is_arxiv":true,"paper":"/paper/190505393","title":"Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arcelien/pba","path":"pba/resnet.py","file_url":"https://github.com/arcelien/pba/blob/HEAD/pba/resnet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, arcelien/pba, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"09f6f950522b2929","code_sha256_prefix":"09f6f950522b2929","mcp_get_code":{"code_sha256":"09f6f950522b2929"}},{"arxiv_id":"1812.09803","arxiv_id_is_arxiv":true,"paper":"/paper/guessing-smart-biased-sampling-for-efficient","title":"Guessing Smart: Biased Sampling for Efficient Black-Box Adversarial Attacks","date":"2018-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ttbrunner/biased_boundary_attack_avc","path":"models/resnet18_baseline/resnet_model.py","file_url":"https://github.com/ttbrunner/biased_boundary_attack_avc/blob/HEAD/models/resnet18_baseline/resnet_model.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":"c756a6986ed2d1b8","code_sha256_prefix":"c756a6986ed2d1b8","mcp_get_code":{"code_sha256":"c756a6986ed2d1b8"}},{"arxiv_id":"1812.00442","arxiv_id_is_arxiv":true,"paper":"/paper/deep-cosine-metric-learning-for-person-re","title":"Deep Cosine Metric Learning for Person Re-Identification","date":"2018-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ace19-dev/mvcnn-tf","path":"nets/resnet_model.py","file_url":"https://github.com/ace19-dev/mvcnn-tf/blob/HEAD/nets/resnet_model.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":"00d606fe5c48bd93","code_sha256_prefix":"00d606fe5c48bd93","mcp_get_code":{"code_sha256":"00d606fe5c48bd93"}},{"arxiv_id":"1710.05941","arxiv_id_is_arxiv":true,"paper":"/paper/searching-for-activation-functions","title":"Searching for Activation Functions","date":"2017-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Neoanarika/Searching-for-activation-functions","path":"src/childnetwork.py","file_url":"https://github.com/Neoanarika/Searching-for-activation-functions/blob/HEAD/src/childnetwork.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":"c756a6986ed2d1b8","code_sha256_prefix":"c756a6986ed2d1b8","mcp_get_code":{"code_sha256":"c756a6986ed2d1b8"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aby2s/sharpmask","path":"resnet_model.py","file_url":"https://github.com/aby2s/sharpmask/blob/HEAD/resnet_model.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":"c756a6986ed2d1b8","code_sha256_prefix":"c756a6986ed2d1b8","mcp_get_code":{"code_sha256":"c756a6986ed2d1b8"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelWangfc/distributed-tensorflow-resnet","path":"models/resnet_model_official.py","file_url":"https://github.com/MichaelWangfc/distributed-tensorflow-resnet/blob/HEAD/models/resnet_model_official.py","status":"unverified","verification_level":0,"contract_check":null,"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, MichaelWangfc/distributed-tensorflow-resnet when it was checked","code_sha256":"e81b36632b5e5b93","code_sha256_prefix":"e81b36632b5e5b93","mcp_get_code":{"code_sha256":"e81b36632b5e5b93"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serre-lab/gala_tpu","path":"resnet_model.py","file_url":"https://github.com/serre-lab/gala_tpu/blob/HEAD/resnet_model.py","status":"unverified","verification_level":0,"contract_check":null,"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, serre-lab/gala_tpu when it was checked","code_sha256":"84915b6aa29ee231","code_sha256_prefix":"84915b6aa29ee231","mcp_get_code":{"code_sha256":"84915b6aa29ee231"}},{"arxiv_id":"aaai_16474","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16474","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CQUlearningsystemgroup/BitwiseBottleneck","path":"resnet_model.py","file_url":"https://github.com/CQUlearningsystemgroup/BitwiseBottleneck/blob/HEAD/resnet_model.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":"00d606fe5c48bd93","code_sha256_prefix":"00d606fe5c48bd93","mcp_get_code":{"code_sha256":"00d606fe5c48bd93"}}],"record_sha256":"3fb839f8e27d3e9efd6a4ff04f783118d6789cfc117028b68a78311a0a605538","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}