Machine Learning
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 29 August
In a data-driven world, efficiently organizing and mapping relationships between objects is crucial. Graphs are powerful tools for modeling these connections, being widely used in social networks, telecommunications, and biology. However, graph-based methods often face high computational costs, particularly in memory and space usage. To address this, graph embedding techniques, also referred to as Network Representation Learning, encode graph information into lower-dimensional representations while preserving structural aspects. Traditional methods, however, lack interpretable dimensions. RaDE (Rank Diffusion Embedding) introduces a new approach using rank-based information, with a key step being the selection of a representative subset of nodes to provide interpretability for its dimensions and improve retrieval tasks. Despite its potential, RaDE's original proposal did not fully explore the effectiveness of representative subset selection across different classes or evaluate embeddings in tasks like classification and clustering. Inspired by RaDE, this work introduces GRaCE (Graph and Rank-based Contextual Embeddings), a fully unsupervised framework that generates interpretable embeddings by leveraging robust rank-based measures for representative subset selection and node embedding. GRaCE surpasses RaDE and Original Features across diverse datasets, including textual and image collections, excelling in retrieval, classification, and clustering tasks, considering state-of-the-art Transformer models as feature descriptors and Graph Convolutional Networks models in classification tasks.
Robotics
Coding What Matters: A Semantic-Aware Memory Interface for Energy-Efficient Perception in Autonomous Vehicles
Autonomous vehicles stream high-resolution surround-camera frames into memory before perception runs. This sensor-to-memory path consumes energy when cells store ones and adjacent bytes toggle on the data bus, so its cost follows bit-1 density and switching activity rather than pixel semantics. We present MotiMem-Omega, a semantic-aware memory-interface coder that lowers this cost while preserving perception predictions. Its semantic importance field protects traffic participants, especially vulnerable road users, while assigning lower fidelity to sky and empty background. Cross-dataset bit-sensitivity sweeps determine class weights, with a safety floor for pedestrians, cyclists, and motorcyclists. Each image block then selects a precision tier by minimizing a joint energy-distortion cost. When ego pose is available, a motion-compensated prior carries protected regions between frames. We estimate interface-energy reduction from the two measured proxies using a coefficient-swept memory-energy model. Across 29 detectors on 12 driving datasets, 5 occupancy models, and 5 segmentation networks, MotiMem-Omega retains about 90% of detection mean average precision, 91% of vulnerable-road-user recall, over 98% of occupancy accuracy, and the strongest segmentation retention among energy-reducing methods. It reduces front-camera bit-1 density by 52%, corresponding to a modeled memory-interface energy reduction near 36%, with a lower end of 27% under the literature coefficient sweep. It also gives higher retention than the baseline and energy-matched truncation at the same or lower bit-1 density, whereas image codecs preserve accuracy without reducing memory-interface energy.
Read the full abstract
Analysis of PDEs
Time periodic problem of the Navier-Stokes equations in an exterior domain with periodically moving boundary
In this paper we consider the Navier-Stokes equations in exterior domains of $\mathbb{R}^n$, $n\geq 3$, with a periodically in time moving boundary $\partial\Omega(t)$ and external force $f(t)$. For this case we prove the existence of a locally unique mild time periodic solution in weighted function spaces with radially symmetric Muckenhoupt weights. The solutions split into a stationary part controlled by potential theoretic estimates and a purely oscillatory part constructed as mild solution via analytic semigroup theory. To deal with perturbation terms of even second order - coming from a coordinate transform and the moving boundary - in weighted, homogeneous Sobolev spaces a maximal $L^1$ type regularity estimate will be used in weighted Lorentz spaces. To control the convective term an $\mathcal H^\infty$-calculus in weighted spaces of the Stokes operator, its $BIP$ property and embedding estimates of fractional powers are exploited, see a recent paper by the authors: The Stokes operator on exterior domains in homogeneous weighted function spaces: From weak theory to $\mathscr H^\infty$-calculus to fractional domains (2025).
Read the full abstract
Materials Science
Can a Spin Liquid State Persist as the Ground State in the Presence of Competing Interactions and Disorder?
In this report, we have shown that, in an otherwise geometrically frustrated lattice, the underlying interactions compete to stabilize different magnetic phases. In conjunction with fluctuations, these interactions may lead to the formation of unusual ordered phases, providing a pathway for understanding the fluctuation-driven order-by-disorder phenomenon. This competition is further modified by the presence of inherent structural disorder in a frustrated two-dimensional lattice. Furthermore, due to the local nature of the additional structural disorder, the majority of the samples evolve toward glassy dynamics, which can not only mimic spin-liquid-like behavior but also make it difficult to identify genuine spin-liquid candidates experimentally.
Read the full abstract
Artificial Intelligence
Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free
In May 2026 an OpenAI model produced a counterexample to the Erdős unit distance conjecture. Five mathematicians published a human-verified version the same day, and the result entered the literature within weeks. In August 2026 the same laboratory published ten mathematical and theoretical computer science results, each accompanied by a machine-checkable Lean 4 certificate with no unproved steps. Four weeks later, one remained the subject of an unresolved dispute over whether its formalization meant what it claimed. We argue that this difference is structural. We distinguish three layers of verification: derivational validity, which a kernel checks; representational fidelity, whether the formal statement means the intended question; and epistemic significance. Only the first is mechanizable. Making it effectively free therefore does not eliminate verification work but shifts the burden to layers dependent on scarce expert attention. Measurements of the August corpus illustrate the shift. The kernel-checked proofs total 20.6 MB, while the statements requiring human audit total 55.6 KB, a ratio of 379 to 1. Yet those statements contain 218 bespoke definitions rather than relying on community-vetted ones. The audit surface is therefore small in volume but irreducibly expert. We argue that machine checking produces verification abundance while leaving adjudication scarce. We propose a six-category taxonomy of representational mismatch, a disclosure schema for machine-generated mathematical claims, and implications for software, cryptography, and regulated decision systems.
Read the full abstract
Materials Science
Orbital occupation selects structural dimensionality in binary transition-metal oxides
Orbital-lattice coupling in transition-metal oxides is usually discussed within a given bonding framework, where orbital occupation is intertwined with local coordination, strain, or symmetry breaking. Here, we show that orbital occupation can also select the bonding framework itself, thereby determining structural dimensionality. Using first-principles calculations, we identify CrO as a prototype in which the single active $3d\,e_g$ electron of high-spin Cr$^{2+}$ gives rise to two competing orbital-structure states. The $d_{x^2-y^2}$ occupation favors a three-dimensionally connected covalent phase, whereas the $d_{z^2}$ occupation stabilizes a weakly coupled layered phase. Constrained-occupation calculations show that increasing the $d_{z^2}$ filling continuously contracts the in-plane lattice while expanding the structure along the layer normal. The two phases exhibit distinct magnetic ground states and ferroelastic responses. Moreover, the layered phase is robust against exchange-correlation functional and on-site ($U$) variations, remains dynamically stable down to the monolayer limit, and has a low exfoliation energy of 46 meV/Angstrom^2. Extending the analysis across related $3d$ binary oxides reveals a filling-dependence relation between accessible orbital filling and the preference for 2D or 3D connected bonding motifs, providing a microscopic basis for exploring low-dimensional oxide materials.
Read the full abstract
Robotics
Hydra: A Navigation World Action Model with Discrete Latent Planning and Continuous Flow-Matching Execution
World models let robots imagine possible futures, but exploiting this capability for real-time planning is bottlenecked by a representation misalignment: generative models and planners operate on decoupled manifolds, requiring computationally expensive decoding of every candidate back to the high-dimensional observation space for evaluation. In this paper, we present Hydra, a discrete World Action Model that tackles this by establishing a unified latent manifold over visual states, physical poses, and control actions. By compressing this manifold through modality-specific Vector-Quantized bottlenecks, Hydra yields discrete vocabularies of kinodynamic intents and visual states. This enables Discrete Latent Planning (DLP), where candidates are sampled directly from the shared manifold and ranked by a Kinematic-Perceptual Cost within the discrete latent space. To bridge discrete planning with the continuous commands required for physical actuation, Hydra pairs DLP with conditional Flow Matching to map selected intents to smooth execution trajectories. Evaluated on two physical robotic platforms, Hydra outperforms state-of-the-art navigation world models in goal-directed planning, while matching or exceeding the closed-loop execution capabilities of leading reactive navigation policies.
Read the full abstract
Superconductivity
Electronic state of vortices at twin boundaries in a nematic superconductor
Local electronic states of vortices in an s $\pm$ d wave nematic superconductor are studied both in the absence and presence of twin boundaries. The Bogoliubov-de Gennes theory for a tight-binding model is used with its nematicity represented by the anisotropy in the transfer integrals and attractive interactions between the nearest-neighbor sites. We evaluate s and d wave components of the pair potentials and the local density of states, and analyze the effects of nematicity on the vortex core structures with/without twin boundaries. We find that a single vortex trapped at the twin boundary is composed of a bound pair of fractional vortices accompanied by weakly-induced s $\pm$ id wave components, despite that such s $\pm$ id wave components do not appear in a zero magnetic field. The calculated spatial structures of the local electronic states are compared with the vortex image measured by STM experiments in an iron-based superconductor FeSe.
Read the full abstract
Optimization and Control
A New Primal-Dual Algorithm with Two Convex Combinations and Linesearch for General Convex-Concave Saddle-Point Problems
Convex-concave saddle-point problems are ubiquitous across diverse domains, including machine learning, image processing, economics, and equilibrium problems. Primal-dual algorithms provide a highly effective and powerful framework for convex-concave saddle-point problems. Convex combination has become a crucial acceleration technique for primal-dual algorithms, and the integration of this technique has recently made these algorithms a highly active research topic. The choice of the convex combination parameter often has a significant impact on both the theoretical analysis and the numerical performance of the corresponding algorithms. However, the requirements on this parameter imposed by theory are sometimes inconsistent with those suggested by numerical experiments. For instance, theoretical analysis often requires the parameter to be small, while numerical experiments tend sometimes to favor larger values. To address this inconsistency and further advance primal-dual algorithms with convex combination, we develop a novel strategy based on two convex combinations, integrate it into a primal-dual framework, and propose a new primal-dual algorithm with linesearch, termed NPDAL-n, for general convex-concave saddle-point problems. The proposed two convex combinations in NPDAL-n ensure that the permissible range of the convex combination parameters is mainly determined by theoretical considerations, with little regard for numerical performance. Through rigorous Lyapunov energy descent analysis, we establish the global convergence and a sublinear ergodic convergence rate of $\mathcal{O}(1/N)$ for NPDAL-n under standard assumptions. When the primal function is strongly convex, we develop an accelerated version of NPDAL-n that achieves an optimal $\mathcal{O}(1/N^2)$ rate.
Read the full abstract
Cryptography and Security
CARVY-FL: Client Anticlustering for Robust Voting in Provably Secure Federated Learning
Federated learning (FL) enables collaborative training without directly sharing raw data, but remains vulnerable to malicious clients. Voting-based FL improves robustness by partitioning clients into groups, training one model per group, and aggregating predictions by plurality voting. However, under class-disjoint non-IID data, distribution-oblivious grouping can yield highly variable certified accuracy (CA). We propose CARVY-FL, which estimates client distribution types from one-epoch model updates and uses anticlustering to increase within-group distributional diversity. Under a fixed grouping, CARVY-FL retains the voting-based CA guarantee while increasing vote margins. Experiments on MNIST and Fashion-MNIST show higher CA than FLCert. Under BadNets with model replacement, CARVY-FL improves the AUC of 100-ASR by 11.1% and 14.9%, respectively.
Read the full abstract
Machine Learning (Statistics)
Jigsaw-CRL: Recovering Global Latent Causal Order from Fragmented Multi-Client Interventions
Causal representation learning (CRL) aims to recover latent causal variables and their structural relations from high-dimensional observations. Existing CRL methods typically assume that all environments are defined over the same latent variables, or at least share a common latent representation space. We study a fragmented multi-client setting, where multiple clients interact with the same global latent causal system but each client only accesses and intervenes on a subset of the latent variables. In this regime, marginalizing unused latent variables induces bidirected edges, so a single client no longer admits a node-wise latent causal graph, and the global latent causal order must be recovered by assembling client-specific structural fragments. We propose Jigsaw-CRL, a framework for recovering global latent causal order from such fragmented interventions. Under soft interventions, differences between precision matrices across environments exhibit a low-rank structure governed by latent ancestor relations. This enables recovery, for each client, of a block partition, the corresponding block-level ancestral order, and latent subspaces, and then assembly of these fragments into the global node-level latent causal order. We establish identifiability guarantees, develop practical algorithms, and validate the framework on synthetic data. Our codes are available on https://anonymous.4open.science/r/code-for-Jigsaw-CRL-7B26
Read the full abstract
Artificial Intelligence
Agentic AI uncovers conserved cross-tissue protein co-abundance programs inaccessible to single-dataset analysis
Protein co-abundance clusters preserved across tissues can nominate shared disease mechanisms and therapeutic targets, particularly where proteins implicated in organ-confined diseases converge in other tissues. Yet cross-tissue proteomic studies have examined pre-selected tissue pairs, leaving most combinations, and non-obvious relationships among them, unexplored. Exhaustive comparison requires consistently assessing thousands of candidate clusters from hundreds of tissue-pair networks across heterogeneous evidence, a scale beyond manual curation. We present an LLM-agent framework for large-scale, evidence-grounded comparison of tissue-specific protein co-abundance networks. From sample-level proteomic data, it constructs tissue networks, derives conserved clusters for each tissue pair, integrates evidence from expression atlases, interaction and complex databases, pathways, disease associations and the literature, and proposes mechanistic hypotheses in which every conclusion cites its evidence. Applied to all 231 pairs among 22 human tissues and sample groups, it identified 1,825 conserved clusters in 216 tissue pairs. Co-abundance relationships were shared beyond chance in 76% of pairs, including unrelated organs, and shared clusters were only weakly associated with abundance similarity. Clusters were enriched 3.7- to 6.9-fold for known interactions and complex memberships, and 379 of 793 testable clusters replicated in independent CPTAC proteomes. Some clusters pointed to relationships absent from current databases: one shared by liver and bone marrow linked three genes causing inherited white matter disorders, suggesting a common mechanism via the integrated stress response. Conserved co-abundance clusters thus offer a hypothesis-generating resource for studying disease proteins beyond the affected organ. Code: https://github.com/jacob20030316-crypto/Protein_Co_Abundance_Agent
Read the full abstract
Human-Computer Interaction
Using LLMs to Mimic the Conversational Dynamics of Reddit Communities
Online communities face a constant battle against toxicity and misinformation. While human moderators struggle to keep pace with the volume of content, LLMs offer a promising solution for automatically generating constructive responses and shaping online interactions. This paper preliminarily investigates if LLMs can mimic the communication styles of Reddit users using their comment history as context. We evaluate two prompting approaches: predicting a target comment and filling in masked comments. We find that LLMs outperform expectations at replicating comment structure and formality, but struggle to accurately capture nuanced emotions, e.g. understating joy and overstating anger. These findings highlight a promising direction for LLMs in guiding online conversations towards prosociality influencing emergent communication patterns and norms within the community. The results of our study inspire future work with more rigorous methods of evaluation to explore the LLMs' effectiveness across diverse online communities to better understand their broader societal impact.
Read the full abstract
Optimization and Control
B$^3$-PWL: GPU-Batched Branch-and-Bound for Piecewise-Linear Optimization with SOS2 Constraints
Piecewise-linear (PWL) optimization problems arise in many mixed-integer programming (MIP) optimization applications, including portfolio optimization, workforce scheduling, and resource allocation. But solving them to global optimality remains computationally expensive because branch-and-bound repeatedly solves LP relaxation subproblems. Existing solvers are largely CPU-centric, leaving the scalability of modern GPUs underutilized. Few prior GPU-accelerated branch-and-bound either targets neural network which is not suitable for general PWL optimization, or accelerates only auxiliary subroutines such as strong branching heuristics within CPU-centric MIP solvers. To bridge this gap, we propose B$^3$-PWL, a GPU-centric batched branch-and-bound framework for piecewise-linear optimization with Special Ordered Set of type 2 (SOS2) constraints. Our method solves batches of LP relaxation subproblems concurrently on the GPU using a first-order primal-dual solver, enabled by a specialized batched block-tiled sparse matrix kernel. To complement bound computation, we further introduce a unified feasibility search module that combines an SOS2 repair primal heuristic with a batched feasibility pump to rapidly obtain feasible incumbents and improve pruning efficiency. On a benchmark of 43 PWL-MIP instances, B$^3$-PWL achieves a 9.25x geometric-mean speedup over NVIDIA cuOpt while reaching high-quality feasible incumbents on every tested instance. On a public valve-point unit-commitment benchmark, it further outperforms NVIDIA cuOpt and the open-source CPU solvers SCIP and HiGHS, demonstrating the potential of first-order LP methods as the central engine of GPU-accelerated branch-and-bound.
Read the full abstract
Astrophysics of Galaxies
Estimation of Dust Mass from Infrared Emission and Extinction of Supernova Remnants: G93.7-0.2, G109.1-1.0, G156.2+5.7, and G166.0+4.3
Supernova remnants (SNRs) are major sites for both the production and destruction of interstellar dust, and quantifying their dust budget is essential for understanding the life cycle of cosmic dust. In this work, the dust masses of four Galactic SNRs (G93.7$-$0.2, G109.1$-$1.0, G156.2+5.7, and G166.0+4.3) are estimated using two complementary methods: the three-dimensional (3D) interstellar extinction map and infrared (IR) spectral energy distribution (SED) fitting based on photometry from WISE, IRAS, AKARI, and Planck. The extinction masses, derived from the differential extinction within each SNR's distance interval, are 108.3, 82.0, 48.8, and 119.2 $M_\odot$, respectively. A two-component (“warm + cold") modified blackbody fitting yields warm dust temperatures of 43–74\,K and cold dust temperatures of 13–16\,K, with the cold dust component dominating the total IR-emission mass ($\sim$90–400 $M_\odot$). The extinction masses and IR emission masses show systematic differences, likely caused by sightline contamination from unrelated foreground/background material and uncertainties in dust temperatures and opacities.
Read the full abstract
Computation and Language
Detecting and Guiding LLM-Generated Korean Poetry with Interpretable Form-level Features
LLMs often struggle with modern Korean poetry, producing outputs that resemble "line-broken prose." We address two coupled tasks: detecting whether a Korean poem is human- or LLM-authored, and guiding LLMs to generate poetry closer in form to human writing. We quantify the human-LLM gap along four form-level linguistic dimensions: output length (Volume), the diversity and connective use of line-final forms (Structure Variation), the irregularity of line lengths (Rhythmic Irregularity), and adherence to standard orthography (Normative Adherence). We operationalize these dimensions as five interpretable features. For detection, a logistic regression classifier over these five features attains an average AUC-ROC of 83.60 in zero-shot out-of-distribution detection across seven unseen LLMs, versus 75.84 for the strongest baseline in our comparison, KatFishNet, an absolute gain of 7.76 AUC points and a 10.23% relative improvement; one generator-specific punctuation pattern outside our taxonomy remains a boundary case. For generation, expert evaluation on GPT-5.2 prefers feature-guided poems over the unconstrained baseline, and analyses across GPT-5.2 and Gemini-3 show that targeted length, rhythm, and ending statistics move toward the human distribution. These results suggest that interpretable, language-specific features can bridge the diagnosis and guidance of LLM-generated poetry.
Read the full abstract
Quantum Physics
Measure of set imaginarity
Recent studies have shown that Bargmann invariants provide effective detectors of set imaginarity. In this paper, we investigate set imaginarity as a quantum resource in qubit systems. By exploiting the structure of Bargmann invariants, we show that the free operations for qubit set imaginarity consist precisely of common unital operations and common planarized operations. Based on this characterization, we introduce an axiomatic framework for set-imaginarity measures (SIMs). In particular, we propose two refined notions, namely unified SIMs and complete SIMs, which allow a more fine-grained quantification of set imaginarity. To make these notions concrete, we construct two qubit SIMs from the Bargmann invariants of three-state subsets. We prove that one of them is a unified SIM, while the other satisfies the stronger requirements of a complete SIM. Furthermore, we revisit the robustness of set imaginarity previously introduced in the literature. We show that, although this robustness is a valid SIM for qubit systems, it is neither a unified SIM nor a complete SIM. To overcome this limitation, we propose an improved robustness-type measure and rigorously prove that it defines a complete qubit SIM.
Read the full abstract
Analysis of PDEs
Optimal regularity and fine asymptotics for very fast diffusion equations in bounded domains
We prove the optimal global regularity of admissible solutions to a transformed very fast diffusion equation in the range $-1<p<0$, posed on smooth bounded domains with zero Dirichlet boundary data and initial data comparable to the distance function. More precisely, we establish existence and uniqueness and show that solutions belong to $C^{1,p+1}(\overline\Omega)$ in space for every positive time and are $C^\infty$ in time uniformly up to the boundary. Moreover, all their time derivatives belong to $C^{1,p+1}(\overline\Omega)$, and the exponent $p+1$ is optimal. These regularity estimates further yield fine long-time asymptotics toward the friendly giant solution, including a first-order expansion in the $C^{1,p+1}(\overline{\Omega})$ topology and an improved convergence rate for the relative error in $C^{p+1}(\overline\Omega)$.
Read the full abstract
Analysis of PDEs
Schauder estimates for the linearized very fast diffusion equations in bounded domains
We establish Schauder estimates for linearized very fast diffusion equations with Dirichlet boundary conditions in bounded smooth domains. These estimates provide an important ingredient for deriving optimal boundary regularity and long-time dynamics of solutions to very fast diffusion equations.
Read the full abstract
Computer Vision
FractureFields: Contact-Aware Binary Multi-Field Transfer for Fractured 3D Gaussian Simulation
Physics-integrated 3D Gaussian representations make it possible to simulate image-reconstructed assets directly as particles, but current Gaussia-MPM pipelines keep a single Eulerian velocity field even after fracture. When disconnected fragments share interpolation support, they still write to and read from the same grid nodes, producing cross-fragment momentum leakage that appears as residual adhesion and non-physical stretching. We present FractureFields, a topology-adaptive transfer for fractured 3D Gaussian objects. After a structural event assigns persistent fragment identities, FractureFields builds fragment-specific mass and momentum fields in a single P2G pass, advances each field independently, and performs a field-aware G2P update so particles only sample their own fragment's grid state. To handle re-contact, we add a momentum-conserving contact projection that applies equal and opposite normal impulses only when two fragment fields are approaching, preserving free separation otherwise. Experiments on reconstructed scenes and a controlled re-contact benchmark show that fragment-conditioned routing eliminates realized cross-fragment mixing by construction, while contact projection reduces interpenetration during collision without reintroducing residual coupling. Overall, we argue that post-fracture simulation should treat structural disconnection as a change in local dynamical state, not merely a change in constitutive stress.
Read the full abstract
Machine Learning
V2TATC: Joint Voice-Trajectory Embedding and Dataset for Air Traffic Controller Situational Awareness
As air traffic volumes in the National Airspace System continue to expand, in particular at low altitude, the need for scalable decision support tools used by air traffic controllers will also require more development. This article introduces Voice-to-Trajectory for Air Traffic Control, a joint voice communication-flight trajectory data embedding framework, that can be a component of situational awareness in congested airspaces, and assist the development of tools for ATC as they reason in real-time over Automatic Dependent Surveillance-Broadcast trajectories, or the intent expressed by pilots in natural language. We show that these data modalities are not independent and represent a common physical referent: an aircraft flying through the airspace. V2TATC maps a voice instruction and the trajectory of the addressed aircraft to nearby points in a single latent space that can be queried in both directions. It combines a self-supervised trajectory encoder, a frozen speech encoder, a contrastive joint embedding, and a bijective lifting via normalizing flows. We demonstrate V2TATC's effectiveness on the San Francisco Bay Area, for its concentration of major airports, and its mix of commercial and general aviation traffic. Lastly, we release a novel paired voice-trajectory dataset, and report experiments on cross-modal retrieval, ablations, and latent-space analysis.
Read the full abstract
Computation and Language
The Illusion of Replacement: Rethinking Specialized Machine Learning Models in the Foundation Model Era
Specialized machine learning architectures encode structural assumptions (equivariance, permutation invariance, relational structure) that language-based foundation models lack by design. This review asks whether such assumptions can instead be acquired through language, drawing on a corpus of 186 papers published between 2016 and 2026 across nine modalities: tabular data, graphs, time series, vision, chemistry, code, knowledge graphs, point clouds, and protein structure. Methods are organized into eight representational regimes, ranging from language-only prompting to fully specialized architectures, and are assessed not only on predictive accuracy but on whether structural information is preserved by the representation and computed by the model. Language-mediated models prove competitive in extreme few-shot prediction, discretized symbolic tasks, and textually annotated knowledge graphs. No evidence of general replacement survives once structure itself is evaluated: where direct tests exist, apparent parity is traceable to information asymmetry, benchmark contamination, or computation performed outside the language model. Across independent research communities, missing structural inductive biases are reintroduced through graph modules, structure-aware tokens, or specialized attention, indicating that specialization is relocated rather than eliminated. The review closes by specifying a falsifiable controlled experiment that would measure the remaining gap directly. The derived data supporting the findings of this review are openly available in the repository at https://github.com/kiyan-rezaee/language-vs-structure.
Read the full abstract
Human-Computer Interaction
AREAs-Lab: An Interactive Environment for AI-driven Requirement Elicitation for AI Systems
Building effective AI systems increasingly depends on writing high-quality task requirements, yet users often struggle to articulate the constraints, preferences, and edge cases that determine success. This problem is especially acute in AI development, where behavior is shaped not only by human expectations but also by data characteristics. We present AREAs-Lab, an interactive environment for AI-driven Requirement Elicitation for AI systems. In AREAs-Lab, an assistant iteratively refines an initially incomplete requirement by analyzing the underlying dataset and asking targeted clarification questions to uncover the user's latent intent. To study this setting systematically, we construct a synthetic benchmark grounded in 16 public datasets spanning diverse domains and task types. Each benchmark instance includes a user profile, a complete reference requirement, and an intentionally underspecified version that serves as the assistant's starting point. We further introduce an automated evaluation pipeline based on an AI-simulated user that reveals hidden information only when appropriately prompted, enabling scalable and reproducible assessment of interactive elicitation quality. AREAs-Lab provides a controlled testbed for studying how AI assistants can transform vague user goals into actionable requirements for AI systems.
Read the full abstract
Artificial Intelligence
Selective Forgetting: A Graph-Based Memory Framework for Long-Term LLM Agents
Knowledge graphs have been proposed as a structured alternative to flat retrieval-augmented generation for long-term agent memory, on the assumption that representing conversations as entities and relations improves recall. We evaluate that assumption directly. Our framework extracts each conversational turn into typed nodes and attributed edges, answers questions from a two-hop subgraph, and periodically prunes nodes that score low on a weighted combination of recency, access frequency, degree centrality, and age. On LongMemEval, the graph does not outperform a flat vector baseline at a matched candidate-generation budget of five retrieval roots: token F1 is $0.417$ against $0.468$, and a paired bootstrap over 500 questions gives $\Delta = -0.050$ (95% CI $[-0.085, -0.016]$). The gap is widest on questions that require recalling a specific prior assistant turn, where judged correctness falls from $0.911$ to $0.607$, suggesting that decomposing a turn into entities discards the surface form these questions depend on. The forgetting module is more successful. Applied once to a persistent 27{,}021-node graph, it removes 9.8% of nodes and 9.5% of stored bytes; token F1 is unchanged ($+0.001$, 95% CI $[-0.015, +0.016]$) and judged correctness falls by $1.6$ points, with the 95% interval bounding any loss at $3.8$ points ($[-0.038, +0.006]$). Because our extractor is a single small model evaluated on one benchmark, these results characterise this extraction-based pipeline rather than graph-structured memory in general. Code: https://github.com/skhanzad/Selective-Amnesia
Read the full abstract
Artificial Intelligence
The Role of Network Topology and Opponent Information in Shaping Cooperation in Multi-Agent Reinforcement Learning Systems
Several works have investigated the influence of graph topology on cooperation among artificial agents, while the majority of the literature has focused on modelling agents' adaptation through strategy imitation, which relies solely on the cumulative payoffs of others. This paper investigates scenarios in which each agent learns to play the two-player Iterated Prisoner's Dilemma (IPD) using deep reinforcement learning. Each agent is represented as a node in a graph, where its neighbours constitute the pool of opponents with whom it can interact. During each IPD episode, agents are provided with different types of information about their opponent, consisting of action history and opponent identity. Experimental results across different graph topologies show that the number of neighbours per node and the average path length are the main factors affecting the emergence of cooperation. We also show that, while partner selection fosters mutual cooperation by limiting the diversity of the opponent pool, providing agents with the identity of their opponent hinders the proliferation of cooperative strategies.
Read the full abstract
Systems and Control
Geodesic strong convexity does not imply forward invariance under gradient flow on SO(3): a certified counterexample
Let $mathcal{C}=\overline{\mathcal{B}}_{\rho}(R_c)$ be a geodesic ball of radius $\rho<\pi/2$ in SO(3) with the bi-invariant metric, and let $f$ be geodesically strongly convex on $\mathcal{C}$ with an interior minimizer. It is tempting to expect the gradient flow $\dot R=R(-\nabla f)^\wedge$ to keep $\mathcal{C}$ forward invariant: the flow is attracted to an interior point, and strong convexity appears to leave no room for outward motion. We show this expectation is false by an explicit, fully certified construction with $\rho=0.3$: a cost, quadratic in the principal logarithmic chart with off-diagonal coupling $0.7$, whose geodesic Hessian satisfies $\Hess f\succeq\mu I_3$ on all of $\mathcal{C}$ with a machine-certified modulus $\mu\geq0.172$, rigorous ball arithmetic over exact rational inputs, yet whose descent velocity at a boundary point has the exact rational outward radial component $21/500$. A continuity corollary of the exact rate certifies that the flow exits the ball; numerical integration puts the peak excursion near $0.3143$ before convergence to the minimizer. The mechanism is elementary: strong convexity constrains the projection of the gradient onto the minimizer direction, not onto the inward radial direction. Code reproducing every certified constant and figure accompanies the note.
Read the full abstract
High Energy Astrophysical Phenomena
Little Red Dots as Shock-Powered High-Energy Neutrino Sources
Little Red Dots (LRDs) are compact, high-redshift sources whose physical nature remains uncertain. Their optical spectra motivate a scenario in which their emission may be powered by shocks interacting with dense surrounding material. We investigate whether such interactions can power LRDs and contribute to the diffuse high-energy neutrino intensity measured by IceCube. In our simplified model, a fast central-engine outflow drives a shock through stationary or slow outflowing material, followed by a prescribed quasi-stationary interaction near the LRD photosphere. We consider the time-averaged neutrino emission from shock-active LRDs without requiring a single shock to persist throughout the LRD lifetime. We explore parameter ranges motivated by the observed and inferred properties of LRDs, finding solutions with shock luminosities 2.0e43 < L_s < 3.5e44 erg/s. Using an analytical framework for cosmic-ray acceleration and hadronic interactions in dense shock environments, we calculate the resulting high-energy neutrino emission and integrate it over the cosmological LRD population. For our fiducial cosmic-ray parameters, the average predicted contribution below 2e5 GeV increases from 0.2% for the lowest-luminosity quintile to 2% for the highest-luminosity quintile, while an illustrative higher-efficiency case reaches 13% of the IceCube diffuse neutrino intensity. These estimates assume all observed LRDs are shock-active. A smaller active fraction or a reduced covering factor would decrease the predicted intensity, whereas survey incompleteness could increase it. Improved models and population synthesis are needed to constrain the total LRD contribution.
Read the full abstract
Artificial Intelligence
From Analytics to Tumor Boards: An Evidence-Linked Multi-Agent Workflow for Oncology Feature Extraction
Clinically relevant oncology information is distributed across heterogeneous, longitudinal documentation, creating substantial abstraction burden and requiring accurate attribution across specimens, tumors, biomarkers, and time points, while manual cancer-registry abstraction can require 27.2 minutes per case, highlighting the need for scalable methods that preserve clinical context while converting documentation into structured data. We evaluate an oncology information-extraction workflow in which OncoLens supplies multi-source, oncology-aware document selection, aggregation, and normalization from integrated EHRs, while the NimbleMind Multi-Agent System (nMAS) is a configurable oncology information-extraction workflow that extracts clinically relevant structured fields from fragmented oncology documentation. The extraction task uses a clinician-informed schema of 328 attributes spanning report metadata, diagnosis, staging, and cancer-type-specific information. nMAS separates clinician-defined field specifications from model execution and combines complexity-aware extraction, report-level consolidation, and source-grounded validation. The retrospective evaluation included 230 de-identified oncology documents from 40 patients and 418 clinician-reviewed document-field pairs containing 1,126 non-empty reference values. Evaluation focused on fields identified by clinicians as present in the source documents rather than exhaustively annotating all 328 schema fields. nMAS achieved a rank-weighted value-level precision of 82.6%, recall of 87.5%, and F1 of 85.0%, compared with an F1 of 66.4% for an independently implemented UMA-style MiniMax M2.5 comparator. These findings support the feasibility of using a configurable, source-grounded extraction workflow to convert fragmented oncology documentation into reusable structured data.
Read the full abstract
Computers and Society
Free Speech and Artificial Intelligence
Philosophers and legal scholars are engaged in debates about the implications of artificial intelligence for freedom of expression. This paper analyzes the free speech issues raised by two distinct AI technologies: social media recommendation algorithms and conversational AI (i.e., chatbots powered by large language models). The first part shows that, through their recommendation algorithms, social media platforms control the dynamics of speech visibility in the digital public sphere, making algorithmic recommendation relevant to the philosophy of free speech. The second part turns to conversational AI. It discusses both the reasons for granting or withholding speech rights to artificial agents and users' right to receive information, which may render specific forms of chatbot regulation illegitimate. Throughout, the chapter also considers whether social media platforms or AI developers hold corporate speech rights. Its general aim is to raise rather than settle questions that arise from the rapid development of AI technologies.
Read the full abstract
Software Engineering
Legacy System Modernization with Coding Agents: A Case Study
Legacy systems built on discontinued platforms are a recurring technological liability in organizations that depend on these applications to sustain critical business processes. Although modernization is strategically necessary, it is costly and error-prone when performed exclusively through manual effort. In this paper, we report on a case study conducted in a real industrial setting, where we evaluate both the effectiveness and efficiency of AI coding agents in supporting the migration of legacy systems to modern platforms. By using one version of Claude Code agent, we migrated 12 features of distinct complexity levels from a corporate ERP system written in Visual Basic 6 to C# .NET 10 under a single-generation strategy. Once the migration sessions were completed, we measured the equivalence of the migrated features against the original ones, and collected data about the time spent and the number of tokens consumed by the agent during the process. In our experiment, the agent achieved an average equivalence of 70%, with a strong asymmetry across complexity levels; low-level features achieved 92%, and high-complexity ones scored 47%. Similar asymmetry was observed in the cost-based metrics; low-level features consumed 1.47M tokens ($1.66), whereas high-level ones used 9.09M ($10.28). We reveal the practical scenarios and circumstances where this migration strategy is more effective, as well as discuss the limitations and challenges of using AI agents for legacy system modernization.