{"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/zero-pad","entry":"zero_pad","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":9,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":3},"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":"2408.03282","paper":"/paper/2408-03282","title":"AMES: Asymmetric and Memory-Efficient Similarity Estimation for Instance-level Retrieval","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pavelsuma/ames","path":"extract/transforms.py","file_url":"https://github.com/pavelsuma/ames/blob/HEAD/extract/transforms.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e712c383c677282","mcp_get_code":{"code_sha256":"8e712c383c677282"}},{"arxiv_id":"2310.17504","paper":"/paper/revisiting-the-distillation-of-image","title":"Three Pillars improving Vision Foundation Model Distillation for Lidar","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"valeoai/scalr","path":"datasets/pc_dataset.py","file_url":"https://github.com/valeoai/scalr/blob/HEAD/datasets/pc_dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5246673a20ebda4e","mcp_get_code":{"code_sha256":"5246673a20ebda4e"}},{"arxiv_id":"2308.04008","paper":"/paper/coarse-to-fine-learning-compact","title":"Coarse-to-Fine: Learning Compact Discriminative Representation for Single-Stage Image Retrieval","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feymanpriv/DOLG-paddle","path":"infer.py","file_url":"https://github.com/feymanpriv/DOLG-paddle/blob/HEAD/infer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e712c383c677282","mcp_get_code":{"code_sha256":"8e712c383c677282"}},{"arxiv_id":"2209.12892","paper":"/paper/learning-to-learn-with-generative-models-of","title":"Learning to Learn with Generative Models of Neural Network Checkpoints","date":"2022-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wpeebles/g.pt","path":"data_gen/train_cifar10.py","file_url":"https://github.com/wpeebles/g.pt/blob/HEAD/data_gen/train_cifar10.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"8e712c383c677282","mcp_get_code":{"code_sha256":"8e712c383c677282"}},{"arxiv_id":"2105.03245","paper":"/paper/adaptive-focus-for-efficient-video","title":"Adaptive Focus for Efficient Video Recognition","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blackfeather-wang/AdaFocus","path":"Experiments on ActivityNet, FCVID and Mini-Kinetics/models/gfv_net.py","file_url":"https://github.com/blackfeather-wang/AdaFocus/blob/HEAD/Experiments%20on%20ActivityNet%2C%20FCVID%20and%20Mini-Kinetics/models/gfv_net.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8e712c383c677282","mcp_get_code":{"code_sha256":"8e712c383c677282"}},{"arxiv_id":"2003.13678","paper":"/paper/designing-network-design-spaces","title":"Designing Network Design Spaces","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alessiacosmos/Basic-RegNet-pytorch","path":"utils/transform.py","file_url":"https://github.com/Alessiacosmos/Basic-RegNet-pytorch/blob/HEAD/utils/transform.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94d1acf6801b9a00","mcp_get_code":{"code_sha256":"94d1acf6801b9a00"}},{"arxiv_id":"1912.08628","paper":"/paper/unsupervised-change-detection-in-multi","title":"Unsupervised Change Detection in Multi-temporal VHR Images Based on Deep Kernel PCA Convolutional Mapping Network","date":"2019-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"I-Hope-Peace/ChangeDetectionRepository","path":"Methodology/Traditional/PCAKmeans/util.py","file_url":"https://github.com/I-Hope-Peace/ChangeDetectionRepository/blob/HEAD/Methodology/Traditional/PCAKmeans/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3bd0e27058549fe6","mcp_get_code":{"code_sha256":"3bd0e27058549fe6"}},{"arxiv_id":"1905.05393","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":"autoaugment/custom_ops.py","file_url":"https://github.com/arcelien/pba/blob/HEAD/autoaugment/custom_ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"563e25e514f4a2a6","mcp_get_code":{"code_sha256":"563e25e514f4a2a6"}},{"arxiv_id":"1904.12848","paper":"/paper/unsupervised-data-augmentation-1","title":"Unsupervised Data Augmentation for Consistency Training","date":"2019-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/uda","path":"image/randaugment/custom_ops.py","file_url":"https://github.com/google-research/uda/blob/HEAD/image/randaugment/custom_ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"563e25e514f4a2a6","mcp_get_code":{"code_sha256":"563e25e514f4a2a6"}}]}