SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2002.08772 · 2020

Set2Graph: Learning Graphs From Sets

arXiv · PDF · Open in the Atlas

Code that ran

2 of 3 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 0 have no contract verdict; 2 failures of our instrument; 1 no recorded run), measured 2026-11-21; 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/2002.08772.json · badge: /api/ran/2002.08772.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
hadarser/SetToGraphPaper canonical (classifier label)
classifier basis: classifier_2025
2 ran · 1 no recorded run
FunctionStatusWhere it lives
calc_metrics Ran
ran; our contract draft was wrong, not the code
hadarser/SetToGraphPaper/main_scripts/main_jets.py
code served (permissive licence) · get_code("3979bb6a4cc7dc13")
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. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is 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 torch
import numpy as np

torch.manual_seed(0)

# Set up dimensions
B = 2  # batch size
N = 4  # number of nodes
C = 3  # number of clusters

# Create pred_partitions: cluster assignments for each node (B, N)
# Values should be in range [0, C-1]
pred_partitions = torch.tensor([[0, 1, 0, 2], [1, 1, 0, 2]], dtype=torch.long, device='cpu')

# Create partitions_as_graph: adjacency matrix representation (B, N, N)
# This is a binary matrix where entry (i,j) is 1 if nodes i and j are in same partition
partitions_as_graph = torch.tensor([
    [[1, 0, 1, 0],
     [0, 1, 0, 0],
     [1, 0, 1, 0],
     [0, 0, 0, 1]],
    [[0, 1, 0, 0],
     [1, 1, 0, 0],
     [0, 0, 1, 0],
     [0, 0, 0, 1]]
], dtype=torch.float, device='cpu')

# Create partitions: ground truth cluster assignments (B, N)
partitions = torch.tensor([[0, 1, 0, 2], [1, 1, 0, 2]], dtype=torch.long, device='cpu')

# Create accum_info: dictionary to accumulate metrics
accum_info = {
    'recall': 0.0,
    'precision': 0.0,
    'fscore': 0.0,
    'accuracy': 0.0,
    'ri': 0.0
}

ARGS = {
    'pred_partitions': pred_partitions,
    'partitions_as_graph': partitions_as_graph,
    'partitions': partitions,
    'accum_info': accum_info
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — 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
infer_clusters Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
hadarser/SetToGraphPaper/main_scripts/main_jets.py
code served (permissive licence) · get_code("8ff242b3439b14da")
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 Tensor, ndim 2, dtype family int, shape (2, 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 torch
import numpy as np

torch.manual_seed(0)

# Create edge_vals tensor with shape (B, N, N)
# B=2 (batch size), N=4 (number of nodes)
# Values should be floats representing edge scores (between -1 and 1)
edge_vals = torch.randn(2, 4, 4)

ARGS = {
    "edge_vals": edge_vals
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type Tensor, ndim 2, dtype family int, shape (2, 4) — shape (2, 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
get_loss Not yet run
unverified (harvested, no recorded run)
hadarser/SetToGraphPaper/main_scripts/main_jets.py
code served (permissive licence) · get_code("72a3836ecf2d6aee")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 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.

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-21.

Repositories linked to this paper

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

Abstract

Many problems in machine learning can be cast as learning functions from sets to graphs, or more generally to hypergraphs; in short, Set2Graph functions. Examples include clustering, learning vertex and edge features on graphs, and learning features on triplets in a collection. A natural approach for building Set2Graph models is to characterize all linear equivariant set-to-hypergraph layers and stack them with non-linear activations. This poses two challenges: (i) the expressive power of these networks is not well understood; and (ii) these models would suffer from high, often intractable computational and memory complexity, as their dimension grows exponentially. This paper advocates a family of neural network models for learning Set2Graph functions that is both practical and of maximal expressive power (universal), that is, can approximate arbitrary continuous Set2Graph functions over compact sets. Testing these models on different machine learning tasks, mainly an application to particle physics, we find them favorable to existing baselines.

For agents

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

get_harvested_code_for_paper("2002.08772")
get_code_for_paper("2002.08772")
have("2002.08772")

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

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

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

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

Connect an agent — have() is free.