{"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-bernoulli","entry":"sample_bernoulli","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":8,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"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":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":0,"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":"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":"ab04fff3a9720e27","code_sha256_prefix":"ab04fff3a9720e27","mcp_get_code":{"code_sha256":"ab04fff3a9720e27"}},{"arxiv_id":"2407.15527","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-concept-based-memory-reasoning","title":"Interpretable Concept-Based Memory Reasoning","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daviddebot/CMR","path":"experiments/celeba/models.py","file_url":"https://github.com/daviddebot/CMR/blob/HEAD/experiments/celeba/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50eb2cd86f0408f1","code_sha256_prefix":"50eb2cd86f0408f1","mcp_get_code":{"code_sha256":"50eb2cd86f0408f1"}},{"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":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7292183c8ee8d08","code_sha256_prefix":"b7292183c8ee8d08","mcp_get_code":{"code_sha256":"b7292183c8ee8d08"}},{"arxiv_id":"2312.09193","arxiv_id_is_arxiv":true,"paper":"/paper/fast-sampling-via-de-randomization-for","title":"Fast Sampling via Discrete Non-Markov Diffusion Models with Predetermined Transition Time","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclaml/dndm","path":"discrete_diffusion/discrete_diffusions/utils.py","file_url":"https://github.com/uclaml/dndm/blob/HEAD/discrete_diffusion/discrete_diffusions/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da869491359e17b9","code_sha256_prefix":"da869491359e17b9","mcp_get_code":{"code_sha256":"da869491359e17b9"}},{"arxiv_id":"2302.05737","arxiv_id_is_arxiv":true,"paper":"/paper/a-reparameterized-discrete-diffusion-model","title":"A Reparameterized Discrete Diffusion Model for Text Generation","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/reparam-discrete-diffusion","path":"discrete_diffusion/discrete_diffusions/utils.py","file_url":"https://github.com/hkunlp/reparam-discrete-diffusion/blob/HEAD/discrete_diffusion/discrete_diffusions/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da869491359e17b9","code_sha256_prefix":"da869491359e17b9","mcp_get_code":{"code_sha256":"da869491359e17b9"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0d129fbf2733355c","code_sha256_prefix":"0d129fbf2733355c","mcp_get_code":{"code_sha256":"0d129fbf2733355c"}},{"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":"deterministic","behaviour_fingerprint":false,"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":"b7292183c8ee8d08","code_sha256_prefix":"b7292183c8ee8d08","mcp_get_code":{"code_sha256":"b7292183c8ee8d08"}},{"arxiv_id":"2004.00010","arxiv_id_is_arxiv":true,"paper":"/paper/the-discrete-gaussian-for-differential","title":"The Discrete Gaussian for Differential Privacy","date":"2020-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/discrete-gaussian-differential-privacy","path":"discretegauss.py","file_url":"https://github.com/IBM/discrete-gaussian-differential-privacy/blob/HEAD/discretegauss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"58c33a7208409998","code_sha256_prefix":"58c33a7208409998","mcp_get_code":{"code_sha256":"58c33a7208409998"}},{"arxiv_id":"1711.05101","arxiv_id_is_arxiv":true,"paper":"/paper/decoupled-weight-decay-regularization","title":"Decoupled Weight Decay Regularization","date":"2017-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethancaballero/Restricted_Boltzmann_Machine__RBM","path":"dist_util.py","file_url":"https://github.com/ethancaballero/Restricted_Boltzmann_Machine__RBM/blob/HEAD/dist_util.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":"9187f52a3b57c15e","code_sha256_prefix":"9187f52a3b57c15e","mcp_get_code":{"code_sha256":"9187f52a3b57c15e"}}],"record_sha256":"abd5715b9d251734c5310689aa93216ede60a946f7d0f03a737c8ccb05a2c925","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}