PAPER PLAINE

Fresh research, simply explained. Updates twice daily.

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.

Co-Learning for Missing Arbitrary Modalities in Multi-modal Classification

Training AI systems that work even when some data sources suddenly disappear

Machine learning systems that combine multiple data sources—like text, images, and audio—perform better than those using a single source. But real systems often lose access to some sources unpredictably due to sensor failures or privacy concerns. Researchers developed a framework where different data sources learn to help each other compensate for missing information, and tested it on systems missing anywhere from one to nearly all of their data sources.

Autonomous vehicles, medical diagnostics, and industrial monitoring systems rely on multiple sensors and data types working together. When one component fails—a camera goes dark, a sensor malfunctions, or privacy rules block access to certain data—current systems often collapse. This approach lets systems keep working reasonably well even when critical data sources vanish unexpectedly, making real-world AI deployments more reliable and cheaper to maintain.

Are cryptocurrencies real financial bubbles? Evidence from quantitative analyses

When cryptocurrency prices detach from reality and crash

Bitcoin and Ether show unmistakable mathematical signatures of financial bubbles—periods where prices spiral far beyond what fundamentals justify—weeks before they actually crash. Using models originally designed to detect stock market bubbles, researchers identified bubble conditions in Bitcoin during December 2017 and January 2018, and in Ether in June and January 2018, each time followed by major price collapses.

Cryptocurrencies remain largely driven by investor mood rather than underlying value, making them vulnerable to sudden crashes that can wipe out retail investors. These mathematical detection methods could help traders and fund managers spot dangerous bubble conditions before prices implode, offering a way to quantify the real risk in a market that often feels like pure speculation.

Coincidence free certification and quantification of spatial entanglement with stimulated parametric down conversion

Testing quantum entanglement using simple light measurements instead of rare coincidences

Physicists have found a way to verify that pairs of photons are quantum-entangled without waiting around for the notoriously difficult task of catching both photons at the detector simultaneously. By flooding one part of the photon pair with bright classical light and measuring what comes out, they can now certify entanglement using ordinary intensity measurements—the same kind a simple camera makes. The team demonstrated this works across the full spatial properties of the photon pairs.

Most quantum light sources are painfully slow to characterize because coincidence counting—detecting both photons in a pair at the same instant—requires either waiting a very long time or using expensive, finicky equipment. This new method trades that bottleneck for a straightforward intensity measurement, making it practical to quickly assess and optimize photon pair sources in labs where space or budget is tight, or where getting perfect alignment is difficult.

Opaque Epistemic Mediation: How LLM Deployment Configurations Shape the Validation of Pseudo-Science

Why the same AI gives wildly different answers about fringe science claims

When researchers asked four major AI systems to evaluate a pseudo-scientific claim about human genetics, they got strikingly different answers—and the same AI sometimes contradicted itself depending on how it was accessed or when it was tested. Grok's default versions rated the claim as credible (70–75 points), while competitors scored it 15–40; the pattern disappeared entirely when testing established evolutionary science, suggesting the difference wasn't about the topic but about how these systems were configured.

People increasingly turn to AI for factual questions, often trusting its answers as authoritative. This research shows that AI systems can validate fringe or false claims depending on invisible internal settings—system prompts, safety filters, updates—that neither users nor independent researchers can see. Without transparency about how these configurations shape what AI calls credible, the public has no way to know when they're getting filtered answers or how much to trust them.

A Hierarchical Likelihood Model for Non-linear Inverse Problems under Additive and Multiplicative Noise

Recovering hidden information when measurements are noisy and incomplete

When scientists try to reconstruct hidden information from messy, real-world measurements, they face a thorny problem: the data contains multiple types of noise and gaps. This paper presents a mathematical framework and efficient algorithm that handles all these complications at once, without requiring tedious manual tuning. Tests on astronomical data show it outperforms existing methods in both accuracy and speed.

Inverse problems appear everywhere—from medical imaging to geophysics to astronomy—where researchers must infer what they can't directly observe from imperfect measurements. Previous approaches required researchers to either ignore some noise sources or manually calibrate workaround models, both of which degrade results. This method automates the process and handles realistic conditions more faithfully, letting scientists spend time on science rather than fitting their tools.

Data Driven Modeling of Nonlinear Dynamics in a Rotating Detonation Combustor via Finite Dimensional Approximations of the Koopman Operator

Using math to untangle the chaotic waves inside experimental rocket engines

Researchers used high-speed video of flame patterns inside a rotating detonation engine to build mathematical models that predict how the combustion waves behave. By applying a technique called Koopman operator theory to the flame data, they could break down complex, nonlinear wave interactions into simpler, understandable pieces—even capturing standing wave patterns and noise that standard methods miss.

Rotating detonation engines could be significantly more efficient than conventional combustors, but engineers first need to predict and control their unpredictable wave behavior. These models provide a practical tool to understand what's happening inside the engine in real time, which is essential for tuning operating conditions and preventing unwanted vibrations or instability that could damage hardware.

Dynamic Capability Scoping for Enterprise AI Agents: A Synthetic Dataset and Three-Source Permission Architecture

Giving AI assistants only the permissions they need for each specific task

AI systems at companies typically get access to all tools they might ever need, creating a security gap if the AI goes rogue or gets hacked. Researchers designed a three-layer system that dynamically grants AI agents only the specific permissions required for their current task, and created a dataset of 600 realistic enterprise tasks labeled with minimum required permissions to test this approach. The method reduced security violations by 93% when refined alongside company policies.

Enterprise AI agents increasingly handle sensitive operations across finance, HR, and infrastructure. If an AI agent is compromised or behaves unpredictably, having unnecessary access credentials could let it cause real damage—transfer funds, delete records, or expose private data. Dynamic permission scoping shrinks that window of potential harm by default, rather than relying on detecting bad behavior after it happens. The released dataset gives security teams a concrete way to test whether their AI agents are respecting proper access boundaries.

Universal BCI Personalization: One API for Frozen EEG Trunks and Foundation Models

One standardized adapter for brain-computer interfaces across incompatible models

Brain-computer interfaces rely on machine learning models trained to decode brain signals, but each model type requires its own custom personalization approach — making it expensive and slow to support multiple architectures. This paper presents Nimbus Personalizer, a single standardized adapter that works across five different model types and four datasets without modification, recovering most of the accuracy gains of full retraining while using a fraction of the calibration time.

Brain-computer interface companies currently need to build separate personalization pipelines for each model they want to support. A universal adapter means they can integrate once and swap between models freely as technology improves, cutting engineering complexity and time-to-market. For users, faster calibration means less time in the setup chair before the system is ready to use.

Measuring inequality and social stratification with Lorenz curvature

A new way to measure inequality using the shape of wealth distribution curves

Researchers created a new family of tools for measuring economic inequality by analyzing the curvature of Lorenz curves, which visualize how wealth is distributed across a population. The approach only fully satisfies standard inequality principles when set to its simplest form, and when tested against World Bank data across countries, it produces different rankings than existing inequality measures—especially for income-based comparisons.

Inequality measurements guide policy decisions on taxation, welfare, and development aid, so how we measure it shapes real outcomes for millions of people. This new method offers a mathematically cleaner alternative that could challenge current rankings of which countries are most unequal, potentially shifting where international attention and resources focus. The approach is also practical: its simplest version has a closed-form solution that makes calculations straightforward rather than computationally intensive.