{"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/l1-regularization","entry":"l1_regularization","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2503.10091","arxiv_id_is_arxiv":true,"paper":"/paper/g-2-sf-miad-geometry-guided-score-fusion-for","title":"G$^{2}$SF-MIAD: Geometry-Guided Score Fusion for Multimodal Industrial Anomaly Detection","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctaoaa/G2SF","path":"G2SF_GITHUB/Fusion/fusion_engine_v2.py","file_url":"https://github.com/ctaoaa/G2SF/blob/HEAD/G2SF_GITHUB/Fusion/fusion_engine_v2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16199d8c3e9c8b3a","code_sha256_prefix":"16199d8c3e9c8b3a","mcp_get_code":{"code_sha256":"16199d8c3e9c8b3a"}},{"arxiv_id":"2411.15537","arxiv_id_is_arxiv":true,"paper":"/paper/munba-machine-unlearning-via-nash-bargaining","title":"MUNBa: Machine Unlearning via Nash Bargaining","date":"2024-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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":"cae29c9fba744465","code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}},{"arxiv_id":"2411.15537","arxiv_id_is_arxiv":true,"paper":"/paper/munba-machine-unlearning-via-nash-bargaining","title":"MUNBa: Machine Unlearning via Nash Bargaining","date":"2024-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingWu321/MUNBa","path":"CLIP/unlearn/MUNBa.py","file_url":"https://github.com/JingWu321/MUNBa/blob/HEAD/CLIP/unlearn/MUNBa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JingWu321/MUNBa when it was checked","code_sha256":"11a09839091159b2","code_sha256_prefix":"11a09839091159b2","mcp_get_code":{"code_sha256":"11a09839091159b2"}},{"arxiv_id":"2403.07362","arxiv_id_is_arxiv":true,"paper":"/paper/challenging-forgets-unveiling-the-worst-case","title":"Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OPTML-Group/Unlearn-WorstCase","path":"data-wise/unlearn/FT.py","file_url":"https://github.com/OPTML-Group/Unlearn-WorstCase/blob/HEAD/data-wise/unlearn/FT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cae29c9fba744465","code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}},{"arxiv_id":"2403.07362","arxiv_id_is_arxiv":true,"paper":"/paper/challenging-forgets-unveiling-the-worst-case","title":"Challenging Forgets: Unveiling the Worst-Case Forget Sets in Machine Unlearning","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-worstcase","path":"data-wise/main_selmu.py","file_url":"https://github.com/optml-group/unlearn-worstcase/blob/HEAD/data-wise/main_selmu.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e891e24b7f24953","code_sha256_prefix":"1e891e24b7f24953","mcp_get_code":{"code_sha256":"1e891e24b7f24953"}},{"arxiv_id":"2310.12508","arxiv_id_is_arxiv":true,"paper":"/paper/salun-empowering-machine-unlearning-via","title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-saliency","path":"Classification/unlearn/FT.py","file_url":"https://github.com/optml-group/unlearn-saliency/blob/HEAD/Classification/unlearn/FT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cae29c9fba744465","code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}},{"arxiv_id":"2309.05973","arxiv_id_is_arxiv":true,"paper":"/paper/2309-05973","title":"Circuit Breaking: Removing Model Behaviors with Targeted Ablation","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xanderdavies/circuit-breaking","path":"mnist/mlp_model.py","file_url":"https://github.com/xanderdavies/circuit-breaking/blob/HEAD/mnist/mlp_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xanderdavies/circuit-breaking when it was checked","code_sha256":"7a90d9617759fa76","code_sha256_prefix":"7a90d9617759fa76","mcp_get_code":{"code_sha256":"7a90d9617759fa76"}},{"arxiv_id":"2304.04934","arxiv_id_is_arxiv":true,"paper":"/paper/model-sparsity-can-simplify-machine-1","title":"Model Sparsity Can Simplify Machine Unlearning","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-sparse","path":"src/optim/unlearn/FT.py","file_url":"https://github.com/optml-group/unlearn-sparse/blob/HEAD/src/optim/unlearn/FT.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cae29c9fba744465","code_sha256_prefix":"cae29c9fba744465","mcp_get_code":{"code_sha256":"cae29c9fba744465"}}],"record_sha256":"e55e6f59f34ab6f00b6dd93e7a614cb9dbd85d37cbd071d059b1079a3956e80d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}