On the public citation graph

A maxent-stress model for graph layout

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.1002/1097-024x(200009)30:11<1203::aid-spe338>3.0.co;2-nopenalex-snapshot
An open graph visualization system and its applications to software engineering
inferredcites →https://doi.org/10.1002/spe.4380211102openalex-snapshot
Graph drawing by force‐directed placement
inferredcites →https://doi.org/10.1007/3-540-63938-1_67openalex-snapshot
Which aesthetic has the greatest effect on human understanding?
inferredcites →https://doi.org/10.1007/978-0-387-39351-3openalex-snapshot
Nonlinear Dimensionality Reduction
inferredcites →https://doi.org/10.1007/978-3-540-31843-9_25openalex-snapshot
Graph Drawing by Stress Majorization
inferredcites →https://doi.org/10.1007/978-3-540-31843-9_29openalex-snapshot
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-70904-6_6openalex-snapshot
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
inferredcites →https://doi.org/10.1007/978-3-642-00219-9_19openalex-snapshot
The Binary Stress Model for Graph Drawing
inferredcites →https://doi.org/10.1007/978-3-642-00219-9_21openalex-snapshot
An Experimental Study on Distance-Based Graph Drawing
inferredcites →https://doi.org/10.1007/bf02289565openalex-snapshot
Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
inferredcites →https://doi.org/10.1007/bfb0045087openalex-snapshot
Spring algorithms and symmetry
inferredcites →https://doi.org/10.1016/0020-0190(89)90102-6openalex-snapshot
An algorithm for drawing general undirected graphs
inferredcites →https://doi.org/10.1016/j.ecolmodel.2005.03.026openalex-snapshot
Maximum entropy modeling of species geographic distributions
inferredcites →https://doi.org/10.1038/324446a0openalex-snapshot
A hierarchical O(N log N) force-calculation algorithm
inferredcites →https://doi.org/10.1103/physrev.106.620openalex-snapshot
Information Theory and Statistical Mechanics
inferredcites →https://doi.org/10.1103/physreve.79.026102openalex-snapshot
Modularity clustering is force-directed layout
inferredcites →https://doi.org/10.1109/pacificvis.2009.4906847openalex-snapshot
Extending the spring-electrical model to overcome warping effects
inferredcites →https://doi.org/10.1109/tvcg.2008.85openalex-snapshot
Glimmer: Multilevel MDS on the GPU
inferredcites →https://doi.org/10.1109/visual.1996.567787openalex-snapshot
A linear iteration time layout algorithm for visualising high-dimensional data
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1198/jasa.2009.0111openalex-snapshot
Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis
inferredcites →https://doi.org/10.5555/234285.234289openalex-snapshot
A maximum entropy approach to natural language processing
inferredcites →https://doi.org/10.5555/244979.245035openalex-snapshot
A linear iteration time layout algorithm for visualising high-dimensional data
inferredcites →https://doi.org/10.7155/jgaa.00070openalex-snapshot
A Multilevel Algorithm for Force-Directed Graph-Drawing
inferredcites →https://doi.org/10.7155/jgaa.00089openalex-snapshot
Graph Drawing by High-Dimensional Embedding
inferredcites →https://doi.org/10.7155/jgaa.00154openalex-snapshot
Energy Models for Graph Clustering

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4614-7163-9_44-1openalex-snapshot
Visualization of Large Networks
inferred← citeshttps://doi.org/10.1007/978-1-4939-7131-2_44openalex-snapshot
Visualization of Large Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_9openalex-snapshot
Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-06793-3_8openalex-snapshot
Temporal Multivariate Networks
inferred← citeshttps://doi.org/10.1109/mc.2013.242openalex-snapshot
Large-Scale Graph Visualization and Analytics
inferred← citeshttps://doi.org/10.1109/pacificvis.2014.22openalex-snapshot
Bridging the Gap of Network Management and Anomaly Detection through Interactive Visualization
inferred← citeshttps://doi.org/10.1109/pacificvis52677.2021.00030openalex-snapshot
Sublinear-time Algorithms for Stress Minimization in Graph Drawing
inferred← citeshttps://doi.org/10.1109/tvcg.2012.236openalex-snapshot
Intelligent Graph Layout Using Many Users' Input
inferred← citeshttps://doi.org/10.1109/tvcg.2023.3238821openalex-snapshot
Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution
inferred← citeshttps://doi.org/10.1111/cgf.13187openalex-snapshot
Graph Layouts by t‐SNE
inferred← citeshttps://doi.org/10.1111/cgf.14615openalex-snapshot
Event‐based Dynamic Graph Drawing without the Agonizing Pain
inferred← citeshttps://doi.org/10.15366/relacionesinternacionales2021.48.012openalex-snapshot
Agenda y particularización del discurso político chino: un análisis evolutivo en la guerra comercial con los Estados Unidos
inferred← citeshttps://doi.org/10.15866/irecos.v12i2.12002openalex-snapshot
“Forced” Force Directed Placement: a New Algorithm for Large Graph Visualization
inferred← citeshttps://doi.org/10.21941/kcss/2018/1openalex-snapshot
Sugiyama Layouts for Prescribed Drawing Areas
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.