{"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/max-norm","entry":"max_norm","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":5,"n_papers_ran":1,"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":6,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2503.23455","paper":"/paper/efficient-token-compression-for-vision","title":"Efficient Token Compression for Vision Transformer with Spatial Information Preserved","date":"2025-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nust-machine-intelligence-laboratory/prune_and_merge","path":"pm-vit/tm_prune.py","file_url":"https://github.com/nust-machine-intelligence-laboratory/prune_and_merge/blob/HEAD/pm-vit/tm_prune.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":"9555f12025653843","mcp_get_code":{"code_sha256":"9555f12025653843"}},{"arxiv_id":"2405.10757","paper":"/paper/rethinking-graph-backdoor-attacks-a","title":"Rethinking Graph Backdoor Attacks: A Distribution-Preserving Perspective","date":"2024-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzwjames/dpgba","path":"DPGBA/run/heuristic_selection.py","file_url":"https://github.com/zzwjames/dpgba/blob/HEAD/DPGBA/run/heuristic_selection.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9f2e2960cd2522f1","mcp_get_code":{"code_sha256":"9f2e2960cd2522f1"}},{"arxiv_id":"2008.09161","paper":"/paper/nopeek-information-leakage-reduction-to-share","title":"NoPeek: Information leakage reduction to share activations in distributed deep learning","date":"2020-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Koukyosyumei/Attack_SplitNN","path":"src/attacksplitnn/defense/noisedgrad.py","file_url":"https://github.com/Koukyosyumei/Attack_SplitNN/blob/HEAD/src/attacksplitnn/defense/noisedgrad.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ca0521cbab4ec19c","mcp_get_code":{"code_sha256":"ca0521cbab4ec19c"}},{"arxiv_id":"1909.01500","paper":"/paper/rlpyt-a-research-code-base-for-deep","title":"rlpyt: A Research Code Base for Deep Reinforcement Learning in PyTorch","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariuslindegaard/curiosity_baselines","path":"rlpyt/models/curiosity/fuzzy_art.py","file_url":"https://github.com/mariuslindegaard/curiosity_baselines/blob/HEAD/rlpyt/models/curiosity/fuzzy_art.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68ccf52cd821bb33","mcp_get_code":{"code_sha256":"68ccf52cd821bb33"}},{"arxiv_id":"1909.01500","paper":"/paper/rlpyt-a-research-code-base-for-deep","title":"rlpyt: A Research Code Base for Deep Reinforcement Learning in PyTorch","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariuslindegaard/curiosity_baselines","path":"rlpyt/models/curiosity/online_fuzzy_art.py","file_url":"https://github.com/mariuslindegaard/curiosity_baselines/blob/HEAD/rlpyt/models/curiosity/online_fuzzy_art.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97382e35222ebaf9","mcp_get_code":{"code_sha256":"97382e35222ebaf9"}},{"arxiv_id":"1903.00179","paper":"/paper/pyramid-feature-selective-network-for","title":"Pyramid Feature Attention Network for Saliency detection","date":"2019-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wu0409/HSC_WSSS","path":"module/train_helper.py","file_url":"https://github.com/Wu0409/HSC_WSSS/blob/HEAD/module/train_helper.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":"ecf5f2ec37a98524","mcp_get_code":{"code_sha256":"ecf5f2ec37a98524"}}]}