update AGENTS.md

README.md

@@ -43,7 +43,7 @@ framework-level details).
 High-level lowering flow:
 
 ```
-ONNX-MLIR ──► Spatial ──► Pim (tensor) ──► Pim (bufferized) ──► PIM JSON
+ONNX-MLIR ──► Spatial ──► Pim (tensor) ──► Pim (bufferized) ──► PIM code
 ```
 
 1. **ONNX → Spatial** (`src/PIM/Conversion/ONNXToSpatial`).
@@ -55,7 +55,7 @@ ONNX-MLIR ──► Spatial ──► Pim (tensor) ──► Pim (bufferized)
    Conversion patterns are split by op family under
    `Conversion/ONNXToSpatial/Patterns/{Math,NN,Tensor}` (Conv, Gemm, MatMul,
    Elementwise, ReduceMean, Pool, Relu, Sigmoid, Softmax, Concat, Gather,
-   Reshape, Resize, Split).
+   Reshape, Resize, Split, etc...).
 
 2. **Spatial → Pim** (`src/PIM/Conversion/SpatialToPim`).
    Lowers Spatial to the `pim` dialect (`src/PIM/Dialect/Pim`), which
@@ -63,10 +63,7 @@ ONNX-MLIR ──► Spatial ──► Pim (tensor) ──► Pim (bufferized)
    (`pim.send` / `pim.receive`), halts, and crossbar-level operations.
 
 3. **Merge compute nodes** (`src/PIM/Dialect/Spatial/Transforms/MergeComputeNodes`).
-   A DCP-inspired heuristic (Dynamic Critical Path — see the original
-   scheduling paper by Kwok & Ahmad,
-   [DCP-eScience2007](https://clouds.cis.unimelb.edu.au/papers/DCP-eScience2007.pdf))
-   that coarsens the virtual node graph and decides how to group compute
+   A PEFT heuristic that coarsens the virtual node graph and decides how to group compute
    nodes onto cores. Our implementation is only DCP-*inspired*: it is a
    heuristic with different assumptions from the paper (different cost
    model, constraints from crossbar capacity / core resources, and a