{"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/gumbel-noise","entry":"gumbel_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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":6,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":12,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":5,"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":"2602.02600","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02600","title":"Step-Wise Refusal Dynamics in Autoregressive and Diffusion Language Models","date":"2026-02-01","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"ZichenWen1/DIJA","path":"MMaDA/models/sampling.py","file_url":"https://github.com/ZichenWen1/DIJA/blob/HEAD/MMaDA/models/sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"53202c68f703b2ab","code_sha256_prefix":"53202c68f703b2ab","mcp_get_code":{"code_sha256":"53202c68f703b2ab"}},{"arxiv_id":"2505.14671","arxiv_id_is_arxiv":true,"paper":"/paper/unictokens-boosting-personalized","title":"UniCTokens: Boosting Personalized Understanding and Generation via Unified Concept Tokens","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arctanxarc/unictokens","path":"models/sampling.py","file_url":"https://github.com/arctanxarc/unictokens/blob/HEAD/models/sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"53202c68f703b2ab","code_sha256_prefix":"53202c68f703b2ab","mcp_get_code":{"code_sha256":"53202c68f703b2ab"}},{"arxiv_id":"2311.17245","arxiv_id_is_arxiv":true,"paper":"/paper/lightgaussian-unbounded-3d-gaussian","title":"LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPS","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/LightGaussian","path":"vectree/vectree.py","file_url":"https://github.com/VITA-Group/LightGaussian/blob/HEAD/vectree/vectree.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"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, VITA-Group/LightGaussian (NOASSERTION)","code_sha256":"5eaac03d3e73f0db","code_sha256_prefix":"5eaac03d3e73f0db","mcp_get_code":{"code_sha256":"5eaac03d3e73f0db"}},{"arxiv_id":"2308.02117","arxiv_id_is_arxiv":true,"paper":"/paper/vqgraph-graph-vector-quantization-for","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/vqgraph","path":"vq.py","file_url":"https://github.com/yangling0818/vqgraph/blob/HEAD/vq.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, yangling0818/vqgraph when it was checked","code_sha256":"d85a55ec5c2984ef","code_sha256_prefix":"d85a55ec5c2984ef","mcp_get_code":{"code_sha256":"d85a55ec5c2984ef"}},{"arxiv_id":"2210.11017","arxiv_id_is_arxiv":true,"paper":"/paper/multi-granularity-optimization-for-non","title":"Multi-Granularity Optimization for Non-Autoregressive Translation","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yafuly/MGMO-NAT","path":"fairseq/models/nat/iterative_nonautoregressive_transformer.py","file_url":"https://github.com/yafuly/MGMO-NAT/blob/HEAD/fairseq/models/nat/iterative_nonautoregressive_transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, yafuly/MGMO-NAT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a2543dc608ad4f8a","code_sha256_prefix":"a2543dc608ad4f8a","mcp_get_code":{"code_sha256":"a2543dc608ad4f8a"}},{"arxiv_id":"2210.03953","arxiv_id_is_arxiv":true,"paper":"/paper/non-monotonic-latent-alignments-for-ctc-based","title":"Non-Monotonic Latent Alignments for CTC-Based Non-Autoregressive Machine Translation","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/nmla-nat","path":"fairseq/models/nat/iterative_nonautoregressive_transformer.py","file_url":"https://github.com/ictnlp/nmla-nat/blob/HEAD/fairseq/models/nat/iterative_nonautoregressive_transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ictnlp/nmla-nat, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a2543dc608ad4f8a","code_sha256_prefix":"a2543dc608ad4f8a","mcp_get_code":{"code_sha256":"a2543dc608ad4f8a"}},{"arxiv_id":"2205.14333","arxiv_id_is_arxiv":true,"paper":"/paper/one-reference-is-not-enough-diverse","title":"One Reference Is Not Enough: Diverse Distillation with Reference Selection for Non-Autoregressive Translation","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/ddrs-nat","path":"fairseq/models/nat/iterative_nonautoregressive_transformer.py","file_url":"https://github.com/ictnlp/ddrs-nat/blob/HEAD/fairseq/models/nat/iterative_nonautoregressive_transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ictnlp/ddrs-nat, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a2543dc608ad4f8a","code_sha256_prefix":"a2543dc608ad4f8a","mcp_get_code":{"code_sha256":"a2543dc608ad4f8a"}},{"arxiv_id":"2106.08122","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-level-training-for-non","title":"Sequence-Level Training for Non-Autoregressive Neural Machine Translation","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/Seq-NAT","path":"fairseq/models/nat/iterative_nonautoregressive_transformer.py","file_url":"https://github.com/ictnlp/Seq-NAT/blob/HEAD/fairseq/models/nat/iterative_nonautoregressive_transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ictnlp/Seq-NAT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a2543dc608ad4f8a","code_sha256_prefix":"a2543dc608ad4f8a","mcp_get_code":{"code_sha256":"a2543dc608ad4f8a"}},{"arxiv_id":"2102.08473","arxiv_id_is_arxiv":true,"paper":"/paper/coco-lm-correcting-and-contrasting-text","title":"COCO-LM: Correcting and Contrasting Text Sequences for Language Model Pretraining","date":"2021-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/coco-lm-pytorch","path":"coco_lm_pytorch/coco_lm_pytorch.py","file_url":"https://github.com/lucidrains/coco-lm-pytorch/blob/HEAD/coco_lm_pytorch/coco_lm_pytorch.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0897c18b5724ae22","code_sha256_prefix":"0897c18b5724ae22","mcp_get_code":{"code_sha256":"0897c18b5724ae22"}},{"arxiv_id":"2003.10555","arxiv_id_is_arxiv":true,"paper":"/paper/electra-pre-training-text-encoders-as-1","title":"ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/electra-pytorch","path":"electra_pytorch/electra_pytorch.py","file_url":"https://github.com/lucidrains/electra-pytorch/blob/HEAD/electra_pytorch/electra_pytorch.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f0491e137c5b556","code_sha256_prefix":"3f0491e137c5b556","mcp_get_code":{"code_sha256":"3f0491e137c5b556"}},{"arxiv_id":"2003.10555","arxiv_id_is_arxiv":true,"paper":"/paper/electra-pre-training-text-encoders-as-1","title":"ELECTRA: Pre-training Text Encoders as Discriminators Rather Than Generators","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/electra-pytorch","path":"electra_pytorch/electra_pytorch.py","file_url":"https://github.com/lucidrains/electra-pytorch/blob/HEAD/electra_pytorch/electra_pytorch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"983767b34d11c495","code_sha256_prefix":"983767b34d11c495","mcp_get_code":{"code_sha256":"983767b34d11c495"}},{"arxiv_id":"2023.acl-short.31","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-short.31","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JFChi/PLUE","path":"pretraining/ELECTRA/model.py","file_url":"https://github.com/JFChi/PLUE/blob/HEAD/pretraining/ELECTRA/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"983767b34d11c495","code_sha256_prefix":"983767b34d11c495","mcp_get_code":{"code_sha256":"983767b34d11c495"}}],"record_sha256":"e8642a637e1321ff708cb205c27896a233e08cdd31a64ee0228efea667b68a73","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}