--- schema_version: "1.0.0" edition_id: "mp-2026-10-08-morning-0090" published_at: "2026-10-08T09:00:00.000-04:00" modified_at: "2026-10-08T09:00:00.000-04:00" canonical_url: "https://themachinepress.com/edition/2026-10-08" story_count: 27 lead_story_id: "mp-2026-10-08-001" --- # The Machine Press — Morning edition Edition ID: `mp-2026-10-08-morning-0090` Published: 2026-10-08T09:00:00.000-04:00 Canonical edition: https://themachinepress.com/edition/2026-10-08 A vision-language-action policy switched on a stove in every trial under one instruction and only 2% under a near-synonym; a one-pass rewriter recovered part of the gap without retraining. ## 1. One Word Sent the Robot From Perfect to Almost Never {#mp-2026-10-08-001} - Story ID: `mp-2026-10-08-001` - Type: `lead` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-001/one-word-sent-the-robot-from-perfect-to-almost-never **Dek:** A vision-language-action policy switched on a stove in every trial under one instruction and only 2% under a near-synonym; a one-pass rewriter recovered part of the gap without retraining. Language robustness in a vision model does not guarantee language robustness after that model is connected to action. Researchers measured statistically significant single-edit swings in vision-language-action policies: one tested policy completed the same LIBERO stove task 100% of the time for “switch on the stove” and 2% for “switch on the hot plate,” while a rephrase-augmented checkpoint still showed swings as large as 61 points. An oracle search suggested that phrasing alone nearly closed a 21-point in-distribution gap. The proposed mitigation scores alternative instructions on a few training tasks, distills the evidence into rewriting rules and rewrites each incoming command once before the frozen policy acts. Across twelve held-out tasks, the rules improved the tested policy by 16% to 27% relative. This is benchmark evidence, not a general safety guarantee, but it turns wording into an observable control variable rather than user error. ### Why it matters {#why-it-matters-mp-2026-10-08-001} A vision-language-action policy switched on a stove in every trial under one instruction and only 2% under a near-synonym; a one-pass rewriter recovered part of the gap without retraining. ### Limits and context {#limitations-mp-2026-10-08-001} - Language robustness in a vision model does not guarantee language robustness after that model is connected to action. - This is benchmark evidence, not a general safety guarantee, but it turns wording into an observable control variable rather than user error. ### Claims and sources {#claims-mp-2026-10-08-001} - A vision-language-action policy switched on a stove in every trial under one instruction and only 2% under a near-synonym; a one-pass rewriter recovered part of the gap without retraining. [source-2026-10-08-001] — Qualification: Language robustness in a vision model does not guarantee language robustness after that model is connected to action. ## 2. The Larger Model Learned to Compute Around Broken Hardware {#mp-2026-10-08-002} - Story ID: `mp-2026-10-08-002` - Type: `secondary` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-002/the-larger-model-learned-to-compute-around-broken-hardware **Dek:** Training runs on simulated faulty digital hardware suggest that error resilience can rise with model scale, opening a speculative route to lower-energy inference. Efficient hardware often becomes less reliable as voltage and safety margins fall. A study built modified neural scaling laws from 40,000 GPU-hours of language-model training with simulated digital faults and found that appropriately trained models became more resilient as they grew rather than more fragile. The authors interpret the behavior as learned computation inside good error-correcting codes whose relative overhead need not expand with model size. That interpretation remains a conjecture: the experiments simulate faulty hardware, do not establish formal fault tolerance and do not demonstrate an energy-saving production chip. Yet the result reframes the systems bargain. Instead of forcing every transistor to behave perfectly and treating model computation as brittle, future hardware and training might divide the reliability work between them. The immediate contribution is evidence that scale can absorb faults under training—not proof that unreliable accelerators are ready for deployment. ### Why it matters {#why-it-matters-mp-2026-10-08-002} Training runs on simulated faulty digital hardware suggest that error resilience can rise with model scale, opening a speculative route to lower-energy inference. ### Limits and context {#limitations-mp-2026-10-08-002} - The authors interpret the behavior as learned computation inside good error-correcting codes whose relative overhead need not expand with model size. - That interpretation remains a conjecture: the experiments simulate faulty hardware, do not establish formal fault tolerance and do not demonstrate an energy-saving production chip. - The immediate contribution is evidence that scale can absorb faults under training—not proof that unreliable accelerators are ready for deployment. ### Claims and sources {#claims-mp-2026-10-08-002} - Training runs on simulated faulty digital hardware suggest that error resilience can rise with model scale, opening a speculative route to lower-energy inference. [source-2026-10-08-002] — Qualification: The authors interpret the behavior as learned computation inside good error-correcting codes whose relative overhead need not expand with model size. ## 3. The Assistant Remembered Objects It Never Touched {#mp-2026-10-08-003} - Story ID: `mp-2026-10-08-003` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-003/the-assistant-remembered-objects-it-never-touched **Dek:** A persistent 3D ledger retained locations, histories and context after objects left view, lifting accuracy on three egocentric-memory tests. Ledger associates object observations across egocentric video, clusters each object by resting location and records a move only after repeated evidence, reducing false changes from localization noise. It also stores short descriptions such as contents or supporting surfaces and can answer later questions without reopening the original video. The authors report accuracy rising from 29.7% to 42.6% on HD-EPIC and from 33.8% to 38.5% on UCS-Bench, with 0.99-meter median localization error for returned Ego4D objects. Performance fell across stitched multi-scene streams, and per-scene construction recovered only part of that loss. The work makes persistence a first-class component of embodied memory: what matters later may be something the wearer merely passed. ### Why it matters {#why-it-matters-mp-2026-10-08-003} A persistent 3D ledger retained locations, histories and context after objects left view, lifting accuracy on three egocentric-memory tests. ### Limits and context {#limitations-mp-2026-10-08-003} - Ledger associates object observations across egocentric video, clusters each object by resting location and records a move only after repeated evidence, reducing false changes from localization noise. - Performance fell across stitched multi-scene streams, and per-scene construction recovered only part of that loss. ### Claims and sources {#claims-mp-2026-10-08-003} - A persistent 3D ledger retained locations, histories and context after objects left view, lifting accuracy on three egocentric-memory tests. [source-2026-10-08-003] — Qualification: Ledger associates object observations across egocentric video, clusters each object by resting location and records a move only after repeated evidence, reducing false changes from localization noise. ## 4. Novel Reasoning Was Explored Somewhere Else {#mp-2026-10-08-004} - Story ID: `mp-2026-10-08-004` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-004/novel-reasoning-was-explored-somewhere-else **Dek:** Exploration-Distillation separated novelty-seeking policies from the student that ultimately learned their filtered successes. Novelty bonuses can push reinforcement learning with verifiable rewards toward new solutions, but they can also damage behavior that sparse task rewards cannot restore. Exploration-Distillation trains separate explorer policies with novelty incentives, filters their trajectories for correctness and quality, and distills the survivors into a student trained without the bonus. Repeating that cycle lets exploration become aggressive without making the deployed student absorb every experiment. Across seven mathematics benchmarks and two model families, the authors report better results than DAPO at the same wall-clock budget and stronger pass-at-k scaling, indicating more diverse correct solutions. The paper's operational point is broader than math: exploration and optimization need not occur in the same policy at the same time. ### Why it matters {#why-it-matters-mp-2026-10-08-004} Exploration-Distillation separated novelty-seeking policies from the student that ultimately learned their filtered successes. ### Limits and context {#limitations-mp-2026-10-08-004} - Novelty bonuses can push reinforcement learning with verifiable rewards toward new solutions, but they can also damage behavior that sparse task rewards cannot restore. - The paper's operational point is broader than math: exploration and optimization need not occur in the same policy at the same time. ### Claims and sources {#claims-mp-2026-10-08-004} - Exploration-Distillation separated novelty-seeking policies from the student that ultimately learned their filtered successes. [source-2026-10-08-004] — Qualification: Novelty bonuses can push reinforcement learning with verifiable rewards toward new solutions, but they can also damage behavior that sparse task rewards cannot restore. ## 5. A Drawn Line Steered Three Robot Policies {#mp-2026-10-08-005} - Story ID: `mp-2026-10-08-005` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-005/a-drawn-line-steered-three-robot-policies **Dek:** Sparse traces, target points and directions altered actions in noise space without changing the base policy architecture. RoboPrompt translates intuitive human guidance into an action draft, then lets the base diffusion or flow-matching policy refine that draft through its normal generation dynamics. The reusable steering module worked across Diffusion Policy, pi-0.5 and FastWAM without policy-specific architectural changes or steerability fine-tuning. The researchers then used corrected rollouts for DAgger-style improvement. After two or three rounds, average success increased 15.5% for pi-0.5 across three tasks and 21.3% across three policies on an Insert Bread task, while intervention counts fell by 44.0% and 81.9% in the respective comparisons. The tested settings are limited, but the interface makes occasional human intent a lightweight input rather than a full teleoperation session. ### Why it matters {#why-it-matters-mp-2026-10-08-005} Sparse traces, target points and directions altered actions in noise space without changing the base policy architecture. ### Limits and context {#limitations-mp-2026-10-08-005} - No additional limitation was separately recorded. ### Claims and sources {#claims-mp-2026-10-08-005} - Sparse traces, target points and directions altered actions in noise space without changing the base policy architecture. [source-2026-10-08-005] ## 6. Facts Moved Into an Editable Memory Layer {#mp-2026-10-08-006} - Story ID: `mp-2026-10-08-006` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-006/facts-moved-into-an-editable-memory-layer **Dek:** EngramEdit changed conditional n-gram memory while leaving the Transformer backbone fixed and penalizing broadly shared embeddings. Conditional-memory models look up learned embeddings from input n-grams, creating a possible place to update facts without rewriting a model's general computation. EngramEdit first finds target memory representations that produce the new fact across several phrasings, then jointly updates the shared embeddings while penalizing changes to frequently reused entries. The authors report near-perfect edit success, transfer to unseen expressions and multi-hop reasoning, and almost three times the strongest comparison's chain-of-thought accuracy. Unrelated knowledge and general capabilities were largely preserved as edits accumulated in the reported tests. That does not settle open-world model maintenance, but it turns a scaling component into a concrete interface for decoupled knowledge updates. ### Why it matters {#why-it-matters-mp-2026-10-08-006} EngramEdit changed conditional n-gram memory while leaving the Transformer backbone fixed and penalizing broadly shared embeddings. ### Limits and context {#limitations-mp-2026-10-08-006} - That does not settle open-world model maintenance, but it turns a scaling component into a concrete interface for decoupled knowledge updates. ### Claims and sources {#claims-mp-2026-10-08-006} - EngramEdit changed conditional n-gram memory while leaving the Transformer backbone fixed and penalizing broadly shared embeddings. [source-2026-10-08-006] — Qualification: That does not settle open-world model maintenance, but it turns a scaling component into a concrete interface for decoupled knowledge updates. ## 7. One Simulation Estimated Every Logical Error Sensitivity {#mp-2026-10-08-007} - Story ID: `mp-2026-10-08-007` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-007/one-simulation-estimated-every-logical-error-sensitivity **Dek:** Fault-counting matched finite differences while using one to two orders of magnitude fewer surface-code shots at the same variance. Quantum error budgets usually vary each physical noise parameter and rerun simulations to estimate how logical failure responds. This work derives a differentiable estimator that extracts every component of that gradient from one Monte Carlo data set by retaining information about the underlying fault configurations. In circuit-level surface-code simulations, the estimator agreed with conventional finite differences while requiring ten to one hundred times fewer shots for comparable variance. The authors use it to resolve sensitivities down to individual qubits, infer effective code distance and trace threshold contours in multidimensional noise models with Newton updates. The evidence is simulation, but the method could make detailed error-budget diagnosis much cheaper. ### Why it matters {#why-it-matters-mp-2026-10-08-007} Fault-counting matched finite differences while using one to two orders of magnitude fewer surface-code shots at the same variance. ### Limits and context {#limitations-mp-2026-10-08-007} - No additional limitation was separately recorded. ### Claims and sources {#claims-mp-2026-10-08-007} - Fault-counting matched finite differences while using one to two orders of magnitude fewer surface-code shots at the same variance. [source-2026-10-08-007] ## 8. Nineteen Seconds of History Finally Changed the Robot's Next Move {#mp-2026-10-08-008} - Story ID: `mp-2026-10-08-008` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-008/nineteen-seconds-of-history-finally-changed-the-robot-s-next-move **Dek:** Long-WAM gained from longer context only when its video foundation had learned causal prediction rather than bidirectional reconstruction. Long-WAM asks whether a real-time robot can use more visual history without delaying control. Its video foundation is pretrained autoregressively on robot and egocentric footage, then adapted while preserving the history-to-future objective. On RoboCasa GR-1, extending context from zero to 19.2 seconds raised success from 63.3% to 78.7%; a bidirectionally pretrained initialization gained nothing overall. Streaming encoding and asynchronous execution kept an action chunk, including predicted future-video latents, to 107.4 milliseconds on an RTX 5090. The authors also report 95% success on dynamic cup stacking with a Unitree G1 where two compared policies failed all twenty trials. These are benchmark and controlled hardware results, but they isolate a useful distinction: storing history is not the same as training a controller to use it causally. ### Why it matters {#why-it-matters-mp-2026-10-08-008} Long-WAM gained from longer context only when its video foundation had learned causal prediction rather than bidirectional reconstruction. ### Limits and context {#limitations-mp-2026-10-08-008} - These are benchmark and controlled hardware results, but they isolate a useful distinction: storing history is not the same as training a controller to use it causally. ### Claims and sources {#claims-mp-2026-10-08-008} - Long-WAM gained from longer context only when its video foundation had learned causal prediction rather than bidirectional reconstruction. [source-2026-10-08-008] — Qualification: These are benchmark and controlled hardware results, but they isolate a useful distinction: storing history is not the same as training a controller to use it causally. ## 9. Video Diffusion Lost Eight Times the Tokens, Not the Picture {#mp-2026-10-08-009} - Story ID: `mp-2026-10-08-009` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-009/video-diffusion-lost-eight-times-the-tokens-not-the-picture **Dek:** GRACE compressed a pretrained autoencoder while aligning its new latent to the frozen diffusion transformer's feature space. Compressing a video autoencoder reduces the token load seen by a diffusion transformer, but the new latent can drift away from what that transformer learned. GRACE keeps a frozen base latent, learns a residual for information lost under heavier compression and aligns the compressed representation inside the frozen transformer's feature space. Lightweight adaptation and asymmetric denoising then process the base ahead of the residual. On Wan2.1-I2V-14B at the reported resolution and duration, the method cut token count eightfold and latency 11.1-fold while matching the pretrained pipeline's VBench generation quality. The comparison is tied to that pipeline and benchmark, yet it shows why reconstruction quality alone is the wrong target when a latent exists to serve a generator. ### Why it matters {#why-it-matters-mp-2026-10-08-009} GRACE compressed a pretrained autoencoder while aligning its new latent to the frozen diffusion transformer's feature space. ### Limits and context {#limitations-mp-2026-10-08-009} - No additional limitation was separately recorded. ### Claims and sources {#claims-mp-2026-10-08-009} - GRACE compressed a pretrained autoencoder while aligning its new latent to the frozen diffusion transformer's feature space. [source-2026-10-08-009] ## 10. Deleting Later May Require Remembering Everything Now {#mp-2026-10-08-010} - Story ID: `mp-2026-10-08-010` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-010/deleting-later-may-require-remembering-everything-now **Dek:** Lower bounds show that forget-only unlearning can need information ordinary training was designed to discard. Forget-only unlearning gives a deletion algorithm the trained model and examples to remove, but no retained data or training trace. The paper shows why that setup cannot always reproduce retraining: different datasets can produce the same model yet require different outputs after the same deletion. It derives accuracy lower bounds for several standard learners and then asks how much training information successful deletion must preserve. For simple threshold learners, arbitrary deletion requests can require memory as large as the full dataset even though ordinary training keeps only a boundary point. The result is theoretical, not a measurement of current large-model unlearning, but it exposes a design conflict: minimal sufficient state for prediction may be insufficient state for future erasure. ### Why it matters {#why-it-matters-mp-2026-10-08-010} Lower bounds show that forget-only unlearning can need information ordinary training was designed to discard. ### Limits and context {#limitations-mp-2026-10-08-010} - Forget-only unlearning gives a deletion algorithm the trained model and examples to remove, but no retained data or training trace. - The paper shows why that setup cannot always reproduce retraining: different datasets can produce the same model yet require different outputs after the same deletion. - For simple threshold learners, arbitrary deletion requests can require memory as large as the full dataset even though ordinary training keeps only a boundary point. ### Claims and sources {#claims-mp-2026-10-08-010} - Lower bounds show that forget-only unlearning can need information ordinary training was designed to discard. [source-2026-10-08-010] — Qualification: Forget-only unlearning gives a deletion algorithm the trained model and examples to remove, but no retained data or training trace. ## 11. Six Agents Built Climate Models That Beat the Published Baseline {#mp-2026-10-08-011} - Story ID: `mp-2026-10-08-011` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-011/six-agents-built-climate-models-that-beat-the-published-baseline **Dek:** A hidden-grader exam tested whether open-ended agent research reproduced ENSO statistics, inferred unseen variables and forecast held-out years. SciExam for ENSO gives agents six hours to process real observations, write diagnostics that are then frozen and build low-order stochastic climate models using only those diagnostics as feedback. Hidden graders evaluate statistics, unobserved-variable recovery and held-out forecasts, and score a published model under the same procedure. Six of twelve agent systems scored higher than that baseline, mainly through reconstruction and forecasting. Simplified versions of the stronger models aligned with the two competing explanations of ENSO's warm-cold asymmetry even though the prompt did not mention the debate. The benchmark does not establish new climate science by itself, but it offers an unusually demanding test: research output is judged by unseen physical behavior rather than a known answer or another model's review. ### Why it matters {#why-it-matters-mp-2026-10-08-011} A hidden-grader exam tested whether open-ended agent research reproduced ENSO statistics, inferred unseen variables and forecast held-out years. ### Limits and context {#limitations-mp-2026-10-08-011} - SciExam for ENSO gives agents six hours to process real observations, write diagnostics that are then frozen and build low-order stochastic climate models using only those diagnostics as feedback. - Simplified versions of the stronger models aligned with the two competing explanations of ENSO's warm-cold asymmetry even though the prompt did not mention the debate. - The benchmark does not establish new climate science by itself, but it offers an unusually demanding test: research output is judged by unseen physical behavior rather than a known answer or another model's review. ### Claims and sources {#claims-mp-2026-10-08-011} - A hidden-grader exam tested whether open-ended agent research reproduced ENSO statistics, inferred unseen variables and forecast held-out years. [source-2026-10-08-011] — Qualification: SciExam for ENSO gives agents six hours to process real observations, write diagnostics that are then frozen and build low-order stochastic climate models using only those diagnostics as feedback. ## 12. The Robot Chose Experiments That Could Disprove Its Own Plan {#mp-2026-10-08-012} - Story ID: `mp-2026-10-08-012` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-012/the-robot-chose-experiments-that-could-disprove-its-own-plan **Dek:** EmbodiedRSI maintained competing code-and-skill hypotheses and selected physical trials by their expected information value. Self-improving robot harnesses can waste scarce hardware trials testing changes that do not distinguish competing explanations. EmbodiedRSI keeps a graph of code and skill hypotheses, chooses experiments by value of information, and uses outcomes to evolve both runtime code and reusable skills. A slower memory system retains only experience that improves later fast decisions. The authors report 77.0% overall success on RoboCasa365 versus 40.1% for the strongest baseline, 86.8% on LIBERO-Pro and 71.3% after zero-shot transfer to a real robot across the tested tasks. The claims combine benchmark and controlled robot evidence; the core systems idea is to make every physical trial adjudicate a hypothesis rather than merely add another trajectory. ### Why it matters {#why-it-matters-mp-2026-10-08-012} EmbodiedRSI maintained competing code-and-skill hypotheses and selected physical trials by their expected information value. ### Limits and context {#limitations-mp-2026-10-08-012} - Self-improving robot harnesses can waste scarce hardware trials testing changes that do not distinguish competing explanations. - A slower memory system retains only experience that improves later fast decisions. ### Claims and sources {#claims-mp-2026-10-08-012} - EmbodiedRSI maintained competing code-and-skill hypotheses and selected physical trials by their expected information value. [source-2026-10-08-012] — Qualification: Self-improving robot harnesses can waste scarce hardware trials testing changes that do not distinguish competing explanations. ## 13. The Best Coding Base Model Could Be Ranked Before It Learned the Harness {#mp-2026-10-08-013} - Story ID: `mp-2026-10-08-013` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-013/the-best-coding-base-model-could-be-ranked-before-it-learned-the-harness **Dek:** Three screens evaluated decisive actions inside successful trajectories instead of demanding cold-start tool use from an untrained checkpoint. Base checkpoints often fail an agent benchmark because they cannot yet format tool calls, hiding whether their weights contain useful coding behavior. This work replays successful post-training trajectories, finds the first cumulative patch that flips tests from failing to passing and evaluates base models at that decisive step. Bits-per-byte on the certified action, multiple-choice discrimination against verifier-rejected alternatives and prefix-conditioned pass-at-k all ranked ten base/post-trained model pairs in close agreement with eventual SWE-bench Verified performance. The screens still depend on successful trajectories and a verifier, but they may prevent expensive post-training runs on checkpoints whose apparent weakness is only harness fluency—or whose underlying coding distribution truly lacks the needed action. ### Why it matters {#why-it-matters-mp-2026-10-08-013} Three screens evaluated decisive actions inside successful trajectories instead of demanding cold-start tool use from an untrained checkpoint. ### Limits and context {#limitations-mp-2026-10-08-013} - Base checkpoints often fail an agent benchmark because they cannot yet format tool calls, hiding whether their weights contain useful coding behavior. - The screens still depend on successful trajectories and a verifier, but they may prevent expensive post-training runs on checkpoints whose apparent weakness is only harness fluency—or whose underlying coding distribution truly lacks the needed action. ### Claims and sources {#claims-mp-2026-10-08-013} - Three screens evaluated decisive actions inside successful trajectories instead of demanding cold-start tool use from an untrained checkpoint. [source-2026-10-08-013] — Qualification: Base checkpoints often fail an agent benchmark because they cannot yet format tool calls, hiding whether their weights contain useful coding behavior. ## 14. A Correct Answer Rarely Meant the Hallucination Was Repaired {#mp-2026-10-08-014} - Story ID: `mp-2026-10-08-014` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-014/a-correct-answer-rarely-meant-the-hallucination-was-repaired **Dek:** PHRBench classified whether models complied with, avoided or heuristically corrected a false premise across 4,820 controlled cases. Hallucinated context can become the premise for another model's reasoning, so final-answer accuracy alone cannot show how the error was handled. PHRBench evaluates eighteen language models across four domains and labels trajectories as compliance, avoidance or heuristic correction, reserving an insightful outcome for a correction that also reaches the right answer. Successful recovery was relatively rare and coincided with more belief updates through the trace. Prompt properties alone carried enough signal for a lightweight predictor to reach 0.847 AUROC on recovery. The benchmark does not remove hallucinations, but it makes downstream behavior inspectable: a system that lands on the right answer may still have accepted the false premise for the wrong reasons. ### Why it matters {#why-it-matters-mp-2026-10-08-014} PHRBench classified whether models complied with, avoided or heuristically corrected a false premise across 4,820 controlled cases. ### Limits and context {#limitations-mp-2026-10-08-014} - Hallucinated context can become the premise for another model's reasoning, so final-answer accuracy alone cannot show how the error was handled. - The benchmark does not remove hallucinations, but it makes downstream behavior inspectable: a system that lands on the right answer may still have accepted the false premise for the wrong reasons. ### Claims and sources {#claims-mp-2026-10-08-014} - PHRBench classified whether models complied with, avoided or heuristically corrected a false premise across 4,820 controlled cases. [source-2026-10-08-014] — Qualification: Hallucinated context can become the premise for another model's reasoning, so final-answer accuracy alone cannot show how the error was handled. ## 15. The Training Trace Had to Match the Harness That Made It {#mp-2026-10-08-026} - Story ID: `mp-2026-10-08-026` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-026/the-training-trace-had-to-match-the-harness-that-made-it **Dek:** CoTrace routed verified terminal-agent trajectories by runtime provenance instead of pooling every successful replay. Terminal agents learn inside a harness that formats prompts, binds tools and recovers from errors, making a trajectory's value conditional on the runtime that produced it. CoTrace alternates harness search and policy training while matching supervised rollouts to the adopted harness and using fresh interactions for reinforcement learning. On the Tmax promotion split, the authors report Qwen3.5-9B advancing from 78 to 88 solved tasks under supervised fine-tuning and to 90 with online reinforcement learning. A compact harness-matched corpus outperformed much larger pools from sibling harnesses, and out-of-distribution tests showed failures when training and evaluation scaffolds diverged. The result treats harness provenance as training data, not incidental metadata. ### Why it matters {#why-it-matters-mp-2026-10-08-026} CoTrace routed verified terminal-agent trajectories by runtime provenance instead of pooling every successful replay. ### Limits and context {#limitations-mp-2026-10-08-026} - The result treats harness provenance as training data, not incidental metadata. ### Claims and sources {#claims-mp-2026-10-08-026} - CoTrace routed verified terminal-agent trajectories by runtime provenance instead of pooling every successful replay. [source-2026-10-08-015] — Qualification: The result treats harness provenance as training data, not incidental metadata. ## 16. The Attribution Method Mostly Found Large Gradients {#mp-2026-10-08-027} - Story ID: `mp-2026-10-08-027` - Type: `dispatch` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-027/the-attribution-method-mostly-found-large-gradients **Dek:** BehaviorTrace planted a known learned behavior and found that simple confounds often matched targeted rollout-attribution scores. BehaviorTrace asks which online reinforcement-learning rollout taught a model a known planted behavior. Across three Qwen2.5-1.5B seeds, a control that ranked training steps only by gradient magnitude reached 4.2 to 4.5 times chance and matched or beat the best targeted estimator on two seeds. At saturated checkpoints, fluency predicted the behavior label at least as well as every compared gradient method. After controlling for fluency, per-rollout findings changed across seeds and generation draws; only trigger-token gradient alignment held consistently. The study proposes no replacement estimator. Its contribution is a stricter evaluation harness and a warning that plausible attribution maps can be driven by update size or fluency rather than the behavior being traced. ### Why it matters {#why-it-matters-mp-2026-10-08-027} BehaviorTrace planted a known learned behavior and found that simple confounds often matched targeted rollout-attribution scores. ### Limits and context {#limitations-mp-2026-10-08-027} - Across three Qwen2.5-1.5B seeds, a control that ranked training steps only by gradient magnitude reached 4.2 to 4.5 times chance and matched or beat the best targeted estimator on two seeds. - After controlling for fluency, per-rollout findings changed across seeds and generation draws; only trigger-token gradient alignment held consistently. ### Claims and sources {#claims-mp-2026-10-08-027} - BehaviorTrace planted a known learned behavior and found that simple confounds often matched targeted rollout-attribution scores. [source-2026-10-08-016] — Qualification: Across three Qwen2.5-1.5B seeds, a control that ranked training steps only by gradient magnitude reached 4.2 to 4.5 times chance and matched or beat the best targeted estimator on two seeds. ## 17. Untruthful Prompts Used More Reasoning Tokens {#mp-2026-10-08-015} - Story ID: `mp-2026-10-08-015` - Type: `ticker` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-015/untruthful-prompts-used-more-reasoning-tokens **Dek:** Three models spent more tokens when explicitly told to lie or ignore truth, a group-level signal that is not yet a deception detector. Across 210 multiple-choice questions, truth-directed responses used fewer reasoning tokens than lie-directed or truth-indifferent responses in all three tested reasoning models. The result does not establish instance-level detection, spontaneous deception or robustness under adversarial pressure; it identifies a content-independent candidate signal for future study. ### Why it matters {#why-it-matters-mp-2026-10-08-015} Three models spent more tokens when explicitly told to lie or ignore truth, a group-level signal that is not yet a deception detector. ### Limits and context {#limitations-mp-2026-10-08-015} - The result does not establish instance-level detection, spontaneous deception or robustness under adversarial pressure; it identifies a content-independent candidate signal for future study. ### Claims and sources {#claims-mp-2026-10-08-015} - Three models spent more tokens when explicitly told to lie or ignore truth, a group-level signal that is not yet a deception detector. [source-2026-10-08-017] — Qualification: The result does not establish instance-level detection, spontaneous deception or robustness under adversarial pressure; it identifies a content-independent candidate signal for future study. ## 18. The Best Robot Explored Too Little {#mp-2026-10-08-016} - Story ID: `mp-2026-10-08-016` - Type: `ticker` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-016/the-best-robot-explored-too-little **Dek:** RoboQuest's strongest multimodal agent completed only 23% of tasks requiring search, inspection or interactive testing. The benchmark separates hidden-information discovery from basic execution. Agents could often perform the component actions when the missing fact was supplied, yet commonly committed before gathering required evidence and rarely repaired disturbances caused during exploration. A policy fine-tuned on full episodes almost never succeeded. ### Why it matters {#why-it-matters-mp-2026-10-08-016} RoboQuest's strongest multimodal agent completed only 23% of tasks requiring search, inspection or interactive testing. ### Limits and context {#limitations-mp-2026-10-08-016} - No additional limitation was separately recorded. ### Claims and sources {#claims-mp-2026-10-08-016} - RoboQuest's strongest multimodal agent completed only 23% of tasks requiring search, inspection or interactive testing. [source-2026-10-08-018] ## 19. Two-Bit Residuals Cut Looped-Transformer Cache Storage {#mp-2026-10-08-017} - Story ID: `mp-2026-10-08-017` - Type: `ticker` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-017/two-bit-residuals-cut-looped-transformer-cache-storage **Dek:** ResidualQuant used final-loop states as a reference and encoded similar earlier loops as low-precision differences. Mixed-precision tests retained accuracy near BF16 while reducing theoretical KV storage 80.7%. On an RTX 5090, lower memory traffic improved fixed-batch decode throughput up to 2.73 times and the larger feasible batch raised peak throughput up to 4.15 times in the reported models. ### Why it matters {#why-it-matters-mp-2026-10-08-017} ResidualQuant used final-loop states as a reference and encoded similar earlier loops as low-precision differences. ### Limits and context {#limitations-mp-2026-10-08-017} - No additional limitation was separately recorded. ### Claims and sources {#claims-mp-2026-10-08-017} - ResidualQuant used final-loop states as a reference and encoded similar earlier loops as low-precision differences. [source-2026-10-08-019] ## 20. A Blind Control Beat the Adaptive Layer Program {#mp-2026-10-08-018} - Story ID: `mp-2026-10-08-018` - Type: `ticker` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-018/a-blind-control-beat-the-adaptive-layer-program **Dek:** Multiple-choice headroom survived even when perturbations ignored the input, exposing option order as a confound. Across two models and 4,413 items, input-blind controls produced more oracle headroom than the real layer programs in the primary shared-order comparisons. Rotating answer options sharply reduced both. The authors argue that selection gain alone does not identify a computation-specific benefit. ### Why it matters {#why-it-matters-mp-2026-10-08-018} Multiple-choice headroom survived even when perturbations ignored the input, exposing option order as a confound. ### Limits and context {#limitations-mp-2026-10-08-018} - The authors argue that selection gain alone does not identify a computation-specific benefit. ### Claims and sources {#claims-mp-2026-10-08-018} - Multiple-choice headroom survived even when perturbations ignored the input, exposing option order as a confound. [source-2026-10-08-020] — Qualification: The authors argue that selection gain alone does not identify a computation-specific benefit. ## 21. Quantum Semantics Found Forty Confirmed Library Bugs {#mp-2026-10-08-019} - Story ID: `mp-2026-10-08-019` - Type: `ticker` - Classification: `editorial` - Content status: `new` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-019/quantum-semantics-found-forty-confirmed-library-bugs **Dek:** QuSema used documentation and domain constraints as an oracle for silent implementation errors in Qiskit and PennyLane. On twenty historical silent bugs, the agent achieved higher mean relocation counts than two general coding agents in the authors' setup. It also reported forty previously unknown bugs confirmed by developers, thirty of them silent rather than crashes, by turning semantic mismatches into executable tests. ### Why it matters {#why-it-matters-mp-2026-10-08-019} QuSema used documentation and domain constraints as an oracle for silent implementation errors in Qiskit and PennyLane. ### Limits and context {#limitations-mp-2026-10-08-019} - No additional limitation was separately recorded. ### Claims and sources {#claims-mp-2026-10-08-019} - QuSema used documentation and domain constraints as an oracle for silent implementation errors in Qiskit and PennyLane. [source-2026-10-08-021] ## 22. Space Drums 2.0 {#mp-2026-10-08-020} - Story ID: `mp-2026-10-08-020` - Type: `invention_desk` - Classification: `editorial` - Content status: `carried_over` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-020/space-drums-2-0 **Dek:** Moves motion tracking onto two ESP32-S3 drumsticks, adds haptic hits and a two-pedal hub, and sends velocity-sensitive drum events to open PC or Android playback software. Moves motion tracking onto two ESP32-S3 drumsticks, adds haptic hits and a two-pedal hub, and sends velocity-sensitive drum events to open PC or Android playback software. ### Why it matters {#why-it-matters-mp-2026-10-08-020} An independent builder is turning an improbable idea into a working project. ### Limits and context {#limitations-mp-2026-10-08-020} - A Desk Pick is an editorial selection, not a product endorsement. ### Claims and sources {#claims-mp-2026-10-08-020} - This Invention Desk entry makes no independently sourced news claim. ## 23. 3RIC {#mp-2026-10-08-021} - Story ID: `mp-2026-10-08-021` - Type: `invention_desk` - Classification: `editorial` - Content status: `carried_over` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-021/3ric **Dek:** Pairs a chip-level 65C02 computer with custom hardware, video, sound, floppy, and microSD support with a cycle-honest emulator and browser assembler built around the same machine. Pairs a chip-level 65C02 computer with custom hardware, video, sound, floppy, and microSD support with a cycle-honest emulator and browser assembler built around the same machine. ### Why it matters {#why-it-matters-mp-2026-10-08-021} An independent builder is turning an improbable idea into a working project. ### Limits and context {#limitations-mp-2026-10-08-021} - A Desk Pick is an editorial selection, not a product endorsement. ### Claims and sources {#claims-mp-2026-10-08-021} - This Invention Desk entry makes no independently sourced news claim. ## 24. M3-CRETE {#mp-2026-10-08-022} - Story ID: `mp-2026-10-08-022` - Type: `invention_desk` - Classification: `editorial` - Content status: `carried_over` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-022/m3-crete **Dek:** Publishes a pallet-scale cartesian motion reference, CAD, BOM, and low-voltage controls for supervised cementitious-extrusion research while explicitly excluding certified structural use. Publishes a pallet-scale cartesian motion reference, CAD, BOM, and low-voltage controls for supervised cementitious-extrusion research while explicitly excluding certified structural use. ### Why it matters {#why-it-matters-mp-2026-10-08-022} An independent builder is turning an improbable idea into a working project. ### Limits and context {#limitations-mp-2026-10-08-022} - A Desk Pick is an editorial selection, not a product endorsement. ### Claims and sources {#claims-mp-2026-10-08-022} - This Invention Desk entry makes no independently sourced news claim. ## 25. DeskNode {#mp-2026-10-08-023} - Story ID: `mp-2026-10-08-023` - Type: `invention_desk` - Classification: `editorial` - Content status: `carried_over` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-023/desknode **Dek:** Turns a bare ESP32-S3 touchscreen into a USB-connected desk instrument for PC activity and optional room temperature, humidity, and light measurements. Turns a bare ESP32-S3 touchscreen into a USB-connected desk instrument for PC activity and optional room temperature, humidity, and light measurements. ### Why it matters {#why-it-matters-mp-2026-10-08-023} An independent builder is turning an improbable idea into a working project. ### Limits and context {#limitations-mp-2026-10-08-023} - A Desk Pick is an editorial selection, not a product endorsement. ### Claims and sources {#claims-mp-2026-10-08-023} - This Invention Desk entry makes no independently sourced news claim. ## 26. The First Paid Slot {#mp-2026-10-08-024} - Story ID: `mp-2026-10-08-024` - Type: `invention_desk` - Classification: `house_example` - Content status: `carried_over` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-024/the-first-paid-slot **Dek:** A transparent preview of paid placement with one verified link and no claim of endorsement. A transparent preview of paid placement with one verified link and no claim of endorsement. House example - no advertiser paid. Payment will buy placement, never endorsement. ### Why it matters {#why-it-matters-mp-2026-10-08-024} This placement explains how builders can appear in The Invention Desk without purchasing editorial endorsement. ### Limits and context {#limitations-mp-2026-10-08-024} - House example - no advertiser paid. Payment will buy placement, never endorsement. ### Claims and sources {#claims-mp-2026-10-08-024} - This Invention Desk entry makes no independently sourced news claim. ## 27. Put Your Project on the Desk {#mp-2026-10-08-025} - Story ID: `mp-2026-10-08-025` - Type: `invention_desk` - Classification: `house_example` - Content status: `carried_over` - Permanent URL: https://themachinepress.com/story/mp-2026-10-08-025/put-your-project-on-the-desk **Dek:** One manually reviewed placement stays active for seven days and remains separate from Desk Picks. One manually reviewed placement stays active for seven days and remains separate from Desk Picks. Manual intake only. Payment buys placement, never endorsement, and every submission is reviewed. ### Why it matters {#why-it-matters-mp-2026-10-08-025} This placement explains how builders can appear in The Invention Desk without purchasing editorial endorsement. ### Limits and context {#limitations-mp-2026-10-08-025} - Manual intake only. Payment buys placement, never endorsement, and every submission is reviewed. ### Claims and sources {#claims-mp-2026-10-08-025} - This Invention Desk entry makes no independently sourced news claim. ## Normalized sources - **source-2026-10-08-001:** [arXiv preprint 2610.10526](https://arxiv.org/abs/2610.10526) — arXiv; primary_research - **source-2026-10-08-002:** [arXiv preprint 2610.10311](https://arxiv.org/abs/2610.10311) — arXiv; primary_research - **source-2026-10-08-003:** [arXiv preprint 2610.10538](https://arxiv.org/abs/2610.10538) — arXiv; primary_research - **source-2026-10-08-004:** [arXiv preprint 2610.10536](https://arxiv.org/abs/2610.10536) — arXiv; primary_research - **source-2026-10-08-005:** [arXiv preprint 2610.10534](https://arxiv.org/abs/2610.10534) — arXiv; primary_research - **source-2026-10-08-006:** [arXiv preprint 2610.10533](https://arxiv.org/abs/2610.10533) — arXiv; primary_research - **source-2026-10-08-007:** [arXiv preprint 2610.10531](https://arxiv.org/abs/2610.10531) — arXiv; primary_research - **source-2026-10-08-008:** [arXiv preprint 2610.10528](https://arxiv.org/abs/2610.10528) — arXiv; primary_research - **source-2026-10-08-009:** [arXiv preprint 2610.10524](https://arxiv.org/abs/2610.10524) — arXiv; primary_research - **source-2026-10-08-010:** [arXiv preprint 2610.10519](https://arxiv.org/abs/2610.10519) — arXiv; primary_research - **source-2026-10-08-011:** [arXiv preprint 2610.10513](https://arxiv.org/abs/2610.10513) — arXiv; primary_research - **source-2026-10-08-012:** [arXiv preprint 2610.10498](https://arxiv.org/abs/2610.10498) — arXiv; primary_research - **source-2026-10-08-013:** [arXiv preprint 2610.10478](https://arxiv.org/abs/2610.10478) — arXiv; primary_research - **source-2026-10-08-014:** [arXiv preprint 2610.10455](https://arxiv.org/abs/2610.10455) — arXiv; primary_research - **source-2026-10-08-015:** [arXiv preprint 2610.10426](https://arxiv.org/abs/2610.10426) — arXiv; primary_research - **source-2026-10-08-016:** [arXiv preprint 2610.10422](https://arxiv.org/abs/2610.10422) — arXiv; primary_research - **source-2026-10-08-017:** [arXiv preprint 2610.10405](https://arxiv.org/abs/2610.10405) — arXiv; primary_research - **source-2026-10-08-018:** [arXiv preprint 2610.10388](https://arxiv.org/abs/2610.10388) — arXiv; primary_research - **source-2026-10-08-019:** [arXiv preprint 2610.10381](https://arxiv.org/abs/2610.10381) — arXiv; primary_research - **source-2026-10-08-020:** [arXiv preprint 2610.10368](https://arxiv.org/abs/2610.10368) — arXiv; primary_research - **source-2026-10-08-021:** [arXiv preprint 2610.10258](https://arxiv.org/abs/2610.10258) — arXiv; primary_research