Home › Code › grid

grid

Syntologyentry name in harvested coderead from the graph 2026-09-24

grid appears in the code Syntology harvested for 20 papers, as 17 distinct code bodies found in 21 places (a place is one code body under one paper). At least one of them ran in 9 of the papers; 0 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 grid 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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 8 of the 17 distinct code bodies named grid; 9 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
1ran · fixture could not drive it
7ran
9unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 8 of the 21 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 “fixture could not drive it” 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.

Papers

20 papers shown of 20, newest first; 21 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. 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, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Flow Map Denoisers: Traversing the Distortion-Perception Plane for Inverse Problems added by Syntology 2026-06 (from id) nzilberstein/Flow-map-denoisers/run_baselines.py 76cfa754c0ba6a8a ran no licence file found · pointer only
Instance Discrimination for Link Prediction added by Syntology 2026-05 (from id) valentincuzin/GCL-Link-Prediction/other_methods/MPLP-main/graph_generation.py 6d854e401e59d083 ran no licence file found · pointer only
GEMSS: A Variational Method for Discovering Multiple Sparse Solutions in Classification and Regression Problems added by Syntology 2026-02 (from id) kat-er-ina/gemss_testing/algorithm_comparison/diagnostics/tuned_compare.py 717e32343d81591f unverified no licence file found · pointer only
Supervised Kernel Thinning 17 Oct 2024 ag2435/npr/npr/util_sample.py aeda13fd13f0720b ran BSD-3-Clause (permissive)
Hyperbolic Geometric Latent Diffusion Model for Graph Generation 6 May 2024 ringbdstack/hypdiff/Synthatic_graph_generator.py 5f8e5c848498bc23 ran no licence file found · pointer only
Efficient Image Deblurring Networks based on Diffusion Models 11 Jan 2024 bnm6900030/swintormer/ldm/models/autoencoder.py fb932e0777ff7f87 ran no licence file found · pointer only
DeViL: Decoding Vision features into Language 4 Sep 2023 ExplainableML/DeViL/src/evaluation.py 6c584e98426ef212 ran GPL-3.0 (copyleft) · pointer only
Pure Message Passing Can Estimate Common Neighbor for Link Prediction 2 Sep 2023 Barcavin/efficient-node-labelling/graph_generation.py 6d854e401e59d083 ran no licence file found · pointer only
LOCATE: Self-supervised Object Discovery via Flow-guided Graph-cut and Bootstrapped Self-training 22 Aug 2023 silky1708/locate/dist.py 819b7f223154f50c ran no licence file found · pointer only
Submodular Reinforcement Learning 25 Jul 2023 manish-pra/non-additive-rl/utils/environment.py 46361cb3c9786ea9 ran · fixture could not drive it MIT (permissive)
From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness 7 Oct 2021 GNNAsKernel/GNNAsKernel/core/data_utils/graph_generation.py 5547f9317a2e9d3e unverified MIT (permissive)
Denoising Diffusion Probabilistic Models 19 Jun 2020 dataflowr/notebooks/graphs/lib/grid_graph.py e0f51f35088884b5 unverified Apache-2.0 (permissive)
Multipole Graph Neural Operator for Parametric Partial Differential Equations 16 Jun 2020 wumming/graph-pde/graph-neural-operator/utilities.py 7e433b681c7d291e unverified MIT (permissive)
Towards High-Fidelity 3D Face Reconstruction from In-the-Wild Images Using Graph Convolutional Networks 12 Mar 2020 yiyuan1991/3D-Face-GCNs/lib/graph.py 00b211ed8d329331 unverified MIT (permissive)
ENTMOOT: A Framework for Optimization over Ensemble Tree Models 10 Mar 2020 cog-imperial/entmoot/entmoot/utils.py f01eb438bc424617 unverified BSD-3-Clause (permissive)
Analyzing and Improving the Image Quality of StyleGAN 3 Dec 2019 simplerick/stylegan2_pytorch/misc.py fa6245afd0bd3943 unverified MIT (permissive)
Distance Metric Learning using Graph Convolutional Networks: Application to Functional Brain Networks 7 Mar 2017 sk1712/gcn_metric_learning/lib/graph.py 00b211ed8d329331 unverified MIT (permissive)
Structured Sequence Modeling with Graph Convolutional Recurrent Networks 22 Dec 2016 andymogul/gcrnn_revised/graph.py 00b211ed8d329331 unverified MIT (permissive)
How should spin-weighted spherical functions be defined? 2016-04 (from id) moble/spherical/spherical/modes/utilities.py bd39c20114eb94e2 unverified MIT (permissive)
How should spin-weighted spherical functions be defined? 2016-04 (from id) moble/spherical_functions/spherical_functions/SWSH_modes/utilities.py 1adba7e0f60adafc unverified MIT (permissive)
Deep Convolutional Networks on Graph-Structured Data 16 Jun 2015 zdcuob/cnn_graph-/lib/graph.py 00b211ed8d329331 unverified MIT (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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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