Peer Revenue Publish or profit

Papers

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

All of arXiv

Monday 7 September

Artificial Intelligence

AgentIdeaBench: Benchmarking Scientific Ideation in the Agent Era

Scientific ideation is the capacity to formulate novel and testable hypotheses from scientific evidence, and autonomous AI scientists depend on it. Existing evaluations largely assess it by asking models to generate ideas from a static, curated set of reference papers. That passive setup departs from the retrieval-and-reasoning workflow of modern AI scientists, and it becomes less discriminative as models improve. We introduce AgentIdeaBench, a multidisciplinary benchmark that evaluates scientific ideation under two matched settings, static observation and active exploration. We report matched Static-Active evaluations for 33 LLMs across 40 densely scored subfields spanning five disciplines, using a multidimensional, literature-verified scoring framework whose critics assess originality against retrieved prior art. Active exploration reveals considerably more capability headroom, and that headroom is unevenly distributed across models. Performance scales about twice as fast as under static observation, and the exploration gain is capability-gated, favoring the strongest models over the weakest. The gain reflects better grounding, improving feasibility, clarity, and specificity while leaving measured originality unchanged under our critics. We further explore Scientific World Modeling, a generation-time loop that refines a draft hypothesis through structured thought experiments. It benefits mid-capability models, and its impact diminishes among frontier models that appear to have internalized such reasoning patterns already. AgentIdeaBench gives future work on scientific ideation a measurement basis suited to the agent era.
Read the full abstract

All authors Yunxiang Mo, Tianshi Zheng, Yisen Gao, Rui Wang, Newt Nguyen Kim Hue Nam, Kelvin Kiu Wai Tam, Jiaxin Bai, Yangqiu Song, Ginny Wong, Simon See

Machine Learning

Translation of Black-Box Clinical Prediction Models into Standalone Transparent Nomograms: Temporal External Validation in Heart Transplantation

We convert black-box clinical prediction models for tabular data into standalone nomograms that can be audited term by term. PRiSM (Partial Responses in Structured Models) takes the shape of each effect and interaction from the source model, not merely which variables mattered, and lets the outcome select and weight them. We tested this in 50,356 heart transplant recipients, with validation in a later era than training. Nomograms from all 5 source models - a public clinical risk score, logistic regression, neural networks, random forests and extreme gradient boosting - met a prespecified noninferiority criterion for discrimination before any further simplification, and generally preserved calibration and clinical net benefit. Those from the 3 machine-learning models showed no detectable difference in discrimination from de novo generalized additive and explainable boosting models, exceeded neural additive models, and carried fewer terms than the explainable boosting model. PRiSM is released as an open-source Python package.
Read the full abstract

All authors Henry Pigot, Paulo J. G. Lisboa, Sandra Ortega-Martorell, Ivan Olier, Joseph Mahon, Johan Nilsson

Networking

How Bitcoin Forms Its Network: Peer-Table Sampling and Structural Properties

The global structure of P2P networks underlying modern cryptocurrencies is hidden by design: each node only knows its neighbors and maintains a local peer table of IP addresses. The peer table of a node can be seen as the node's “local view” of the set of nodes currently in the network: it is constantly updated with information collected from the neighbors and it is used by the node to establish new connections when needed. The maintenance rules of the nodes' peer tables determine the global structure of the network and its evolution. Even though the global structure is unknown to any node of the network as well as to any external observer, the rules for the exchange of information between neighbors are compatible with the design and use of network crawlers that can query the nodes and extract some information about their peer tables. In this paper we first analyze the data we crawled from nodes of the Bitcoin and Dogecoin P2P networks, to collect information about the distribution of IP addresses in the peer tables and to estimate the evolution of network size and churn rate; we then use the estimates to set up the parameters for a simulation of the Bitcoin network and we analyze the evolution of the network structure that we get from the simulation. Overall, our results show that Bitcoin's peer-table maintenance rules induce non-uniform, heavy-tailed visibility patterns while nevertheless generating a well-connected and structurally robust network.
Read the full abstract

All authors Taki E.M. Abedesselam, Antonio Cruciani, Fabio Giacomelli, Lucianna Kiffer, Francesco Pasquale

Computer Vision

Solution for UCF UrbanTwin V2X-Real Track: Sim-to-Real Urban LiDAR 3D Object Detection

Bridging the simulation-to-reality gap in roadside LiDAR requires addressing several coupled discrepancies, including scene geometry, sampling density, return patterns, and pedestrian scale. This report presents a multi-source collaborative training and class-aware fusion framework for Sim2Real 3D detection. The method organizes digital-twin scans, diffusion-redrawn scans, density-stabilized scans, and pedestrian morphology-aligned samples into a unified training pool with complementary roles. Within a common DSVT detection formulation, source-specialized expert branches preserve those roles while optimizing for the same detection objective. At inference, a predefined class-aware fusion pathway integrates geometry-stable and calibration-aware branches for vehicles, sampling-complementary branches for trucks, and morphology-consistent evidence for pedestrians. A label-free point-cloud center blend then refines geometric localization. On the UrbanTwin V2X-Real hidden test set, the unified system achieves a combined score of 0.7421, with 3D mAP@0.5 of 0.4518 and a realism score of 0.8871. The results indicate that a stable, interpretable collaboration among data sources is more valuable than unconstrained aggregation of model outputs.
Read the full abstract

All authors Pu Luo, Cong Xu, Yumei Li, Kexin Zhang, Licheng Jiao, Wenping Ma, Lingling Li

Human-Computer Interaction

JudgmentLens: Human-AI Sensemaking of Complex Legal Judgments

Judicial judgments are increasingly available, yet dense language and distributed relationships among facts, evidence, reasoning, and rulings remain difficult for non-experts to interpret. Through a mixed-methods formative study with Chinese non-expert readers (survey N=34; interviews N=6), we identified structural, interpretive, verification, and action breakdowns. We developed JudgmentLens, an AI-augmented reading system combining persistent case representations, adaptive explanations, and traceable links from generated interpretations to judgment passages. In a counterbalanced within-subject evaluation (N=16), participants completed tasks faster with JudgmentLens than with conventional PDF reading and reported lower workload and greater self-reported decision understanding, while rubric-scored comprehension did not differ reliably. An exploratory PDF+DeepSeek probe suggested that conversational AI supported formulated questions while leaving question formulation, answer integration, and source checking largely to users. We contribute an empirical account of non-expert judgment sensemaking and design strategies for inspectable, source-grounded AI mediation.
Read the full abstract

All authors Xinyi Chen, Ruijie Li, Yuelu Li, Chen Liang

Machine Learning

CLUES-WEASEL: No additional clues required to choose your time series clustering algorithm

Time series data is very common in many real-world applications and in numerous domains, with increasing interest for automated information extraction using machine learning. One of these subfields is time series clustering, which consists in identifying clusters among a set of time series in an unsupervised fashion. Most time series clustering algorithms suffer from the same balancing act: they trade clustering performance for faster runtimes or vice versa. We present a novel time series clustering algorithm that we call CLUES-WEASEL, which stands for CLustering with the UnsupervisEd Second version of Word ExtrAction for time SEries cLassification. CLUES-WEASEL extracts features using the unsupervised version of the transformation step of WEASEL 2.0, which is a time series classification algorithm, then reduces these features using principal component analysis, and finally performs clustering with the $k$-means algorithm using these reduced extracted features. Through extensive experiments, we prove that CLUES-WEASEL is significantly better than any other existing time series clustering algorithm while being (much) faster than any state-of-the-art one. We also show that the architecture of CLUES-WEASEL can work well with other time series feature extraction algorithms. Our findings highlight the relevance of CLUES-WEASEL for time series clustering.
Read the full abstract

Computer Vision

Search-to-World: Evaluation of 3D World Delivery from User Request through Web Search

Agentic systems can interpret user requests, search the live web, and use external tools, but their ability to transform retrieved web content into a usable 3D world has not been systematically evaluated. No established end-to-end pipeline or benchmark exists for this capability. We introduce Search-to-World, an end-to-end evaluation task covering request understanding, web visual-content retrieval, and 3D-world delivery. We define Observed Retrieval Rate (ORR) and World Delivery Rate (WDR) to distinguish observing relevant content from successfully delivering a request-aligned, perceptually acceptable world. We also present WorldSearcher, a reuse-then-reconstruction harness that connects existing search agents to world delivery: it first retrieves reusable 3D worlds and, when none are available, reconstructs a world from video. A structured recovery controller revises temporal grounding, replaces source videos, or reformulates queries after failure. Using WorldSearcher, we benchmark representative models on Search-to-World and study supervised fine-tuning (SFT) for recovery subagents. Results show that delivery depends on the underlying agentic model, and that relevant-content observation does not ensure world delivery. Jointly training recovery agents improves delivery success and action efficiency. Search-to-World makes agentic 3D-world delivery measurable, while WorldSearcher provides a practical evaluation harness with recovery capabilities.
Read the full abstract

All authors Zixiao Gu, Yabo Chen, Xunzhi Xiang, Yu He, Haibin Huang, Chi Zhang, Yunbo Wang, Xuelong Li

Quantum Physics

Quantum Approximate Counting with Bernoulli Oracles

Quantum counting is a fundamental quantum algorithm that estimates the fraction of marked elements using a membership oracle, achieving a quadratic speedup over classical sampling. The membership oracle, however, assumes exact labeling of each element, but this assumption fails when the labels are inherently probabilistic. We study quantum counting with Bernoulli oracles, where given $m$ Bernoulli distributions with unknown biases $p_1,\dots,p_m$ and a gap parameter $\Delta$, the goal is to estimate the fraction $\rho$ of positive distributions ($p_i\ge1/2+\Delta$) to within additive error $\epsilon$. We prove an upper bound of $\tilde{O}\!\big(\frac{\sqrt{\rho}}{\Delta\epsilon}+\frac{1}{\Delta\sqrt{\epsilon}}\big)$ queries, achieving a quadratic speedup over the classical sample complexity. % of $\Theta(\rho/\Delta^2\epsilon^2)$. Our algorithm first uses the Quantum Singular Value Transformation (QSVT) to coherently amplify the bias gap without collapsing the superposition over distributions, and then applies two-stage adaptive amplitude estimation. We complement this upper bound with a near-matching lower bound of $\Omega(\sqrt{\rho}/(\Delta\epsilon))$ via a new composition theorem for the quantum adversary method in the Boolean-over-average-case direction. For the special case of a constant gap $\Delta=\Theta(1)$, which corresponds to the bounded-error oracle where each query returns the correct label with constant probability, our bounds specialize to $\tilde{O}\big(\frac{\sqrt{\rho}}{\epsilon}+\frac{1}{\sqrt{\epsilon}}\big)$ and $\Omega(\frac{\sqrt{\rho}}{\epsilon})$, thereby characterizing the query complexity of quantum counting with bounded-error oracles.
Read the full abstract

Artificial Intelligence

FinCUABuild: Can Agents Build Reliable Benchmarks for Dynamic Financial Computer Use?

Financial scenarios are diverse and complex, spanning varying data conditions, tool configurations, and workflows. Yet existing CUA, Computer-Using Agent, evaluation tasks remain largely manually constructed, limiting scalable coverage of real-world financial scenarios. Then, can agents autonomously construct diverse CUA evaluation tasks for financial scenarios? Evaluating this capability poses three key challenges: scenario coverage of construction requests, fair comparison across construction methods, and reliable assessment of generated task quality. To solve these, we introduce FinCUABuildBench, a benchmark for evaluating financial CUA task construction, featuring: (i) 576 construction requests covering 24 financial workflows and three types of runtime variation; (ii) standardized input, budget, and output specifications; and (iii) a task qualification mechanism based on execution tests and quality checks. We further introduce FinCUABuildAgent, a multi-agent system for automatically constructing dynamic financial CUA evaluation tasks. It consists of three modules that jointly construct tasks, environments, and validators. On FinCUABuildBench, under the same model backbone, existing agent-based construction methods achieve strict qualification rates of only 1.3-8.3%, while FinCUABuildAgent reaches 31.3%. Downstream evaluations further show that the constructed tasks can effectively differentiate CUA task-execution capabilities. These results demonstrate that agents can autonomously construct financial CUA tasks with meaningful evaluation value, offering a practical path toward broader evaluation coverage in financial scenarios. Code: https://github.com/FengxianJi/FinCUABuild
Read the full abstract

All authors Jingpu Yang, Fengxian Ji, Jinri Guo, Tianhao Li, Qian Jiang, Fan Zhang, Min Peng, Qianqian Xie, Preslav Nakov, Zhuohan Xie

General Relativity and Quantum Cosmology

Global structure and stability of Kerr-Bertotti-Robinson spacetime

The surface $r=\infty$ of the Kerr-Bertotti-Robinson spacetime is not a genuine boundary. We construct its natural analytic extension and show that $r=+\infty$ of one KBR region is smoothly connected to $r=-\infty$ of a neighboring one. Repeated continuation produces an infinite chain of regions connected by wormhole-like bridges and exposes the neighboring ring singularity without an intervening horizon, which violates the weak cosmic censorship conjecture. We then study a test massless scalar field on a two-universe scattering segment to probe the stability of the spacetime. For axisymmetric perturbations, we analytically establish purely imaginary growing quasinormal modes for every $\ell$ and trace their origin to the chronology-violating region. In the $(\ell,m)=(2,2)$ sector, unstable branches occur for sufficiently large rotation and sufficiently small magnetic field. Their marginal real modes obey an exact horizon-flux balance, supporting a black-hole-bomb interpretation in which superradiant extraction is amplified by trapping within the double-barrier potential. The same cavity also supports families of weakly damped modes and may produce echo-like responses.
Read the full abstract

All authors Yu-Sen Zhou, Liang-Bi Wu, Ming-Fei Ji, Wen-Tao Fu, Li-Ming Cao, Rong-Gen Cai

Computation and Language

ObGynLongBench: Revealing the Evidence-to-EHR Gap in Longitudinal EHR Decision-Making

The application of large language models (LLMs) to personalized medical assistants has garnered growing interest. However, existing medical benchmarks largely rely on static question answering with pre-selected evidence, leaving unclear whether LLMs can make reliable clinical decisions from real longitudinal electronic health records (EHRs). To bridge this gap, we introduce ObGynLongBench, a rule-grounded long-context EHR benchmark for obstetric and gynecologic decision-making, comprising 1,500 clinical decision-point cases from 976 real pregnancy EHR histories and traceable rules. Each case is anchored to a patient, a pregnancy-timeline point, and a pre-decision information boundary, enabling Evidence-only, Visit-level EHR, and History-level EHR evaluation. Evaluating 17 LLMs reveals a substantial Evidence-to-EHR Gap: models perform well when evidence is directly provided, but accuracy drops when evidence must be extracted from same-day records or full pre-decision EHR histories. Further analyses identify evidence utilization as a key bottleneck: performance decreases with longer EHR contexts and more complex evidence requirements, and earlier failures often predict later failures within the same patient history. Finally, active-search agents perform best among EHR access strategies, highlighting patient-specific evidence utilization as a central challenge for reliable personalized medical assistants. Resources are available at https://github.com/xiangjun2003/ObgynLongbench.
Read the full abstract

All authors Jun Xiang, Zhijie Bao, Rong Hu, Kaizhou Qin, Wei Chen, Zhongyu Wei

Computer Vision

BarkNet-Lite: A Lightweight Texture and Colour Network with the BarkBD Benchmark for Bark-Based Tree Species Recognition in Bangladesh

Tree species recognition supports forest inventory and biodiversity monitoring but still depends on scarce taxonomic expertise. Bark is visible year-round at ground level, yet bark recognition has concentrated on temperate floras and on large ImageNet-pre-trained backbones. We address both gaps. First, we release BarkBD, a bark dataset for Bangladesh: 14,258 uncropped smartphone photographs of 20 native species across four districts and three weather conditions, with a fixed stratified split. Second, we propose BarkNet-Lite, a 2.96M-parameter network trained from random initialisation, pairing a multi-scale texture pathway with a parallel colour-aware pathway. Over five seeds it reaches 96.64+-0.66%accuracyunderstrict single-image inference, within 2.3 points of nine ImageNet-pre-trained backbones fine-tuned under an identical protocol and within one seed-level standard deviation of the smallest ofthem, andtransfers to public benchmarks (95.86% on BarkVN-50, 92.85% on BarkNet 1.0). Grad-CAM, validated by faithfulness and weight-randomisation checks, confirms its decisions rest on bark structure rather than background. The exported single-precision model classifies one photograph in 15.34ms on a commodity smartphone.
Read the full abstract

Distributed Computing

Fast Multidimensional Approximate Agreement with Optimal Resilience Using Ball Validity

Multidimensional approximate agreement requires $n$ processes with inputs in $\mathbb{R}^d$ to output vectors close to each other, despite up to $t$ Byzantine faults. Under convex validity, outputs must lie in the convex hull of the correct inputs, which leads to resilience thresholds that grow with the dimension. We instead study Minimum Enclosing Ball (MEB) validity and its multiplicative relaxation $c$-MEB validity. Our first contribution is Adaptive MEB Contraction, a coordinate-free algorithm that, in the synchronous model with $n>(d+1)t$ contracts the correct MEB radius by $1/\sqrt2$ per round for $\alpha=1$ while satisfying $\sqrt2$-MEB validity. We also give an example showing that this bound is tight for our analysis. Our main technical contribution is a dimension-free inflation theorem: if every $\beta$ balls in a finite family of Euclidean balls have a common point, then inflating each radius by $\sqrt{\beta/(\beta-1)}$ guarantees a common intersection. Applying the theorem to the candidate balls defining the local MEB-safe areas results in a synchronous algorithm with optimal resilience $n>3t$, contraction factor $\sqrt3/2$ and $\sqrt6$-MEB validity. To the best of our knowledge, this is the first multidimensional approximate agreement algorithm with optimal resilience, constant $c$-MEB validity and coordinate-free contraction. We further extend the approach to the asynchronous setting. Without inflation we obtain resilience $n>(d+2)t$, contraction factor $\sqrt{2/3}$ and $\sqrt6$-MEB validity, whereas with inflation for $n>4t$ we get the contraction factor $\sqrt{15}/4$ and $2\sqrt{10}$-MEB validity. Finally, we compare our guarantees with existing algorithms, including Minimum-Diameter Averaging (MDA), for which we derive MEB-validity guarantees. Our algorithms achieve strictly better resilience while providing substantially stronger MEB-validity guarantees than MDA.
Read the full abstract

Computers and Society

Mapping the Emerging Social Science of Large Language Models

As large language models (LLMs) blur the boundary between cognition and computation, they reshape knowledge production and collective life. We combine a curated review of 198 papers with computational mapping of 47,719 formally published papers from five databases. Text embeddings, clustering, and topic modeling organize the curated literature into 13 subcategories across three domains. LLM as Social Minds examines mind-like reasoning and socially grounded behavior in individual models. LLM Societies explores how interactions among agents produce collective behavior and social organization. LLM-Human Interactions examines how people perceive and engage with LLMs, and how interaction reshapes human thinking, creativity, and relationships. Structural topic modeling of the larger corpus traces how research attention shifts over time and differs across publication venues. We present a reproducible framework that identifies the field's underlying structure and enables its continuous refinement as new studies emerge. The review also identifies a gap in current understanding: the mechanisms underlying many of LLMs' observed cognitive and social behaviors remain unclear. Human-like performance can then be mistaken for understanding, obscuring the norms, biases, and structures of power that LLMs reproduce. We call for shared benchmarks and robustness checks across the three domains to build a reliable evidence base for understanding LLMs' social behaviors and informing their design and use.
Read the full abstract

All authors Zhanzhan Zhao, Yi Yang, Xiao Jia, Zeyun Dong, Chenzhang Wang

Machine Learning

Beyond the Matrix Sign: Quadratic Spectral Descent

Muon emerges as a strong competitor of the AdamW for LLM pretraining, because the matrix-wise update it employs can potentially incur smaller second-order penalty than the once dominating AdamW, which performs coordinate-wise update. However, the spectral flattening procedure in Muon is quite debatable since it discards the spectral amplitude information totally. To seek for better spectral allocation (and the associated spectral subspace), we propose to solve the quadratic model of loss function under the spectral norm constraint directly (i.e., in a genuinely Newtonian way) and thus obtaining the Quadratic Spectral Descent (QSD) algorithm. In contrast, many existing curvature-aware methods either exploit the second-order information in an implicit way by changing the weight update geometry (such as Mousse, FISMO) or rely on strong assumptions (such as the weight displacement isotropy assumption in Newton-Muon). QSD's potential advantage over these methods is best illustrated in the isotropic curvature scenario, where Mousse, FISMO and Newton-Muon all reduce to Muon while the spectral allocation in QSD is still non-flat (since the spectral allocation in QSD depends on the gradient to curvature ratio). Meanwhile, to control the complexity of QSD, we employ inversion-free K-FAC and online Frank-Wolfe update which is essentially a matrix sign operator. Overall, the complexity increase can be rather mild. Experiments on GPT pre-training show that QSD consistently improves validation loss over Muon and recent Muon variants, while achieving up to an $8.49\%$ wall-clock speedup at matched validation loss.
Read the full abstract

Machine Learning

I Don't Miss You, but I Do: Self-Explanation Faithfulness of Modality Missingness in Vision-Language Models

Vision-language models (VLMs) are increasingly used in settings where some input modalities may be unavailable, yet we know little about whether they can faithfully explain how such missing information affects their own predictions. We introduce an interventional protocol for evaluating self-explanations of modality dynamics: models state what each modality alone would support, whether restoring a missing modality would change their answer, and whether the available evidence is sufficient; we then execute the corresponding intervention and compare these claims with realized behavior. We evaluate ten VLMs spanning open-weight and proprietary models across four tasks covering mixed, redundant, and unique modality regimes. We find a systematic tendency to overstate the sufficiency of available evidence. Models substantially underestimate the effect of restoring missing modalities: executed change exceeds predicted change in 78 of 80 model-task-condition settings, with task-level median executed change rates reaching 70.1% while median predicted rates remain at most 9.6%. Insufficiency claims have low recall, leaving many cases in which behavior changes despite a stated claim of sufficiency. Retrospective self-explanations show the same tendency, over-crediting single-input sufficiency in mixed regimes and interchangeability in redundant ones. Together, these results show that VLMs systematically mischaracterize how their predictions depend on available and missing evidence, motivating executable interventions as a behavioral test of multimodal self-explanations.
Read the full abstract

Digital Libraries

Same Problem, Different Field: Cross-Domain Solution Import via Domain-Stripped Computational Fingerprints

The same underlying computational problem is solved across unrelated fields under different names: recursive Bayesian state estimation appears as a "Kalman filter" in control, "Bayesian forecasting" in pharmacokinetics, and "data assimilation" in geoscience. Topical and citation-based scientific embeddings cannot see this shared problem. We distill each paper once into a domain- and method-name-stripped faceted computational fingerprint, a free-text mechanism skeleton plus controlled computational facets. We define a tunable, facet-selectable similarity over it. The goal is solution import: surface cross-field pairs solving the same problem, so a bespoke implementation can be swapped for another field's standard, specialized solver. On a benchmark of 18 method families across 109 papers, the skeleton lifts cross-domain retrieval average precision over the abstract from 0.222 to 0.513, and the whole fingerprint reaches 0.557. Strikingly, four trained scientific embedders all fall below plain abstract+TF-IDF: they encode topical and citation similarity, the wrong signal for this task. The gain is the representation: the abstract-to-skeleton swap lifts every embedder, and the pipeline is one cached LLM call per paper plus a cheap embedder. An interventional re-skin / math-edit test shows the fingerprint tracks the computation, not the field. On a 501-paper wild corpus, known twins dominate the top of the ranking (23 of the top 30); with planted pairs excluded from the results, three blind LLM judges rate 3 of the top 5 and 8 of the top 30 pairs genuine import candidates, and 0 of 30 random ones. The human verification is the four executed imports: in one, an open standard solver reproduces a bespoke clinical dosing engine's output. We release the benchmark, the code, and the distillation prompt.
Read the full abstract

Human-Computer Interaction

Large-Scale User Behavior Analysis in Multimodal AI-Assisted Manual Task Execution

Conversational Task Assistants (CTAs) are multimodal dialogue systems that support users in complex real-world tasks such as cooking and DIY through voice, text, image, and video interactions. Prior user studies have focused on controlled settings, leaving limited understanding of real-world CTA usage at scale. In this work, we present a large-scale study of CTA usage based on thousands of users in-the-wild. Our large-scale real-world data analysis unveils new understandings of (i) user-CTA interaction flows, (ii) user intents, (iii) user conversational traits, and (iv) behavioral factors associated with user satisfaction. Our findings reveal key opportunities for future research in CTAs, particularly in user interaction design and task engagement, concluding with concrete design guidelines.
Read the full abstract

All authors Rafael Ferreira, Diogo Tavares, Diogo Glória-Silva, David Semedo, João Magalhães

Analysis of PDEs

Littlewood–Paley operators and semigroup maximal operators on CMO spaces associated to Schödinger operators

Let $L=-\Delta+V$ be a Schrödinger operator on $\mathbb{R}^n$, where $\Delta$ is the Laplacian and $V$ satisfies the reverse Hölder inequality ${\rm RH}_q$ for some $q>n/2$. In this paper, we study the behavior of the Littlewood–Paley operators $s_L$ and $S_L$, as well as the semigroup maximal operator $T^*_L$, on the space ${\rm CMO}_L(\mathbb{R}^n)$ associated with the Schrödinger operator $L$. It is known from previous work that these operators are bounded on ${\rm BMO}_L(\mathbb{R}^n)$. Our main result shows that they are, in fact, mappings from ${\rm CMO}_L(\mathbb{R}^n)$ into itself. To prove this, we develop several equivalent characterizations of ${\rm CMO}_L(\mathbb{R}^n)$ and employ a refined decomposition that partitions the parameter interval at $r_B\rho(x_B)$, instead of the customary $r_B^2$ or $\rho(x_B)^2$. The new strategy allows us to overcome a key technical obstacle that arises when applying existing methods to the ${\rm CMO}_L$ setting.
Read the full abstract

Metric Geometry

Chasing rotational symmetry in the spectre tiling

We identify the rotational symmetry centers in the spectre tiling. We find that both 2-fold and 3-fold symmetry centers are coexisting, with two different types of 3-fold centers. Local and global symmetry operations are distinguished, and characterized in terms of substitution systems. We introduce a decomposition of the spectre tiling in terms of three metatiles named diabolo, 2-arms and 3-arms, valid at any substitution level. We propose geometrical constructions for generating patches of the spectre tiling with 2-fold and 3-fold global rotational symmetry.
Read the full abstract

Quantum Physics

Topology Obstructs Pure Foundation Neural Quantum States

Foundation models for ground states in spin-1/2 systems are a promising method for problems ranging from quantum chemistry to identifying new phase diagrams. Nearly all such models are currently pure-states that condition on the Hamiltonian's parameters, whose Monte Carlo samples give energy estimates according to the variational principle. In this contribution, we show that this representation is topologically obstructed. For any gapped Hamiltonian family whose ground-state bundle is non-trivial, every continuous normalized state-vector model has zero fidelity with the ground state at some parameter value in the Hamiltonian family. For that value, the energy is at least one spectral gap, $\Delta$, with an $O(\Delta)$ gap in an open-neighbourhood of that point. We show that this is a sufficient no-go also in the case of degenerate ground-state manifolds, time dynamics, and periodic systems with mixed space-time topology, demonstrating these obstructions on one- and two-qubit systems. We discuss how this causes a spike in the fidelity susceptibility, giving a numerical signature of a phase-transition where there is none. Finally, we show that operator-valued models canonically avoid these obstructions and preserve topological information, implying a structural necessity in representation for foundation neural quantum states.
Read the full abstract

All authors Timothy Heightman, Elena Orlova, Philip Mantrov, Aleksei Ustimenko

Computer Vision

Solution for UCF UrbanTwin LUMPI Track: Sim-to-Real Urban LiDAR 3D Object Detection

We present our solution to the LUMPI track of the UCF UrbanTwin Sim2Real LiDAR Challenge at the 6th DriveX Workshop, ECCV 2026. The detector must be trained only on synthetic data and is evaluated on 50 held-out real LiDAR frames; a separate 50-frame synthetic submission is evaluated for point-cloud realism. Our method addresses the Sim2Real gap at three levels. First, we align synthetic scans to the 50k-point test density and build a 30k-record training pool using UT-LUMPI geometry, RangeLDM-based sampling diversification, rare-class copy-paste, and pedestrian-oriented augmentation. Second, complementary DSVT detectors and Car/Bus PointPillars specialists are trained under the same synthetic-only constraint. Third, predictions are integrated by class-aware routing, asymmetric agreement fusion, constrained residual-recall supplementation, class-coverage auditing, and selective box-size calibration. The realism branch is optimized independently with radial-density matching, weak affine calibration, and calibrated set mixing. The final submission obtains a Combined Score of 0.4692, a Detection Score of 0.1797, a Realism Score of 0.9035, and 3D mAP@0.5 of 0.1258.
Read the full abstract

All authors Pu Luo, Cong Xu, Yumei Li, Kexin Zhang, Licheng Jiao, Wenping Ma, Lingling Li

Computation and Language

Validating DBpedia Triple Sets for Natural Language Generation

We present a study of the quality of individual DBpedia triples from the perspective of Natural Language Generation, and propose and evaluate an approach for collecting entity-specific triple sets that filters out questionable triples while minimizing the loss of correct ones. We show in an evaluation against manually annotated data that with validation rules, it is possible to reach 98% precision in triple selection, and with improvements to a few Property definitions, it is possible to improve recall by 40% without harming precision.
Read the full abstract

All authors Mark Andrade, Simon Mille, Anya Belz, Brian Davis

Representation Theory

$q$-Oper Structures on a Formal Punctured Disc

Let $G$ be a connected reductive complex algebraic group and let $q\in\mathbb{C}^{\times}$ be not a root of unity. We prove that every $(G,q)$-connection on a formal punctured disc admits a $(G,q)$-oper structure.

Mesoscale and Nanoscale Physics

Encapsulated macroscopic WS$_2$ monolayers enable room-temperature exciton-polariton lattices

Large-area, optically homogeneous monolayer semiconductors are a critical prerequisite for scalable room-temperature polaritonics and for realizing polariton lattices extending across many unit cells. Yet, the small size, optical inhomogeneity, and device-to-device variability of conventional exfoliated flakes have remained major obstacles. Here, we overcome these limitations using 1-dodecanol-encapsulated WS$_2$ monolayers that combine millimeter-scale coverage with remarkably uniform optical properties over lateral distances approaching $300\,$$\mu \mathrm{m}$. Integrated into a tunable open microcavity, these monolayers exhibit robust room-temperature exciton-photon strong coupling, evidenced by a pronounced anti-crossing and a Rabi splitting of $\hbar \Omega_{\mathrm{R}} \approx 31\,\mathrm{meV}$. Leveraging the exceptional uniformity of this platform, we realize a two-dimensional polaritonic kagome lattice and directly resolve its characteristic band structure. Angle-resolved spectroscopy reveals Dirac dispersive bands together with a weakly dispersive flat-band-like branch within the $s$-band, in good agreement with a linear non-interacting model. Complementary momentum- and real-space imaging further identifies the associated bond-centered and site-centered mode profiles. These results establish large-area WS$_2$ monolayers in open microcavities as a scalable platform for engineering polariton band structures and exploring synthetic quantum materials under ambient conditions.
Read the full abstract

All authors Shiyu Huang, Sander Scheel, Jiang Qu, Johannes Düreth, Dominik Horneber, Edith Wietek, Simon Widmann, Libo Ma, Monika Emmerling, Martin Kamp, Simon Betzold, Alexey Chernikov, Sven Höfling, Sebastian Klembt

Artificial Intelligence

A Tool-Augmented, GPT-4 Chatbot for Real-Time Repository Data Analysis

Software repositories contain vast amounts of data on code contributions, bug reports, and project activities, yet this information remains challenging for non-technical stakeholders and developers to access due to limited expertise in querying repositories. To address this, we introduce a novel chatbot architecture leveraging OpenAI's GPT-4 model for automated extraction and analysis of repository data. In contrast, our architecture takes a structured path first by parsing the user's query to extract relevant parameters, then selecting the correct tool to employ based on that analysis, and finally invoking the GPT-4 model to create a highly detailed response. In contrast to previous work based on multi-component systems with embedding models and document retrievers, our architecture inverts the process by relying on prompt engineering and tool selection to fit with the query intent. To validate our approach, we conducted experiments on various question types, including Issues, Pull Requests, Commits, Compound Questions, and General Repository Information, evaluating our target prompts' ability to improve the accuracy of responses from the model. Beyond demonstrating the utility of this architecture to a diverse set of users, our findings suggest that this architecture can make repository data more accessible to technical and non-technical audiences through the production of actionable insights.
Read the full abstract

Analysis of PDEs

Strong and Weak-Type Dispersive Estimates for the Energy-Critical Nonlinear Schrödinger Equation with an Inverse-Square Potential

We prove dispersive estimates for the three-dimensional defocusing energy-critical nonlinear Schrödinger equation associated with $\mathcal L_a=-\Delta+a|x|^{-2}$. For nonnegative potentials, we extend the known finite-$p$ theory to the endpoint $L^1\to L^\infty$. For negative potentials in the global well-posedness range, set $\sigma=\frac12-\sqrt{\frac14+a}$. We obtain the free strong decay rate for $2<p<3/\sigma$ and the limiting Lorentz estimate from $L^{(3/\sigma)',1}$ to $L^{3/\sigma,\infty}$. The restriction $p<3/\sigma$ is sharp for strong Lebesgue decay. The proof combines a finite-interval bootstrap, nonlinear real interpolation on bounded energy sets, and endpoint Sobolev–Lorentz estimates adapted to $\mathcal L_a$.
Read the full abstract

Plasma Physics

Self-organized positron reorienting and pinching mechanism for the experimental detection of the linear Breit-Wheeler process

The linear Breit-Wheeler (LBW) process ($\gamma+\gamma\rightarrow e^{-}+e^{+}$) is a fundamental prediction of quantum electrodynamics, but yet to be observed under laboratory conditions using real photons. In recent years, a few experimental schemes utilizing high-intense ($\sim10^{22}$W/cm$^2$) laser-plasma interactions to observe the LBW process have been proposed. However, a high level of signal-to-noise-ratio are expected in these schemes, hindering the first-ever experimental detection of the LBW process by real photons. In this paper, we present a simple experimental setup which could enhance the expected positron signals by 2-3 orders of magnitude compared to previously proposed schemes, reaching the level of $10^{6}$MeV$^{-1}$str$^{-1}$. Moreover, such high positron signal is achieve in the direction opposite to the laser propagation, where a significantly quieter background is expected compared to the previously focused direction of laser propagation. The key to achieve this result is a newly discovered self-organized positron reorienting and pinching mechanism, enabled by the in-situ strong plasma fields from the laser-plasma interaction.
Read the full abstract

All authors Yutong He, Alexey Arefiev, Mario Manuel, Hui Chen, Christopher Ridgers

Number Theory

Zeros of Ramanujan-Like Polynomials

In this paper we study a naturally occurring variant of Ramanujan polynomials with a Bernoulli convolution structure, $S_v$, related to the double Mordell-Tornheim series. In particular, we prove for even $v$ all zeros of $S_v$ lie on the complex unit circle, and for even $v \ge 4$ they are simple with the exception of roots at $1, -1$, which are double roots.
Read the full abstract

Cryptography and Security

Benchmarking LLMs for Threat Level Determination

The fast progress of large language models (LLMs) opens new opportunities in the management of cyber threat intelligence, but their reliability for operational tasks remains unclear. In this work, we benchmark LLMs on the task of threat level determination. First, we construct a curated dataset derived from publicly available MISP OSINT feeds. Next, we design a tailored prompt to systematically compare eight different LLMs under zero-shot conditions. Finally, we apply supervised fine-tuning on each model and perform a comparative analysis between baseline and fine-tuned versions. Our results show that zero-shot models achieve weak performance, with limited ability to correctly assign threat levels. Fine-tuned models, however, demonstrate substantial improvements, reaching F1 scores between 0.40 and 0.58 depending on the base architecture. Despite this progress, the performance is still low for practical deployment, highlighting the need for additional research on data quality, model adaptation, and domain-specific tuning.
Read the full abstract