{"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-gaussian","entry":"sample_gaussian","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":15,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":1,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":3,"n_places":16,"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":1,"ran_fixture":0,"ran":9,"unverified":5},"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.05153","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-05153","title":"Geometric Causal Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"EWeinstein/GCM","path":"spatial_gcm.py","file_url":"https://github.com/EWeinstein/GCM/blob/HEAD/spatial_gcm.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":"244b89c12e0f9844","code_sha256_prefix":"244b89c12e0f9844","mcp_get_code":{"code_sha256":"244b89c12e0f9844"}},{"arxiv_id":"2606.12733","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12733","title":"Let's Ask Gauss: Improved One-Run Privacy Auditing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"stoneboat/dpsgd-auditbench","path":"src/classifier/white_box_dp_sgd.py","file_url":"https://github.com/stoneboat/dpsgd-auditbench/blob/HEAD/src/classifier/white_box_dp_sgd.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, stoneboat/dpsgd-auditbench when it was checked","code_sha256":"b50a90bb6b0af6b9","code_sha256_prefix":"b50a90bb6b0af6b9","mcp_get_code":{"code_sha256":"b50a90bb6b0af6b9"}},{"arxiv_id":"2411.17525","arxiv_id_is_arxiv":true,"paper":"/paper/pushing-the-limits-of-large-language-model","title":"Pushing the Limits of Large Language Model Quantization via the Linearity Theorem","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goodevening13/aquakv","path":"aquakv/grid_generator.py","file_url":"https://github.com/goodevening13/aquakv/blob/HEAD/aquakv/grid_generator.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":"f5f502f02b4bc42d","code_sha256_prefix":"f5f502f02b4bc42d","mcp_get_code":{"code_sha256":"f5f502f02b4bc42d"}},{"arxiv_id":"2410.00983","arxiv_id_is_arxiv":true,"paper":"/paper/robust-guided-diffusion-for-offline-black-box","title":"Robust Guided Diffusion for Offline Black-Box Optimization","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggchen1997/rgd","path":"lib/utils.py","file_url":"https://github.com/ggchen1997/rgd/blob/HEAD/lib/utils.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, ggchen1997/rgd when it was checked","code_sha256":"facb0fb3832a74fc","code_sha256_prefix":"facb0fb3832a74fc","mcp_get_code":{"code_sha256":"facb0fb3832a74fc"}},{"arxiv_id":"2403.09605","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-contrastive-learning-robust","title":"Counterfactual contrastive learning: robust representations via causal image synthesis","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/counterfactual-contrastive","path":"causal_models/hvae.py","file_url":"https://github.com/biomedia-mira/counterfactual-contrastive/blob/HEAD/causal_models/hvae.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":"f71d1270abe6581b","code_sha256_prefix":"f71d1270abe6581b","mcp_get_code":{"code_sha256":"f71d1270abe6581b"}},{"arxiv_id":"2402.01607","arxiv_id_is_arxiv":true,"paper":"/paper/natural-counterfactuals-with-necessary","title":"Natural Counterfactuals With Necessary Backtracking","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuangyuanHao/natural_counterfactuals","path":"src-2o/vae.py","file_url":"https://github.com/GuangyuanHao/natural_counterfactuals/blob/HEAD/src-2o/vae.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, GuangyuanHao/natural_counterfactuals when it was checked","code_sha256":"6717f15242b1a22b","code_sha256_prefix":"6717f15242b1a22b","mcp_get_code":{"code_sha256":"6717f15242b1a22b"}},{"arxiv_id":"2402.01607","arxiv_id_is_arxiv":true,"paper":"/paper/natural-counterfactuals-with-necessary","title":"Natural Counterfactuals With Necessary Backtracking","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuangyuanHao/natural_counterfactuals","path":"src-2o/simple_vae.py","file_url":"https://github.com/GuangyuanHao/natural_counterfactuals/blob/HEAD/src-2o/simple_vae.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, GuangyuanHao/natural_counterfactuals when it was checked","code_sha256":"0c3673aea1cda139","code_sha256_prefix":"0c3673aea1cda139","mcp_get_code":{"code_sha256":"0c3673aea1cda139"}},{"arxiv_id":"2308.16212","arxiv_id_is_arxiv":true,"paper":"/paper/retrobridge-modeling-retrosynthesis-with","title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","date":"2023-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"igashov/retrobridge","path":"src/frameworks/diffusion_utils.py","file_url":"https://github.com/igashov/retrobridge/blob/HEAD/src/frameworks/diffusion_utils.py","status":"ran","verification_level":1,"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, igashov/retrobridge (NOASSERTION)","code_sha256":"4ce22ba6e93d5f06","code_sha256_prefix":"4ce22ba6e93d5f06","mcp_get_code":{"code_sha256":"4ce22ba6e93d5f06"}},{"arxiv_id":"2303.01274","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-axiomatic-soundness-of","title":"Measuring axiomatic soundness of counterfactual image models","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/causal-gen","path":"src/vae.py","file_url":"https://github.com/biomedia-mira/causal-gen/blob/HEAD/src/vae.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":"6717f15242b1a22b","code_sha256_prefix":"6717f15242b1a22b","mcp_get_code":{"code_sha256":"6717f15242b1a22b"}},{"arxiv_id":"2205.03766","arxiv_id_is_arxiv":true,"paper":"/paper/scheduled-multi-task-learning-for-neural-chat","title":"Scheduled Multi-task Learning for Neural Chat Translation","date":"2022-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xl2248/sml","path":"thumt-sml/thumt/models/contextual_transformer.py","file_url":"https://github.com/xl2248/sml/blob/HEAD/thumt-sml/thumt/models/contextual_transformer.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":"b5dc3b8e8f47d2b8","code_sha256_prefix":"b5dc3b8e8f47d2b8","mcp_get_code":{"code_sha256":"b5dc3b8e8f47d2b8"}},{"arxiv_id":"2112.06351","arxiv_id_is_arxiv":true,"paper":"/paper/neural-point-process-for-learning","title":"Neural Point Process for Learning Spatiotemporal Event Dynamics","date":"2021-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rose-stl-lab/deepstpp","path":"src/model.py","file_url":"https://github.com/rose-stl-lab/deepstpp/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"41dcba471efe8ce7","code_sha256_prefix":"41dcba471efe8ce7","mcp_get_code":{"code_sha256":"41dcba471efe8ce7"}},{"arxiv_id":"2008.02792","arxiv_id_is_arxiv":true,"paper":"/paper/caspr-learning-canonical-spatiotemporal-point","title":"CaSPR: Learning Canonical Spatiotemporal Point Cloud Representations","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davrempe/caspr","path":"caspr/models/utils.py","file_url":"https://github.com/davrempe/caspr/blob/HEAD/caspr/models/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":"9503f70580415e65","code_sha256_prefix":"9503f70580415e65","mcp_get_code":{"code_sha256":"9503f70580415e65"}},{"arxiv_id":"1812.08985","arxiv_id_is_arxiv":true,"paper":"/paper/non-adversarial-image-synthesis-with","title":"Non-Adversarial Image Synthesis with Generative Latent Nearest Neighbors","date":"2018-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yedidh/glann","path":"utils.py","file_url":"https://github.com/yedidh/glann/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9e9a6dc9e188fa21","code_sha256_prefix":"9e9a6dc9e188fa21","mcp_get_code":{"code_sha256":"9e9a6dc9e188fa21"}},{"arxiv_id":"1810.10191","arxiv_id_is_arxiv":true,"paper":"/paper/making-sense-of-vision-and-touch-self","title":"Making Sense of Vision and Touch: Self-Supervised Learning of Multimodal Representations for Contact-Rich Tasks","date":"2018-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-iprl-lab/multimodal_representation","path":"multimodal/models/models_utils.py","file_url":"https://github.com/stanford-iprl-lab/multimodal_representation/blob/HEAD/multimodal/models/models_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":"c2dce1e9a43381ec","code_sha256_prefix":"c2dce1e9a43381ec","mcp_get_code":{"code_sha256":"c2dce1e9a43381ec"}},{"arxiv_id":"1802.06552","arxiv_id_is_arxiv":true,"paper":"/paper/are-generative-classifiers-more-robust-to","title":"Are Generative Classifiers More Robust to Adversarial Attacks?","date":"2018-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepgenerativeclassifier/DeepBayes","path":"models/conv_encoder_cifar10.py","file_url":"https://github.com/deepgenerativeclassifier/DeepBayes/blob/HEAD/models/conv_encoder_cifar10.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":"ce4a47b072be0891","code_sha256_prefix":"ce4a47b072be0891","mcp_get_code":{"code_sha256":"ce4a47b072be0891"}},{"arxiv_id":"1506.02564","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-free-hamiltonian-monte-carlo-with","title":"Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karlnapf/kernel_hmc","path":"kernel_hmc/densities/gaussian.py","file_url":"https://github.com/karlnapf/kernel_hmc/blob/HEAD/kernel_hmc/densities/gaussian.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff81502c713bcd2f","code_sha256_prefix":"ff81502c713bcd2f","mcp_get_code":{"code_sha256":"ff81502c713bcd2f"}}],"record_sha256":"6d7e303d71a4de5e62aaeff30c4c6bf54b81784beb58a75626e6fde5dc9def8d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}