Home › Code › to_dense

to_dense

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

to_dense appears in the code Syntology harvested for 12 papers, as 10 distinct code bodies found in 12 places (a place is one code body under one paper). At least one of them ran in 4 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 to_dense 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 4 of the 10 distinct code bodies named to_dense; 6 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
0ran · fixture could not drive it
4ran
6unverified
0fingerprinted

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

12 papers shown of 12, newest first; 12 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 1 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. 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
Unrestrained Simplex Denoising for Discrete Data A Non-Markovian Approach Applied to Graph Generation added by Syntology 2026-03 (from id) cvignac/DiGress/src/utils.py f8f656160d633d0b unverified MIT (permissive)
arXiv:2506.15725 2025-06 (from id) mninniri/GrIDDD/griddd/utils.py 01fa8f7138b28256 unverified no licence file found · pointer only
Generative Modelling of Structurally Constrained Graphs 25 Jun 2024 manuelmlmadeira/ConStruct/ConStruct/utils.py 110db6be0f991435 unverified MIT (permissive)
Discrete-state Continuous-time Diffusion for Graph Generation 19 May 2024 pricexu/disco/digress_utils.py f8f656160d633d0b unverified no licence file found · pointer only
Graph Diffusion Policy Optimization 26 Feb 2024 sail-sg/gdpo/process.py 44c3cf76becae1f4 ran no licence file found · pointer only
Graph Diffusion Transformers for Multi-Conditional Molecular Generation 24 Jan 2024 liugangcode/MCD/graph_dit/utils.py ea35dc496409db0f ran no licence file found · pointer only
Classifier-free graph diffusion for molecular property targeting 28 Dec 2023 asduffo/freegress/src/utils.py 04bee8fa958e3921 ran MIT (permissive)
Sparse Training of Discrete Diffusion Models for Graph Generation 3 Nov 2023 qym7/sparsediff/sparse_diffusion/utils.py fbba1d3a8b6cab5a ran MIT (permissive)
Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering 10 May 2023 qslim/PDF/utils/basis_transform.py 9fe73cedf564403e unverified MIT (permissive)
MiDi: Mixed Graph and 3D Denoising Diffusion for Molecule Generation 17 Feb 2023 cvignac/midi/midi/utils.py c431df61de63102e unverified MIT (permissive)
A New Perspective on the Effects of Spectrum in Graph Neural Networks 14 Dec 2021 qslim/gnn-spectrum/utils/basis_transform.py 9fe73cedf564403e unverified MIT (permissive)
CLOSURE: Assessing Systematic Generalization of CLEVR Models 12 Dec 2019 raeidsaqur/mgn/mgn/models/graph_matcher.py 4d89c0ece4ba3159 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