Seven days, eighteen pieces, one recurring shape. Strip the topics away — a Le Corbusier master plan, a 1988 anime, a 57-kilometre rail tunnel, a Grasshopper solver from 2011 — and what’s left underneath is the same object: a graph of what depends on what, and the quiet node that takes everything down when it fails. That’s the week I’m handing you back.

←TODAY: In 2026 the cut vertex in your delivery is usually a person, a licence, or a fibre nobody laid. →3012: The buildings that survive to Zurich-3012 are the ones whose dependency graph was drawn while the trench was still open. Fulcrum: A resilience diagram is only honest when you can name the third single point you didn’t know you had.

Top stories:

Chandigarh, read as topology. The week’s sharpest piece took Le Corbusier’s master plan and refused to see a city — it saw a tree with no redundancy, every clean hierarchy hiding a cut vertex you can only spot on a dependency graph, not an architecture diagram (architecturelab.net). For a Swiss office, the lesson is procedural: the org chart your deliverable actually runs on is not the one on the wall.

Akira as a funding graph. The natural sibling: 160,000 hand-painted cels on a ¥1.1 billion budget, shipped because the production spread its money across seven financiers so no single node was load-bearing. The same articulation-point logic that keeps a fire exit reachable keeps a deadline reachable — the Akira piece made the case that constraint-scheduling is engineering, not trivia.

The Gotthard’s spare fibre. On the infrastructure side, reading 57 km of rock as one distributed-acoustic strand was the most PAZ-native story of the week: a digital twin earns its keep by recommending an action, and the cheapest sensing you’ll ever buy is a dark spare laid before the concrete cures. Put it in the BEP now or pay an order of magnitude to retrofit.

Git as vendor insurance. The most under-glamorous, most useful piece: Git for Architects — free, offline, readable by a stranger in twenty years, and the single cheapest hedge against lock-in a practice can make. Keep IFC, SVG, JSON and .gh in text so git diff can show what moved. This one has no expiry date.

Tor Alva’s honest reinforcement. ETH’s reinforcement scheme for thin-walled printed concrete was the material-science anchor of the week — the breakthrough isn’t the column-forest ornament, it’s making free form and material efficiency stop fighting. Run the hollow-vs-solid check on your heaviest repeated element and tag it for disassembly.

Signal vs. noise: Genuinely new: the Gotthard sensing case and Tor Alva’s reinforcement geometry — both primary, both physical, both hard to fake. Genuine but small, and honestly labelled as such: “graph engineering,” which mostly names a naming — the nodes-edges-shared-state decision LangGraph and ADK already forced on you. The loudest noise was Mojo: fast, worth an afternoon, but a closed compiler until Modular’s promised open date — open-core lock-in wearing a benchmark. Trial it on a non-critical kernel and write the exit clause in the same commit. Rutten’s Galapagos at fifteen was the antidote: an honest solver that still works exactly where its author told you it would.

Hidden gem: The Roman roads piece — 80,500 km that lasted a millennium — deserved more attention than it got, because it answers the resilience question the flashier stories only pose. The roads survived because drainage and a named maintenance office, the curatores viarum, were designed in as line-items, not bolted on. That is the whole discipline: an owner for the ditch, and a schedule row that says who checks it in year 40.

Hack: Find the choke node in your live project before it finds your deadline. Map the project as a directed graph — files, people, approvals as nodes; dependencies as edges — and let the math name the single points of failure the diagram hides.

import networkx as nx
G = nx.Graph()
G.add_edges_from([("IFC","clash"), ("clash","tender"),
                  ("BIM_lead","clash"), ("BIM_lead","tender")])
for v in nx.articulation_points(G):
    print("cut vertex — removing this splits the graph:", v)

Every printed vertex is a node whose loss disconnects the work. Draw one redundant edge around it today, not the day it fails.

Looking ahead: Two PAZ dates now sit on the calendar and both are about turning this week’s headlines into one repeatable desk habit: the Building System Specialist Title XIV opens 1 September, and the KI Back 2 Work Camp runs 23–24 September. Watch, too, whether Modular actually ships the Mojo compiler open as promised — the exit clause you write this month is the test of whether you read the licence or the benchmark. Draw your real dependency graph this week; the point of the exercise is finding the third single point you didn’t know you had.