SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1809.02630 · 2018

Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoders

arXiv · PDF · Open in the Atlas

Code that ran

3 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 0 failures of our instrument; 2 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/1809.02630.json · badge: /api/ran/1809.02630.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
Microsoft/constrained-graph-variational-autoencoder canonical (classifier label)
classifier basis: census
3 ran · 2 no recorded run
FunctionStatusWhere it lives
dataset_info Ran
ran on a synthesized input
Microsoft/constrained-graph-variational-autoencoder/utils.py
code served (permissive licence) · get_code("709c9954baa2ec15")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

ARGS = {
    'dataset': 'qm9'
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type dict — a dict output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a dict output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
genereate_incremental_adj Ran
ran on a synthesized input
Microsoft/constrained-graph-variational-autoencoder/data_augmentation.py
code served (permissive licence) · get_code("ff2338305fea0d7d")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned dict. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

from copy import deepcopy

# Construct the adjacency list structure
# The function expects last_adj to be a dict where keys are nodes
# and values are lists of tuples (neighbor, edge_type)

last_adj = {
    0: [(1, "edge_type_a")],
    1: [(0, "edge_type_a")],
    2: [],
    3: []
}

node_in_focus = 0
neighbor = 2
edge_type = "edge_type_b"

ARGS = {
    "last_adj": last_adj,
    "node_in_focus": node_in_focus,
    "neighbor": neighbor,
    "edge_type": edge_type
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
none outside the standard library — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type dict — a dict output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a dict output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
graph_to_adj_mat Ran
ran on a synthesized input
Microsoft/constrained-graph-variational-autoencoder/utils.py
code served (permissive licence) · get_code("1505e0ba4663e4e2")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 3, dtype family float, shape (3, 4, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import numpy as np

# Create a small graph represented as a list of (src, edge_type, dest) tuples
graph = [
    (0, 0, 1),  # edge type 0 from vertex 0 to vertex 1
    (1, 1, 2),  # edge type 1 from vertex 1 to vertex 2
    (2, 0, 0),  # edge type 0 from vertex 2 to vertex 0
]

max_n_vertices = 4
num_edge_types = 3
tie_fwd_bkwd = True
considering_edge_type = True

ARGS = {
    "graph": graph,
    "max_n_vertices": max_n_vertices,
    "num_edge_types": num_edge_types,
    "tie_fwd_bkwd": tie_fwd_bkwd,
    "considering_edge_type": considering_edge_type,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 3, dtype family float, shape (3, 4, 4) — shape (3, 4, 4) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
generate_label Not yet run
unverified (harvested, no recorded run)
Microsoft/constrained-graph-variational-autoencoder/data_augmentation.py
code served (permissive licence) · get_code("6b3fed09d1b23615")
How it ran

no invocation recorded.

generate_mask Not yet run
unverified (harvested, no recorded run)
Microsoft/constrained-graph-variational-autoencoder/data_augmentation.py
code served (permissive licence) · get_code("87fb0cab6105ca64")
How it ran

no invocation recorded.

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 2 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
generate_label 1 other paper
1 later
2009.00725 (2020-09)
Conditional Constrained Graph Variational Autoencoders for Molecule Design
generate_mask 1 other paper
1 later
2009.00725 (2020-09)
Conditional Constrained Graph Variational Autoencoders for Molecule Design
genereate_incremental_adj 1 other paper
1 later
2009.00725 (2020-09)
Conditional Constrained Graph Variational Autoencoders for Molecule Design

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Deep generative models have achieved remarkable success in various data domains, including images, time series, and natural languages. There remain, however, substantial challenges for combinatorial structures, including graphs. One of the key challenges lies in the difficulty of ensuring semantic validity in context. For examples, in molecular graphs, the number of bonding-electron pairs must not exceed the valence of an atom; whereas in protein interaction networks, two proteins may be connected only when they belong to the same or correlated gene ontology terms. These constraints are not easy to be incorporated into a generative model. In this work, we propose a regularization framework for variational autoencoders as a step toward semantic validity. We focus on the matrix representation of graphs and formulate penalty terms that regularize the output distribution of the decoder to encourage the satisfaction of validity constraints. Experimental results confirm a much higher likelihood of sampling valid graphs in our approach, compared with others reported in the literature.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1809.02630")
get_code_for_paper("1809.02630")
have("1809.02630")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1809.02630.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1809.02630.svg)](https://syntology.ai/paper/1809.02630)

Connect an agent — have() is free.