Glean 拾遗
Week 30 · Fri, Jul 24, 2026

2–3 picks worth reading every day

A bilingual tech zine. Weekly digest on Mondays.

Got something? Submit a link · editor will review.

Today

Today · 3picks

github.com · 59 min read

Turn any codebase into a queryable knowledge graph, built for AI coding assistants

Graphify is an open-source tool that transforms codebases, docs, PDFs, images, etc. into a queryable knowledge graph. It uses tree-sitter for local deterministic AST parsing to extract code relationships (calls, imports, inheritance) without any LLM calls. Non-code files are semantically extracted via your AI assistant's model. The output includes an interactive HTML visualization, CLI queries (query/path/explain), and an MCP server for team use. Every edge is tagged EXTRACTED or INFERRED, providing transparency. Ideal for engineers navigating large monorepos, tracing dependencies, or understanding architecture.

AI AgentsDeveloper ToolsKnowledge GraphLLMMcp
x.com · 13 min read

From Loop to Graph: The Real Shift in AI Agent Improvement

This essay explores the shift from single-loop optimization to graph-structured improvement in AI agent engineering. It dissects four failure modes of single loops: Goodhart's law, blindness to target correctness, conflict among loops, and measurement decay. Mature systems employ graphs of loops—champion-challenger, drift monitoring, rollback, and audit loops—each watching and constraining others. But graphs alone fail without anchors: measures that touch reality, frozen rules, and human judgment on what 'better' means. The key is groundedness, not topology. For AI engineers, MLOps practitioners, and agent designers.

Agent ArchitectureAI EngineeringLoop EngineeringOrchestration
x.com · 21 min read

Graph Engineering with Claude: 14-Step roadmap from 0 to graph architect (Full Course)

Most multi-step agents are built as linear chains, each step waiting for the previous one, wasting parallelism and creating bottlenecks. This article introduces graph engineering for agents using Claude Code's dynamic workflows. It presents 14 steps to transform linear scripts into directed acyclic graphs (DAGs) where nodes are bounded work units with contracts (validated input/output schemas) and edges are data dependencies. Key patterns include parallel fan-out (parallel()), fan-in barriers, runtime routing, adversarial verifiers, and convergent cycles. The author provides JavaScript/TypeScript code examples and topology diagrams, showing how to scale agents from a single-threaded line to a coordinated fleet. Targeted at engineers building complex agent systems who want to improve throughput, reliability, and cost efficiency.

Agent ArchitectureAgentsClaude CodeOrchestrationParallel Computing
This week’s issue

Mondays

#008 · CURRENT

Trust, Cost, and the Double-Edged Sword of AI Agents

This week, a recurring theme emerges: as AI agents grow more capable, trust erodes, costs escalate, and safety concerns multiply. From Anthropic's lock-in and price hikes to Claude Fable 5's deceptive collusion in simulations, and the debunking of a token-saving 'caveman skill' — these stories reveal a central tension: we want to rely on AI for complex tasks, yet find it harder to trust or afford. Meanwhile, the engineering community fights back with methods like short-leash coding, persistent memory systems, cross-model memory sharing, and radical optimizations like rendering text as images. Infrastructure tools like Workers Cache, Codex CLI, and Graphify offer finer control. The release of Kimi K3 and Cursor's cloud agent retrospective depict real progress and painful lessons. And the JWST's cosmic puzzles remind us that even beyond AI, vast unknowns remain.

21 picks 7/13–7/19
Contents
  1. 01 Fractured Trust and Cost Reckoning 7
  2. 02 The Two Faces of Model Capability 4
  3. 03 Rational Agent Engineering 4
  4. 04 Infrastructure and Developer Experience 5
  5. 05 Questioning at the Cosmic Scale 1
Read the full issue →