{"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/transform-matrix-offset-center","entry":"transform_matrix_offset_center","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":6,"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":3,"ran_fixture":0,"ran":0,"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":"2608.11815","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c85a6426b383b41","code_sha256_prefix":"3c85a6426b383b41","mcp_get_code":{"code_sha256":"3c85a6426b383b41"}},{"arxiv_id":"2510.10100","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, krumpguo/FedCoPL when it was checked","code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"2312.13555","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trustaiot/cr-sam when it was checked","code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"2311.16450","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chen-huanxin/Tint when it was checked","code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"2204.00008","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, anlthms/nips-2017, 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":"3c85a6426b383b41","code_sha256_prefix":"3c85a6426b383b41","mcp_get_code":{"code_sha256":"3c85a6426b383b41"}},{"arxiv_id":"1909.13719","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"1908.09791","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"1904.09546","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HopefulRational/DeepCaps-PyTorch when it was checked","code_sha256":"f1391c2b4e040dc5","code_sha256_prefix":"f1391c2b4e040dc5","mcp_get_code":{"code_sha256":"f1391c2b4e040dc5"}},{"arxiv_id":"1903.05285","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}},{"arxiv_id":"1811.11168","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c85a6426b383b41","code_sha256_prefix":"3c85a6426b383b41","mcp_get_code":{"code_sha256":"3c85a6426b383b41"}},{"arxiv_id":"1805.09501","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e773c6c5bc796d4","code_sha256_prefix":"3e773c6c5bc796d4","mcp_get_code":{"code_sha256":"3e773c6c5bc796d4"}}],"record_sha256":"661532be3ecaf5561b854fb66b29323ed8f650bd822125859b552f5f435922f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}