Home › Code › sample_gaussian

sample_gaussian

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

sample_gaussian appears in the code Syntology harvested for 15 papers, as 15 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 15 papers, 10 with a sample that ran: 9 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument. 3 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named sample_gaussian do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 15 distinct code bodies named sample_gaussian: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
1ran · our draft was wrong
0ran; the contract check could not run
9ran
5unverified
3fingerprinted

Licence is a property of each copy, so it is counted per place: 5 of the 16 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

15 papers shown of 15, newest first; 16 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Geometric Causal Models added by Syntology 2026-07 (from id) EWeinstein/GCM/spatial_gcm.py 244b89c12e0f9844 ran MIT (permissive)
Let's Ask Gauss: Improved One-Run Privacy Auditing added by Syntology 2026-06 (from id) stoneboat/dpsgd-auditbench/src/classifier/white_box_dp_sgd.py b50a90bb6b0af6b9 ran no licence file found · pointer only
Pushing the Limits of Large Language Model Quantization via the Linearity Theorem 26 Nov 2024 goodevening13/aquakv/aquakv/grid_generator.py f5f502f02b4bc42d ran fingerprinted Apache-2.0 (permissive)
Robust Guided Diffusion for Offline Black-Box Optimization 1 Oct 2024 ggchen1997/rgd/lib/utils.py facb0fb3832a74fc ran · our draft was wrong no licence file found · pointer only
Counterfactual contrastive learning: robust representations via causal image synthesis 14 Mar 2024 biomedia-mira/counterfactual-contrastive/causal_models/hvae.py f71d1270abe6581b unverified MIT (permissive)
Natural Counterfactuals With Necessary Backtracking 2 Feb 2024 GuangyuanHao/natural_counterfactuals/src-2o/vae.py 6717f15242b1a22b unverified no licence file found · pointer only
Natural Counterfactuals With Necessary Backtracking 2 Feb 2024 GuangyuanHao/natural_counterfactuals/src-2o/simple_vae.py 0c3673aea1cda139 unverified no licence file found · pointer only
RetroBridge: Modeling Retrosynthesis with Markov Bridges 30 Aug 2023 igashov/retrobridge/src/frameworks/diffusion_utils.py 4ce22ba6e93d5f06 ran licence not identified · pointer only
Measuring axiomatic soundness of counterfactual image models 2 Mar 2023 biomedia-mira/causal-gen/src/vae.py 6717f15242b1a22b unverified MIT (permissive)
Scheduled Multi-task Learning for Neural Chat Translation 8 May 2022 xl2248/sml/thumt-sml/thumt/models/contextual_transformer.py b5dc3b8e8f47d2b8 unverified MIT (permissive)
Neural Point Process for Learning Spatiotemporal Event Dynamics 12 Dec 2021 rose-stl-lab/deepstpp/src/model.py 41dcba471efe8ce7 ran fingerprinted MIT (permissive)
CaSPR: Learning Canonical Spatiotemporal Point Cloud Representations 6 Aug 2020 davrempe/caspr/caspr/models/utils.py 9503f70580415e65 ran MIT (permissive)
Non-Adversarial Image Synthesis with Generative Latent Nearest Neighbors 21 Dec 2018 yedidh/glann/utils.py 9e9a6dc9e188fa21 ran fingerprinted BSD-3-Clause (permissive)
Making Sense of Vision and Touch: Self-Supervised Learning of Multimodal Representations for Contact-Rich Tasks 24 Oct 2018 stanford-iprl-lab/multimodal_representation/multimodal/models/models_utils.py c2dce1e9a43381ec ran MIT (permissive)
Are Generative Classifiers More Robust to Adversarial Attacks? 19 Feb 2018 deepgenerativeclassifier/DeepBayes/models/conv_encoder_cifar10.py ce4a47b072be0891 unverified MIT (permissive)
Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families 8 Jun 2015 karlnapf/kernel_hmc/kernel_hmc/densities/gaussian.py ff81502c713bcd2f ran BSD-3-Clause (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections