SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2602.20833 · 2026

DRESS: A Continuous Framework for Structural Graph Refinement

Eduar Castrillo Velilla

arXiv · PDF · Open in the Atlas

Code that ran

None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-22; 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/2602.20833.json · badge: /api/ran/2602.20833.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
velicast/dress-graph canonical (classifier label)
classifier basis: census
0 ran · 3 no recorded run
FunctionStatusWhere it lives
delta_fit Not yet run
unverified (harvested, no recorded run)
velicast/dress-graph/python/src/dress/core.py
code served (permissive licence) · get_code("7e0bbb810e5d852e")
How it ran

no invocation recorded.

fit Not yet run
unverified (harvested, no recorded run)
velicast/dress-graph/python/src/dress/core.py
code served (permissive licence) · get_code("2902b27b6eb35ebe")
How it ran

no invocation recorded.

nabla_fit Not yet run
unverified (harvested, no recorded run)
velicast/dress-graph/python/src/dress/core.py
code served (permissive licence) · get_code("3df503d488a099eb")
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-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 DRESS, a deterministic, parameter-free framework that iteratively refines the structural similarity of edges in a graph to produce a canonical fingerprint: a realvalued edge vector, obtained by converging a non-linear dynamical system to its unique fixed point. The fingerprint is isomorphism-invariant by construction, numerically stable (strictly bounded, precision-preserving, and mathematically well-posed), fast and embarrassingly parallel to compute: DRESS total runtime is O(I • m • d max ) for I iterations to convergence, and convergence is guaranteed by Birkhoff contraction. We generalize the original equation to Motif-DRESS (arbitrary structural motifs) and Generalized-DRESS (abstract aggregation template), and introduce ∆-DRESS, which runs DRESS on each vertex-deleted subgraph to boost expressiveness. ∆-DRESS empirically separates all 7,983 graphs in a comprehensive Strongly Regular Graph benchmark, and on the tested CFI instances (k = 0, 1, 2, 3), k-deletion (∆ k -DRESS) empirically matches the (k+2)-WL boundary. 1. Original-DRESS (Section 2): The foundational equation, a parameter-free dynamical system on edges that converges to a canonical fingerprint vector. 2. Expressiveness beyond 1-WL (Section 3): Original-DRESS distinguishes graphs that 1-WL cannot, including the prism graph from K 3,3 .

For agents

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

get_harvested_code_for_paper("2602.20833")
get_code_for_paper("2602.20833")
have("2602.20833")

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

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

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

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

Connect an agent — have() is free.