PAPER PLAINE

Most robot hands today can handle rigid objects but struggle with tools that bend, rotate, or have moving joints—the very tools humans use daily. This work opens the door to robots performing practical manipulation tasks in homes, factories, and repair shops, where articulated tools are ubiquitous. The approach is also efficient: it generates its own training data automatically, meaning new tools can be added without expensive manual setup.

Databases and financial ledgers often rely on untrusted third parties to maintain sorted data correctly. This method lets an auditor verify that data hasn't been corrupted or manipulated without storing a copy of the entire dataset—critical for systems where storage is expensive or memory is constrained, like blockchain systems or distributed databases.

Quantum computing advocates have hoped quantum machines could dramatically outperform classical ones on certain optimization problems. This work draws a precise line: quantum advantage exists only in small constant factors, not in the scaling that matters for large, practical problems. For researchers building quantum algorithms, it means effort should focus on optimizing these constant improvements rather than chasing exponential speedups that the mathematics now shows are unreachable.

As AI systems tackle harder reasoning problems—from math competitions to scientific discovery—the ability to recognize when two seemingly different problems require the same solution strategy becomes critical. This work provides a concrete way to improve AI reasoning without needing bigger models or better reward signals, suggesting a practical path to more capable problem-solving systems at smaller model sizes.

Biological experiments are expensive and produce limited data points, so extracting reliable mechanistic rules from them is critical for everything from disease modeling to drug design. Most current AI approaches assume all noise looks the same, which often misses real biological complexity and leads to wrong predictions. This framework lets researchers automatically discover what kind of variability they're actually dealing with, improving confidence in conclusions drawn from small, expensive datasets.

As universities and companies race to use AI for research, blindly trusting AI outputs can publish false findings that waste resources and mislead policy. This framework shows that reliability doesn't require better AI alone—it requires better workflow design, with specific checkpoints where human judgment stops bad analyses before they reach publication. The method is practical enough to deploy today with existing tools.

As AI tools for creative work become more common, understanding which methods work best for music composition matters for building better music generation software. The findings show that simpler, more direct approaches (autoregressive models) currently outperform more complex ones for this task—a lesson that could guide how developers choose tools for other creative AI applications.

Healthcare networks can now collaborate on AI without fear that one compromised hospital or malicious participant will corrupt the shared model, and they can honor patient privacy requests by surgically erasing a departed hospital's contribution in under a second rather than retraining from scratch. This removes a major legal and trust barrier to the kind of multi-hospital AI training that could improve rare disease diagnosis and treatment.

Financial traders and risk managers currently price options using models that assume steady time flow, but real markets operate in bursts — some moments see hundreds of trades, others see none. This work provides a concrete way to account for that variable rhythm, potentially improving how banks price derivatives and manage hedging when market activity is thin or uneven. It also clarifies which types of market risk standard models fail to capture, which matters for both regulators assessing systemic risk and traders avoiding blind spots.

Graph neural networks power recommendation systems, drug discovery, and social network analysis. Practitioners use truncated encodings because full versions are too slow, but now know this tradeoff weakens the network's ability to distinguish between different graph structures. Teams building production systems can use these findings to either choose truncated encodings more strategically or invest in combining multiple types to recover lost performance.

Control engineers routinely work with nonlinear systems (robots, aircraft, power grids) that are hard to analyze and control. If a system can be Koopman linearized, standard linear control techniques become available, making design faster and more reliable. These geometric conditions let engineers quickly determine whether linearization will work for their specific system, avoiding wasted effort on impossible transformations.

Network defenders typically evaluate security through operational testing alone, which misses systematic vulnerabilities. This framework provides a formal guarantee—a mathematical proof—that a network design either can or cannot be defended given specific constraints, catching architectural flaws before deployment. The approach also revealed that networks can look formally secure on paper while failing in real adversarial play, meaning defenders now have two complementary lenses instead of one.