Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Sunday 30 August

Quantum Physics

Quantum Pessiland

Pessiland is a world where NP is hard on average but one-way functions (OWFs) do not exist [Impagliazzo 1995]. Because almost all classical cryptographic primitives imply OWFs [Impagliazzo and Luby 1989], there is almost no classical cryptography in Pessiland. On the other hand, quantum cryptography can exist even when OWFs do not [Kretschmer 2021; Morimae and Yamakawa 2022; Ananth, Qian and Yuen 2022]. Is there a quantum analogue of Pessiland where NP is hard on average but even quantum cryptography does not exist? In this paper, we show that such a miserable world, Quantum Pessiland, exists: there is a quantum oracle relative to which $UP\cap coUP$ is hard on average against quantum polynomial-time algorithms with quantum advice, yet auxiliary-input EFI pairs do not exist. We also show that there is a classical oracle relative to which $UP\cap coUP$ is hard on average against quantum polynomial-time algorithms with quantum advice, yet classically-secure auxiliary-input one-way puzzles (OWPuzzs) do not exist. Almost all quantum cryptographic primitives imply EFI pairs or OWPuzzs, and therefore these results mean that there is almost no quantum cryptography relative to these oracles. We further show that relative to the classical oracle, SampBQP = SampBPP, and therefore there is no sampling-based quantum advantage in Quantum Pessiland. Finally, because our average-case hardness of $UP\cap coUP$ implies $P^{\#P}\not\subseteq i.o.BQP/qpoly$, our result also implies that a non-relativizing proof technique is necessary to construct OWPuzzs solely from $P^{\#P}\not\subseteq i.o.BQP/qpoly$, which gives a partial negative answer to the open problem of [Khurana and Tomer 2025].
Read the full abstract

Computation and Language

CoCoA: Context-Conditional Cultural Alignment for Large Language Models

Large Language Models (LLMs) often favor Western-associated entities across cultural contexts. Conventional debiasing methods aim for uniform neutrality, but cultural bias mitigation demands context-conditional behavior, preferring culturally appropriate entities when cultural cues are present and remaining neutral when they are absent. We propose CoCoA (Context-Conditional Cultural Alignment), a framework that learns this behavior through dual-context training on the same entity pairs under contexts with and without cultural cues. CoCoA combines a contrastive alignment objective with calibration and drift regularization, optimized through goal-aware gradient reconciliation. We evaluate CoCoA on CAMeL and Camellia, two entity-centric cultural bias benchmarks, across ten language settings and four LLMs. CoCoA reduces the Cultural Bias Score from 43 to 24 on average while maintaining near-neutral preferences at 50.2, with minimal impact on general performance across five standard benchmarks. These findings highlight that effective cultural alignment requires context-conditional modeling rather than uniform debiasing, and establish a new direction for mitigating entity-centric cultural bias in LLMs.
Read the full abstract

All authors Kyungdon Lee, Wei Xu, Alan Ritter, Dong-Ho Lee, JinYeong Bak

Statistics Theory

Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality

Although Pollak's minimax formulation is one of the central frameworks in quickest change detection (QCD), the strongest general optimality results available for it are predominantly asymptotic, applying as the average run-length-to-false-alarm constraint, $\gamma$, tends to infinity. Exact results for finite $\gamma$ have previously been available only for special models or restricted regimes. This paper addresses the general finite-$\gamma$ problem over the complete class of randomized, history-dependent stopping rules for i.i.d. change models. The key technical development is a survival-process representation that recasts the optimization of Pollak's minimax criterion over stopping times as an equivalent linear variational optimization over admissible survival processes. Although this formulation is infinite-dimensional, it establishes the existence of an optimizer and provides an exact characterization of the finite-$\gamma$ Pollak minimax value. This characterization, in turn, provides a principled basis for constructing computable stopping rules whose performance can be made arbitrarily close to the optimum. The resulting rules are driven by a recursively updated weighted likelihood-ratio statistic with generally time-varying injections and boundaries. Importantly, this structure is not imposed a priori: the optimization is carried out over the full class of randomized, history-dependent stopping rules, and the Shiryaev–Roberts form emerges naturally from the solution. In particular, the classical Shiryaev–Roberts recursion arises as the time-homogeneous special case. Finally, under a likelihood-ratio floor condition, the framework yields closed-form exact minimax solutions for a nontrivial class of change models.
Read the full abstract

Multiagent Systems

Generalizable Multi-Agent Planning from Signal Temporal Logic Specifications via Diffusion

Multi-agent systems in the real-world (e.g., drone swarms, autonomous cars, warehouse robots) must satisfy rich, temporal tasks while avoiding collisions. Signal Temporal Logic (STL) elegantly encodes such objectives, but current STL planning methods face critical limitations. State-of-the-art optimization-based approaches can handle arbitrary STL specifications but struggle with scalability, becoming computationally impractical as the number of agents grows. Learning-based methods efficiently handle a large number of agents with rapid planning times but fare poorly when deployment-time objectives differ from those used during training, and do not support planning tasks that require different specifications to be ascribed to different agents (i.e., heterogeneity) or team-level specifications requiring coordination of multiple agents. This fundamental trade-off between generalizability and scalability presents a challenge for realizing multi-agent STL planning algorithms in practice. To overcome this challenge, we introduce a new diffusion method for multi-agent planning with STL specifications. Using a differentiable approximation of STL, we integrate the STL gradient in the denoising process, making our approach generalizable to novel formulas whose predicates are placed anywhere within the goal region covered during training, while achieving the same scalability as existing learning-based methods. Our method supports heterogeneous specifications, and by using diffusion models, naturally enhances plan diversity, thereby significantly reducing safety-related violations (e.g., collisions) among agents. A detailed evaluation study justifies the utility of STL-guided diffusion-based multi-agent planners for constructing generalizable, scalable, and diverse plans. Videos and code are available at https://www.jeappen.com/diff-ma-stl/ and https://github.com/jeappen/diff-ma-stl .
Read the full abstract

All authors Joe Eappen, Zikang Xiong, Shreyash S. Iyengar, Suresh Jagannathan

Cryptography and Security

SpatialTrust: A Benchmark for Environmental Risk Recognition in Secure Authentication

Visual environmental risk recognition plays an important role in secure authentication, where a user's surroundings may reveal sensitive information or introduce potential security risks. However, existing evaluations of multimodal large language models (MLLMs) rarely examine whether models can reliably recognize, localize, and explain such risks in spatially grounded authentication scenarios. We present SpatialTrust, a question-answering benchmark for evaluating environmental risk recognition in secure authentication. SpatialTrust assesses five complementary abilities: sensitive factor detection, direct factor identification, indirect factor identification, direct factor explanation, and indirect factor explanation. We evaluate both proprietary and open-source MLLMs and find that current models show limited performance, especially in understanding and explaining indirect risks, indicating that spatial risk awareness remains a challenging capability for MLLMs. In addition, we introduce SpatialTrustGuard, a structured QA-and-audit pipeline that improves Qwen3-VL-30B-A3B-Instruct from 36.78% to 41.12% overall. Our findings highlight the need for dedicated benchmarks and structured inference methods to improve the trustworthiness of MLLMs in secure authentication.
Read the full abstract

All authors Junbin Lu, Hsiang-Wei Huang, Saesha Wadhwa, Yu Ting Hsu, Jenq-Neng Hwang

Theoretical Economics

Conditional Impatience and Concavity of Consumption Functions

Concave consumption functions imply a marginal propensity to consume that falls with wealth. I characterize the utility functions that guarantee this property in finite-horizon optimal saving problems with stochastic discounting, returns, income, and borrowing limits. Under conditional impatience—the conditional expected discounted gross return does not exceed one—consumption functions are always concave if and only if inverse absolute prudence, $-u''/u'''$, is concave. When no conditional-impatience restriction is imposed, hyperbolic absolute risk aversion (HARA) is necessary and sufficient for uniform concavity. Thus conditional impatience permits declining marginal propensities to consume for a preference class strictly larger than HARA.
Read the full abstract

Robotics

Blind Dexterity: Whole-Body Humanoid Manipulation via Pure Proprioception

We present blind, whole-body manipulation skills on a Unitree G1 humanoid using only onboard proprioception, without cameras, markers, force-torque, or tactile sensors. Despite this minimal sensing, the trained policies exhibit surprising capability across qualitatively different tasks: push-resilient bipedal walking without IMU feedback, active soccer ball trapping with a foot, seeking and lifting a suitcase by its handle, and mounting a randomly positioned skateboard. We argue that these capabilities arise from a key underappreciated signal: the way the joint encoder readouts evolve under purposeful compliant contact, effectively forming a whole-body tactile channel. By generating contact-rich motions, the trained policies actively probe the environment; as a result, task-relevant object state (e.g., pose) becomes increasingly decodable from short proprioceptive histories. We expose this information using compact task-specific state estimators trained alongside, but fully separately from, the policies; their prediction errors decrease rapidly after informative contact. Our results indicate that joint encoder-based proprioception, combined with compliant actuation (now widely available on commercial robots and low-cost motors) is already a strong, practical substrate for whole-body dexterous manipulation and interactive perception, and therefore a natural foundation on which richer sensing can be layered.
Read the full abstract

All authors Aditya Bhatt, Oleg Kaidanov, Puze Liu, Jan Peters

Algebraic Geometry

The Picard number of fibred Mori dream surfaces

Let $S$ be a smooth complex projective surface endowed with a fibration $f \colon S \to C$ onto a smooth projective curve $C$. We prove that, if $S$ is a Mori dream space (or, more generally, if its pseudo-effective cone is polyhedral) then the Picard number $\rho(S)$ can be effectively computed by counting the irreducible components of the reducible fibres of $f$. A first simple consequence is that, given an elliptic fibration $f \colon S \to \mathbb{P}^1$ with a section and such that $S$ is a Mori dream space, the Mordell-Weil group of the general fibre of $f$ is finite. The main application is a simple criterion for proving that a surface fibred over a curve is not a Mori dream space. We show that certain Horikawa surfaces, Fermat surfaces in $\mathbb{P}^{3}$ of every degree $\ge 4$, particular product-quotient surfaces, and the minimal simply connected numerical Godeaux surface constructed by Craighero and Gattazzo are not Mori dream spaces.
Read the full abstract

Analysis of PDEs

Interior $C^{2,\alpha}$ Regularity for the Quadratic Hessian Equation

We establish interior $C^{2,\alpha}$ regularity for admissible solutions of the quadratic Hessian equation with positive $C^\alpha$ right-hand side on the full positive branch. The main ingredients are a quantitative large-trace propagation argument and an adaptive Dirichlet comparison method.
Read the full abstract

Computer Vision

GeoAgent: Evaluating VLM Geolocalization Through Embodied Navigation

Modern Vision-Language Models (VLMs) perform well above the human baseline in image geolocalization, a task critically important in disaster response, OSINT verification, and location privacy. However, most efforts to study AI behavior on the task remain limited to static image-based retrieval, classification, and predictions. We argue that faithful recreation of the task should involve embodied navigation, where a multimodal agent autonomously explores its surroundings to gather observations before submitting a prediction. To this end, we introduce GeoAgent, an agentic environment-based benchmark that requires agents to navigate Street View environments to refine their geolocalization through sequential reasoning. Our analysis shows that modern VLMs struggle to discern regional patterns while succeeding at country- and continent-level predictions. When compared to static image-based baselines, agentic navigation significantly improves accuracy across established metrics. We also note severe bias in a developed/developing region context across frontier model architectures and poor self-improvement capabilities given incorrect priors. Overall, our work establishes the challenges of embodied navigation and geospatial reasoning. We publicly release our code and the GeoAgent environment: https://geoagent-benchmark.github.io
Read the full abstract

All authors Arka Mukherjee, Soham Roy, Kartikeya Trivedi, Shreya Ghosh

Symbolic Computation

Parallel Integration over Simple Radical Extensions

The parallel Risch (Risch–Norman) method is a fast heuristic for computing elementary integrals over towers of transcendental extensions. Its justification rests on two structural facts about the integral: a bound on its denominator and a description of the logarithms that can occur. Both are known for purely logarithmic towers (Davenport–Trager) and, in the form of a structure theorem, for arbitrary derivations on multivariate rational function fields (Bronstein). We extend both facts to a simple radical extension $L=K(y)$, $y^m=q$, of such a field. The key observations are that the integral closure of $F[t_1,\dots,t_n]$ in $L$ has an explicit basis, so that all factorisation can remain in a polynomial ring, and that the derivation has a well-defined pole order $\delta_P\in\{0,1,e_P\}$ at every height-one prime $P$, so that pole orders of derivatives shift by $\delta_P$. The denominator of the integral then has the same Hermite-type shape as in the transcendental case, while the admissible logands are precisely the $S$-units of the integral closure for an explicit finite set $S$ of primes; the latter can be larger than the set generated by irreducible polynomials, as the unit $x+\sqrt{x^2+1}$ shows. For $n=1$ we relate these $S$-units to torsion in the Jacobian and, for $m=2$, to the polynomial Pell equation, obtaining a complete description of the logarithmic part in genus~0. We describe the resulting algorithm and give examples.
Read the full abstract

Computation and Language

SIC-Agents: Benchmarking and Building an Adaptive Simulator for Pediatric Serious Illness Communication Training

Pediatric serious illness communication (SIC) is critically important, yet scalable communication training for clinicians remains limited. Compared with other dialogue simulation settings, pediatric SIC poses additional challenges, including multi-party interactions, response to parental distress and strong dependence on feedback dynamics. Existing LLM-based simulators optimize generic dialogue quality rather than curriculum-contingent behavior required for effective SIC training. In collaboration with educators and pediatric clinicians, we introduce the first benchmark suite and simulation framework tailored to pediatric SIC training. Our benchmarks, PitfallBench and DialogueBench, evaluate simulators both at the turn-level and across full dialogues. We further propose SIC-Agents, a self-improving framework that generates a clinician-editable skill document to guide simulator behavior. Our experiments show that SIC-Agents outperforms static expert prompting. To support future research, we release our benchmarks for parent simulation in pediatric SIC at https://github.com/Beikewzh/sic-benchmarks
Read the full abstract

All authors Zihan Wang, Anita Marie Slominska, Rennie Bimman, Elizabeth Di Flumeri, Amanda Mayappo-Neeposh, Conall Francoeur, Tamara Ellen Carver, Xiao-Wen Chang, Doina Precup, Esin Darici Haritaoglu, Ismail Haritaoglu, Akshatha Arodi, Naomi Goloff

Sound

Note-Level Temporal Grounding of Musical Concepts in Large Audio-Language Models

Large audio-language models (LALMs) demonstrate growing music-understanding capabilities, but whether their responses are grounded in acoustic evidence remains unclear. Musical language often involves abstract concepts whose acoustic evidence is difficult to define and evaluate precisely. We introduce MusicGroundingBench, a controlled benchmark of algorithmically generated piano audio with exact symbolic alignment, comprising three-note and two-bar settings. We evaluate two complementary capabilities: grounding, which localizes the acoustic evidence for a musical query, and understanding, which answers questions about the same excerpts. Our experiments show that cross-modal fine-tuning enables models to learn each capability, but adding grounding supervision does not consistently improve understanding across backbones. We further test whether understanding requires listening through audio-ablation controls that remove or replace the input audio, and use attention analysis to examine whether grounding supervision shifts attention toward note boundaries. Meanwhile, the two evaluated LALMs show limited zero-shot grounding even for basic musical concepts, highlighting grounded music understanding as an important open challenge.
Read the full abstract

Optimization and Control

The De Cock–De Moor Conjecture: Proof, Normal Form, and Indefinite Angles

De Cock and De Moor conjectured that two matrices built from the solutions of three coupled Lyapunov equations always share their eigenvalues, an identity linking principal angles between model subspaces with the canonical correlations between the past and future of a stochastic process. The conjecture was recorded as Problem 9.1 of Unsolved Problems in Mathematical Systems and Control Theory. We prove it under the natural nonresonance condition, without stability or diagonalizability, and show that the two matrices are similar. The proof exposes a Cauchy-matrix structure created by the rank-one perturbation and reduces the problem to rational interpolation, and the main theorem has also been verified in the Lean~4 proof assistant. The same structure gives a normal form that depends only on the poles and zeros of the model. Off the stable set the eigenvalues become squared cosines of angles in an indefinite metric. We prove an inertia theorem for them and show that reflecting a pole or a zero across the unit circle acts on the angles by a principal pivot transform. For several inputs and outputs, where the conjecture fails, we identify the subspaces whose angles do give the canonical correlations. We also relate our approach to the independent proof of Gillberg and Löfberg.
Read the full abstract

Computers and Society

Applications of Risk Science to AI Fairness Evaluation: Principles, Challenges, and Best Practices

Scholarly work which aims to describe potential societal impacts (e.g., risks) of proliferating technology (especially related to artificial intelligence or other algorithmic systems) is likely to have an impact beyond the scientific communities it was written for, given that general society itself is a primary object of study. However, it is an open question whether the current practices of AI evaluation scholarship follow the principles and best practices established by risk science, which aims to systematically generate knowledge related to understanding, assessing, communicating, managing, and governing risk. In this work, we examine this in depth by conducting a literature review of scholarly works purporting to evaluate the bias or fairness of technological systems used for tasks related to hiring and employment. Through analysis of 22 common fairness evaluation metrics and studies using them, we find that most characterize the severity of bias- or fairness-related consequences but do not follow best practices to characterize the uncertainty around either the occurrence of these consequences or severity estimates. Next, we conduct a case study of fairness evaluation for an AI-mediated resume screening task and demonstrate how principles of risk science can be incorporated into such an evaluation. Finally, we propose the AI Risk Report Card, which facilitates the reporting and communication of risk assessment results to stakeholders in positions to act based on the predicted risks. The outcomes of these activities suggest that further research at the convergence of risk science and AI evaluation can lead to advancements in AI assessments of societal impact by enabling shared frameworks to evaluate and discuss AI risks both within and outside of the scientific community.
Read the full abstract

All authors Kyra Wilson, Sabrina Kang, Saloni Dash, Aylin Caliskan

Computation and Language

MUDDLE: Measuring Understanding of Documents under Distractor and Length Effects

Document question-answering systems increasingly answer questions over collections of retrieved documents rather than one clean source, so robustness to distracting context matters as much as reading ability. When such systems fail, it is often unclear whether the context was too long or the distractors were too close to the topic, because prior work tends to conflate these two effects. We present MUDDLE, a controlled benchmark that separates them. MUDDLE uses 270 human-annotated questions, each tied to a single source document, and instantiates every question in five conditions: the source alone, the source with two or four topically similar hard negatives, and the source with two or four random distractors. The random distractors are matched to the hard negatives in length and provenance, so an accuracy gap between the two arms reflects topical similarity rather than length. All five conditions are rendered in markdown, page images, and raw PDF, but the distractor sweep reported here is run in markdown, since a source plus its distractors exceeds current image and PDF input limits. We score answers with an LLM judge across three model families. In the complete markdown sweep, hard negatives lower accuracy more than length-matched random documents at both context sizes for gpt-5-mini, while random documents stay near the no-distractor baseline. The effect is small but directionally consistent, and for gpt-5-mini hard negatives significantly underperform length-matched random distractors when pooled across context sizes. We release the data and evaluation code for a reproducible study of context degradation.
Read the full abstract

All authors Jason Luo, Saibilila Abudukelimu, Judy Song, Andrew Feng, Shivank Garg, Vasu Sharma, Kevin Zhu

High Energy Physics (Phenomenology)

Finite-Width Dissolution of Radial Spectroscopy in Single-Top Mesonic Correlations

Within the heavy-mass expansion, the pole width of a system containing one unstable heavy constituent inherits the constituent width up to $\mathcal O(\Lambda_{\rm kin}^2/m_Q^2)$ corrections, while radial splittings remain $\mathcal O(\Lambda_{\rm rad})$. The top quark is an extreme realization of this hierarchy. We implement the complex top pole mass in an instantaneous Bethe–Salpeter framework, where a biorthogonal Hellmann–Feynman relation realizes width inheritance at the operator level and an artificial heavy-mass scan confirms the predicted $m_Q^{-2}$ suppression. The low-pole source-projected response has a single broad maximum at the physical top width in the $t\bar b$, $t\bar c$, and $t\bar u$ channels. Full width-dependent non-Hermitian re-diagonalization and a direct full-matrix resolvent evaluation confirm the progressive dissolution of the small-width radial maxima. Thus stable-top eigenvalues survive as reference poles but not as a resolvable multi-peak spectrum; they may instead leave qualitative, process-dependent $Wb\bar q$ signatures, such as a broad threshold enhancement or modified color flow.
Read the full abstract

Computer Vision

Seeing Through Extreme Visual Sparsity: Surface Understanding from a Single Random Visual Patch

Surface material recognition from incomplete visual observations remains a challenging problem in robotic perception and environmental understanding. This paper discusses Sparse Surface Understanding Framework (SSUF), a unified dual-task learning framework that adapts four pretrained architectures-Convolutional Autoencoder (ConvAE), Vision Transformer (ViT), Swin Transformer, and Masked Autoencoder (MAE) for si-multaneous surface reconstruction and material classification. Experiments were conducted on the Touch-and-Go dataset using a sparse observation protocol in which only 10% of the original image remained visible while the remaining regions were masked. To enable a fair comparison, reconstruction-oriented models were extended with classification heads, whereas classification- oriented models were augmented with reconstruction decoders. The resulting architectures were assessed using reconstruction quality, classification performance, model complexity, and in-ference efficiency metrics. Experimental results revealed distinct strengths across the models. Swin Transformer achieved the best classification performance with an accuracy of 89.21%, an F1-score of 0.8922, and a ROC-AUC of 0.9813. In contrast, MAE produced the highest reconstruction scores among evaluated models, with a PSNR of 16.06 dB and an SSIM of 0.4501, while ViT provided the best overall balance between reconstruction and classification performance. Furthermore, all models achieved real-time inference, requiring less than 5 ms per image. Over-all, the results show that pretrained architectures can support material recognition under severe visual sparsity, while accurate image reconstruction remains challenging.
Read the full abstract

Systems and Control

Relative-Degree Wall Restricts Passivity-Based Stability Analysis in Inverter-Dominant Grids

This letter reveals a fundamental limitation of passivity-based distributed stability analysis in power systems. Under the standard formulation, passivity certification inherently imposes a relative-degree compatibility constraint that excludes many high-fidelity inverter dynamic models (e.g., those that include electromagnetic transients). Potential extensions of passivity frameworks are discussed to break this limitation.
Read the full abstract

All authors Xiaoyu Peng, Zhongze Li, Xi Ru, Xinghua Chen, Feng Liu

Optimization and Control

Stochastic Optimal Control of Hawkes Jump-Diffusion Systems

This paper is devoted to developing a framework for stochastic growth models with environmental risk, in which rare but catastrophic shocks interact with capital accumulation and pollution. Building on the Poisson point process formulation studied in arXiv:2511.13568, we extend the model to disasters driven by a marked Hawkes process, allowing past disasters to temporarily increase the likelihood of subsequent shocks. Our work focuses on a subcritical Markovian Hawkes specification, in which the state space is augmented by the self-excitation component of disaster risk. We establish the well-posedness and nonexplosion of the resulting controlled Hawkes dynamics. Using the Hamilton-Jacobi-Bellman characterization of the corresponding Poisson control problem, we obtain quantitative estimates for the Hawkes excitation process and prove, under a small-excitation scaling, that the Hawkes value function converges to its Poisson counterpart as the magnitude of self-excitation vanishes. This provides a rigorous Poisson approximation of the stochastic control problem and quantifies the effect of self-excitation on optimal growth under environmental disaster risk.
Read the full abstract

Saturday 29 August

Human-Computer Interaction

Semantic-Enhanced Sparse Temporal Modeling for Dynamic Engagement Estimation in Multimodal Interactions

Dynamic engagement estimation aims to infer participants' evolving engagement states from continuous multimodal interaction streams. Existing approaches typically combine acoustic, pose, and visual representations with temporal models to capture observable interaction patterns. However, conversational semantics are difficult to align with frame-level engagement annotations in the same manner as continuous audio-visual signals, leaving dialogue context less effectively exploited in existing temporal modeling pipelines. Moreover, engagement annotations often evolve smoothly over time, making dense frame-level modeling computationally redundant and potentially sensitive to local annotation noise. To address these issues, we propose SEST, a Semantically-Enhanced Sparse Temporal framework that models engagement-related information from both semantic and temporal perspectives. SEST leverages Multimodal Large Language Models to extract multimodal semantic embeddings, providing dialogue-aware contextual information beyond conventional frame-level features. In parallel, SEST replaces dense-to-dense temporal modeling with a sparse-to-dense pathway, where continuous frame sequences are first encoded into compact temporal dynamics to reduce redundant computation and broaden temporal coverage, then fused with semantic context and recovered to the original label resolution for dense engagement prediction. Experiments on the MEE2026 benchmark demonstrate the effectiveness of SEST, which achieved first place in the challenge.
Read the full abstract

All authors Yangchen Yu, Taoliang Wang, Jia Li, Nor Mazlina Ghazali, Mohd Nazim Mohtar, Bingkun Bao, Richang Hong

Programming Languages

Replay Is a Family of Assertions: Fork-Safety in Event-Sourced Agent Runtimes

Event-sourced agent runtimes commonly claim deterministic replay, cheap forking, and lineage. These are families of assertions, not one guarantee. A fixed-log fold may be deterministic while reactive settlement remains schedule-sensitive; a recorded oracle result can enable zero-call replay while the original interaction still changed cost or world state; and a prefix copy cannot undo an action in a discarded suffix. We present an executable F# contract that separates facts from effect requests, makes scheduling explicit, and assesses a cut relative to projection, strict execution replay, external continuation, or a declared counterfactual-world observation. Preserved counterexamples show that general settlement is neither terminating nor confluent and that disjoint declared writes do not prevent read/trigger interference. Against 5,540 public runtime logs, all 317,296 projection cuts satisfy the stated observation, while 36,251 cuts split a model request and do not license continuation; another 120,969 are Conditional because a committed oracle result must be served from the record without re-execution. In 121 observed forks, 16,625 retained-prefix events have zero structural mismatches, but none crosses an external-effect boundary. A separate public offline conformance fork crosses a committed, recorded oracle boundary. Its generator observes that the inherited result is served without a second fixture-oracle call; its verifier checks receipt/log consistency and a fork-bound HMAC assertion under a public conformance key. The result reframes cheap forking as a property-indexed semantic contract with explicit evidence and environment preconditions.
Read the full abstract

Optimization and Control

Advance versus Spot Selling in Queueing Systems: the Effect of Uncertainty Sources

We develop an unobservable M/M/1 queueing model to analyze advance selling and spot selling under uncertainty. Customers are heterogeneous in waiting costs, drawn from a uniform distribution. We disentangle two fundamental sources of uncertainty: customer valuation and service capacity. We derive the respective revenue functions for both advance and spot selling strategies and compare their performance. Our analysis reveals that advance selling is more profitable when customer valuations are uncertain. Conversely, spot selling emerges as the more profitable strategy when uncertainty originates from service capacity. When both sources are present, our numerical experiments suggest that the preferred regime depends on the relative dispersion of the two uncertainties: advance selling tends to be favored when valuation uncertainty is sufficiently pronounced relative to capacity uncertainty, whereas spot selling tends to be favored when capacity uncertainty is more pronounced. These results highlight how the origin and magnitude of uncertainty shape the optimal selling strategy in service queues and offer practical guidance for platforms and service providers deciding between advance and spot selling.
Read the full abstract

Artificial Intelligence

Ingest-Time Fact Compilation for Cost-Efficient and Reliable Question Answering over Revised Corpora

Most agentic question answering (QA) systems do an important part of their semantic work at the worst possible time: every time someone asks a question. When a corpus contains revisions, drafts, revocations, deletions, and sources with different levels of authority, the model must reconstruct the governed current state on every read - then throw that work away and repeat it on the next query. This is a bit like a database that rebuilds a materialized view every time someone reads from it. We present ingest-time fact compilation, an architecture that performs this work when corpus data is ingested or changed. Raw passages are rephrased into self-contained facts; rules governing revisions, deletions, effective dates, and source trust are resolved once; and the resulting state is stored as typed records carrying source and revision provenance. At query time, an inexpensive model reads the compiled record instead of reconstructing it from noisy candidates. In a controlled synthetic experiment across five seeds, the same low-cost model produced the correct value, source, and revision in only one of 30 trials under query-time reconstruction, but in all 30 trials from the compiled substrate, at 12.89 times lower mean read cost per question. On simpler revision questions both architectures were exact, but the compiled path used 21.6 times fewer tokens. A separate test found that fact rephrasing roughly halved verbose Federal Reserve dialogue while preserving high source entailment, but left concise Wikipedia prose essentially unchanged. These results support a narrow but practical claim: resolving a corpus state once can make subsequent QA cheaper and more reliable for inexpensive models. We release the open source, MIT-licensed implementation and experimental artifacts.
Read the full abstract

2609.29661 · 29 Aug · 6 pages, 5 tables, 1 figure. Accepted for presentation at the 2026 International Conference on Applied Science and Technology - Engineering Science (iCAST-ES 2026), Surabaya, Indonesia, October 2026. Code and frozen experimental artifacts: https://github.com/aix-sc/isc (tag data-freeze-2026-07-16)

Number Theory

Self-intersection Points of Billiard Trajectories in a Square with Small Pockets

We study the self-intersections of billiard trajectories in a square with small pockets of size $\varepsilon$ removed from its four corners. In particular, we establish an asymptotic formula for the $r$-th moment of the number of self-intersection points for each positive integer $r$, as well as the distribution of such points.
Read the full abstract

All authors Anji Dong, Colin Edsey, Shuta Iwai, Alexandru Zaharescu

Computation and Language

How To Do Things With Prompts

When users address large language models, they produce directive speech acts whose pragmatic features differ from those of both everyday conversation and traditional human-computer interaction, and these features change as users gain familiarity with the systems they address. This paper applies speech act and politeness theory to a corpus-pragmatic analysis of 2,000 English-language prompts drawn from publicly shared ChatGPT conversations, 1,000 from 2023 and 1,000 from 2025, using the ShareChat dataset. Each prompt is annotated for illocutionary force, directness, propositional content, and the presence of politeness markers, and the distribution of these features is compared across the two sampling years. The results show a consistent movement toward indirect, implicit, and fragmentary realizations of directive force, accompanied by a decline in politeness marking. The largest single change, a shift of 14.9 percentage points, occurs in propositional content, where explicit specification of the requested action gives way to implicit reliance on the system's inferential capacity, suggesting that users have updated their model of what the system can recover from reduced input, treating it as a competent implicature resolver. Rather than asking whether LLMs "really" understand language, we should ask: what kind of language have we created in learning to speak to them?
Read the full abstract

Software Engineering

Object-to-Source Mapping under Optimization: What a Control-Flow Trace Can Show, and Where Source-Level Coverage Breaks

Within a validated interval, control-flow trace can reconstruct machine-level execution, but source-level structural coverage additionally requires a validated attribution from generated instructions and branch outcomes to source obligations. This paper defines that boundary and illustrates it with exact compiler output. Optimization can fuse multiple source conditions into one branch, replace a branch with a conditional select or move, and degrade provenance in debug and mapping information. In such cases, trace may be complete for the generated binary while condition-level source evidence remains unresolved. We therefore separate trace completeness, source attribution, and coverage satisfaction; distinguish source-to-object transformations from object-region attribution states; and explain when internal reconvergence makes aggregate branch observations insufficient and ordered per-instance condition-evaluation histories necessary. We compare measuring a less-optimized build, constraining code generation, and adding state-writing instrumentation. Finally, we describe a pre-compilation supplementation mechanism disclosed in WO 2026/162831 A1 that preserves selected source distinctions as trace-observable control flow without writes to application-resident coverage state. An appendix demonstrates the mechanism end-to-end on real silicon for the worked example: the supplemented -O3 build keeps each condition individually trace-observable, per-instance histories and an MC/DC verdict are reconstructed from a captured ETM trace, and code-size and cycle costs are measured. Its use remains subject to build-specific preservation, final-image mapping, trace-validity, and probe-effect verification.
Read the full abstract

Algebraic Geometry

Beyond Harnack Rigidity

The boundary of a plane amoeba is always contained in its contour, and equality is a characteristic feature of simple Harnack curves. We show that the converse fails, even under strong smoothness and nondegeneracy assumptions. For every two-dimensional lattice polygon, except unimodular triangles, we construct a smooth Newton-nondegenerate curve with smooth logarithmic critical locus and smooth embedded contour satisfying $\mathcal C(\mathscr A_f)=\partial\mathscr A_f$, although the curve is not Harnack. We also provide explicit primitive and nonprimitive families that are not torus-equivalent to simple Harnack curves. A concrete primitive example is certified by exact elimination and Sturm root counting. These results disprove contour–boundary rigidity and show that the contour as a set does not detect the real structure or the multiplicity of coincident critical sheets, thereby refining the compensation problem proposed by Lang, Shapiro, and Shustin.
Read the full abstract

Algebraic Geometry

On the Analyticity of Amoeba Contours

The contour of an amoeba records the critical values of the logarithmic map and forms a fundamental interface between complex algebraic geometry and real-analytic geometry. Building on the known semianalyticity of amoeba contours, we prove the stronger statement that the componentwise exponential image of the contour of any algebraic hypersurface in $(\mathbb C^*)^n$ is semialgebraic. For a smooth hypersurface, we establish a natural criterion guaranteeing that the contour is a closed real-analytic hypersurface: the logarithmic Gauss map is transverse to $\mathbb RP^{n-1}$ and the logarithmic map has maximal rank along its critical locus. We then show that neither hypothesis is necessary, since singular or ramified critical parametrizations may still have complete real-analytic images. Finally, we derive intrinsic restrictions imposed by analyticity. In particular, every irreducible contour component of dimension $n-1$ is generated, over a dense open subset of its regular locus, by a real-analytic critical stratum on which the logarithmic map has maximal rank. These results distinguish the analytic geometry of the contour from the singularities of its critical parametrization and answer the question of Lang, Shapiro, and Shustin concerning effective sufficient conditions for analyticity.
Read the full abstract