Nishi Family › Compare › Nishi Atlas Forest vs the Award-Winning Graph-Visualization Field

Nishi Compare · measured, not asserted

Nishi Atlas Forest vs the Award-Winning Graph-Visualization Field

Nishi vs the field — every Nishi cell is measured against real organ source at emit time; each gap names the watch contract that will close it.

HONEST INTAKE AFTER AN OPERATOR JUNK VERDICT (2026-07-16): our whole-forest render is a static 8000px banner -- every organ + edge drawn, but unusable next to Gephi/Cytoscape/Graphistry-class interactive multilevel viewers. This matrix is the organ-graded gap list that drives the rebuild.

Overview

The purpose, declared position and evidence coverage of this domain. Source presence and completed acceptance are different measures.

Where we are. The whole forest renders bits-up in 5 s -- all 16,222 nodes and 42,088 edges -- with per-organ lineage drill-down, a layered generational layout, additive edge density, centrality-coupled sizing, a zero-JS walkable per-node atlas (exceed) and a zero-dependency pipeline (exceed). But it is ONE static 8000px banner: no force-directed layout, no edge bundling, no multilevel aggregation, no interaction, no community coloring, no readability self-grading, no GPU ceiling -- the junk verdict was right about usability and this board is its build order.

Where we need to go. A graph surface someone can actually read: communities colored by meaning, bundled edges instead of overdraw, super-nodes that expand on demand, pan-zoom-hover-search over the same data, a force layout where structure emerges -- and a critic that GRADES every render before it ships, because the process bug was a render nobody judged.

The unit. 1 u = one measured session-leg (estate calibration: graphics R21 in one leg 2026-08-15). Local evidence: the whole-forest raster (graph to pixels to PNG) landed in one leg; estimates are relative to that.
Where we are: 7 open rungs. Data and raster pipeline present; every usability primitive absent. Counts measured at emit below this line.
Cost to a judged render: 1 u. GV1 the readability critic (crossings, overlap, occlusion) -- first, so every later rung has a referee, per the law that a render nobody graded is the process bug.
Cost to a readable overview: 5.5 u. GV2 community detection, GV3 multilevel aggregation with semantic zoom, GV4 hierarchical edge bundling -- graded by GV1 before and after.
Cost to interaction and scale: 6 u. GV5 force-directed layout, GV6 the interactive viewer, GV7 tiled rendering toward the 100k ceiling.

Research bar. Gephi is measured on ForceAtlas2 and OpenOrd layouts, modularity coloring, analytics-driven sizing. Theirs: the award-winning interactive reference. Ours: GV2 GV5 GV6 measured on this page.

Research bar. Holten 2006 is measured on hierarchical edge bundling. Theirs: the clutter cure. Ours: GV4.

Research bar. Graphistry is measured on GPU density shading at millions of edges. Theirs: the scale ceiling. Ours: GV7.

Latest recorded release

No valid dated release entry is recorded for this domain.

Release entries describe recorded changes; they do not establish that every capability passed evaluation.

9 of 16 capabilities measured|2 of them measured exceeds|7 open|coverage 562/1000|adoption 5 full / 4 partial

Evidence profile — what the gaps on this board actually are

Measured by nx_swcompare_evidence, read back by nx_evprofile_lib. Every figure is a count with its denominator — there is deliberately no score, no grade and no percentage anywhere in this band, because a stored scalar is a field a seat can edit and a counted partition is not.

evidence|grounded 9/9|unsupported 0|gates green 1/1|proven able to fail 1/1|never bitten 0|green at 0/0 0|open gaps 7|of them unnamed 0|of them proof withheld 0|flips ready 0

proven able to fail counts the gates that have a RECORDED RED — nx_gate_bite mutated the gate subject, rebuilt it, watched the gate go red, and that record is inside the shared TTL. never bitten is its complement over the same denominator: those gates ran and were green, and nothing has ever shown them able to detect anything, so their green is a statement about this run and not about the gate. green at 0/0 is a separate and much weaker observation — the gate printed GREEN on a zero denominator, so its own tooth counter says it examined nothing. A gate can be green, non-zero, and still never bitten; that is the common case and it is now visible instead of implied.

partition: grounded + unsupported = 9 vs present 9 · named + unnamed + withheld = 7 vs open 7 · both reconcile

liar-kill conj=GPQN · all four conjuncts held

graded document: BUILDROOT tree, 4374 bytes · gates map: PRIMARY · stamped 2d 18h ago · source ../knowledge/status/evstamp_graphviz.verdict

Gap classWhat it is, and the work it names
NONENo gap class fires on this board: every published claim is grounded, the declared gates ran and were green, no watch contract is unnamed or already landed, and the stamp is inside its TTL. That is a statement about evidence, not about depth, scale or polish.
This band reports the referee counts. The per-axis worklist rows — which axis is unsupported, which watch is ready to flip, which gap is unnamed — are printed by nx_swcompare_evidence graphviz itself and are not carried on the stamp, so this page names the classes and the producer names the rows. That split is stated rather than hidden: a count without a worklist is not actionable, and this band is honest about which half of that it is.

Production map

Follow the dependencies, declared acceptance criteria and recorded priorities. Inspect source binding before treating a rank as executable work.

Ranking source binding: PLAN_MATRIX_BOUND_ONLY. Recorded priorities require current acceptance evidence and resource checks before execution.

Ranking matches the captured plan and matrix only. Latest execution outcome, research freshness, accepted delivery and investment return are unverified.

Recorded priority estimates

Order from nx_compare_rank (nx_dr_ocm: (deficit + cost-of-delay + option + enables) x sponsor x self-sufficiency x momentum / cost). FINISH rows are rungs whose symbol is present but whose organ is short of full adoption: listed before new work by this heuristic. Priority is not measured delivery cost or execution readiness. Stamp: # asof=1789541503 domain=graphviz target_version=0.1 rungs=10 done=2 open=8 finish=0 ranker=nx_dr_ocm

#StageRungPriorityDerivation
#10.1Readability critic (GV1) gvc_readability_score2000v=10 m=2 c=10
#2laterCommunity detection (GV2) gc_louvain1066v=8 m=2 c=15
#3laterMultilevel aggregation and semantic zoom (GV3) gm_cluster_level800v=16 m=1 c=20
#4laterTiled rendering toward 100k (GV7) ggpu_tile_render700v=7 m=2 c=20
#5laterForce-directed layout (GV5) gf_forceatlas2600v=6 m=2 c=20
#6laterInteractive viewer (GV6) gvw_pan_zoom500v=10 m=1 c=20
#7laterHierarchical edge bundling (GV4) gb_bundle_edges300v=6 m=1 c=20
#8laterLayered generational layout (GX1) barycenter0v=0 m=2 c=100

Declared roadmap — contract, acceptance, executor, effort

RungCloses withDefinition of done (pre-declared)ExecutorEst.
Whole-forest raster (GX0)write_png16k nodes and 42k edges to PNG in 5 s, zero third-party -- LANDEDOrgan0 u
Layered generational layout (GX1)
after GX0		barycenterOne-pass barycenter Sugiyama -- LANDED, crossing quality behind dotOrgan0 u
Centrality sizing (GX2)eg_caCa-coupled node sizing -- LANDEDOrgan0 u
Readability critic (GV1)
after GX0		gvc_readability_scoreEdge crossings, node overlap and label occlusion counted on the emitted layout, published as a score with its partition; gate proves a planted overlapping pair raises the overlap count and a crossing-free fixture scores zero crossings -- no render ships without its scoreOrgan1 u
Community detection (GV2)
after GX0		gc_louvainModularity-based communities over the edge list (Louvain-class) with deterministic tie-break, colors assigned per community; gate proves two disconnected cliques land in two communities and modularity exceeds the random-partition controlOrgan1.5 u
Multilevel aggregation and semantic zoom (GV3)
after GV2		gm_cluster_levelCommunities collapsed to super-nodes at the overview level, expanded on demand per level; gate proves the super-node edge weights SUM to the underlying edge counts and a level-0 expand returns every memberOrgan2 u
Hierarchical edge bundling (GV4)
after GV3,GV1		gb_bundle_edgesEdges routed along the community and generation hierarchy as splines; gate proves GV1's crossing and overlap score improves over the straight-edge render of the same graph and a single-edge graph is unchangedOrgan2 u
Force-directed layout (GV5)
after GX0		gf_forceatlas2ForceAtlas2-class layout with Barnes-Hut repulsion, deterministic integer arithmetic, bounded iterations announced; gate proves a barbell graph separates into two lobes and the layout is bit-identical across two runsOrgan2 u
Interactive viewer (GV6)
after GV3		gvw_pan_zoomPan, zoom, hover and search over the emitted layout in the sovereign page, overview-first with details on demand, zero third-party; gate proves a search for an organ name centers its node and hover surfaces its cardOrgan2 u
Tiled rendering toward 100k (GV7)
after GX0		ggpu_tile_renderThe raster split into tiles rendered independently (CPU today, the GPU delivery cable tomorrow) with a stitched result byte-identical to the single-pass render; gate proves tile-stitched equals whole at the current 16k and reports time per tileOrgan2 u

Milestones

MilestoneRungsCumulative
M1 · JudgedGV11 u
M2 · Readable overviewGV2,GV3,GV46.5 u
M3 · Interactive and scalableGV5,GV6,GV712.5 u
Ladder verdict. NOT DECLARED. This board names no dated best-in-class or frontier target and no rung roles (sotatarget and rungrole rows on its plan); the ranker labels it NO-LADDER until it does, and until then its rungs climb toward a target nobody has written down. Bars: 0 (fresh 0, attested 0, stale 0, unattested 0), verdict NO-BAR against the current month 2026-09.

Inspect a rung and its prerequisites

Declared nodes 10. Rank input binding: PLAN_MATRIX_BOUND_ONLY. Dependency order is authored. Implementation, acceptance evidence, authority and resource readiness are unverified. No action is recommended or dispatched here.

Plan SHA-256 8418a5300b84d7ca18497552b316c5fa5eea6d43d1fbafd059613946ee3af9fa. Target rows 0; role rows 0. Existing risks and release worklog retain their own scope; no node completion is inferred.

Use Enter or Space on a rung to inspect its contract. Prerequisite links locate another rung in this list; open its summary to inspect it. Estimates are authored effort, not forecasts.

  1. GX0 — Whole-forest raster

    Prerequisites: None declared; this does not establish execution eligibility.

    Contract: write_png

    Acceptance: 16k nodes and 42k edges to PNG in 5 s, zero third-party -- LANDED

    Authored effort: 0. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  2. GX1 — Layered generational layout

    Prerequisites: GX0 (acceptance unverified)

    Contract: barycenter

    Acceptance: One-pass barycenter Sugiyama -- LANDED, crossing quality behind dot

    Authored effort: 0. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  3. GX2 — Centrality sizing

    Prerequisites: None declared; this does not establish execution eligibility.

    Contract: eg_ca

    Acceptance: Ca-coupled node sizing -- LANDED

    Authored effort: 0. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  4. GV1 — Readability critic

    Prerequisites: GX0 (acceptance unverified)

    Contract: gvc_readability_score

    Acceptance: Edge crossings, node overlap and label occlusion counted on the emitted layout, published as a score with its partition; gate proves a planted overlapping pair raises the overlap count and a crossing-free fixture scores zero crossings -- no render ships without its score

    Authored effort: 1. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  5. GV2 — Community detection

    Prerequisites: GX0 (acceptance unverified)

    Contract: gc_louvain

    Acceptance: Modularity-based communities over the edge list (Louvain-class) with deterministic tie-break, colors assigned per community; gate proves two disconnected cliques land in two communities and modularity exceeds the random-partition control

    Authored effort: 1.5. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  6. GV3 — Multilevel aggregation and semantic zoom

    Prerequisites: GV2 (acceptance unverified)

    Contract: gm_cluster_level

    Acceptance: Communities collapsed to super-nodes at the overview level, expanded on demand per level; gate proves the super-node edge weights SUM to the underlying edge counts and a level-0 expand returns every member

    Authored effort: 2. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  7. GV4 — Hierarchical edge bundling

    Prerequisites: GV3 (acceptance unverified), GV1 (acceptance unverified)

    Contract: gb_bundle_edges

    Acceptance: Edges routed along the community and generation hierarchy as splines; gate proves GV1's crossing and overlap score improves over the straight-edge render of the same graph and a single-edge graph is unchanged

    Authored effort: 2. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  8. GV5 — Force-directed layout

    Prerequisites: GX0 (acceptance unverified)

    Contract: gf_forceatlas2

    Acceptance: ForceAtlas2-class layout with Barnes-Hut repulsion, deterministic integer arithmetic, bounded iterations announced; gate proves a barbell graph separates into two lobes and the layout is bit-identical across two runs

    Authored effort: 2. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  9. GV6 — Interactive viewer

    Prerequisites: GV3 (acceptance unverified)

    Contract: gvw_pan_zoom

    Acceptance: Pan, zoom, hover and search over the emitted layout in the sovereign page, overview-first with details on demand, zero third-party; gate proves a search for an organ name centers its node and hover surfaces its card

    Authored effort: 2. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

  10. GV7 — Tiled rendering toward 100k

    Prerequisites: GX0 (acceptance unverified)

    Contract: ggpu_tile_render

    Acceptance: The raster split into tiles rendered independently (CPU today, the GPU delivery cable tomorrow) with a stitched result byte-identical to the single-pass render; gate proves tile-stitched equals whole at the current 16k and reports time per tile

    Authored effort: 2. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.

Learning and practice paths

No structured learning path is declared for this plan. Existing research, roadmap and worklog remain available above.

Capability comparisons

Compare the field, search individual capabilities and open their source and adoption evidence. Documented presence does not establish comparative quality.

Position map — centrality and distinctiveness

The four-quadrant map the field uses for brand strategy (Dawar and Bagga, HBR June 2015), re-derived from this matrix on every publish. Centrality is the share of the category's feature mass a player covers, each feature weighted by how many hold it; distinctiveness is the average lead over each rival on the rows the player holds; breadth is the depth-weighted share of the whole matrix (the bubble); depth is how deeply the rows held are held; momentum is the day-over-day move off the spine (green rising, red falling, grey until day two); the dashed path runs first day → previous day → today. Dividers are the category means. Axes are fitted to the field of play, so read the tick numerals, not the frame. Rival marks are documented presence, so a rival's position reads the record, never its quality. The picture grades its own readability below; the table beside it is the same data for a screen reader or a second method.

Views. 2D cut: centrality, distinctiveness · 3D cube: centrality, distinctiveness, breadth · axes registered: centrality, distinctiveness, breadth, depth, momentum · a board picks its own in knowledge/compare/graphviz.cdmap (cut|x|y, cube|x|y|z); absent = the HBR defaults
Position map, two-dimensional cutOne bubble per player. Bubble area is breadth, the ring colour is momentum, the dashed lines are the category means, and both axes are fitted to the field of play with their tick numerals shown. Every value is repeated in the table that follows. 500 600 700 800 900 1000 100 150 200 250 300 350 centrality (permil, fitted 500–1000) distinctiveness (permil, fitted 100–350) mean 758 mean 266 Unconventional Aspirational Peripheral Mainstream Nishi, centrality 603, distinctiveness 314, breadth 416, depth 740, momentum 0 Gephi, centrality 924, distinctiveness 307, breadth 625, depth 769, momentum 0 Graphviz, centrality 547, distinctiveness 142, breadth 270, depth 619, momentum 0 Cytoscape, centrality 867, distinctiveness 250, breadth 541, depth 722, momentum 0 Graphistry, centrality 849, distinctiveness 319, breadth 583, depth 777, momentum 0 Nishi Gephi Graphviz Cytoscape Graphistry

bubble area = breadth · ring = momentum (green rising, red falling, grey until day two) · dashed = category means · axes fitted to the field of play: centrality 500–1000, distinctiveness 100–350 of 0–1000 permil (the full range put every player in one corner)
readability of the 2D cut, self-graded by the layout ruler: label overlaps 0 · labels over marks 0 · off-canvas 0 · unresolved labels 0 · mark overlaps 0 (a fact of the data: two players that close are that close) · data spread 729 permil of the plot · quadrant words unseated 0
text contrast, measured with wcag2-ratio (floors from contrast.conf), light theme: labels 16.24 (floor 4.50) · notes 16.24 (floor 4.50) · quadrant words 5.89 (floor 4.50) · tick numerals 5.89 (floor 4.50) · axis titles 5.59 (floor 4.50) · dark theme: labels 13.78 (floor 4.50) · quadrant words 5.55 (floor 4.50) · axis titles 5.97 (floor 4.50) · dark classes under their floor 0 (one figure serves both themes: a dark shortfall is a token to fix, never a class to hide) · classes refused under their floor 0 (a refused class is not drawn; the scale classes are measured, never hidden) · export: SVG PNG (receipt, rendered by the estate's own rasteriser from this page)
Position map, three-dimensional cubeThe same players in an isometric cube. Each axis is fitted to its own field of play and carries numerals on the floor grid and the vertical axis; each bubble drops a dotted line to its floor shadow so height reads as height. Values are in the table that follows. 500 600 700 800 900 1000 100 150 200 250 300 350 200 300 400 500 600 700 centrality distinctiveness breadth Graphviz: centrality 547, distinctiveness 142, breadth 270 Nishi: centrality 603, distinctiveness 314, breadth 416 Cytoscape: centrality 867, distinctiveness 250, breadth 541 Graphistry: centrality 849, distinctiveness 319, breadth 583 Gephi: centrality 924, distinctiveness 307, breadth 625 Nishi Gephi Graphviz Cytoscape Graphistry
axes fitted: centrality 500–1000 · distinctiveness 100–350 · breadth 200–700 permil · farther bubbles are painted first, nearer ones over them · the floor shadow is each bubble's (x, y) at height 0
readability of the 3D cube, self-graded by the layout ruler: label overlaps 0 · labels over marks 0 · off-canvas 0 · unresolved labels 0 · mark overlaps 0 (a fact of the data: two players that close are that close) · data spread 223 permil of the plot
Position map, small multiplesEvery pair of registered axes as one small cut. Each panel fits both axes to the field of play, the dashed lines are the category means, bubble area is breadth and the ring colour is momentum; the legend below names the colours. 500 1000 100 350 distinctiveness vs centrality Nishi: centrality 603, distinctiveness 314 Gephi: centrality 924, distinctiveness 307 Graphviz: centrality 547, distinctiveness 142 Cytoscape: centrality 867, distinctiveness 250 Graphistry: centrality 849, distinctiveness 319 500 1000 200 700 breadth vs centrality Nishi: centrality 603, breadth 416 Gephi: centrality 924, breadth 625 Graphviz: centrality 547, breadth 270 Cytoscape: centrality 867, breadth 541 Graphistry: centrality 849, breadth 583 500 1000 550 800 depth vs centrality Nishi: centrality 603, depth 740 Gephi: centrality 924, depth 769 Graphviz: centrality 547, depth 619 Cytoscape: centrality 867, depth 722 Graphistry: centrality 849, depth 777 500 1000 480 520 momentum vs centrality Nishi: centrality 603, momentum 500 Gephi: centrality 924, momentum 500 Graphviz: centrality 547, momentum 500 Cytoscape: centrality 867, momentum 500 Graphistry: centrality 849, momentum 500 100 350 200 700 breadth vs distinctiveness Nishi: distinctiveness 314, breadth 416 Gephi: distinctiveness 307, breadth 625 Graphviz: distinctiveness 142, breadth 270 Cytoscape: distinctiveness 250, breadth 541 Graphistry: distinctiveness 319, breadth 583 100 350 550 800 depth vs distinctiveness Nishi: distinctiveness 314, depth 740 Gephi: distinctiveness 307, depth 769 Graphviz: distinctiveness 142, depth 619 Cytoscape: distinctiveness 250, depth 722 Graphistry: distinctiveness 319, depth 777 100 350 480 520 momentum vs distinctiveness Nishi: distinctiveness 314, momentum 500 Gephi: distinctiveness 307, momentum 500 Graphviz: distinctiveness 142, momentum 500 Cytoscape: distinctiveness 250, momentum 500 Graphistry: distinctiveness 319, momentum 500 200 700 550 800 depth vs breadth Nishi: breadth 416, depth 740 Gephi: breadth 625, depth 769 Graphviz: breadth 270, depth 619 Cytoscape: breadth 541, depth 722 Graphistry: breadth 583, depth 777 200 700 480 520 momentum vs breadth Nishi: breadth 416, momentum 500 Gephi: breadth 625, momentum 500 Graphviz: breadth 270, momentum 500 Cytoscape: breadth 541, momentum 500 Graphistry: breadth 583, momentum 500 550 800 480 520 momentum vs depth Nishi: depth 740, momentum 500 Gephi: depth 769, momentum 500 Graphviz: depth 619, momentum 500 Cytoscape: depth 722, momentum 500 Graphistry: depth 777, momentum 500
Nishi Gephi Graphviz Cytoscape Graphistry
10 panels over 5 registered axes, every pair once (the lower axis on x, the higher on y) · each panel fitted to its own field of play, first and last tick numerals shown · no labels in a small cut, the legend names the colours; the grade below reports the mark terms only (MM summed over the panels, spread averaged)
readability of the small multiples, self-graded by the layout ruler: label overlaps 0 · labels over marks 0 · off-canvas 0 · unresolved labels 0 · mark overlaps 4 (a fact of the data: two players that close are that close) · data spread 560 permil of the plot
PlayerQuadrantcentralitydistinctivenessbreadthdepthmomentumRows heldDays on spineFirst seen
NishiUnconventional6033144167400 since 2026-09-15922026-09-15
GephiAspirational9243076257690 since 2026-09-151322026-09-15
GraphvizPeripheral5471422706190 since 2026-09-15722026-09-15
CytoscapeMainstream8672505417220 since 2026-09-151222026-09-15
GraphistryAspirational8493195837770 since 2026-09-151222026-09-15
DayMatrix rows reviewedPlayers recorded
2026-09-15165
2026-09-16165

players 5|matrix rows 16|feature mass 53|centrality mean 758|distinctiveness mean 266|axes 5|spine days 2 (shown 2)|rows written today 0|readability defects 2D 0 cube 0|spine knowledge/status/cdmap/graphviz.spine

How this is scored. Every Nishi mark is measured: the generator reads the real organ source on disk and requires the implementing symbol to exist (no self-grading). A watching tag names the organ and symbol contracted to close a gap — the mark flips itself on the next compare beat when that workstream ships, and the comparewatch- plane row flips with it. A dark tag means the organ file EXISTS but does not declare the contracted symbol: something shipped there under another name, and until the contract is repointed to the real entry point (the plan rung and this row) or the function is renamed, that capability is invisible to this board — a build lost to darkness, named so it is not. The flip is necessary, not sufficient: it proves the symbol exists, never that the capability is good. The bar is the rung's pre-declared done-rule, proven by its gate — a symbol shipped without the behaviour behind it is a defect, and the flip is exactly what makes that defect visible instead of quiet. Competitor marks record documented capability presence — presence, not depth or scale. Adoption is measured too: every measured row carries where its organ stands on the estate's ladder (source → built → promoted → registered → invoked; libraries by importer reach minus validation importers; gates by the execution surfaces that run them). A row is fully adopted only at the top of its ladder; anything short is tagged partial with the exact remedy, so a build nobody promoted can no longer read as shipped. Census stamps: importers asof 1789497476, gate census asof 1789498715 (unix seconds; -1 = census absent).

Capability matrix — measured against source

◉ leads / measured exceed● present◐ partial○ absent · click any capability for its evidence

CapabilityNishiGephiGraphvizCytoscapeGraphistry
Full-graph static raster (16k in one frame)Measured: main exists in runtime/_hdl_build/nx_eco_graph_forest.nx, verified at emit. We render all 16,222 nodes/42,088 edges in 5s bits-up -- but as ONE static banner; the field renders AND lets you explore. Parity in kind only. rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: PROMOTED-UNREGISTERED — PARTIAL: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked).
not adopted: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
Pros Nishi has it, measured on diskCons not adopted yet: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
●●●●●
Per-organ lineage drill-downMeasured: main exists in runtime/_hdl_build/nx_eco_graph_png.nx, verified at emit. Cytoscape's subnetwork views are Best [cytoscape]; our per-seed lineage PNG via one MCP call is real but static Adoption: REGISTERED-DARK — PARTIAL: callable, authorised, completed MCP invocation not established by supplied journal window; lifetime history unknown (direct execution may be recorded elsewhere; this scan does not establish lifetime use); no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked).
not adopted: callable, authorised, completed MCP invocation not established by supplied journal window; lifetime history unknown (direct execution may be recorded elsewhere; this scan does not establish lifetime use); no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
Pros Nishi has it, measured on diskCons behind Cytoscape (leads); not adopted yet: callable, authorised, completed MCP invocation not established by supplied journal window; lifetime history unknown (direct execution may be recorded elsewhere; this scan does not establish lifetime use); no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
●●●◉●
Layered generational layoutMeasured: main exists in runtime/_hdl_build/nx_eco_graph_forest.nx, verified at emit. Graphviz dot IS the Sugiyama reference (4-phase, rank+order+position+splines) [gansner93] [graphviz-dot]; ours is 1-pass barycenter -- crossing quality far behind Adoption: PROMOTED-UNREGISTERED — PARTIAL: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked).
not adopted: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
Pros Nishi has it, measured on disk; ahead of GraphistryCons behind Graphviz (leads); not adopted yet: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
●●◉●○
Additive edge-density renderingMeasured: r2_px_add exists in runtime/nx_raster2d_lib.nx, verified at emit. Graphistry's GPU density shading is Best; our clamp-add is the same idea at CPU scale rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: LIB-WIRED importers=1 nonval=1 — fully adopted (top of its ladder).
Pros Nishi has it, measured on disk; ahead of Graphviz, Cytoscape; fully adopted on the estate ladderCons behind Graphistry (leads)
●●○○◉
Centrality-coupled node sizingMeasured: eg_ca exists in runtime/nx_eco_graph.nx, verified at emit. Gephi's analytics-driven sizing/ranking is Best [gephi09]; our Ca sizing is real but one metric Adoption: LIB-WIRED importers=37 nonval=30 — fully adopted (top of its ladder).
Pros Nishi has it, measured on disk; ahead of Graphviz; fully adopted on the estate ladderCons behind Gephi (leads)
●◉○●●
Walkable per-node web atlas (zero-JS)Measured exceed: main in runtime/_hdl_build/nx_eco_graph_wiki.nx, verified at emit. No competitor ships a zero-JS server-generated walkable atlas of ITS OWN codebase -- sovereign self-documentation exceed Adoption: PROMOTED-UNREGISTERED — PARTIAL: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked).
not adopted: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
Pros Nishi leads, a measured exceed; ahead of Gephi, Graphviz, Cytoscape, GraphistryCons not adopted yet: a real binary nobody can call over MCP: /api/tools/register it; no execution surface runs it either (clock, cron, daemon, roster, actlog and surfaced forks checked)
◉○○○○
Zero-dependency sovereign pipelineMeasured exceed: write_png in runtime/nx_png.nx, verified at emit. Gephi=Java+OpenGL, Cytoscape=Java, Graphistry=GPU cloud; ours is graph->pixels->PNG with zero third-party -- the sovereignty exceed Adoption: LIB-WIRED importers=185 nonval=46 — fully adopted (top of its ladder).
Pros Nishi leads, a measured exceed; ahead of Gephi, Graphviz, Cytoscape, Graphistry; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)
◉○○○○
Force-directed layout (ForceAtlas2/OpenOrd)Open — watching runtime/nx_graph_force.nx : gf_forceatlas2, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. Gephi's ForceAtlas2/OpenOrd are THE award-winning organic layouts [forceatlas2-14]; we have none -- structure emerges from communities, not assigned bands
watching gf_forceatlas2
Pros none measured yetCons behind Gephi (leads), Graphviz, Cytoscape, Graphistry; open contract, nothing on disk yet
○◉●●●
Hierarchical edge bundling (Holten-class)Open — watching runtime/nx_graph_bundle.nx : gb_bundle_edges, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. The InfoVis-award clutter cure (bundle edges along hierarchy splines) [holten06]; our additive overdraw is NOT bundling -- the junk verdict's core
watching gb_bundle_edges
Pros none measured yetCons behind Gephi, Cytoscape, Graphistry; open contract, nothing on disk yet
○●○◐●
Multilevel aggregation + semantic zoomOpen — watching runtime/nx_graph_multilevel.nx : gm_cluster_level, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. THE usability keystone at 16k+: cluster to super-nodes, expand on demand; nobody reads 16k nodes in one static frame -- our render proves it rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them
watching gm_cluster_level
Pros none measured yetCons behind Gephi, Graphviz, Cytoscape (leads), Graphistry (leads); open contract, nothing on disk yet
○●◐◉◉
Interactive pan/zoom/hover/searchOpen — watching runtime/nx_graph_viewer.nx : gvw_pan_zoom, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. Usability = interaction (overview first, zoom+filter, details on demand -- Shneiderman) [shneiderman96]; a static PNG cannot answer ANY question about a specific organ
watching gvw_pan_zoom
Pros none measured yetCons behind Gephi (leads), Cytoscape (leads), Graphistry (leads); open contract, nothing on disk yet
○◉○◉◉
Community detection coloringOpen — watching runtime/nx_graph_community.nx : gc_louvain, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. Gephi modularity coloring is the iconic award-winning look [louvain08]; color = meaning, ours has none
watching gc_louvain
Pros none measured yetCons behind Gephi (leads), Cytoscape, Graphistry; open contract, nothing on disk yet
○◉○●●
Readability self-grading (crossings/overlap)Open — watching runtime/nx_graphviz_critic.nx : gvc_readability_score, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. The field evaluates layouts by metrics (crossings, node overlap, label occlusion); we shipped a render NO judge graded -- the process bug this row indicts rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them
watching gvc_readability_score
Pros none measured yetCons behind Graphviz, Cytoscape; open contract, nothing on disk yet
○○◐◐○
GPU large-scale rendering (100k+)Open — watching runtime/nx_graph_gpu.nx : ggpu_tile_render, re-measured on every compare beat. Ship that symbol and this mark flips itself; the comparewatch- plane row flips with it. Graphistry is Best (GPU, millions) [graphistry]; we are CPU 16k -- fine today, names the ceiling
watching ggpu_tile_render
Pros none measured yetCons behind Gephi, Graphistry (leads); open contract, nothing on disk yet
○◐○○◉
Whole-graph statistics (fan-in/fan-out coupling, hub concentration)Measured: eg_coupling_stats exists in runtime/nx_eco_graph.nx, verified at emit. Gephi's statistics panel and Cytoscape's NetworkAnalyzer are Best (whole-graph degree, centrality and modularity); ours computes Ca fan-in, Ce fan-out and hub concentration over all 16,222 organs in one pass -- real, and narrower than either rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: LIB-WIRED importers=37 nonval=30 — fully adopted (top of its ladder).
Pros Nishi has it, measured on disk; ahead of Graphviz; fully adopted on the estate ladderCons behind Gephi (leads), Cytoscape (leads)
●◉○◉●
Node labels drawn into the render (in-house bitmap font)Measured: r2_name exists in runtime/nx_raster2d_lib.nx, verified at emit. Every tool in this field labels nodes; ours draws each organ's name straight into the framebuffer from an in-house 5x7 bitmap font, with no text-shaping engine and no font file on disk -- parity in kind at our scale rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: LIB-WIRED importers=1 nonval=1 — fully adopted (top of its ladder).
Pros Nishi has it, measured on disk; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)
●●●●●
Rival-claim provenance. Every Yes, Best or Part mark in a rival column is a claim about someone else's product. rows with rival marks 14 · cited 8 · uncited 6. A cited row carries a reference mark that resolves to a pinned mirror (the refs gate measures that); an uncited row is an observation read and is badged in its evidence until a reference lands. The badge is the receipt, never the proof: a mark proves a mirror exists, not that the mirror supports the code.

Delivery and evidence

Inspect risks, technical debt, rendered observations, experiments and references. Read scope and limitations alongside every result.

Risk register

RiskLikelihood x impactMitigation
A layout change shipped without the critic repeats the junk verdict with a different picturecertain x highGV1 ranks first by declaration and every later rung's done-rule cites its score.
Force layouts with float physics are non-deterministic across runspossible x mediumGV5 done-rule is bit-identity across runs under the integer doctrine.
On these two registers. Rows are declared in the domain's plan file and carry the debt id, which is the join key back to the sovereign debt plane — that plane, not this page, is the authority on state. Reconciling them automatically (the regen reading the plane and refreshing these rows) is a named, owed rung; until it lands, treat an id here as a pointer to look up, not a status to trust.
Honest verdict. The coverage above is capability presence measured against source — not depth, scale, or polish, where mature rivals may lead. Exceeds are claimed only where a mechanism backs them. Every open gap is a watch contract: it names the organ and symbol that closes it, and this page flips the cell itself when that workstream ships.

Person · product · place — not yet measured for this domain

Every compare carries this layer. Declare knowledge/compare/graphviz.ppp (rows surface|nishi or c1..c4|label|url|connect naming OUR live surface and each rival's front door), run nx_ppp_probe domain graphviz, and this section fills itself on the next beat: the same ruler on both sides — privacy and CX (third-party hosts, tracker classes, cookies, security headers), design and longevity (design hygiene, computed WCAG contrast, render-blocking resources, unsized media, script weight, theme and motion queries), findability (landmarks, skip link, on-site search, breadcrumb, headings, internal links).

The field — discovered, not chosen

Rows written by nx_field_discover from graphviz.seeds: the industry's own lists (Wikipedia wikitext, GitHub topics, awesome lists) read mechanically, every candidate counted across seeds. The matrix columns above are a SEAT'S pick; this band is the population they were picked from, and the stats line measures one against the other. A rival here is a lead, never a verdict — it earns a column when its capabilities are read and pinned.

field|seeds=3|scanned=2|fetched=2|reused=0|failed=1|named=3|candidates=3|mentions=3|capped=0 rival|Graphviz|1|1|col1-graphviz|https://graphviz.org/docs/layouts/dot/|named rival|Cytoscape|1|1|col2-cytoscape|https://cytoscape.org/|named rival|Graphistry|1|1|col3-graphistry|https://www.graphistry.com/|named
RankRivalSeedsMentionsFirst seedKindLink
1Graphviz11col1-graphviznamedhttps://graphviz.org/docs/layouts/dot/
2Cytoscape11col2-cytoscapenamedhttps://cytoscape.org/
3Graphistry11col3-graphistrynamedhttps://www.graphistry.com/

field candidates 3|shown 3 of 3|matrix columns in the field 3 of 4|discovered rivals with no column 0|malformed rows 0 (counted, never rendered)|read-capped 0

Gaps from the record — what the estate does that no board carries

The record census (nx_goalmap record) reads the invoked-tool population and every plan queue row and files each organ or directive that NO matrix, plan or gates row names. A row here is a callout the boards missed: adjudicate it onto a board or declare it infrastructure. Census state BLIND (age 74318 s), sources read 4 of 7 declared — a BLIND census is a FLOOR: unread sources can only add rows.

kindnameboardsourceevidence

rows shown 0|this board's directives 0|estate-wide un-boarded organs 492 (listed in full on /compare/ecosystem)|census rows 611|malformed 0 (counted, never rendered)

References

Beyond a link list. Every reference below resolves twice — the publisher's copy and, where banked, the estate's own non-rottable library mirror with a content pin — and carries its evidence class plus the exact claim on this page it grounds. Keyed marks like [key] in the matrix notes jump here. A dash means honestly absent, never assumed.
  1. [gephi09] Bastian, Heymann, Jacomy. Gephi: An Open Source Software for Exploring and Manipulating Networks. Proceedings of the International AAAI Conference on Web and Social Media (ICWSM) 3(1), 2009. publisher · read in our library knowledge/fetched/cmp_graphviz_gephi09.html · pin h624e45fea2ef370abd9ec8b807a4b479bb4fe12119a192aabf62ff0ea467cf00 · accessed 2026-08-18 · published-paperGrounds: The Gephi column: "Interactive pan/zoom/hover/search" and "Centrality-coupled node sizing" (Gephi's analytics-driven sizing/ranking is Best) -- the paper states the real-time interactive exploration, filtering and clustering architecture the column codes read from.
  2. [forceatlas2-14] Jacomy, Venturini, Heymann, Bastian. ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software. PLOS ONE 9(6), 2014. publisher · read in our library knowledge/fetched/cmp_graphviz_forceatlas2-14.html · pin he34a0e89d77fd06f4d1c2d610907996f4f27c9939a54ea5915c5fb6d417f61c2 · accessed 2026-08-18 · published-paperGrounds: "Force-directed layout (ForceAtlas2/OpenOrd)" -- the row names ForceAtlas2 as THE award-winning organic layout; this is its published definition (nodes repel, edges attract, continuous layout), the algorithm nx_graph_force is _ABSENT_ against.
  3. [gansner93] Gansner, Koutsofios, North, Vo. A Technique for Drawing Directed Graphs. IEEE Transactions on Software Engineering 19(3):214-230, 1993 -- the four-pass dot algorithm: network-simplex ranking, crossing-reducing ordering, coordinate assignment, spline edges. publisher · read in our library knowledge/fetched/cmp_graphviz_tse93.pdf · pin h1572e926cbd9613d96c97aa7b624f34129225138cc8f6d904d178c206991785c · accessed 2026-08-18 · published-paperGrounds: "Layered generational layout" -- the row's "Graphviz dot IS the Sugiyama reference (4-phase, rank+order+position+splines)" is this paper; our 1-pass barycenter is graded against its crossing-reduction pass.
  4. [graphviz-dot] Graphviz project. dot layout engine documentation: hierarchical (layered) drawings of directed graphs, edges pointing the same direction, crossing minimisation and spline routing. publisher · read in our library knowledge/fetched/cmp_graphviz_dot-docs.html · pin h0d1d58435a4b37f0ff7b42ecd7a304eb5537cd4e6b130e97ecdf3099f6b4ab69 · accessed 2026-08-18 · vendor-docGrounds: The Graphviz column codes: "Layered generational layout" (Graphviz Best) and "Full-graph static raster (16k in one frame)" -- dot renders whole graphs to static output, which is why Graphviz reads 0 on "Interactive pan/zoom/hover/search" and 1 on the static rows.
  5. [cytoscape] Cytoscape Consortium. Cytoscape: an open source platform for complex network analysis and visualization (project site; the 2003 Genome Research paper by Shannon et al. is its published origin). publisher · read in our library knowledge/fetched/cmp_graphviz_cytoscape-site.html · pin h18f1b14eb9832703fba13d055580fa6bb148af5b8dc3e2a224896bbfec07951b · accessed 2026-08-18 · vendor-docGrounds: The Cytoscape column: "Per-organ lineage drill-down" (Cytoscape's subnetwork views are Best), "Multilevel aggregation + semantic zoom" and "Interactive pan/zoom/hover/search" -- the interactive network-analysis platform our static per-seed PNG is graded beside.
  6. [graphistry] Graphistry Inc. Graphistry: GPU-accelerated visual graph analytics for big and complex data (product site). publisher · accessed 2026-08-18 · vendor-docGrounds: The Graphistry column: "GPU large-scale rendering (100k+)" (Graphistry is Best: GPU, millions of nodes) and "Additive edge-density rendering" (GPU density shading is Best); the page's GPU-acceleration claim is the ceiling row our CPU 16k render names. Mirror absent by declaration: the sovereign TLS handshake to graphistry.com failed on every retry.
  7. [holten06] Holten, D. Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. IEEE Transactions on Visualization and Computer Graphics 12(5), 2006 (InfoVis 2006). publisher · read in our library knowledge/fetched/cmp_graphviz_holten06.html · pin hb151c3596210639c75b99fd0b15076c8583dda266b989f57d4600b805f270b3f · accessed 2026-08-18 · published-paperGrounds: "Hierarchical edge bundling (Holten-class)" -- the row's InfoVis-award clutter cure: adjacency edges bent as B-splines toward the hierarchy path; the reason our additive overdraw is NOT bundling and the junk verdict's core.
  8. [shneiderman96] Shneiderman, B. The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations. IEEE Symposium on Visual Languages 1996 (UMD HCIL tech report, DRUM 1903/5784) -- "Overview first, zoom and filter, then details-on-demand". publisher · read in our library knowledge/fetched/cmp_graphviz_shneiderman96.html · pin h0af15733a3f19a23da48ff39816cbe0df05fcf4b758665ddee8960929903fb61 · accessed 2026-08-18 · published-paperGrounds: "Interactive pan/zoom/hover/search" -- the row cites the Visual Information-Seeking Mantra by name (overview first, zoom+filter, details on demand -- Shneiderman); the usability law a static PNG cannot satisfy.
  9. [louvain08] Blondel, Guillaume, Lambiotte, Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, P10008, 2008; arXiv:0803.0476 -- the Louvain modularity method. publisher · read in our library knowledge/fetched/cmp_graphviz_louvain08.html · pin hfcbce77311ad06d62a460fc2f88f31a5455b1429fcac76c11eeb1d707e87d536 · accessed 2026-08-18 · published-paperGrounds: "Community detection coloring" -- Gephi's modularity coloring (the iconic look the row names) runs this algorithm; nx_graph_community is _ABSENT_ against exactly this method.

generated by nx_swcompare_matrix (sovereign NishiLang organ) from knowledge/compare/graphviz.matrix · source checks show implementation presence; runtime and user-outcome evidence are reported separately · JavaScript supports page controls