{"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/noise-2","entry":"Noise","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":9,"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":9,"n_samples_ran":3,"n_samples_constructed":1,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"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":6},"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.22586","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22586","title":"TABDLM: Free-Form Tabular Data Generation via Joint Numerical-Language Diffusion","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ilikevegetable/TabDLM","path":"tabdlm/model.py","file_url":"https://github.com/ilikevegetable/TabDLM/blob/HEAD/tabdlm/model.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":"bcf700f63b2d2675","code_sha256_prefix":"bcf700f63b2d2675","mcp_get_code":{"code_sha256":"bcf700f63b2d2675"}},{"arxiv_id":"2602.11453","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11453","title":"From Noise to Order: Learning to Rank via Denoising Diffusion","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"sadjadeb/DiffusionRank","path":"generative/tabdiff/models/unified_ctime_diffusion.py","file_url":"https://github.com/sadjadeb/DiffusionRank/blob/HEAD/generative/tabdiff/models/unified_ctime_diffusion.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, sadjadeb/DiffusionRank when it was checked","code_sha256":"cb1dfc3dbebdbf91","code_sha256_prefix":"cb1dfc3dbebdbf91","mcp_get_code":{"code_sha256":"cb1dfc3dbebdbf91"}},{"arxiv_id":"2601.21628","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21628","title":"Noise as a Probe: Membership Inference Attacks on Diffusion Models Leveraging Initial Noise","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"S3IC-Lab/NoiseMIA","path":"attack.py","file_url":"https://github.com/S3IC-Lab/NoiseMIA/blob/HEAD/attack.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, S3IC-Lab/NoiseMIA when it was checked","code_sha256":"d3abc7bc5d62b30a","code_sha256_prefix":"d3abc7bc5d62b30a","mcp_get_code":{"code_sha256":"d3abc7bc5d62b30a"}},{"arxiv_id":"2504.12739","arxiv_id_is_arxiv":true,"paper":"/paper/mask-image-watermarking","title":"Mask Image Watermarking","date":"2025-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hurunyi/maskmark","path":"models/Network.py","file_url":"https://github.com/hurunyi/maskmark/blob/HEAD/models/Network.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":"942910e44eb17b71","code_sha256_prefix":"942910e44eb17b71","mcp_get_code":{"code_sha256":"942910e44eb17b71"}},{"arxiv_id":"2503.00307","arxiv_id_is_arxiv":true,"paper":"/paper/remasking-discrete-diffusion-models-with","title":"Remasking Discrete Diffusion Models with Inference-Time Scaling","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/remdm","path":"diffusion.py","file_url":"https://github.com/kuleshov-group/remdm/blob/HEAD/diffusion.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":"4360fa80bd3c0ebd","code_sha256_prefix":"4360fa80bd3c0ebd","mcp_get_code":{"code_sha256":"4360fa80bd3c0ebd"}},{"arxiv_id":"2408.10159","arxiv_id_is_arxiv":true,"paper":"/paper/customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akalikong/ilora","path":"model/peft/tuners/moelora.py","file_url":"https://github.com/akalikong/ilora/blob/HEAD/model/peft/tuners/moelora.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, akalikong/ilora when it was checked","code_sha256":"752e59eb5fe15c43","code_sha256_prefix":"752e59eb5fe15c43","mcp_get_code":{"code_sha256":"752e59eb5fe15c43"}},{"arxiv_id":"2103.10834","arxiv_id_is_arxiv":true,"paper":"/paper/improved-deterministic-smoothing-for-l1","title":"Improved, Deterministic Smoothing for L_1 Certified Robustness","date":"2021-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alevine0/smoothingSplittingNoise","path":"src/noises/noises.py","file_url":"https://github.com/alevine0/smoothingSplittingNoise/blob/HEAD/src/noises/noises.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, alevine0/smoothingSplittingNoise (NOASSERTION)","code_sha256":"eda0dae8db1d6c1f","code_sha256_prefix":"eda0dae8db1d6c1f","mcp_get_code":{"code_sha256":"eda0dae8db1d6c1f"}},{"arxiv_id":"2101.04775","arxiv_id_is_arxiv":true,"paper":"/paper/towards-faster-and-stabilized-gan-training-1","title":"Towards Faster and Stabilized GAN Training for High-fidelity Few-shot Image Synthesis","date":"2021-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silentz/Towards-Faster-And-Stabilized-GAN-Training-For-High-Fidelity-Few-Shot-Image-Synthesis","path":"src/models.py","file_url":"https://github.com/silentz/Towards-Faster-And-Stabilized-GAN-Training-For-High-Fidelity-Few-Shot-Image-Synthesis/blob/HEAD/src/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, silentz/Towards-Faster-And-Stabilized-GAN-Training-For-High-Fidelity-Few-Shot-Image-Synthesis, is not in the permissive set Syntology serves inline","code_sha256":"6c829db3e87910f5","code_sha256_prefix":"6c829db3e87910f5","mcp_get_code":{"code_sha256":"6c829db3e87910f5"}},{"arxiv_id":"openreview_xyKr7qopq6","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_xyKr7qopq6","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Kust-lp/ECMRNet","path":"codes/utils/utils.py","file_url":"https://github.com/Kust-lp/ECMRNet/blob/HEAD/codes/utils/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":"e3d59a1c4606e454","code_sha256_prefix":"e3d59a1c4606e454","mcp_get_code":{"code_sha256":"e3d59a1c4606e454"}}],"record_sha256":"73ba5e91a136118a69c4332d5bf8c63e775faa7d3512a402b1e328e29ee2697d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}