{"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/sample-categorical","entry":"sample_categorical","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":20,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":16,"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":15,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":11,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":20,"n_places_pointer_only":12,"n_places_pointer_only_link_open":2,"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":7,"ran_fixture":4,"ran":3,"unverified":1},"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":"2608.15073","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-15073","title":"BOCoDe: Engineering-Centered Benchmarking for Bayesian Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"hvarfner/vanilla_bo_in_highdim","path":"BenchSuite/benchsuite/helper.py","file_url":"https://github.com/hvarfner/vanilla_bo_in_highdim/blob/HEAD/BenchSuite/benchsuite/helper.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, hvarfner/vanilla_bo_in_highdim when it was checked","code_sha256":"e4fdb09f2d550022","code_sha256_prefix":"e4fdb09f2d550022","mcp_get_code":{"code_sha256":"e4fdb09f2d550022"}},{"arxiv_id":"2606.02241","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02241","title":"BlockGen: Flexible Blockwise Sequence Modeling with Hybrid Samplers","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jdeschena/blockgen","path":"samplers.py","file_url":"https://github.com/jdeschena/blockgen/blob/HEAD/samplers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, jdeschena/blockgen when it was checked","code_sha256":"42d20a65c4d664db","code_sha256_prefix":"42d20a65c4d664db","mcp_get_code":{"code_sha256":"42d20a65c4d664db"}},{"arxiv_id":"2605.11125","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11125","title":"Language Modeling with Hyperspherical Flows","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"s-sahoo/duo","path":"trainer_base.py","file_url":"https://github.com/s-sahoo/duo/blob/HEAD/trainer_base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"300194a15680602c","code_sha256_prefix":"300194a15680602c","mcp_get_code":{"code_sha256":"300194a15680602c"}},{"arxiv_id":"2510.24088","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24088","title":"Information-Theoretic Discrete Diffusion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Dongjae0324/infodis","path":"catsample.py","file_url":"https://github.com/Dongjae0324/infodis/blob/HEAD/catsample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, Dongjae0324/infodis when it was checked","code_sha256":"172aa319a831b3ab","code_sha256_prefix":"172aa319a831b3ab","mcp_get_code":{"code_sha256":"172aa319a831b3ab"}},{"arxiv_id":"2510.03206","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03206","title":"Coevolutionary Continuous Discrete Diffusion: Make Your Diffusion Language Model a Latent Reasoner","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"zhouc20/CCDD","path":"ccdd/diffusion_process.py","file_url":"https://github.com/zhouc20/CCDD/blob/HEAD/ccdd/diffusion_process.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92703dd64782cadd","code_sha256_prefix":"92703dd64782cadd","mcp_get_code":{"code_sha256":"92703dd64782cadd"}},{"arxiv_id":"2509.19962","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-19962","title":"Learnable Sampler Distillation for Discrete Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"feiyangfu/LSD","path":"sampler.py","file_url":"https://github.com/feiyangfu/LSD/blob/HEAD/sampler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"72eccb5c284af3e0","code_sha256_prefix":"72eccb5c284af3e0","mcp_get_code":{"code_sha256":"72eccb5c284af3e0"}},{"arxiv_id":"2508.10684","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-10684","title":"MDNS: Masked Diffusion Neural Sampler via Stochastic Optimal Control","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"yuchen-zhu-zyc/MDNS","path":"utils.py","file_url":"https://github.com/yuchen-zhu-zyc/MDNS/blob/HEAD/utils.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, yuchen-zhu-zyc/MDNS when it was checked","code_sha256":"399f607de3e3cec3","code_sha256_prefix":"399f607de3e3cec3","mcp_get_code":{"code_sha256":"399f607de3e3cec3"}},{"arxiv_id":"2506.19935","arxiv_id_is_arxiv":true,"paper":"/paper/any-order-gpt-as-masked-diffusion-model","title":"Any-Order GPT as Masked Diffusion Model: Decoupling Formulation and Architecture","date":"2025-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scxue/ao-gpt-mdm","path":"catsample.py","file_url":"https://github.com/scxue/ao-gpt-mdm/blob/HEAD/catsample.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, scxue/ao-gpt-mdm when it was checked","code_sha256":"363f8d07ea5498f8","code_sha256_prefix":"363f8d07ea5498f8","mcp_get_code":{"code_sha256":"363f8d07ea5498f8"}},{"arxiv_id":"2506.02612","arxiv_id_is_arxiv":true,"paper":"/paper/simple-good-fast-self-supervised-world-models","title":"Simple, Good, Fast: Self-Supervised World Models Free of Baggage","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jrobine/sgf","path":"src/wm.py","file_url":"https://github.com/jrobine/sgf/blob/HEAD/src/wm.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":"a8117d72551969e1","code_sha256_prefix":"a8117d72551969e1","mcp_get_code":{"code_sha256":"a8117d72551969e1"}},{"arxiv_id":"2503.04482","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-interpolating-discrete-diffusion","title":"Generalized Interpolating Discrete Diffusion","date":"2025-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvruette/gidd","path":"gidd/diffusion_process.py","file_url":"https://github.com/dvruette/gidd/blob/HEAD/gidd/diffusion_process.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d5a6f595215768b4","code_sha256_prefix":"d5a6f595215768b4","mcp_get_code":{"code_sha256":"d5a6f595215768b4"}},{"arxiv_id":"2503.01161","arxiv_id_is_arxiv":true,"paper":"/paper/split-gibbs-discrete-diffusion-posterior","title":"Split Gibbs Discrete Diffusion Posterior Sampling","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chuwd19/Split-Gibbs-Discrete-Diffusion-Posterior-Sampling","path":"sampling/sgdd.py","file_url":"https://github.com/chuwd19/Split-Gibbs-Discrete-Diffusion-Posterior-Sampling/blob/HEAD/sampling/sgdd.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, chuwd19/Split-Gibbs-Discrete-Diffusion-Posterior-Sampling when it was checked","code_sha256":"172aa319a831b3ab","code_sha256_prefix":"172aa319a831b3ab","mcp_get_code":{"code_sha256":"172aa319a831b3ab"}},{"arxiv_id":"2406.03736","arxiv_id_is_arxiv":true,"paper":"/paper/your-absorbing-discrete-diffusion-secretly","title":"Your Absorbing Discrete Diffusion Secretly Models the Conditional Distributions of Clean Data","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-gsai/radd","path":"catsample.py","file_url":"https://github.com/ml-gsai/radd/blob/HEAD/catsample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from chuwd19/Split-Gibbs-Discrete-Diffusion-Posterior-Sampling, and GitHub detected no licence in that repository when it was checked","code_sha256":"172aa319a831b3ab","code_sha256_prefix":"172aa319a831b3ab","mcp_get_code":{"code_sha256":"172aa319a831b3ab"}},{"arxiv_id":"2405.20971","arxiv_id_is_arxiv":true,"paper":"/paper/amortizing-intractable-inference-in-diffusion","title":"Amortizing intractable inference in diffusion models for vision, language, and control","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gfnorg/diffusion-finetuning","path":"diffusion_lm/catsample.py","file_url":"https://github.com/gfnorg/diffusion-finetuning/blob/HEAD/diffusion_lm/catsample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gfnorg/diffusion-finetuning when it was checked","code_sha256":"172aa319a831b3ab","code_sha256_prefix":"172aa319a831b3ab","mcp_get_code":{"code_sha256":"172aa319a831b3ab"}},{"arxiv_id":"2403.19381","arxiv_id_is_arxiv":true,"paper":"/paper/on-uncertainty-quantification-for-near-bayes","title":"On Uncertainty Quantification for Near-Bayes Optimal Algorithms","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meta-inf/ipb","path":"classification/utils.py","file_url":"https://github.com/meta-inf/ipb/blob/HEAD/classification/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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, meta-inf/ipb, is not in the permissive set Syntology serves inline","code_sha256":"0061138c1e64bfcc","code_sha256_prefix":"0061138c1e64bfcc","mcp_get_code":{"code_sha256":"0061138c1e64bfcc"}},{"arxiv_id":"2402.03701","arxiv_id_is_arxiv":true,"paper":"/paper/improving-and-unifying-discrete-continuous","title":"Unified Discrete Diffusion for Categorical Data","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingxiaoshawn/usd3","path":"discrete_diffusion.py","file_url":"https://github.com/lingxiaoshawn/usd3/blob/HEAD/discrete_diffusion.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b3f251a40b42cb6","code_sha256_prefix":"3b3f251a40b42cb6","mcp_get_code":{"code_sha256":"3b3f251a40b42cb6"}},{"arxiv_id":"2310.16834","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-diffusion-language-modeling-by","title":"Discrete Diffusion Modeling by Estimating the Ratios of the Data Distribution","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louaaron/Score-Entropy-Discrete-Diffusion","path":"catsample.py","file_url":"https://github.com/louaaron/Score-Entropy-Discrete-Diffusion/blob/HEAD/catsample.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from chuwd19/Split-Gibbs-Discrete-Diffusion-Posterior-Sampling, and GitHub detected no licence in that repository when it was checked","code_sha256":"172aa319a831b3ab","code_sha256_prefix":"172aa319a831b3ab","mcp_get_code":{"code_sha256":"172aa319a831b3ab"}},{"arxiv_id":"2209.14734","arxiv_id_is_arxiv":true,"paper":"/paper/digress-discrete-denoising-diffusion-for","title":"DiGress: Discrete Denoising diffusion for graph generation","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingxiaoshawn/pard","path":"pard/diffusion.py","file_url":"https://github.com/lingxiaoshawn/pard/blob/HEAD/pard/diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9d8f3764aca720ec","code_sha256_prefix":"9d8f3764aca720ec","mcp_get_code":{"code_sha256":"9d8f3764aca720ec"}},{"arxiv_id":"2205.14987","arxiv_id_is_arxiv":true,"paper":"/paper/a-continuous-time-framework-for-discrete","title":"A Continuous Time Framework for Discrete Denoising Models","date":"2022-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3b3f251a40b42cb6","code_sha256_prefix":"3b3f251a40b42cb6","mcp_get_code":{"code_sha256":"3b3f251a40b42cb6"}},{"arxiv_id":"1704.01279","arxiv_id_is_arxiv":true,"paper":"/paper/neural-audio-synthesis-of-musical-notes-with","title":"Neural Audio Synthesis of Musical Notes with WaveNet Autoencoders","date":"2017-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NoaCahan/WavenetAutoEncoder","path":"generate.py","file_url":"https://github.com/NoaCahan/WavenetAutoEncoder/blob/HEAD/generate.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, NoaCahan/WavenetAutoEncoder when it was checked","code_sha256":"68ea19d0fbeefdbd","code_sha256_prefix":"68ea19d0fbeefdbd","mcp_get_code":{"code_sha256":"68ea19d0fbeefdbd"}},{"arxiv_id":"Jiao_Semi-supervised_Semantics-guided_Adversarial_Training_for_Robust_Trajectory_Prediction_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Jiao_Semi-supervised_Semantics-guided_Adversarial_Training_for_Robust_Trajectory_Prediction_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jrcblue/SSAT-for-Motion-Prediction","path":"train_adv_ssat.py","file_url":"https://github.com/jrcblue/SSAT-for-Motion-Prediction/blob/HEAD/train_adv_ssat.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":"e9106556b7b945d8","code_sha256_prefix":"e9106556b7b945d8","mcp_get_code":{"code_sha256":"e9106556b7b945d8"}}],"record_sha256":"012c73f7e5b150309533d88ed02216f4ec9ceeaac2b823f39a3f4a29917a183b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}