SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2402.02441 · 2024

TopoX: A Suite of Python Packages for Machine Learning on Topological Domains

arXiv · PDF · Open in the Atlas

Code that ran

2 of 2 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 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/2402.02441.json · badge: /api/ran/2402.02441.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
pyt-team/toponetx canonical (classifier label)
classifier basis: census
2 ran · 0 no recorded run
FunctionStatusWhere it lives
hodge_laplacian_eigenvectors Ran
ran; our contract draft was wrong, not the code
pyt-team/toponetx/toponetx/algorithms/spectrum.py
code served (permissive licence) · get_code("4fe78da1ddc3cd14")
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 tuple. 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
import scipy.sparse as sparse
from scipy.sparse import diags

# Create a small sparse matrix that represents a Hodge Laplacian
# For a small simplicial complex, we'll create a simple symmetric sparse matrix
n = 8  # size of matrix
# Create a small sparse symmetric matrix (Hodge Laplacian)
row = np.array([0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7])
col = np.array([0, 1, 2, 1, 2, 3, 4, 3, 4, 5, 6, 5, 6, 7, 0])
data = np.array([2.0, 3.0, -1.0, 3.0, 2.0, 1.0, -0.5, 1.0, 2.0, 2.0, -1.0, 2.0, 1.0, 1.5, -0.3])

hodge_laplacian_matrix = sparse.csr_matrix((data, (row, col)), shape=(n, n))
# Make it symmetric
hodge_laplacian_matrix = hodge_laplacian_matrix + hodge_laplacian_matrix.T
hodge_laplacian_matrix = hodge_laplacian_matrix / 2

# Define the number of components to extract
n_components = 2

ARGS = {
    "hodge_laplacian": hodge_laplacian_matrix,
    "n_components": n_components,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type tuple — a tuple output has no array shape of its own; none is 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
laplacian_spectrum Ran
ran, honoured the contract we drafted
pyt-team/toponetx/toponetx/algorithms/spectrum.py
code served (permissive licence) · get_code("8db8ecbaa9ea4c02")
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 1, dtype family float, shape (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
import scipy as sp
from scipy import sparse

# Create a small Laplacian matrix
# A Laplacian matrix is typically symmetric and positive semi-definite
# For a simple graph with 4 nodes, we can construct a sparse Laplacian matrix
n = 4
laplacian = sparse.lil_matrix((n, n))

# Create a simple graph Laplacian:
# Degree matrix D - Adjacency matrix A
# D is diagonal with node degrees
# A is the adjacency matrix

# Simple graph: 0-1, 1-2, 2-3 (a path graph)
# Degrees: [1, 2, 2, 1]
degrees = np.array([1, 2, 2, 1])
laplacian.setdiag(degrees)

# Set off-diagonal elements (negative of adjacency)
laplacian[0, 1] = -1
laplacian[1, 0] = -1
laplacian[1, 2] = -1
laplacian[2, 1] = -1
laplacian[2, 3] = -1
laplacian[3, 2] = -1

# Convert to CSR format (efficient for operations)
laplacian_sparse = laplacian.tocsr()

ARGS = {
    "matrix": laplacian_sparse
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family float, shape (4,) — shape (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

Also present in other papers' code

Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 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 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.

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

We introduce TopoX, a Python software suite that provides reliable and user-friendly building blocks for computing and machine learning on topological domains that extend graphs: hypergraphs, simplicial, cellular, path and combinatorial complexes. TopoX consists of three packages: TopoNetX facilitates constructing and computing on these domains, including working with nodes, edges and higher-order cells; TopoEmbedX provides methods to embed topological domains into vector spaces, akin to popular graph-based embedding algorithms such as node2vec; TopoModelX is built on top of PyTorch and offers a comprehensive toolbox of higher-order message passing functions for neural networks on topological domains. The extensively documented and unit-tested source code of TopoX is available under MIT license at https://pyt-team.github.io/}{https://pyt-team.github.io/.

For agents

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

get_harvested_code_for_paper("2402.02441")
get_code_for_paper("2402.02441")
have("2402.02441")

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

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

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

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

Connect an agent — have() is free.