{"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-norm-2","entry":"l1_norm","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":5,"n_places":5,"n_places_pointer_only":2,"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":2,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2602.08197","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Higashiguchi-Shingo/KTVGL when it was checked","code_sha256":"cd196e9b67e8b9fa","code_sha256_prefix":"cd196e9b67e8b9fa","mcp_get_code":{"code_sha256":"cd196e9b67e8b9fa"}},{"arxiv_id":"2310.02396","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sflippl/multi-task when it was checked","code_sha256":"47cd3b12f7a09bdf","code_sha256_prefix":"47cd3b12f7a09bdf","mcp_get_code":{"code_sha256":"47cd3b12f7a09bdf"}},{"arxiv_id":"2203.07860","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"38b8d075d6dff46c","code_sha256_prefix":"38b8d075d6dff46c","mcp_get_code":{"code_sha256":"38b8d075d6dff46c"}},{"arxiv_id":"2110.10546","arxiv_id_is_arxiv":true,"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":"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":"2b5e0c6ca822c2df","code_sha256_prefix":"2b5e0c6ca822c2df","mcp_get_code":{"code_sha256":"2b5e0c6ca822c2df"}},{"arxiv_id":"1905.05796","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28423a047ef20ce4","code_sha256_prefix":"28423a047ef20ce4","mcp_get_code":{"code_sha256":"28423a047ef20ce4"}}],"record_sha256":"17cc0185871bd9c108b7029fa09d0feccb67053c0ea507f5072f2fcb548f02c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}