Home › Code › g

g

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.

g appears in the code Syntology harvested for 21 papers, as 25 distinct code bodies found in 25 places (a place is one code body under one paper). Of the 21 papers, 21 with a sample that ran: 16 with a run with no instrument failure, 5 where every run was a failure of Syntology's instrument. 20 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 g 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 25 distinct code bodies named g: 25 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 6 honoured, 4 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 0 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:

6ran · honoured contract
4ran · violated contract
3ran · our draft was wrong
2ran; the contract check could not run
10ran
0unverified
20fingerprinted

Licence is a property of each copy, so it is counted per place: 14 of the 25 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

21 papers shown of 21, newest first; 25 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 3 papers added by Syntology; 1 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). 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
On the convergence of graph Laplacians with a symmetric divergence added by Syntology 2026-07 (from id) lzx23/graph_laplacians_w_sdiv/dilation_utils.py c338fee69fa195e7 ran · violated contract fingerprinted no licence file found · pointer only
Annealing in variational inference mitigates mode collapse: A theoretical study on Gaussian mixtures added by Syntology 2026-02 (from id) Luijios/annealed_vi_gmms/src/utils.py 2147890ce3e5b56d ran fingerprinted no licence file found · pointer only
Stochastic Control Methods for Optimization added by Syntology 2026-01 (from id) Jinnqiu/Stochastic-Control-Methods-for-Optimization/F_Ackley_20d.py 42cd4fbe54bbf6af ran · honoured contract fingerprinted no licence file found · pointer only
Stochastic Control Methods for Optimization added by Syntology 2026-01 (from id) Jinnqiu/Stochastic-Control-Methods-for-Optimization/F_VF_XSY4.py 2a5be50b1d7b3f17 ran · honoured contract fingerprinted no licence file found · pointer only
arXiv:2502.15147 2025-02 (from id) allenai/instructLF/alfworld/linear_corex.py ee4beedde707a811 ran · honoured contract fingerprinted Apache-2.0 (permissive)
High-Dimensional Differential Parameter Inference in Exponential Family using Time Score Matching 14 Oct 2024 Leyangw/tsm/loggle/Loggle_SparTSM_sine.py d993dde250539976 ran · violated contract fingerprinted MIT (permissive)
Dynamic metastability in the self-attention model 9 Oct 2024 hugokoubbi/2024-transformers-dotm/staircase.py cca4fbc0607f1254 ran fingerprinted no licence file found · pointer only
Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs 8 May 2024 psc25/mlpjumps/counterparty_expVG_mlp.py 57996fb088240971 ran · honoured contract fingerprinted no licence file found · pointer only
Full error analysis of the random deep splitting method for nonlinear parabolic PDEs and PIDEs 8 May 2024 psc25/mlpjumps/default_bs_mlp.py 9206612d3995aa1c ran · honoured contract fingerprinted no licence file found · pointer only
Deep Equilibrium Models are Almost Equivalent to Not-so-deep Explicit Models for High-dimensional Gaussian Mixtures 5 Feb 2024 stephenli24/inn_eqvi_enn/Gaussian_Integration.py 0f0973bef7e558ef ran fingerprinted no licence file found · pointer only
Deep Equilibrium Models are Almost Equivalent to Not-so-deep Explicit Models for High-dimensional Gaussian Mixtures 5 Feb 2024 stephenli24/inn_eqvi_enn/utils.py e97510d9597ca6c0 ran · violated contract fingerprinted no licence file found · pointer only
Game-Theoretic Unlearnable Example Generator 31 Jan 2024 hong-xian/gue/gue.py f38767d36eae77a4 ran · our draft was wrong no licence file found · pointer only
Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing 7 Aug 2023 guoji-fu/dignn/graphclassification/src/functions.py 0c20d2ddb8b92d0c ran fingerprinted MIT (permissive)
Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing 7 Aug 2023 guoji-fu/dignn/nodeclassification/baselines.py 66811722ba344c40 ran fingerprinted MIT (permissive)
Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks 13 Jul 2023 johanwind/which_l1_minimizer/figure3.py 3b284356f931d31d ran fingerprinted no licence file found · pointer only
LEACE: Perfect linear concept erasure in closed form 6 Jun 2023 eleutherai/concept-erasure/experiments/fleace.py 203f94a4b5a85512 ran · our draft was wrong MIT (permissive)
On Penalty-based Bilevel Gradient Descent Method 10 Feb 2023 hanshen95/penalized-bilevel-gradient-descent/V-PBGD/toy/toy.py aaae9088694d9425 ran · violated contract fingerprinted no licence file found · pointer only
Designing BERT for Convolutional Networks: Sparse and Hierarchical Masked Modeling 9 Jan 2023 Factral/UnMix-NeRF/unmixnerf/utils/spec_to_rgb.py 558f6d7e47654006 ran fingerprinted Apache-2.0 (permissive)
Guided Depth Super-Resolution by Deep Anisotropic Diffusion 21 Nov 2022 prs-eth/diffusion-super-resolution/model/simple_diffusion.py 55afd035478386fe ran fingerprinted MIT (permissive)
A Neural Network Approach for Stochastic Optimal Control 2022-09 (from id) emorymlip/fbsnns/HamiltonJacobiBellman100D.py d25c6435028dd30c ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive)
EIGNN: Efficient Infinite-Depth Graph Neural Networks 22 Feb 2022 liu-jc/eignn/models_chains.py 367057a642c441a6 ran · our draft was wrong fingerprinted MIT (permissive)
Inpainting Transformer for Anomaly Detection 28 Apr 2021 jhy12/inpainting-transformer/model.py fd379ae04177d538 ran · honoured contract fingerprinted no licence file found · pointer only
Learning Stochastic Differential Equations With Gaussian Processes Without Gradient Matching 16 Jul 2018 cagatayyildiz/npde/utils.py fda8bd2922b285ac ran MIT (permissive)
Decoupled Weight Decay Regularization 14 Nov 2017 txping/AEGD/kmeans.py f20b24ac49219c59 ran BSD-3-Clause (permissive)
DGM: A deep learning algorithm for solving partial differential equations 24 Aug 2017 Plemeur/DGM/burger.py 217aabe5ff223b11 ran; the contract check could not run (RAISES) · metamorphic tier: invariant no licence file found · pointer only

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