{"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/transform-matrix-offset-center","entry":"transform_matrix_offset_center","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":11,"n_papers_ran":11,"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":3,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"unverified":0},"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":"2608.11815","paper":"/paper/arxiv-2608-11815","title":"Learning with Bilevel-Minimax Optimization for Efficient and Reliable Transfer Attacks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"callous-youth/BMAT","path":"bmat/bmat_attack.py","file_url":"https://github.com/callous-youth/BMAT/blob/HEAD/bmat/bmat_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3c85a6426b383b41","mcp_get_code":{"code_sha256":"3c85a6426b383b41"}},{"arxiv_id":"2510.10100","paper":"/paper/arxiv-2510-10100","title":"Cooperative Pseudo Labeling for Unsupervised Federated Classification","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"krumpguo/FedCoPL","path":"methods/data_aug_utils.py","file_url":"https://github.com/krumpguo/FedCoPL/blob/HEAD/methods/data_aug_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"2312.13555","paper":"/paper/cr-sam-curvature-regularized-sharpness-aware","title":"CR-SAM: Curvature Regularized Sharpness-Aware Minimization","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trustaiot/cr-sam","path":"utils/autoaugment.py","file_url":"https://github.com/trustaiot/cr-sam/blob/HEAD/utils/autoaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"2311.16450","paper":"/paper/typhoon-intensity-prediction-with-vision","title":"Typhoon Intensity Prediction with Vision Transformer","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chen-huanxin/Tint","path":"data_augmentation/auto_augment.py","file_url":"https://github.com/chen-huanxin/Tint/blob/HEAD/data_augmentation/auto_augment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"2204.00008","paper":"/paper/improving-adversarial-transferability-via","title":"Improving Adversarial Transferability via Neuron Attribution-Based Attacks","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anlthms/nips-2017","path":"mmd/defense_mmd.py","file_url":"https://github.com/anlthms/nips-2017/blob/HEAD/mmd/defense_mmd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"3c85a6426b383b41","mcp_get_code":{"code_sha256":"3c85a6426b383b41"}},{"arxiv_id":"1909.13719","paper":"/paper/randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"1908.09791","paper":"/paper/once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/ofa-cifar","path":"ofa/imagenet_classification/data_providers/cifar10.py","file_url":"https://github.com/pprp/ofa-cifar/blob/HEAD/ofa/imagenet_classification/data_providers/cifar10.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"1904.09546","paper":"/paper/deepcaps-going-deeper-with-capsule-networks","title":"DeepCaps: Going Deeper with Capsule Networks","date":"2019-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HopefulRational/DeepCaps-PyTorch","path":"deepcaps.py","file_url":"https://github.com/HopefulRational/DeepCaps-PyTorch/blob/HEAD/deepcaps.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f1391c2b4e040dc5","mcp_get_code":{"code_sha256":"f1391c2b4e040dc5"}},{"arxiv_id":"1903.05285","paper":"/paper/all-you-need-is-a-few-shifts-designing","title":"All You Need is a Few Shifts: Designing Efficient Convolutional Neural Networks for Image Classification","date":"2019-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hikvision-research/SparseShiftLayer","path":"models/auto_augment.py","file_url":"https://github.com/hikvision-research/SparseShiftLayer/blob/HEAD/models/auto_augment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"1811.11168","paper":"/paper/deformable-convnets-v2-more-deformable-better","title":"Deformable ConvNets v2: More Deformable, Better Results","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4uiiurz1/pytorch-deform-conv-v2","path":"scaled_mnist/dataset.py","file_url":"https://github.com/4uiiurz1/pytorch-deform-conv-v2/blob/HEAD/scaled_mnist/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3c85a6426b383b41","mcp_get_code":{"code_sha256":"3c85a6426b383b41"}},{"arxiv_id":"1805.09501","paper":"/paper/autoaugment-learning-augmentation-policies","title":"AutoAugment: Learning Augmentation Policies from Data","date":"2018-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4uiiurz1/pytorch-auto-augment","path":"auto_augment.py","file_url":"https://github.com/4uiiurz1/pytorch-auto-augment/blob/HEAD/auto_augment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}}]}