{"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/l2-distance","entry":"l2_distance","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":10,"n_papers_ran":4,"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":10,"n_samples_ran":4,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":6},"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":"2607.13124","paper":"/paper/arxiv-2607-13124","title":"ShortOPD: Recovering Pruned LLMs with Short-to-Long On-Policy Distillation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"icip-cas/ShortX","path":"shortx/shortgpt/metrics.py","file_url":"https://github.com/icip-cas/ShortX/blob/HEAD/shortx/shortgpt/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1215305d10fb1d13","mcp_get_code":{"code_sha256":"1215305d10fb1d13"}},{"arxiv_id":"2603.03328","paper":"/paper/arxiv-2603-03328","title":"StructLens: A Structural Lens for Language Models via Maximum Spanning Trees","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"naist-nlp/structlens","path":"src/structlens/similarity.py","file_url":"https://github.com/naist-nlp/structlens/blob/HEAD/src/structlens/similarity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"739cb66d97a8b03c","mcp_get_code":{"code_sha256":"739cb66d97a8b03c"}},{"arxiv_id":"2501.03012","paper":"/paper/analyzing-fine-tuning-representation-shift","title":"Analyzing Fine-tuning Representation Shift for Multimodal LLMs Steering alignment","date":"2025-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mshukor/xl-vlms","path":"src/analysis/cluster_analysis.py","file_url":"https://github.com/mshukor/xl-vlms/blob/HEAD/src/analysis/cluster_analysis.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":"00990ef5c064dcc2","mcp_get_code":{"code_sha256":"00990ef5c064dcc2"}},{"arxiv_id":"2403.09346","paper":"/paper/avibench-towards-evaluating-the-robustness-of","title":"B-AVIBench: Towards Evaluating the Robustness of Large Vision-Language Model on Black-box Adversarial Visual-Instructions","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanghao5201/b-avibench","path":"image_attack_tool/models/evolutionary_attack.py","file_url":"https://github.com/zhanghao5201/b-avibench/blob/HEAD/image_attack_tool/models/evolutionary_attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0341e020ac3d0eec","mcp_get_code":{"code_sha256":"0341e020ac3d0eec"}},{"arxiv_id":"2305.16713","paper":"/paper/reconpatch-contrastive-patch-representation","title":"ReConPatch : Contrastive Patch Representation Learning for Industrial Anomaly Detection","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"travishsu/ReConPatch-TF","path":"model.py","file_url":"https://github.com/travishsu/ReConPatch-TF/blob/HEAD/model.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":"5fb254bb87ab998e","mcp_get_code":{"code_sha256":"5fb254bb87ab998e"}},{"arxiv_id":"2110.14807","paper":"/paper/l2ight-enabling-on-chip-learning-for-optical","title":"L2ight: Enabling On-Chip Learning for Optical Neural Networks via Efficient in-situ Subspace Optimization","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeremiemelo/l2ight","path":"compare_gradient.py","file_url":"https://github.com/jeremiemelo/l2ight/blob/HEAD/compare_gradient.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"2cc5c6edd49e4f57","mcp_get_code":{"code_sha256":"2cc5c6edd49e4f57"}},{"arxiv_id":"1911.04933","paper":"/paper/eternal-sunshine-of-the-spotless-net","title":"Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networks","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zero-or-one/URP","path":"evaluation/eval_utils.py","file_url":"https://github.com/zero-or-one/URP/blob/HEAD/evaluation/eval_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3aec5db3515dd753","mcp_get_code":{"code_sha256":"3aec5db3515dd753"}},{"arxiv_id":"1906.03563","paper":"/paper/beyond-adversarial-training-min-max","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjksjtu/minmax-adv","path":"pytorch/utils.py","file_url":"https://github.com/wangjksjtu/minmax-adv/blob/HEAD/pytorch/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e9de120c9fccad8d","mcp_get_code":{"code_sha256":"e9de120c9fccad8d"}},{"arxiv_id":"1903.11359","paper":"/paper/scaling-up-the-randomized-gradient-free","title":"Scaling up the randomized gradient-free adversarial attack reveals overestimation of robustness using established attacks","date":"2019-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jonasrauber/linear-region-attack","path":"lr_attack.py","file_url":"https://github.com/jonasrauber/linear-region-attack/blob/HEAD/lr_attack.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd8d31e9fcb41c96","mcp_get_code":{"code_sha256":"fd8d31e9fcb41c96"}},{"arxiv_id":"aaai_28521","paper":null,"title":"arXiv:aaai_28521","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"winter-flow/WSMD","path":"loss.py","file_url":"https://github.com/winter-flow/WSMD/blob/HEAD/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac58891e8f1564df","mcp_get_code":{"code_sha256":"ac58891e8f1564df"}}]}