SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2307.06104 · 2023

Deep learning for dynamic graphs: models and benchmarks

arXiv · PDF · Open in the Atlas

Code that ran

4 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 0 have no contract verdict; 4 failures of our instrument; 1 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/2307.06104.json · badge: /api/ran/2307.06104.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
gravins/dynamic_graph_benchmark canonical (classifier label)
classifier basis: census
4 ran · 1 no recorded run
FunctionStatusWhere it lives
compute_metrics Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
gravins/dynamic_graph_benchmark/D-TDG/dyngesn.py
pointer only (licence: NONE) · get_code("3f1af57b35ed5f3c")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gravins/dynamic_graph_benchmark when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

compute_stats Ran
ran; our contract draft was wrong, not the code
gravins/dynamic_graph_benchmark/C-TDG/utils.py
pointer only (licence: NONE) · get_code("bfee47aeed2edc65")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gravins/dynamic_graph_benchmark when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_node_sets Ran
ran; our contract draft was wrong, not the code
gravins/dynamic_graph_benchmark/C-TDG/utils.py
pointer only (licence: NONE) · get_code("95369209434160a2")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gravins/dynamic_graph_benchmark when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

scoring Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
gravins/dynamic_graph_benchmark/C-TDG/utils.py
pointer only (licence: NONE) · get_code("65357288a6dc4305")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gravins/dynamic_graph_benchmark when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

eval Not yet run
unverified (harvested, no recorded run)
gravins/dynamic_graph_benchmark/D-TDG/dyngesn.py
pointer only (licence: NONE) · get_code("dbec1e85a8f0ef2e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, gravins/dynamic_graph_benchmark when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. 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, 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 5 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

Recent progress in research on Deep Graph Networks (DGNs) has led to a maturation of the domain of learning on graphs. Despite the growth of this research field, there are still important challenges that are yet unsolved. Specifically, there is an urge of making DGNs suitable for predictive tasks on realworld systems of interconnected entities, which evolve over time. With the aim of fostering research in the domain of dynamic graphs, at first, we survey recent advantages in learning both temporal and spatial information, providing a comprehensive overview of the current state-of-the-art in the domain of representation learning for dynamic graphs. Secondly, we conduct a fair performance comparison among the most popular proposed approaches on node and edge-level tasks, leveraging rigorous model selection and assessment for all the methods, thus establishing a sound baseline for evaluating new architectures and approaches

For agents

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

get_harvested_code_for_paper("2307.06104")
get_code_for_paper("2307.06104")
have("2307.06104")

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

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

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

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

Connect an agent — have() is free.