{"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/regularizer","entry":"Regularizer","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":3,"n_papers_ran_no_instrument_failure":3,"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":6,"n_samples_ran":3,"n_samples_constructed":2,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2304.04620","arxiv_id_is_arxiv":true,"paper":"/paper/federated-incremental-semantic-segmentation","title":"Federated Incremental Semantic Segmentation","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiahuaDong/FISS","path":"utils/regularizer.py","file_url":"https://github.com/JiahuaDong/FISS/blob/HEAD/utils/regularizer.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, JiahuaDong/FISS when it was checked","code_sha256":"8f756e3786cff1aa","code_sha256_prefix":"8f756e3786cff1aa","mcp_get_code":{"code_sha256":"8f756e3786cff1aa"}},{"arxiv_id":"2210.15578","arxiv_id_is_arxiv":true,"paper":"/paper/gammae-gamma-embeddings-for-logical-queries","title":"GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs","date":"2022-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dyang67/GammaE","path":"models.py","file_url":"https://github.com/dyang67/GammaE/blob/HEAD/models.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":"4dd767dfdd3cd11d","code_sha256_prefix":"4dd767dfdd3cd11d","mcp_get_code":{"code_sha256":"4dd767dfdd3cd11d"}},{"arxiv_id":"2111.04981","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-adversarially-regularized-graph","title":"Wasserstein Adversarially Regularized Graph Autoencoder","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeonResearch/WARGA","path":"WARGA Github Edition/model.py","file_url":"https://github.com/LeonResearch/WARGA/blob/HEAD/WARGA%20Github%20Edition/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, LeonResearch/WARGA (NOASSERTION)","code_sha256":"2e8877554661b142","code_sha256_prefix":"2e8877554661b142","mcp_get_code":{"code_sha256":"2e8877554661b142"}},{"arxiv_id":"2011.05816","arxiv_id_is_arxiv":true,"paper":"/paper/duality-induced-regularizer-for-tensor","title":"Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion","date":"2020-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIRALab-USTC/KGE-DURA","path":"code/regularizers.py","file_url":"https://github.com/MIRALab-USTC/KGE-DURA/blob/HEAD/code/regularizers.py","status":"unverified","verification_level":0,"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, MIRALab-USTC/KGE-DURA when it was checked","code_sha256":"2506c17cda0c5069","code_sha256_prefix":"2506c17cda0c5069","mcp_get_code":{"code_sha256":"2506c17cda0c5069"}},{"arxiv_id":"2010.11465","arxiv_id_is_arxiv":true,"paper":"/paper/beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclnlp/cqd","path":"kbc/models.py","file_url":"https://github.com/uclnlp/cqd/blob/HEAD/kbc/models.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":"dfce66d833684f59","code_sha256_prefix":"dfce66d833684f59","mcp_get_code":{"code_sha256":"dfce66d833684f59"}},{"arxiv_id":"2003.12022","arxiv_id_is_arxiv":true,"paper":"/paper/milking-cowmask-for-semi-supervised-image","title":"Milking CowMask for Semi-Supervised Image Classification","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/google-research","path":"milking_cowmask/masking/regularizers.py","file_url":"https://github.com/google-research/google-research/blob/HEAD/milking_cowmask/masking/regularizers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b4f663724f8eda0","code_sha256_prefix":"6b4f663724f8eda0","mcp_get_code":{"code_sha256":"6b4f663724f8eda0"}}],"record_sha256":"3dd8344174210bdfb63c0946b75ab50d53e4614bcc6defdfab5659232554a684","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}