← Back to narratives
Node-Link
FROM PAPER TO PRACTICE  ·  GRIAL / IEEE VIS 2026  ·  Generated 2026-03-12  ·  JSON-LD ↗

The node-link visualization in the CausalMap system was designed to untangle how sentiment spreads across social media topics. It maps causal relationships over time, using a horizontal axis to show how attitudes toward one subject influence others. This allows analysts to trace "contagion pathways" and see how specific demographics drive shifts in public opinion. In practice, however, practitioners often use node-link diagrams for far simpler tasks, such as mapping static relationships in character datasets or GitHub contributor networks. The focus shifts from exploring dynamic influence to merely reporting category distributions, frequently resulting in generic, static "hairballs" or being abandoned entirely for basic bar charts.

What is lost in this transition is the analytic depth of temporal flow and hierarchical structure. Essential features like semantic zooming—which allows users to move between high-level clusters and individual connections—and "edge weakness" filtering are typically missing. To preserve the original value, practitioners should use a directional layout, such as a time-based horizontal axis, to give the network a clear narrative flow. Furthermore, do not just plot every connection; implement interactive filters that allow users to hide insignificant edges and reveal the core structural components. This transforms the visualization from a cluttered map into a tool for genuine discovery.

Drift severity breakdown

Frequency over time (academic)

Academic vs repository distribution

Per-year publication trend

Top libraries in matching notebooks

Drift Evidence — 50 annotations

ENCODING50 major
MAJOR (50)
Multiscale Visualization of Small World Networks
Academic design encodes multiscale node-link structure with edge weakness and hierarchical decomposition, while the notebook only produces unrelated bar/heatmap/scatter plots of Pokémon stats.
Multiscale Visualization of Small World Networks
No evidence of the paper’s multiscale node-link decomposition, edge weakness metric, or hierarchical subgraph layout; repository only shows generic networkx plots.
Multiscale Visualization of Small World Networks
Academic design’s edge-weakness metric, hierarchical subgraph layouts, and semantic-zoom node-link views are absent; only a basic histogram and generic networkx plot appear.
Multiscale Visualization of Small World Networks
The repo only outputs static nx.draw calls with no edge-weakness colouring, subgraph decomposition, or hierarchical layout, so every multiscale encoding channel is absent.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic design’s animated node-link MST vs PFNET comparison is replaced by static charts (area, glyph, heatmap, histogram, scatter) that do not encode network topology or evolution.
Multiscale Visualization of Small World Networks
The repo uses a basic spring-layout node-link plot with no multiscale hierarchy, edge-weakness colouring, or semantic-zoom layers that the paper’s design prescribes.
Multiscale Visualization of Small World Networks
Academic design’s edge-weakness metric and hierarchical multiscale decomposition are replaced by a single Louvain community partition and static node-link layout.
Multiscale Visualization of Small World Networks
The academic paper's multiscale, hierarchical node-link with edge-weakness filtering is reduced to a single-level co-authorship network, losing the multiscale decomposition and semantic zoom encodings.
Multiscale Visualization of Small World Networks
The academic node-link multiscale view with edge-weakness filtering and hierarchical subgraphs is absent; only static bar/histogram charts appear.
Multiscale Visualization of Small World Networks
The academic design’s multiscale node-link decomposition and edge-weakness encoding are absent; the notebook only shows generic bar/scatter plots of word counts.
Multiscale Visualization of Small World Networks
The repo uses a plain spring-layout node-link plot with a single categorical color channel, completely omitting the paper’s multiscale hierarchical decomposition, edge-weakness metric, and semantic-zoom-based visual encodings.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic paper's animated node-link evolution with MST/PFNET link reduction is replaced by static bar/heatmap plots of Pokémon stats, losing the temporal network encoding entirely.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic design’s animated node-link evolution comparing MST vs PFNET topologies is reduced to a static histogram of class labels, losing the temporal and structural encodings entirely.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
Academic design animates evolving MST vs PFNET topologies with link-reduction semantics, while the repo produces a static Louvain-coloured node-link diagram lacking time, link pruning, or path semantics.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic paper’s animated node-link MST/PFNET evolution is reduced to static bar/histogram counts, losing the time-varying network topology and link-reduction comparison entirely.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repo uses a static spring-layout node-link diagram with no MST/PFNET pruning, edge weight animation, or topology-preserving layout that the paper requires for comparing evolving co-citation structures.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation drops several key visual channels and encoding axes present in the academic design, such as the use of minimum spanning trees and pathfinder networks for network visualization.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation simplifies the encoding by primarily focusing on bar, node-link, and scatter charts, deviating from the academic design's emphasis on minimum spanning trees and pathfinder networks for evolving network visualization.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The encoding drift is major because the academic design relies on dynamic network topology preservation and link reduction algorithms, whereas the repository implementation uses a static node-link diagram with limited encoding capabilities.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The implementation primarily utilizes node-link diagrams with varying layouts, whereas the academic design focuses on animated visualizations of evolving networks using minimum spanning trees and pathfinder networks, indicating a significant encoding drift.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation simplifies the visual encoding by primarily using standard node-link diagrams without radial focus+context layout, level highlighting, or secondary foci as described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks the unique radial focus+context layout and image-bearing node visualization features described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks the radial focus+context layout and visual node display of the academic design, instead using various chart types with simplified encoding.
Exploring high-D spaces with multiform matrices and small multiples
The repository implementation simplifies the encoding by using only a Node-Link diagram without incorporating multiform matrices, small multiples, or conditional entropy ordering as described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation simplifies the encoding by primarily using bar charts and histograms instead of the radial focus+context visualization and node-link diagrams described in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation replaces the radial focus+context layout and image-bearing nodes with a simple spring layout and generic circles, dropping key visual channels.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation uses a static graphviz layout and plain colored nodes, dropping the radial focus+context layout, image-bearing nodes, and interactive encodings.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The code uses generic networkx/pyvis graphs lacking the radial focus+context layout and image‑bearing visual nodes of MoireGraphs.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation uses generic static node‑link (or other chart types) without the radial focus+context layout, image nodes, or animated transitions described in the paper.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation uses a basic spring layout and simple colour encoding, dropping the radial focus+context layout and image‑bearing nodes of MoireGraphs.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The implementation replaces the radial focus+context layout and image-bearing nodes with uniform static node‑link drawings, losing key visual channels.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook lacks EdgeLens-specific encodings like interactive edge curvature, transparency, and multiple lens overlays, reducing the visual encoding to basic static node-link plots.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook uses static matplotlib plots and a simple histogram, dropping the EdgeLens node‑link layout, curvature, transparency and multi‑lens encodings required by the paper.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook uses heatmaps, boxplots, etc., not the node‑link with EdgeLens encoding described in the paper.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation uses a basic static node‑link layout with no edge curvature, lenses, transparency, or colour encoding required by EdgeLens, simplifying the visual encoding substantially.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation drops EdgeLens curvature, transparency, multiple lenses and uses static colour‑by‑community, a major deviation from the paper’s encodings.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation uses a generic node‑link graph without EdgeLens curvature, transparency, or multiple lens overlays, abandoning the paper's specialized encodings.
Edgelens: an interactive method for managing edge congestion in graphs
Implementation uses static bar/histogram plots, omitting the node-link graph, edge curvature, and lens encodings required by EdgeLens.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook lacks the node‑link EdgeLens visual encoding entirely, using generic plots unrelated to edge curvature or transparency.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation uses a static spring layout without edge curvature, lenses, transparency or multi‑channel encodings that are central to EdgeLens.
Edgelens: an interactive method for managing edge congestion in graphs
The implementation replaces EdgeLens curvature, transparency, and multi‑lens overlays with basic static node‑link drawings using simple color and size encodings.
Exploring high-D spaces with multiform matrices and small multiples
The notebook uses a basic node‑link plot without the multiform matrices, small multiples, conditional‑entropy ordering, or coordinated views described in the paper.
Exploring high-D spaces with multiform matrices and small multiples
The notebook replaces the paper's multiform matrices, small multiples, and coordinated views with a simple histogram and basic node‑link, losing the complex encodings and layout.
Exploring high-D spaces with multiform matrices and small multiples
The notebook replaces the paper's multiform matrix/small multiples and coordinated views with simple static heatmaps and boxplots, losing key visual encodings.
Exploring high-D spaces with multiform matrices and small multiples
The notebook builds a co‑authorship network using pyvis instead of the paper's multiform bivariate matrix/small‑multiple coordinated views, dropping the intended multi‑encoding layout.
Exploring high-D spaces with multiform matrices and small multiples
Implementation reduces the design to a single static node‑link graph, dropping the multi‑form matrices, small multiples, conditional entropy ordering and coordinated views.
Exploring high-D spaces with multiform matrices and small multiples
The implementation uses only static bar and histogram plots, dropping the node‑link, matrix and small‑multiple encodings central to the paper.
Exploring high-D spaces with multiform matrices and small multiples
The implementation uses generic bar/scatter/node‑link plots on text data instead of the paper’s coordinated multiform matrices and small multiples.
Exploring high-D spaces with multiform matrices and small multiples
Implementation reduces the design to a single static node‑link plot, dropping matrix/small‑multiple layouts, multivariate encodings, and coordinated views.
Exploring high-D spaces with multiform matrices and small multiples
Implementation replaces the paper's multiform matrices and coordinated small multiples with simple static node‑link drawings, dropping key encodings and layout complexity
INTERACTION50 major
MAJOR (50)
Multiscale Visualization of Small World Networks
Paper’s semantic zooming, network filtering, and navigable subgraph hierarchy are entirely absent; the notebook is a static sequence of charts.
Multiscale Visualization of Small World Networks
Repository lacks the paper’s semantic zooming, interactive filtering, and dynamic subgraph exploration features.
Multiscale Visualization of Small World Networks
The paper’s core interactive semantic zooming and dynamic filtering of weak edges to reveal nested small-world components are completely missing in the static notebook.
Multiscale Visualization of Small World Networks
No semantic zooming, filtering, or navigation controls exist; the notebook merely renders fixed matplotlib subplots.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The paper’s core interactive animation of network evolution over time is absent; the notebook only shows fixed plots.
Multiscale Visualization of Small World Networks
All interactive semantic zooming, filtering by edge weakness, and hierarchical navigation described in the paper are absent; only a static draw call is provided.
Multiscale Visualization of Small World Networks
Paper’s semantic zooming and interactive filtering of weak edges are completely absent; the notebook produces only a static community-colored graph.
Multiscale Visualization of Small World Networks
The paper's interactive semantic zooming and filtering on edge weakness are not implemented; only a static networkx/pyvis rendering is present.
Multiscale Visualization of Small World Networks
Semantic zooming, network decomposition, and interactive filtering described in the paper are completely missing from the static notebook plots.
Multiscale Visualization of Small World Networks
Semantic zooming, hierarchical subgraph navigation, and interactive filtering described in the paper are not implemented; the notebook is static.
Multiscale Visualization of Small World Networks
The notebook produces only a static nx.draw_networkx image, lacking the paper’s core interactive semantic zooming, network filtering, and hierarchical subgraph navigation.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository offers no animation or interactive exploration of network evolution, while the paper depends on animated growth to reveal critical-path cohesion.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The paper’s core interactive animation of network growth over 58 years is absent; the notebook only shows a fixed histogram with no user-controlled or automated playback.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
Paper relies on animated growth playback to compare MST/PFNET path cohesion over time; the notebook only renders a single static frame with no animation or user controls.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
No animation, brushing, or timeline controls exist; the notebook only outputs fixed bar plots and histograms, eliminating the dynamic exploration of network evolution.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The notebook is purely static; it lacks the temporal animation and interactive comparison between MST and PFNET views that the paper uses to reveal critical-path cohesion over 58 years.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation lacks interactivity described in the academic design, including dynamic network analysis, animated visualization models, and linked views.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation lacks interactivity described in the academic design, such as animated visualization models and dynamic network analysis, which are crucial for understanding evolving networks.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The interaction drift is major because the academic design likely requires interactive animation and exploration of evolving networks, whereas the repository implementation is a static visualization with no interactive elements.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The repository implementation lacks the interactive elements, such as animations and dynamic filtering, that are crucial to the academic design's goals of exploring and interpreting the evolution of networks.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks interactivity such as radial rotation, focus strength interaction, and animated transitions that are central to the exploratory capabilities of the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks interactive features like focus strength changing, radial rotation, level highlighting, and animated transitions that are central to the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation is largely static and lacks the interactive features such as focus strength changing, radial rotation, and animated transitions described in the academic design.
Exploring high-D spaces with multiform matrices and small multiples
The repository implementation lacks interactivity such as dynamic conditioning, coordinated multiple views, and brushing, which are essential components of the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation lacks the interactivity described in the academic design, such as focus strength changing, radial rotation, level highlighting, secondary foci, and animated transitions.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
No focus strength, rotation, highlighting, or animated transitions are provided—interaction is absent.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
No interactive features such as focus strength, rotation, brushing, or animated transitions are provided.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
It does not implement the paper's focus strength, radial rotation, level highlighting, secondary foci, or animated transition interactions.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
No focus strength, radial rotation, level highlighting, or other interactive techniques are present, reducing interactivity to basic static plots.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
No interactive controls (focus strength, rotation, highlighting, animations) are provided; the figure is static.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
No interactive controls (focus strength, rotation, highlighting, animation) are provided, only static plots.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive lens manipulation, brushing, or dynamic focus+context is provided in the notebook implementation.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive lens manipulation, brushing, or dynamic zooming is present, unlike the paper's core interactive technique.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive edge‑lens manipulation or linked views are present; visualizations are static.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive techniques (lensing, brushing, zoom, tooltips) are present; the notebook produces only static plots.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive lens, brushing, or focus+context tools are present, a major interaction loss.
Edgelens: an interactive method for managing edge congestion in graphs
No EdgeLens interactive lens, brushing, or focused edge‑curving interactions are present, only basic static or generic graph displays.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive lens manipulation, zoom, or tooltips are present; plots are static.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive EdgeLens features (lenses, brushing, tooltips) are present in the code.
Edgelens: an interactive method for managing edge congestion in graphs
No interactive features (lensing, brushing, zoom) are present; the plot is rendered as a static matplotlib figure.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook provides only static matplotlib plots, lacking the interactive lens manipulation, zoom, and focus+context features described in the paper.
Exploring high-D spaces with multiform matrices and small multiples
Kaggle notebooks provide static images only, lacking the brushing, dynamic conditioning, linked view interactions the academic design relies on.
Exploring high-D spaces with multiform matrices and small multiples
The academic design relies on dynamic conditioning, linked brushing, and zoom, which are absent in the static matplotlib notebook.
Exploring high-D spaces with multiform matrices and small multiples
The implementation provides no interactive conditioning, linking, or brushing described in the academic design.
Exploring high-D spaces with multiform matrices and small multiples
The implementation lacks the conditional entropy ordering, dynamic conditioning, and linked multiple‑view interactions described in the academic design, offering only basic network interactivity.
Exploring high-D spaces with multiform matrices and small multiples
No brushing, filtering, linked views or dynamic conditioning are provided; the notebook produces a static plot.
Exploring high-D spaces with multiform matrices and small multiples
No interactive features (brushing, linked views, conditioning) are present; the notebook produces static figures.
Exploring high-D spaces with multiform matrices and small multiples
It lacks the conditional filtering, linked views and dynamic queries central to the academic design.
Exploring high-D spaces with multiform matrices and small multiples
No interactive features like brushing, dynamic conditioning, or linked views are present; the plot is static.
Exploring high-D spaces with multiform matrices and small multiples
No interactive features (brushing, filtering, linked views, tooltips) are present, whereas the academic design relies on dynamic conditioning and coordinated interactions
TASK48 major · 2 minor
MAJOR (48)
Multiscale Visualization of Small World Networks
Academic goal is exploratory analysis of small-world network dynamics via decomposition, whereas the notebook performs descriptive reporting on Pokémon attribute distributions.
Multiscale Visualization of Small World Networks
Paper targets exploratory multiscale analysis of small-world networks, while the notebook focuses on static graph classification metrics.
Multiscale Visualization of Small World Networks
The paper targets multiscale exploratory decomposition of small-world networks, whereas the notebook merely loads GitHub data and shows class distributions, shifting to a static reporting task.
Multiscale Visualization of Small World Networks
The paper’s goal of interactively exploring small-world decomposition is replaced by a demo of generating random adjacency matrices for a graph-neural-network toy example.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The paper’s exploratory task of comparing topological and dynamical properties of evolving networks is shifted to a static classification/reporting task focused on model performance metrics.
Multiscale Visualization of Small World Networks
The academic goal of decomposing and exploring small-world networks via interactive multiscale analysis has shifted to a simple tutorial on creating and plotting static graphs.
Multiscale Visualization of Small World Networks
The paper’s goal of multiscale exploration and understanding of small-world dynamics has shifted to a one-shot community-detection summary of a Stack-Overflow tag network.
Multiscale Visualization of Small World Networks
The paper's goal is exploratory analysis of small-world network hierarchies, whereas the notebook uses the network as a static summary of AI/ML co-authorship counts.
Multiscale Visualization of Small World Networks
The paper’s exploratory small-world network decomposition task is replaced by a static text-mining and frequency reporting task on literature titles/abstracts.
Multiscale Visualization of Small World Networks
The paper targets exploratory multiscale network analysis, whereas the notebook performs simple textual statistics on philosophy sentences, shifting the analytic purpose entirely.
Multiscale Visualization of Small World Networks
The academic design targets exploratory multiscale analysis of small-world decompositions, whereas the notebook simply illustrates a graph-classification dataset with no decomposition or small-world analytic steps.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The paper's goal is to compare topology-preserving algorithms for evolving scientific co-citation networks, whereas the notebook performs univariate descriptive analysis of a static Pokémon dataset.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The paper’s goal—comparing how MST and PFNET preserve critical paths in evolving networks—is replaced by a simple class-distribution plot, shifting from dynamic topology analysis to static label counting.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
Paper’s goal is to evaluate how well two link-reduction algorithms preserve critical paths in evolving co-citation networks, whereas the notebook performs community detection on a Stack-Overflow tag network with no temporal or comparative intent.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The paper’s goal—comparing how MST vs PFNET preserve critical paths in evolving co-citation networks—is replaced by simple term-frequency reporting on CORD-19 titles/abstracts.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The academic goal is to evaluate how MST vs PFNET preserve evolving critical paths, whereas the notebook only demonstrates basic NetworkX drawing and shortest-path queries on toy or city data, entirely dropping the evolutionary analysis task.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The analytic purpose has shifted from exploratory analysis and dynamic network visualization to static reporting and general data processing, indicating a significant task drift from the academic design's objectives.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The task drift is major because the academic design targets the comparison and analysis of evolving network topologies, whereas the repository implementation appears to focus on a static graph visualization and node classification task.
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The analytic purpose of the academic design, which is centered on the exploratory analysis and comparison of evolving networks, has shifted in the repository implementation to primarily demonstrate graph-related computations and neural network applications, indicating a major task drift.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The analytic purpose shifts from exploratory graph analysis with visual nodes to training and evaluating machine learning models on graph-structured data, indicating a significant divergence in task focus.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation focuses on exploratory data analysis and statistical summaries of a specific dataset, whereas the academic design targets graph exploration and visualization of complex relations.
Exploring high-D spaces with multiform matrices and small multiples
The analytic purpose of the repository implementation shifts from exploratory analysis of high-dimensional spaces to static visualization of a graph, deviating from the academic design's focus on identifying relationships and patterns in multivariate data.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The analytic purpose has shifted from exploratory graph analysis with visual nodes to static reporting of text data distributions and topic modeling using techniques like LDA.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The notebook serves as a static graph demonstration rather than the exploratory, image-rich analysis envisioned by the paper.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The notebook performs community detection and static visualization rather than the exploratory, image-focused analysis described in the paper.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The notebook extracts and analyses arXiv metadata for static reporting, not the exploratory graph‑exploration task emphasized in the academic design.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The notebook processes text data for reporting rather than exploratory graph navigation with visual nodes, shifting the analytic purpose.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The notebook presents a static dataset overview rather than the exploratory, image‑rich analysis the paper targets.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The notebook shifts from the paper’s exploratory graph analysis to a static demonstration of graph computations.
Edgelens: an interactive method for managing edge congestion in graphs
The academic goal of exploratory edge congestion mitigation is replaced by a machine‑learning classification workflow, shifting the analytic purpose entirely.
Edgelens: an interactive method for managing edge congestion in graphs
The academic work targets exploratory edge‑congestion mitigation, whereas the notebook focuses on static class distribution reporting, shifting the analytic purpose.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook performs data summarization of Pokemon attributes, whereas the paper targets graph navigation and edge congestion reduction.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook serves as a simple demonstration/ reporting tool, not the exploratory edge‑congestion analysis and mitigation task described in the paper.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook performs community detection and static visualization, shifting away from the paper’s edge‑congestion exploration task.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook extracts and reports arXiv co‑authorship data, shifting from the paper's exploratory edge‑congestion mitigation task to a static analytical report.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook focuses on text mining and frequency analysis, not on graph edge congestion mitigation or exploratory network navigation.
Edgelens: an interactive method for managing edge congestion in graphs
The academic work targets graph readability exploration, whereas the notebook processes text data for static analysis.
Edgelens: an interactive method for managing edge congestion in graphs
The notebook focuses on loading a dataset and training a GCN, not on mitigating edge congestion or exploratory graph navigation as in the paper.
Edgelens: an interactive method for managing edge congestion in graphs
The academic work targets interactive edge‑congestion mitigation, whereas the notebook demonstrates graph Laplacian computations, shifting the analytic purpose.
Exploring high-D spaces with multiform matrices and small multiples
The academic work focuses on exploratory high‑dimensional analysis, whereas the notebook implements a graph neural network training pipeline for classification, shifting the purpose entirely.
Exploring high-D spaces with multiform matrices and small multiples
The paper targets exploratory high‑dimensional analysis, while the notebook only reports class distribution, shifting the analytic purpose dramatically.
Exploring high-D spaces with multiform matrices and small multiples
The academic goal of high‑dimensional exploratory analysis is shifted to basic descriptive reporting on a single dataset.
Exploring high-D spaces with multiform matrices and small multiples
The academic work targets exploratory high‑dimensional analysis of cancer data, while the notebook extracts AI/ML paper metadata for a static co‑author network, shifting the analytic purpose entirely.
Exploring high-D spaces with multiform matrices and small multiples
Paper targets high‑dimensional exploratory analysis, while the notebook focuses on community detection in a tag network for static reporting.
Exploring high-D spaces with multiform matrices and small multiples
The notebook focuses on word‑frequency reporting, not the high‑dimensional exploratory analysis the academic design targets.
Exploring high-D spaces with multiform matrices and small multiples
The notebook performs static text analytics rather than the high‑dimensional exploratory analysis described in the paper.
Exploring high-D spaces with multiform matrices and small multiples
The notebook uses the graph for a classification demo rather than the exploratory, high‑dimensional analysis the paper describes.
Exploring high-D spaces with multiform matrices and small multiples
The notebook illustrates generic graph drawing rather than the paper's high‑dimensional exploratory analysis and variable ranking task
MINOR (2)
Visualizing evolving networks: minimum spanning trees versus pathfinder networks
The analytic purpose has shifted slightly from exploratory analysis of evolving networks to static reporting of co-citation networks, but still targets comparison and distribution of network structures.
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
The repository implementation appears to be focused on data loading, preprocessing, and basic visualization, with a slightly different analytic purpose compared to the exploratory graph analysis in the academic design.

Academic Sources

Repository Implementations