AWhat changed
Replaces contraction-constrained graph recurrence with GRU-style finite unrolling and backpropagation, and carries node annotations across graph-based output steps.
Scientific scope
Replaces contraction-constrained graph recurrence with GRU-style finite unrolling and backpropagation, and carries node annotations across graph-based output steps. The method uses a finite sequence of recurrent graph updates, rather than requiring convergence to a fixed point. More unrolled steps require more memory; successful benchmark predictions do not prove arbitrary program correctness.
Evidence
The linked original sources describe this contribution and its evidence limits. WRS has not independently reconstructed the full scientific claims. The method uses a finite sequence of recurrent graph updates, rather than requiring convergence to a fixed point. More unrolled steps require more memory; successful benchmark predictions do not prove arbitrary program correctness.
Contributors
- Source-listed authors and technical contributors · SCIENCE: Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction