PAPER PLAINE

Fresh research, simply explained. Updates twice daily.

Optimal Block Time for AMM Liquidity Providers under Jump-Diffusion Prices

Why making blockchain blocks faster doesn't always help liquidity providers

When prices jump suddenly instead of moving smoothly, making blockchain blocks faster stops helping liquidity providers avoid losses at a certain point. Researchers found that roughly one-quarter of losses at Ethereum come from these sudden price jumps that no block speed can prevent, and this fraction grows even larger on faster chains like Solana.

Blockchain developers often assume faster blocks help protect traders who provide liquidity to exchanges, but this research shows there's a hard limit to what speed can achieve. The optimal block time turns out to be around 8 seconds regardless of how big the pool is or how volatile prices are—meaning some losses are structural to markets with sudden price movements and cannot be engineered away.

Properties of the \mathcal V-Monoid of Weighted Leavitt Path Algebras

When do algebraic structures built from weighted graphs behave predictably?

Mathematicians studying weighted Leavitt path algebras—algebraic structures built from graphs with numbered edges—have identified when certain key properties hold or fail. The work characterizes exactly when these algebras can be simplified without losing information, and when their building blocks can be cancelled out like numbers in multiplication.

Leavitt path algebras appear in operator theory, symbolic dynamics, and quantum physics. Understanding when these algebras have predictable structural properties lets mathematicians and physicists apply them reliably in theory and computation, and simplifies the problem of determining when two seemingly different weighted graphs produce equivalent algebraic structures.

ContextPilot: Teaching Agents for Proactive Context Management via Fine-grained RL

Teaching AI agents to organize their own memory while solving complex tasks

Researchers created ContextPilot, a system that lets AI language models actively manage and compress their own working memory as they solve multi-step problems. The approach adds new memory-management tools and a smarter training method that rewards the most impactful decisions, allowing models to reach better answers while keeping their context 30–50% smaller than before.

As AI agents tackle longer and more complex tasks, they accumulate massive amounts of context that slows them down and costs more to run. By teaching models to edit their own memory intelligently, ContextPilot makes them faster and cheaper to operate without sacrificing accuracy—a practical gain for any real-world AI system handling lengthy customer conversations, research queries, or multi-step planning.

An Anonymized Urn-Based Experimental Dataset on Decision-Making under Risk and Ambiguity

How people bet differently when odds are clear versus murky

Researchers collected 4,486 decisions from 246 people choosing how much to wager on colored balls drawn from urns—sometimes with known odds, sometimes with unknown odds. The dataset reveals how people's willingness to pay shifts when uncertainty becomes ambiguous rather than simply risky, with online participants also rating how uncertain they felt about each choice.

Understanding how people behave under ambiguous uncertainty matters for everything from financial regulation to insurance pricing to public health policy, where real decisions often involve incomplete information. This dataset is large and detailed enough that researchers can now test competing theories about ambiguity-aversion side by side, and replicate findings that might otherwise stay trapped in individual labs.

Optimal Adversarial Testing: Extracting Honest Test Results from Dishonest Test Takers

How to design fair tests that work even when people cheat

When test takers cheat—especially using AI—honest results become impossible to trust. Researchers developed a strategy that identifies likely cheaters and retests them with harder security measures, using dynamic programming to figure out the cheapest and most effective way to catch and correct dishonest answers.

As cheating becomes more sophisticated and widespread, exams and performance evaluations risk becoming useless. This approach lets institutions maintain test validity without throwing out results or suspecting everyone—crucial for hiring, admissions, and quality control where a few bad actors can corrupt decisions affecting thousands of people.

Acquire, Repair, Preserve: A Diagnosis-Guided Post-Training Recipe for Small-Model Dialogue Game Agents

Teaching small AI models to play dialogue games without forgetting what they just learned

A small 2-billion-parameter AI model trained on dialogue games improved its performance roughly 4-fold by fixing three specific problems: it didn't participate in enough game scenarios, it kept making the same mistakes within conversations, and it sometimes ignored feedback it had just received. The researchers used targeted retraining to address each issue, raising the model's score from 10.67 to 38.92 on a standard benchmark.

Dialogue games reveal weaknesses that static tests miss—a model must track what's happened, follow new rules, and adapt to feedback. This work shows that small, accessible models can reach usable performance with the right training approach, making interactive AI applications feasible without massive computational resources. However, the method still struggles with completely new game variants, suggesting that true flexibility remains a hard problem.

Neuromorphic architectures as numerical solvers for computational neuroscience

Making brain-mimicking computers work for models without electrical spikes

Neuromorphic computers—machines designed to work like brains—are typically built around artificial neurons that fire spikes, like real neurons do. This paper shows that a different class of brain models, which simulate neurons as continuously changing signals rather than discrete pulses, can run more efficiently on neuromorphic hardware using specialized numerical techniques. The researchers converted an existing neuromorphic chip into a "spikeless" system and demonstrated it uses less energy and produces less delay than standard approaches.

Most neuromorphic chips today are engineered around spike-based computation, which doesn't match how many brain-inspired models actually work. This research expands what problems neuromorphic hardware can solve efficiently, potentially unlocking its use for broader classes of neuroscience simulations and AI applications that currently require conventional computers. For researchers running large-scale brain simulations, this could mean significantly lower power consumption.

Learning a Size-Weight Frontier for Synthetic-Augmented Inference

How much fake data can you safely mix with real data?

When researchers use synthetic data to fill gaps in real observations, they risk getting wrong answers if they're not careful about how much synthetic data to use. This paper presents a method that identifies exactly how many synthetic samples can be safely mixed with real data—and at what weight—while still producing reliable results. In tests combining AI-generated responses with real survey data, the approach maintained accuracy while shrinking confidence intervals by substantial margins.

Synthetic data is cheap and fast to generate, but mistakes in using it waste time and money on flawed conclusions. This framework lets practitioners know precisely when they can trust their results, making it practical to combine real and synthetic data without guessing about reliability. For surveys, medical studies, and other research constrained by small sample sizes, this could make the difference between usable insights and misleading ones.

WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution

Teaching AI agents to remember and reuse what they learn from experience

Researchers built WikiSkill, a system that lets AI agents collect lessons from their past attempts and store them in a shared knowledge base—like a persistent wiki—that improves their problem-solving over time. Agents using WikiSkill solved tasks better than those without, and smaller AI models equipped with evolved skills outperformed much larger models that lacked them.

As AI systems tackle more complex problems, they waste enormous computational effort rediscovering solutions repeatedly. WikiSkill lets agents build and share knowledge efficiently, so each new problem-solving attempt compounds on prior experience. The finding that smaller models with evolved skills beat larger models without them suggests we could accomplish more with less hardware—cutting energy costs and computational waste significantly.

SPA: Securing Persistent LLM Agents Across Queries with Plan-First Information-Flow Control

Protecting AI agents from poisoned data across multiple conversations

AI assistants that remember past work and pull from untrusted websites are vulnerable to attackers who slip malicious data into their memory or sources — then exploit it in future tasks. Researchers built SPA, a system that makes the agent plan out its full approach before executing it, then tracks data flows like a security auditor, stopping poisoned information from reaching sensitive actions. In tests, this reduced successful attacks from common rates down to nearly zero.

As AI agents handle more real work — scheduling, filing forms, accessing accounts — they become targets for attackers who can slip false information into websites or documents the agent reads. A poisoned fact lodged in the agent's memory could reactivate in an unguarded moment weeks later and cause damage. SPA's approach means companies deploying persistent AI agents can do so without accepting uncontrolled security risk from data sources outside their control.

Reflexivity from Hierarchical Causality

How financial markets' top-down rules create self-reinforcing feedback loops

When higher-level market rules constrain what trades are allowed, they create a feedback loop where the rules themselves influence the timing and sequence of trades—which then feeds back up to reshape those same rules. The paper shows that this top-down constraint, combined with how individual trades happen in real time, can generate multiple competing causal pathways even when the underlying trading mechanics follow predictable patterns.

Market reflexivity—where prices influence the rules governing trading, which then change prices—has long been observed but poorly understood mathematically. This framework clarifies how regulatory constraints and trading mechanics interlock to create self-reinforcing market dynamics, which matters for predicting when interventions (like circuit breakers or position limits) will work as intended versus when they'll trigger unintended cascades.

MM-Spectrum: Multimodal Multi-spectral Molecular Structural Elucidation with a Stable MoE Framework

Teaching AI to read molecular fingerprints when some signals are weak or missing

A new AI system called MM-Spectrum can figure out the structure of molecules by combining multiple types of spectroscopic data—like different ways of measuring how molecules absorb light—even when some measurements are weak or unavailable. The key innovation is a routing mechanism that recognizes when different data streams have unequal quality or importance, preventing the system from getting confused by mismatched signals.

Identifying molecular structures is essential in drug discovery, materials science, and chemistry labs, but real-world spectroscopy data is messy and incomplete. This system works reliably even with partial information, which could speed up molecular analysis when some measurement methods fail or produce poor results. It could reduce both the cost and time needed to identify unknown compounds.