PAPER PLAINE

Fresh research, simply explained. Updates twice daily.

SciFigQual-Bench: A Benchmark for Scientific Figure Quality Assessment with Full-Manuscript Context

Teaching AI to judge whether scientific figures actually support their claims

Researchers created a benchmark of over 6,300 scientific figures from top computer-science papers, each scored by experts on five qualities: clarity, layout, how well captions match images, relevance to the text, and whether the figure misleads. They then built an AI system that learned to evaluate figures the same way humans do, achieving 93% consistency with expert judgment—significantly better than existing image-quality tools, which weren't designed for scientific content.

Scientific papers rely on figures to communicate results, but no automated system has existed to catch figures that are unclear, mislabeled, or misleading. This benchmark and AI tool could help journal editors and researchers spot problematic figures before publication, reducing the spread of poorly presented—or even deceptive—research findings.

Dead Reckoning: Counting Your Customers Who Never Say Goodbye

Why companies can't really know how many customers they still have

When customers stop buying without announcement, companies use statistical models to guess who's still active. But the paper shows these models are fundamentally unreliable: different reasonable assumptions produce customer counts that vary by a factor of 7.6 on the same dataset, even when predictions about near-term purchases match closely. The problem isn't bad math—it's that the models extrapolate infinitely far into the future, where verification is impossible.

Companies use these customer counts for valuation, marketing budgets, and strategic decisions worth millions of dollars. When the same data can justify counts ranging from 3,654 to 27,734 active customers, leadership is making bets on a number with almost no reliable foundation. The paper shows the honest fix: report concrete, verifiable predictions over a fixed time horizon (like "18-month repeat purchase rate") instead of an extrapolated infinity, and if a total count must be given, present it as a wide range rather than false precision.

Where does the criticality live? Early-warning signals are event-heterogeneous across seven crypto-perpetual liquidation cascades

Why crypto crash warnings work differently depending on what triggers them

A study of seven major Bitcoin liquidation crashes found no single early-warning signal that works across all events. Price showed telltale signs of instability before five crashes but completely failed to warn of two sudden news-driven collapses; only a compression in trading order-flow emerged as a consistent (though imperfect) precursor across all events. This suggests crypto crashes fall into at least two different types—those that build up gradually and those triggered suddenly by external shocks—each with its own fingerprint.

Regulators and traders looking for a universal early-warning system for crypto derivatives crashes won't find one. The October 2025 crash, which wiped out 19 billion dollars, defied the most commonly cited warning signal. Understanding that different crashes have different signatures means any real-world alarm system would need to watch multiple indicators simultaneously and adapt its logic based on market conditions—a harder engineering problem than existing proposals assume.

π\mathbf{R}^2: Reactive Real-time Flow Policies

Making robot control policies react fast enough to handle the unexpected

Current AI-powered robot controllers plan their moves in chunks and can't adjust mid-action, making them clumsy when things change unexpectedly. Researchers created πR², a new approach that lets robots react to what they sense right now while keeping powerful AI models and planning for multiple actions at once. On real robots, it replans about 4 times faster than existing methods and improves success rates by up to 30%.

Robots trained with large AI models are increasingly useful, but they've been slow to react to surprises—a dropped object, a shifting surface, an unexpected obstacle. πR² lets them adjust course in real-time without slowing down, using the same powerful models. This means robots could handle messier, less predictable real-world tasks like assembly lines or warehouse work where conditions constantly shift.

AI Strategy: How to Choose What AI Product to Implement

How to pick AI projects worth building before you know if they'll work

Companies often can't tell which AI projects will actually pay off—two projects can look equally promising yet deserve opposite decisions. Researchers at real-estate brokerage Compass showed that a simple framework called expected ROI (eROI) breaks this deadlock by asking three separate questions before building anything: How valuable would it be if it worked? How likely is it to work? And what would implementation cost? This sidesteps the catch-22 that you can't estimate ROI without knowing if a project will succeed, yet can't know without building it first.

Companies waste millions funding AI projects that look good on paper but fail in practice. By separating value, likelihood, and cost into independent judgments, teams can make smarter bets earlier—and avoid costly failures. The framework works even with rough estimates rather than precise numbers, making it practical for any organization deciding where to invest in AI.

OPERA: Offline Policy-guided Expert Routing and Adaptation for Universal Biomedical Image Analysis

One AI model that works across different hospitals without retraining

Researchers created OPERA, a system that combines multiple specialized AI models to analyze medical images from different scanners and hospitals without needing to retrain on new data. By learning how to route each image to the best-suited expert model during a short calibration phase, then adapting slightly at test time, OPERA maintained high accuracy across 9 different medical imaging datasets—including X-rays, CT scans, and MRI images—without the expensive cycle of retraining for each new setting.

Medical AI systems often fail when deployed to new hospitals or scanners because patient populations and imaging protocols differ, forcing expensive and time-consuming retraining. OPERA eliminates this bottleneck: hospitals can deploy the same system across different equipment and patient groups without collecting new labeled data or sharing sensitive patient information. This makes it practical to build robust diagnostic AI that actually works in the real world, where retraining is rarely an option.

MODUS: Decoder-Only Any-to-Any Modeling of Diverse Modalities

One model that turns any type of data into any other type

Researchers built a single AI model that can take any mix of inputs—images, text, audio, numbers—and produce any type of output, without needing specialized parts for each task. The model performs competitively with systems built specifically for individual jobs, while remaining flexible enough to chain outputs together or verify its own answers by generating data in multiple formats.

Most AI systems today are built separately for each task—one for image-to-text, another for audio-to-image, and so on. A single unified model cuts engineering complexity and lets researchers in fields like astronomy or ecology build multimodal systems without training from scratch each time. The open-source release means these tools are immediately available to scientists and companies working across different data types.

Iterate Wronskians over \mathbb{R}^d as N-ary brackets on \mathbb{R}[x^1,\ldots,x^d]: the N-bonacci numbers bound the highest total degrees

How fast polynomials grow when you repeatedly apply a mathematical operation

Mathematicians proved that when you repeatedly apply a certain algebraic operation to polynomials, their complexity grows no faster than a specific sequence called the N-bonacci numbers. In special cases, polynomials actually reach this maximum growth rate, showing the bound is tight.

Understanding growth rates of polynomial operations matters for computer algebra systems and symbolic computation, where knowing worst-case complexity helps optimize algorithms. This result provides a provable ceiling on how quickly these operations can spiral in complexity, which improves estimates for computational cost and feasibility.

GraphIDyOM: A graph-native Python reimplementation of IDyOM for musical expectation modelling

Making a music prediction model easier to use and understand

A researcher rebuilt a widely-used model that predicts what note comes next in music, translating it from an outdated programming language into modern Python. The new version exposes how the model stores and retrieves memories, making it possible to inspect, visualize, and modify the internal workings that drive its predictions.

IDyOM is the standard tool for testing theories about how humans anticipate music, but its technical barriers meant most researchers couldn't easily modify or integrate it into their own work. GraphIDyOM removes those barriers, potentially accelerating research into musical cognition, improving music recommendation systems, and enabling new interactive applications that respond to listener expectations in real time.

Agentic Permissions Policy Algebra for Taint Confinement in LLM Agents

Letting AI agents safely explore risky data without locking up their entire memory

Large language model agents that handle mixed sensitive and public data are vulnerable to attacks that trick them into leaking secrets. A new security framework called APPA lets agents temporarily explore untrusted information in a sandboxed branch of their reasoning, then safely bring back only cleaned results to their main context—blocking data theft attempts that were successful 31–50% of the time while recovering much of the work capacity that traditional security methods sacrifice.

Autonomous AI agents are increasingly deployed to access real databases, customer records, and proprietary documents. A system that cuts successful data theft from one-in-three attempts to near zero while keeping agents useful enough to do their jobs makes it practical to deploy them on mixed public-private data without choosing between security and function.

Denial of Deadline: Network-Driven Accuracy Collapse in Distributed Inference Pipelines

How attackers can sabotage AI predictions by slowing down the system

Researchers discovered that distributed AI systems combining fast and slow prediction paths are vulnerable to a new type of attack: an attacker can flood the network with dummy requests to delay the slow, accurate path so badly that predictions arrive too late to be used. In a self-driving car test, 4,000 burst requests increased decision latency from 92 milliseconds to 2 seconds, cutting the accuracy benefit of the slower path in half and reducing object detection quality by 7 percentage points on average—with some rare objects like stop signs losing nearly half their detection accuracy.

Modern AI systems designed to be both fast and accurate rely on a backup slow path to improve predictions when time allows. This research reveals they can be attacked without stealing any model secrets or user data—only by congesting shared resources. Self-driving cars, drones, and other safety-critical systems using this architecture could fail to detect important objects in attacks, raising serious security questions for systems already deploying these hybrid inference designs.

Frequency-Based Reservoir computing

Building smarter prediction machines by copying how the brain handles rhythms

A new approach to reservoir computing—a fast machine learning technique for forecasting time series—organizes the internal processing around frequencies instead of random connections. By modeling the system as independent oscillators tuned to different frequencies, the method performs as well as or better than traditional random reservoirs and can actually be optimized to improve short-term predictions, something random reservoirs cannot do.

Reservoir computing is already used for real-time forecasting in weather, finance, and engineering systems because it trains faster than deep neural networks. This frequency-based design makes it work better while also becoming interpretable—you can actually understand why it makes specific predictions—rather than operating as a black box. That combination of speed, accuracy, and explainability matters for applications where you need both reliable forecasts and the ability to trust why the system made them.