On the public citation graph

Joint Graph Embedding and Alignment with Spectral Pivot

https://doi.org/10.1145/3447548.3467377
0 signed · 40 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4757-3023-4openalex-snapshot
Handbook of Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-540-71681-5_2openalex-snapshot
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
inferredcites →https://doi.org/10.1007/978-3-642-15555-0_36openalex-snapshot
Reweighted Random Walks for Graph Matching
inferredcites →https://doi.org/10.1007/bf02289451openalex-snapshot
A Generalized Solution of the Orthogonal Procrustes Problem
inferredcites →https://doi.org/10.1007/s002110050432openalex-snapshot
A Procrustes problem on the Stiefel manifold
inferredcites →https://doi.org/10.1016/j.patcog.2013.08.024openalex-snapshot
A sparse nonnegative matrix factorization technique for graph matching problems
inferredcites →https://doi.org/10.1016/s0167-5060(08)70955-5openalex-snapshot
Annals of Discrete Mathematics 46
inferredcites →https://doi.org/10.1109/34.6778openalex-snapshot
An eigendecomposition approach to weighted graph matching problems
inferredcites →https://doi.org/10.1109/cvpr.2012.6247667openalex-snapshot
Factorized graph matching
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tkde.2014.2320716openalex-snapshot
SlashBurn: Graph Compression and Mining beyond Caveman Communities
inferredcites →https://doi.org/10.1109/tkde.2018.2807452openalex-snapshot
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
inferredcites →https://doi.org/10.1109/tnse.2019.2913233openalex-snapshot
Spectral Alignment of Graphs
inferredcites →https://doi.org/10.1109/tpami.2008.245openalex-snapshot
A Path Following Algorithm for the Graph Matching Problem
inferredcites →https://doi.org/10.1137/110834524openalex-snapshot
Maximum Block Improvement and Polynomial Optimization
inferredcites →https://doi.org/10.1145/1390156.1390191openalex-snapshot
Efficient projections onto the l 1 -ball for learning in high dimensions
inferredcites →https://doi.org/10.1145/2487788.2488173openalex-snapshot
KONECT
inferredcites →https://doi.org/10.1145/2488388.2488393openalex-snapshot
Distributed large-scale natural graph factorization
inferredcites →https://doi.org/10.1145/2623330.2623732openalex-snapshot
DeepWalk
inferredcites →https://doi.org/10.1145/2806416.2806512openalex-snapshot
GraRep
inferredcites →https://doi.org/10.1145/2939672.2939751openalex-snapshot
Asymmetric Transitivity Preserving Graph Embedding
inferredcites →https://doi.org/10.1145/2939672.2939754openalex-snapshot
node2vec
inferredcites →https://doi.org/10.1145/2939672.2939766openalex-snapshot
FINAL
inferredcites →https://doi.org/10.1145/3159652.3159706openalex-snapshot
Network Embedding as Matrix Factorization
inferredcites →https://doi.org/10.1145/3178876.3186128openalex-snapshot
Low Rank Spectral Network Alignment
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/3269206.3271788openalex-snapshot
REGAL
inferredcites →https://doi.org/10.1145/800070.802206openalex-snapshot
Isomorphism of graphs with bounded eigenvalue multiplicity
inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
inferredcites →https://doi.org/10.18653/v1/d17-1207openalex-snapshot
Earth Mover's Distance Minimization for Unsupervised Bilingual Lexicon Induction
inferredcites →https://doi.org/10.2140/pjm.1957.7.961openalex-snapshot
A congruence theorem for trees
inferredcites →https://doi.org/10.48550/arxiv.1705.09634openalex-snapshot
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0044openalex-snapshot
Balanced Graph Matching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4691777openalex-extracted
Modeling Multi-Scale Consistent Information for Network Alignment
inferred← citeshttps://doi.org/10.1007/s11280-026-01411-0openalex-snapshot
Towards effective and efficient graph alignment without supervision
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00129openalex-snapshot
Robust Attributed Graph Alignment via Joint Structure Learning and Optimal Transport
inferred← citeshttps://doi.org/10.1109/tkde.2025.3640287openalex-snapshot
CombAlign: Enhancing Model Expressiveness in Unsupervised Graph Alignment
inferred← citeshttps://doi.org/10.1145/3561058openalex-snapshot
GRASP: Scalable Graph Alignment by Spectral Corresponding Functions
inferred← citeshttps://doi.org/10.1145/3677135openalex-snapshot
GABoost: Graph Alignment Boosting via Local Optimum Escape
inferred← citeshttps://doi.org/10.1609/aaai.v36i4.20329openalex-snapshot
From One to All: Learning to Match Heterogeneous and Partially Overlapped Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.