SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2402.09565 · 2024

Graph-Skeleton: ~1% Nodes are Sufficient to Represent Billion-Scale Graph

arXiv · PDF · Open in the Atlas

Code that ran

4 of 4 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; 2 honoured the contract we drafted, 1 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.09565.json · badge: /api/ran/2402.09565.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
zjunet/graphskeleton canonical (classifier label)
classifier basis: census
4 ran · 0 no recorded run
FunctionStatusWhere it lives
get_mem_space Ran
ran, honoured the contract we drafted
zjunet/graphskeleton/preliminary_exploration/dgraph/models/gpu_mem_track.py
pointer only (licence: NONE); the stored copy get_code serves, from applied-machine-learning-lab/dt4ier, is pointer only (licence: NONE) · get_code("efa7095cdb85be6c")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, zjunet/graphskeleton 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.

mapping_label Ran
ran, honoured the contract we drafted
zjunet/graphskeleton/skeleton_compress/gs.py
pointer only (licence: NONE) · get_code("242ca55f17a57dd2")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, zjunet/graphskeleton 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.

mapping_mask Ran
ran, violated the contract we drafted
zjunet/graphskeleton/skeleton_compress/gs.py
pointer only (licence: NONE) · get_code("e82ef6e72052da54")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, zjunet/graphskeleton 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.

reconstruct_x Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
zjunet/graphskeleton/skeleton_compress/gs.py
pointer only (licence: NONE) · get_code("95b6ab76f7787127")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, zjunet/graphskeleton 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.

Also present in other papers' code

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

FunctionAlso present inEarliest-datedOthers named
get_mem_space 7 other papers
5 dated earlier, 2 later
2306.06446 (2023-06)
ShiftAddViT: Mixture of Multiplication Primitives Towards Efficient Vision Transformers
2310.13012 (2023-10)
H2O Open Ecosystem for State-of-the-art Large Language Models
2310.20199 (2023-10)
In Search of Lost Online Test-time Adaptation: A Survey
and 4 more not named here

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

Due to the ubiquity of graph data on the web, web graph mining has become a hot research spot. Nonetheless, the prevalence of large-scale web graphs in real applications poses significant challenges to storage, computational capacity and graph model design. Despite numerous studies to enhance the scalability of graph models, a noticeable gap remains between academic research and practical web graph mining applications. One major cause is that in most industrial scenarios, only a small part of nodes in a web graph are actually required to be analyzed, where we term these nodes as target nodes, while others as background nodes. In this paper, we argue that properly fetching and condensing the background nodes from massive web graph data might be a more economical shortcut to tackle the obstacles fundamentally. To this end, we make the first attempt to study the problem of massive background nodes compression for target nodes classification. Through extensive experiments, we reveal two critical roles played by the background nodes in target node classification: enhancing structural connectivity between target nodes, and feature correlation with target nodes. Followingthis, we propose a novel Graph-Skeleton1 model, which properly fetches the background nodes, and further condenses the semantic and topological information of background nodes within similar target-background local structures. Extensive experiments on various web graph datasets demonstrate the effectiveness and efficiency of the proposed method. In particular, for MAG240M dataset with 0.24 billion nodes, our generated skeleton graph achieves highly comparable performance while only containing 1.8% nodes of the original graph.

For agents

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

get_harvested_code_for_paper("2402.09565")
get_code_for_paper("2402.09565")
have("2402.09565")

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

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

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

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

Connect an agent — have() is free.