{"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/sampler","entry":"Sampler","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":21,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":24,"n_samples_ran":11,"n_samples_constructed":8,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":13,"n_samples_fingerprinted":2,"n_places":24,"n_places_pointer_only":8,"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":11,"unverified":13},"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":"2607.26640","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26640","title":"Contrastive ESA: Human Evaluation of Multiple Translations at Once Vilém Zouhar ETH Zurich","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"zouharvi/cESA","path":"evaluation_contrastive/annotation_sampler.py","file_url":"https://github.com/zouharvi/cESA/blob/HEAD/evaluation_contrastive/annotation_sampler.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":"069095bd5c04f8ec","code_sha256_prefix":"069095bd5c04f8ec","mcp_get_code":{"code_sha256":"069095bd5c04f8ec"}},{"arxiv_id":"2605.23473","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-23473","title":"Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Evolutionary-Intelligence/pypop","path":"pypop7/optimizers/bo/lamcts.py","file_url":"https://github.com/Evolutionary-Intelligence/pypop/blob/HEAD/pypop7/optimizers/bo/lamcts.py","status":"unverified","verification_level":0,"contract_check":null,"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, Evolutionary-Intelligence/pypop, is not in the permissive set Syntology serves inline","code_sha256":"b686ac8a146e53df","code_sha256_prefix":"b686ac8a146e53df","mcp_get_code":{"code_sha256":"b686ac8a146e53df"}},{"arxiv_id":"2602.12976","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-12976","title":"Drift-Aware Variational Autoencoder-based Anomaly Detection with Two-level Ensembling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Jin000001/VAEESDD","path":"class_nn_ae_variational.py","file_url":"https://github.com/Jin000001/VAEESDD/blob/HEAD/class_nn_ae_variational.py","status":"ran","verification_level":1,"contract_check":null,"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, Jin000001/VAEESDD when it was checked","code_sha256":"dc573535cee840d1","code_sha256_prefix":"dc573535cee840d1","mcp_get_code":{"code_sha256":"dc573535cee840d1"}},{"arxiv_id":"2601.14957","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-14957","title":"Improving Regret Approximation for Unsupervised Dynamic Environment Generation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"HarryMJMead/Dynamic-Environment-Generation-for-UED","path":"src/jaxued/level_sampler.py","file_url":"https://github.com/HarryMJMead/Dynamic-Environment-Generation-for-UED/blob/HEAD/src/jaxued/level_sampler.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, HarryMJMead/Dynamic-Environment-Generation-for-UED when it was checked","code_sha256":"60892182d98eb304","code_sha256_prefix":"60892182d98eb304","mcp_get_code":{"code_sha256":"60892182d98eb304"}},{"arxiv_id":"2503.21592","arxiv_id_is_arxiv":true,"paper":"/paper/critical-iterative-denoising-a-discrete","title":"Critical Iterative Denoising: A Discrete Generative Model Applied to Graphs","date":"2025-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoboget/sid","path":"sample.py","file_url":"https://github.com/yoboget/sid/blob/HEAD/sample.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, yoboget/sid when it was checked","code_sha256":"aa5672b8c79b1431","code_sha256_prefix":"aa5672b8c79b1431","mcp_get_code":{"code_sha256":"aa5672b8c79b1431"}},{"arxiv_id":"2411.17511","arxiv_id_is_arxiv":true,"paper":"/paper/training-hamiltonian-neural-networks-without","title":"Training Hamiltonian neural networks without backpropagation","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlphaGergedan/Sampling-HNNs","path":"src/trainer/sampler.py","file_url":"https://github.com/AlphaGergedan/Sampling-HNNs/blob/HEAD/src/trainer/sampler.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":"fb200b122841b6cc","code_sha256_prefix":"fb200b122841b6cc","mcp_get_code":{"code_sha256":"fb200b122841b6cc"}},{"arxiv_id":"2410.06716","arxiv_id_is_arxiv":true,"paper":"/paper/guaranteed-generation-from-large-language","title":"Guaranteed Generation from Large Language Models","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/guard","path":"disco/samplers/quasi_rejection_sampler.py","file_url":"https://github.com/naver/guard/blob/HEAD/disco/samplers/quasi_rejection_sampler.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, naver/guard (NOASSERTION)","code_sha256":"0ecafc2a34259866","code_sha256_prefix":"0ecafc2a34259866","mcp_get_code":{"code_sha256":"0ecafc2a34259866"}},{"arxiv_id":"2407.08056","arxiv_id_is_arxiv":true,"paper":"/paper/pareto-low-rank-adapters-efficient-multi-task","title":"Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferences","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nik-dim/palora","path":"src/callbacks/methods/palora.py","file_url":"https://github.com/nik-dim/palora/blob/HEAD/src/callbacks/methods/palora.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f4dd15fcc2cd0f5","code_sha256_prefix":"8f4dd15fcc2cd0f5","mcp_get_code":{"code_sha256":"8f4dd15fcc2cd0f5"}},{"arxiv_id":"2310.12403","arxiv_id_is_arxiv":true,"paper":"/paper/cooperative-minibatching-in-graph-neural","title":"Cooperative Minibatching in Graph Neural Networks","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gt-tdalab/dgl-coop","path":"python/dgl/dataloading/labor_sampler.py","file_url":"https://github.com/gt-tdalab/dgl-coop/blob/HEAD/python/dgl/dataloading/labor_sampler.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":"228613fed63ef133","code_sha256_prefix":"228613fed63ef133","mcp_get_code":{"code_sha256":"228613fed63ef133"}},{"arxiv_id":"2305.14979","arxiv_id_is_arxiv":true,"paper":"/paper/scale-matters-attribution-meets-the-wavelet","title":"Assessment of the Reliablity of a Model's Decision by Generalizing Attribution to the Wavelet Domain","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabrielkasmi/spectral-attribution","path":"spectral_sobol/torch_explainer.py","file_url":"https://github.com/gabrielkasmi/spectral-attribution/blob/HEAD/spectral_sobol/torch_explainer.py","status":"unverified","verification_level":0,"contract_check":null,"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, gabrielkasmi/spectral-attribution, is not in the permissive set Syntology serves inline","code_sha256":"dd9f4a6339412a24","code_sha256_prefix":"dd9f4a6339412a24","mcp_get_code":{"code_sha256":"dd9f4a6339412a24"}},{"arxiv_id":"2303.03023","arxiv_id_is_arxiv":true,"paper":"/paper/guiding-energy-based-models-via-contrastive","title":"Guiding Energy-based Models via Contrastive Latent Variables","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hankook/clel","path":"models/ebm.py","file_url":"https://github.com/hankook/clel/blob/HEAD/models/ebm.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, hankook/clel when it was checked","code_sha256":"4f411de8765f652a","code_sha256_prefix":"4f411de8765f652a","mcp_get_code":{"code_sha256":"4f411de8765f652a"}},{"arxiv_id":"2209.14687","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-posterior-sampling-for-general","title":"Diffusion Posterior Sampling for General Noisy Inverse Problems","date":"2022-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probabilists/azula","path":"azula/guidance/dps.py","file_url":"https://github.com/probabilists/azula/blob/HEAD/azula/guidance/dps.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":"63d1de06f843e96d","code_sha256_prefix":"63d1de06f843e96d","mcp_get_code":{"code_sha256":"63d1de06f843e96d"}},{"arxiv_id":"2209.09893","arxiv_id_is_arxiv":true,"paper":"/paper/deep-generalized-schrodinger-bridge","title":"Deep Generalized Schrödinger Bridge","date":"2022-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghliu/deepgsb","path":"deepgsb/sb_policy.py","file_url":"https://github.com/ghliu/deepgsb/blob/HEAD/deepgsb/sb_policy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45a23b03f8acef82","code_sha256_prefix":"45a23b03f8acef82","mcp_get_code":{"code_sha256":"45a23b03f8acef82"}},{"arxiv_id":"2208.00119","arxiv_id_is_arxiv":true,"paper":"/paper/das-densely-anchored-sampling-for-deep-metric","title":"DAS: Densely-Anchored Sampling for Deep Metric Learning","date":"2022-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lizhaoliu-Lec/DAS","path":"datasampler/d2_coreset_sampler.py","file_url":"https://github.com/lizhaoliu-Lec/DAS/blob/HEAD/datasampler/d2_coreset_sampler.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":"5904b0baadcac152","code_sha256_prefix":"5904b0baadcac152","mcp_get_code":{"code_sha256":"5904b0baadcac152"}},{"arxiv_id":"2204.13902","arxiv_id_is_arxiv":true,"paper":"/paper/fast-sampling-of-diffusion-models-with","title":"Fast Sampling of Diffusion Models with Exponential Integrator","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"probabilists/azula","path":"azula/sample.py","file_url":"https://github.com/probabilists/azula/blob/HEAD/azula/sample.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":"2604445654b63d20","code_sha256_prefix":"2604445654b63d20","mcp_get_code":{"code_sha256":"2604445654b63d20"}},{"arxiv_id":"2107.03006","arxiv_id_is_arxiv":true,"paper":"/paper/structured-denoising-diffusion-models-in","title":"Structured Denoising Diffusion Models in Discrete State-Spaces","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoiker/meta_dpm","path":"models/absorbing_diffusion.py","file_url":"https://github.com/xiaoiker/meta_dpm/blob/HEAD/models/absorbing_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"71964bb493b3fa09","code_sha256_prefix":"71964bb493b3fa09","mcp_get_code":{"code_sha256":"71964bb493b3fa09"}},{"arxiv_id":"2107.03006","arxiv_id_is_arxiv":true,"paper":"/paper/structured-denoising-diffusion-models-in","title":"Structured Denoising Diffusion Models in Discrete State-Spaces","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samb-t/unleashing-transformers","path":"models/absorbing_diffusion.py","file_url":"https://github.com/samb-t/unleashing-transformers/blob/HEAD/models/absorbing_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e7b664d9cbec19fd","code_sha256_prefix":"e7b664d9cbec19fd","mcp_get_code":{"code_sha256":"e7b664d9cbec19fd"}},{"arxiv_id":"2107.00052","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-gradient-descent-ascent-and","title":"Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity","date":"2021-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugobb/StochasticGamesOpt","path":"hamiltonian/algorithms/co.py","file_url":"https://github.com/hugobb/StochasticGamesOpt/blob/HEAD/hamiltonian/algorithms/co.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":"2404a86f26725bdd","code_sha256_prefix":"2404a86f26725bdd","mcp_get_code":{"code_sha256":"2404a86f26725bdd"}},{"arxiv_id":"2010.09800","arxiv_id_is_arxiv":true,"paper":"/paper/a-contour-stochastic-gradient-langevin","title":"A Contour Stochastic Gradient Langevin Dynamics Algorithm for Simulations of Multi-modal Distributions","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WayneDW/Contour-Stochastic-Gradient-Langevin-Dynamics","path":"solver.py","file_url":"https://github.com/WayneDW/Contour-Stochastic-Gradient-Langevin-Dynamics/blob/HEAD/solver.py","status":"ran","verification_level":1,"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":"16365f74feeaad3a","code_sha256_prefix":"16365f74feeaad3a","mcp_get_code":{"code_sha256":"16365f74feeaad3a"}},{"arxiv_id":"2010.09800","arxiv_id_is_arxiv":true,"paper":"/paper/a-contour-stochastic-gradient-langevin","title":"A Contour Stochastic Gradient Langevin Dynamics Algorithm for Simulations of Multi-modal Distributions","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waynedw/interacting-contour-stochastic-gradient-langevin-dynamics","path":"resnet100_cifar100/sgmcmc.py","file_url":"https://github.com/waynedw/interacting-contour-stochastic-gradient-langevin-dynamics/blob/HEAD/resnet100_cifar100/sgmcmc.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":"4b4d962219cf43f7","code_sha256_prefix":"4b4d962219cf43f7","mcp_get_code":{"code_sha256":"4b4d962219cf43f7"}},{"arxiv_id":"2008.05367","arxiv_id_is_arxiv":true,"paper":"/paper/non-convex-learning-via-replica-exchange","title":"Non-convex Learning via Replica Exchange Stochastic Gradient MCMC","date":"2020-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WayneDW/Variance_Reduced_Replica_Exchange_SGMCMC","path":"sgmcmc.py","file_url":"https://github.com/WayneDW/Variance_Reduced_Replica_Exchange_SGMCMC/blob/HEAD/sgmcmc.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, WayneDW/Variance_Reduced_Replica_Exchange_SGMCMC when it was checked","code_sha256":"bd03d320ee349a01","code_sha256_prefix":"bd03d320ee349a01","mcp_get_code":{"code_sha256":"bd03d320ee349a01"}},{"arxiv_id":"2008.05367","arxiv_id_is_arxiv":true,"paper":"/paper/non-convex-learning-via-replica-exchange","title":"Non-convex Learning via Replica Exchange Stochastic Gradient MCMC","date":"2020-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaoliyao/Replica_Exchange_Stochastic_Gradient_MCMC","path":"sgmcmc.py","file_url":"https://github.com/gaoliyao/Replica_Exchange_Stochastic_Gradient_MCMC/blob/HEAD/sgmcmc.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":"cf36f84e0e7fbcd1","code_sha256_prefix":"cf36f84e0e7fbcd1","mcp_get_code":{"code_sha256":"cf36f84e0e7fbcd1"}},{"arxiv_id":"1904.09751","arxiv_id_is_arxiv":true,"paper":"/paper/the-curious-case-of-neural-text-degeneration","title":"The Curious Case of Neural Text Degeneration","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labmlai/annotated_deep_learning_paper_implementations","path":"labml_nn/sampling/nucleus.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/sampling/nucleus.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":"7d8fed5b92965553","code_sha256_prefix":"7d8fed5b92965553","mcp_get_code":{"code_sha256":"7d8fed5b92965553"}},{"arxiv_id":"1707.01495","arxiv_id_is_arxiv":true,"paper":"/paper/hindsight-experience-replay","title":"Hindsight Experience Replay","date":"2017-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangRui2015/Modular_HER","path":"mher/samplers/her_sampler.py","file_url":"https://github.com/YangRui2015/Modular_HER/blob/HEAD/mher/samplers/her_sampler.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":"8c4664b53d0576fa","code_sha256_prefix":"8c4664b53d0576fa","mcp_get_code":{"code_sha256":"8c4664b53d0576fa"}}],"record_sha256":"25c23a47eaa10756106c9876c5c425e5928da8d51601d0ec49d2575beb4599f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}