This breakthrough represents a significant step towards understanding the origins of life and could pave the way for synthetic biology applications in material science, drug development, and beyond.
First synthetic cell built from scratch that can grow, replicate DNA, and divide
Led by Kate Adamala at the University of Minnesota
Involves lipid membrane, DNA replication system, commercial enzymes for reading DNA and making proteins
Full summary
Researchers led by Kate Adamala at the University of Minnesota have created a synthetic cell from scratch that can grow, replicate its DNA, and divide. This cell, which is not yet self-sustaining, demonstrates the potential to generate life-like behavior from non-living components. The team used lipid membranes, a DNA replication system, and commercial enzymes for reading DNA and making proteins. While it requires constant deliveries of food and ribosomes, this breakthrough could lead to applications in material science, drug development, and understanding the origins of life.
GPT-5.6 Sol introduces significant performance improvements and enhanced safety measures in coding, biology, and cybersecurity tasks, setting a new standard for AI model capabilities.
Details
GPT-5.6 series includes Sol (flagship), Terra (balanced), and Luna (fast and affordable) models
Sol sets state-of-the-art on Terminal-Bench 2.1 and GeneBench v1, with strong cybersecurity performance on ExploitBench² and ExploitGym
Models priced per 1M tokens: Sol ($5 input / $30 output), Terra ($2.50 input / $15 output), Luna ($1 input / $6 output)
OpenAI introduces the GPT-5.6 series with Sol as the flagship model, Terra for balanced performance at half the cost of GPT-5.5, and Luna for strong capabilities at the lowest cost. Sol excels in coding, biology, and cybersecurity tasks, achieving state-of-the-art results on Terminal-Bench 2.1 and GeneBench v1, while demonstrating competitive performance with fewer tokens compared to previous models on ExploitBench² and ExploitGym. The series includes enhanced safety features such as layered safeguards, real-time checks, account-level reviews, and differentiated access, tested through extensive red-teaming efforts. Pricing is tiered based on model capabilities, with Sol priced at $5 input / $30 output per 1M tokens, Terra at $2.50 input / $15 output, and Luna at $1 input / $6 output.
Signature cache co-indexed with KV cache ensures exact signatures under prefix caching
ELDR is an expert-locality-aware decode router designed for PD-disaggregated MoE models. It predicts the experts a request will activate during generation and partitions signature space using balanced K-means offline. Online, it uses locality-band routing to send requests to the least-loaded worker matching their signature. A co-indexed signature cache ensures exact signatures under prefix caching. Evaluated on up to 40 GPUs, ELDR reduces median TPOT by 5.9-13.9% over four load-balancing baselines without changing model outputs.
This work challenges a long-standing theorem in quantum field theory, potentially opening new avenues for constructing viable high-energy physics models.
Details
Counterexample to Ostrogradsky's no-go theorem using four-derivative quantum field theory
Theory is UV-complete with consistent perturbative expansion
Quantization on indefinite state space (Krein space) ensures causality and unitarity
The article presents a counterexample to Ostrogradsky's no-go theorem in quantum field theory by introducing a four-derivative, UV-complete QFT with consistent perturbative expansion. The theory is quantized on an indefinite state space (Krein space) and maintains causality and unitarity through the use of covariant methods. A generalized Born rule for Krein spaces ensures positive transition probabilities despite ghost states, facilitated by a hidden 'ghost parity' symmetry.
ASPIRE represents a significant advancement in autonomous robotics by enabling robots to learn and refine their own control programs through continuous experience.
Details
ASPIRE operates in an open-ended loop with three main components: robot execution engine, skill library, and evolutionary search
Achieves up to 77% improvement on LIBERO-Pro manipulation under perturbation compared to prior methods
Employs a code-as-policy paradigm for autonomous failure diagnosis and repair synthesis
ASPIRE is an innovative continual learning system designed for robotics that autonomously writes and refines robot control programs in a code-as-policy paradigm. It consists of three components: a closed-loop execution engine, a skill library, and evolutionary search mechanisms. ASPIRE outperforms existing methods by up to 77% on LIBERO-Pro manipulation tasks under perturbation conditions and shows evidence of sim-to-real transfer, significantly reducing the effort required for real-robot programming across different embodiments and APIs.
Understanding how delayed verification affects multi-agent LLM belief stability can help improve system reliability and prevent misinformation spread in AI networks.
Details
Models use verifier and critic agents to suppress hallucinations
False claims propagate during verification delay, leading to instability
Spectral decomposition by grounded Laplacian yields a closed-form stability threshold
This paper explores how delayed verification destabilizes multi-agent large language model (LLM) belief systems. It models this process using a graph with grounded corrector nodes and finds that excessive or delayed correction can lead to oscillations rather than consensus. The study identifies an instability threshold, particularly for delay two, which is the inverse golden ratio. Additionally, it suggests a supermodular placement objective for optimal allocation of limited corrector resources and confirms predictions through experiments on five open models.
HeRA offers a novel approach to aligning multimodal representations at the granularity of individual attention heads, potentially improving the accuracy and reliability of multimodal large language models (MLLMs).
Focuses on preserving topological structure using Mutual K-Nearest Neighbor (MKNN) alignment metric
Improves performance on challenging vision-centric tasks across multiple MLLMs and benchmarks
The paper introduces Head-Wise Representation Alignment (HeRA), a method that enforces cross-modal alignment at the level of individual attention heads in multimodal large language models (MLLMs). HeRA uses the Mutual K-Nearest Neighbor (MKNN) alignment metric to preserve topological structure across modalities. Evaluations show that aligning less aligned heads yields significant performance improvements on vision-centric tasks and reduces visual hallucinations by mitigating over-reliance on linguistic priors.