{"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/l2-distance","entry":"l2_distance","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":10,"n_places_pointer_only":4,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":5,"unverified":1},"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":"2607.13124","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1215305d10fb1d13","code_sha256_prefix":"1215305d10fb1d13","mcp_get_code":{"code_sha256":"1215305d10fb1d13"}},{"arxiv_id":"2603.03328","arxiv_id_is_arxiv":true,"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":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, naist-nlp/structlens when it was checked","code_sha256":"739cb66d97a8b03c","code_sha256_prefix":"739cb66d97a8b03c","mcp_get_code":{"code_sha256":"739cb66d97a8b03c"}},{"arxiv_id":"2501.03012","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00990ef5c064dcc2","code_sha256_prefix":"00990ef5c064dcc2","mcp_get_code":{"code_sha256":"00990ef5c064dcc2"}},{"arxiv_id":"2403.09346","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhanghao5201/b-avibench when it was checked","code_sha256":"0341e020ac3d0eec","code_sha256_prefix":"0341e020ac3d0eec","mcp_get_code":{"code_sha256":"0341e020ac3d0eec"}},{"arxiv_id":"2305.16713","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5fb254bb87ab998e","code_sha256_prefix":"5fb254bb87ab998e","mcp_get_code":{"code_sha256":"5fb254bb87ab998e"}},{"arxiv_id":"2110.14807","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, jeremiemelo/l2ight, 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":"2cc5c6edd49e4f57","code_sha256_prefix":"2cc5c6edd49e4f57","mcp_get_code":{"code_sha256":"2cc5c6edd49e4f57"}},{"arxiv_id":"1911.04933","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3aec5db3515dd753","code_sha256_prefix":"3aec5db3515dd753","mcp_get_code":{"code_sha256":"3aec5db3515dd753"}},{"arxiv_id":"1906.03563","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9de120c9fccad8d","code_sha256_prefix":"e9de120c9fccad8d","mcp_get_code":{"code_sha256":"e9de120c9fccad8d"}},{"arxiv_id":"1903.11359","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jonasrauber/linear-region-attack when it was checked","code_sha256":"fd8d31e9fcb41c96","code_sha256_prefix":"fd8d31e9fcb41c96","mcp_get_code":{"code_sha256":"fd8d31e9fcb41c96"}},{"arxiv_id":"aaai_28521","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id 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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac58891e8f1564df","code_sha256_prefix":"ac58891e8f1564df","mcp_get_code":{"code_sha256":"ac58891e8f1564df"}}],"record_sha256":"1dc8deceefc8fb587d7a0cfc3336ba3a0f2073c6c6b124545c9acd8e5a63f59e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}