Papers › HSG-12M: A Large-Scale Spatial Multigraph Dataset

HSG-12M: A Large-Scale Spatial Multigraph Dataset

10 Jun 2025arXiv:2506.08618archive 2025-07-28

Xianquan Yan, Hakan Akgün, Kenji Kawaguchi, N. Duane Loh, Ching Hua Lee

Existing graph benchmarks assume non-spatial, simple edges, collapsing physically distinct paths into a single link. We introduce HSG-12M, the first large-scale dataset of spatial multigraphs-graphs embedded in a metric space where multiple geometrically distinct trajectories between two nodes are retained as separate edges. HSG-12M contains 11.6 million static and 5.1 million dynamic Hamiltonian spectral graphs across 1401 characteristic-polynomial classes, derived from 177 TB of spectral potential data. Each graph encodes the full geometry of a 1-D crystal's energy spectrum on the complex plane, producing diverse, physics-grounded topologies that transcend conventional node-coordinate datasets. To enable future extensions, we release Poly2Graph: a high-performance, open-source pipeline that maps arbitrary 1-D crystal Hamiltonians to spectral graphs. Benchmarks with popular GNNs expose new challenges in learning from multi-edge geometry at scale. Beyond its practical utility, we show that spectral graphs serve as universal topological fingerprints of polynomials, vectors, and matrices, forging a new algebra-to-graph link. HSG-12M lays the groundwork for geometry-aware graph learning and new opportunities of data-driven scientific discovery in condensed matter physics and beyond.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2506.08618")

Code

Syntology Ran 6 of 14 code samples harvested from 2 repositories linked to this paper; 8 have no recorded run. Of those that ran: 5 ran · fixture could not drive it; 1 ran with no contract checked.

By repository: official repository: 14 samples from 2 repositories, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

sarinstein-yan/hsg-12m officialmentioned in paperpytorchApache-2.0 report
sarinstein-yan/poly2graph officialmentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 6 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

5ran · fixture could not drive it
1ran
8unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

_fill sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository ran · fixture could not drive it MIT (permissive) · 551cc81aad0cc46e · report
_idx2rc sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · 5828ce4bee3117ff · report
_neighbors sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · 1e7d8d61a2d483ab · report
_parse_struc sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository ran · fixture could not drive it MIT (permissive) · 34032b590b8b81da · report
_trace sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository ran MIT (permissive) · 125338005350e6da · report
skeleton2graph sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository ran · fixture could not drive it MIT (permissive) · edffe805610f10c7 · report
_mark sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository unverified MIT (permissive) · dcf8beaf538df4ad · report
build_graph sarinstein-yan/poly2graph/src/poly2graph/skeleton2graph.py official repository unverified MIT (permissive) · 3ccd76565fb92dd4 · report
get_model_instance sarinstein-yan/HSG-12M/src/hsg/gnn_baselines.py official repository unverified Apache-2.0 (permissive) · 192d4fb35b2c4783 · report
load_class sarinstein-yan/HSG-12M/src/hsg/generation.py official repository unverified Apache-2.0 (permissive) · 0196e82974a16562 · report
plot_batch_sums sarinstein-yan/HSG-12M/src/hsg/sampler.py official repository unverified Apache-2.0 (permissive) · 4077287cfa39f790 · report
rebalance_batch sarinstein-yan/HSG-12M/src/hsg/sampler.py official repository unverified Apache-2.0 (permissive) · 357df038bd8c0f65 · report
unique_indices_by_hash sarinstein-yan/HSG-12M/src/hsg/generation.py official repository unverified Apache-2.0 (permissive) · 91955218e5ede93d · report
wl_hash_safe sarinstein-yan/HSG-12M/src/hsg/generation.py official repository unverified Apache-2.0 (permissive) · c523089b6fe7c93b · report

Tasks

Graph Learningscientific discovery

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections