{"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/l1-norm-2","entry":"l1_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":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":5,"n_samples_ran":4,"n_samples_fingerprinted":4,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2602.08197","paper":"/paper/arxiv-2602-08197","title":"Interpretable Dynamic Network Modeling of Tensor Time Series via Kronecker Time-Varying Graphical Lasso","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Higashiguchi-Shingo/KTVGL","path":"src/ktvgl/methods/kronecker_tvgl/kroneckergl.py","file_url":"https://github.com/Higashiguchi-Shingo/KTVGL/blob/HEAD/src/ktvgl/methods/kronecker_tvgl/kroneckergl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cd196e9b67e8b9fa","mcp_get_code":{"code_sha256":"cd196e9b67e8b9fa"}},{"arxiv_id":"2310.02396","paper":"/paper/implicit-regularization-of-multi-task","title":"Inductive biases of multi-task learning and finetuning: multiple regimes of feature reuse","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sflippl/multi-task","path":"experiments/diagonal/diagonal_network_finetune.py","file_url":"https://github.com/sflippl/multi-task/blob/HEAD/experiments/diagonal/diagonal_network_finetune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"47cd3b12f7a09bdf","mcp_get_code":{"code_sha256":"47cd3b12f7a09bdf"}},{"arxiv_id":"2203.07860","paper":"/paper/imputing-out-of-vocabulary-embeddings-with","title":"Imputing Out-of-Vocabulary Embeddings with LOVE Makes Language Models Robust with Little Cost","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"makcedward/nlpaug","path":"nlpaug/model/word_embs/word_embeddings.py","file_url":"https://github.com/makcedward/nlpaug/blob/HEAD/nlpaug/model/word_embs/word_embeddings.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"38b8d075d6dff46c","mcp_get_code":{"code_sha256":"38b8d075d6dff46c"}},{"arxiv_id":"2110.10546","paper":"/paper/trash-or-treasure-an-interactive-dual-stream","title":"Trash or Treasure? An Interactive Dual-Stream Strategy for Single Image Reflection Separation","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingcv/ytmt-strategy","path":"models/losses.py","file_url":"https://github.com/mingcv/ytmt-strategy/blob/HEAD/models/losses.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":"2b5e0c6ca822c2df","mcp_get_code":{"code_sha256":"2b5e0c6ca822c2df"}},{"arxiv_id":"1905.05796","paper":"/paper/approximating-orthogonal-matrices-with","title":"Approximating Orthogonal Matrices with Effective Givens Factorization","date":null,"month_inferred_from_arxiv_id":"2019-05","title_source":"archive","repo":"tfrerix/givens-factorization","path":"test_givens_gpu.py","file_url":"https://github.com/tfrerix/givens-factorization/blob/HEAD/test_givens_gpu.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28423a047ef20ce4","mcp_get_code":{"code_sha256":"28423a047ef20ce4"}}]}