[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_120":121},"routes/modules.$creator.$moduleId",{"_14":15,"_16":17,"_18":19,"_20":21},"routes/modules.$creator.$moduleId.endpoints",{"_11":12,"_13":-5},"error","Module not found","tools","module",{"_20":22,"_23":21,"_24":25,"_26":27,"_28":29,"_30":31,"_32":33,"_34":25,"_35":36,"_37":-5,"_38":-5,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":49,"_50":51,"_52":53,"_54":-5,"_55":47,"_56":57,"_58":59,"_60":-5,"_61":-5,"_62":-5,"_63":-5,"_64":65,"_66":67,"_68":69,"_70":71,"_72":73,"_74":-5,"_75":-5,"_76":-5,"_77":47,"_78":-5,"_79":80,"_81":82,"_83":84,"_85":86,"_87":88,"_89":90,"_91":92},"apiUrl","https://odel.app/api","creator","anandb71","moduleId","arbor","@anandb71/arbor","displayName","tagline","The Graph-Native Intelligence Layer for Code.","iconKey","https://avatars.githubusercontent.com/u/169837340?v=4","category","local","status","published","visibility","public","metaDescription","deploymentType","external","workerName","bindingName","mcpConfig","pricingModel","free","creatorUserId","system:external-import","createdAt",1783333720000,"updatedAt",1786085297000,"sourceRegistry","official-mcp-registry","sourceUrl","https://registry.modelcontextprotocol.io/v0/servers?search=io.github.Anandb71%2Farbor","sourceVerified",true,"sourceMissingSince","importedAt","upstreamStars",151,"upstreamUpdatedAt",1785724965000,"detectedTransport","detectedAuthType","probeStatus","lastProbedAt","githubRepoUrl","https://github.com/Anandb71/arbor","githubRepoFullName","Anandb71/arbor","releaseId","ext-anandb71-arbor","version","1.0.0","descriptionMarkdown","

\n $\"Arbor$ \n

\n\n

Arbor

\n\n

\n Graph-native intelligence for codebases.
\n Know what breaks before you break it.\n

\n\n

\n $\"Rust$ \n $\"Crates.io\"$ \n $\"Latest$ \n $\"GHCR\"$ \n $\"Glama$ \n $\"MIT$ \n

\n\n

\n $\"Side-by-side:$ \n

\n _{Simulated replay — the arbor commands and their output are real (tokio @ 178k LOC). Methodology: BENCHMARKS.md}\n

\n\n> **v2.6.0 — Ground Truth** · The graph was wrong in ways v2.5.0 made fast. Colliding symbols were silently dropped, resolution depended on hash order, every edge claimed certainty, and every exported TypeScript symbol was indexed twice. All fixed, all tested. Edge recall **+14% on TypeScript**, **+44% on Rust**; **25% of a TS graph was phantom nodes**. Reproduce it yourself: `cargo run -p arbor-watcher --example graph_stats -- `\n\n---\n\n## Why Arbor\n\nMost AI coding tools treat code as text. Arbor builds a **semantic dependency graph** — functions, classes, and modules as nodes; calls, imports, and inheritance as edges — then answers execution-aware questions with deterministic precision:\n\n| Question | Arbor answer |\n|----------|--------------|\n| *If I change this symbol, what breaks?* | Blast radius with depth, confidence, and risk level |\n| *Who calls this — directly and transitively?* | Caller/callee traversal on the call graph |\n| *What's the shortest path between A and B?* | A* path through real dependencies |\n| *Is this PR too risky to merge?* | CI gate on blast-radius thresholds |\n\nNo keyword guessing. No embedding hallucinations. One graph, every interface.\n\nWhere the graph is *unsure*, it says so — edges carry a confidence, and ambiguous resolutions are labelled rather than hidden. An honest unknown beats a confident wrong answer.\n\n---\n\n## What's new in v2.6.0\n\nCorrectness, not speed. Each of these was silently wrong before.\n\n| Fix | Why it mattered |\n|-----|-----------------|\n| **Colliding symbols are kept** | `SymbolTable` used `HashMap::insert`, so a second `handler`, `new`, or `process` replaced the first. The loser had zero callers and was invisible to blast radius. |\n| **Resolution is deterministic** | Same-directory locality was decided by iterating a `HashMap`. Rust seeds `RandomState` per process, so the same binary on the same input could build different edges between runs. Now asserted across eight fresh processes. |\n| **Edges carry confidence** | A proven same-file call and a same-directory guess were identical evidence. Each edge now scores `[0,1]` by how it resolved. |\n| **Exported TS symbols indexed once** | `export_statement` recursed into its children, then the generic loop recursed again — every exported symbol became two vertices sharing one node id. **133 phantom nodes on a 149-file app, 25% of the graph.** |\n| **Method calls on untyped receivers resolve** | `obj.method()` was dropped outright, leaving the graph nearly edgeless on TS/JS — and an empty graph reports a blast radius of zero, which reads as \"safe\" rather than \"unknown\". |\n| **Centrality is a percentile rank** | Scores were divided by the graph maximum, so the top node was `1.0` by construction and a `0.6` threshold meant nothing consistent between repos. Adding one hub rescaled every other node. |\n| **Resolution is O(1), not O(refs × nodes × files)** | Unresolvable references — stdlib and third-party calls, most call sites in real code — paid the worst case. Suffixes are now indexed. |\n\n**New capability — concept search.** Substring matching cannot find `get_authenticated` from `login`; they share no substring. Identifiers are now tokenized and expanded through curated concept clusters, and docstrings, signatures, and paths are indexed alongside names. Deterministic, offline, no model. Available on the library as `ArborGraph::search_ranked` (`arbor query` remains literal-substring for now).\n\n**New capability — hunk-level impact.** `changed_node_ids_for_ranges` keeps only symbols whose lines actually changed, instead of every symbol in a touched file.\n\nMeasured on identical node sets, after the duplicate-extraction fix:\n\n| Codebase | Before | After |\n|----------|--------|-------|\n| TypeScript (149 files) | 172 edges | **196** (+14%) |\n| Rust (arbor-graph) | 116 edges | **167** (+44%) |\n\nGraph caches from earlier versions are invalidated — centrality now means something different, so a stale cache would be read wrong.\n\n

v2.5.0 — The Last Excuse (PageRank 23x, parallel indexing, warm-start centrality)

\n\n| Change | Measured |\n|--------|----------|\n| **PageRank rewrite** — flat call-graph adjacency replaces per-iteration traversal | 149.8ms → **6.6ms** on a 10k-node graph (**23x**), verified side-by-side vs the old implementation |\n| **Parallel indexing** — parse fans out across all cores, deterministic assembly | Arbor: 253ms → **95ms** · tokio (178k LOC): 2.7s → **1.6s** |\n| **Warm-start centrality** — watcher recomputes seed from previous scores | Converges in ~2 rounds after a one-file patch instead of the full 20-iteration budget |\n| **Convergence early-exit** | Iteration stops at 1e-9 max delta — the budget is a ceiling, not a sentence |\n\nThink a number is wrong? `cargo bench -p arbor-graph` and prove it: [BENCHMARKS.md](https://github.com/Anandb71/arbor/blob/main/docs/BENCHMARKS.md).\n\n

\n\n

v2.4.0 — The Agent-Native Leap (MCP 2026-07-28, HTTP transport, Tasks, MCP Apps)

\n\n| Feature | What it does |\n|---------|--------------|\n| **MCP `2026-07-28`** | Stateless `server/discover`, response caching (`ttlMs`/`cacheScope`), dual-version fallback for `2025-03-26` clients |\n| **Tasks extension** | `tasks/get` · `tasks/update` · `tasks/cancel` — cold-start indexing returns task handles, not errors |\n| **MCP Apps** | Interactive blast-radius graph (`ui://arbor/blast-radius`) and architecture map (`ui://arbor/architecture-map`) inside agent hosts |\n| **HTTP transport** | `arbor bridge --http --port 3333` — stateless MCP behind load balancers |\n| **Real `get_blast_radius`** | Git-diff-aware impact analysis via shared `arbor-graph::compute_blast_radius` |\n| **Pagination** | `offset` / `limit` / `hasMore` on `search_symbols` and `get_map` |\n| **Benchmarks** | Criterion suite + CI regression gate — see [BENCHMARKS.md](https://github.com/Anandb71/arbor/blob/main/docs/BENCHMARKS.md) |\n\n