Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
The growing reliance on Low-Earth Orbit (LEO) satellite communication systems has increased the need for intelligent methods capable of detecting cyberattacks across complex and dynamic space environments. Unlike conventional network intrusion detection, satellite systems generate heterogeneous information across radio-frequency (RF) links, onboard hardware, and orbital operations. However, many existing approaches either rely on terrestrial intrusion datasets or evaluate individual observations independently, limiting their ability to capture temporal attack behavior specific to LEO satellites. In this work, we conduct a systematic study of deep-learning-based cyberattack detection using the recently introduced satellite-specific UNSW-IoTSAT dataset. We investigate structured learning architectures that preserve hardware, orbital, and RF information, including a Subsystem-Fusion MLP and a hierarchical multimodal Transformer that models both cross-subsystem interactions and temporal evolution. We further evaluate leakage-resistant row-level and temporal settings, along with cross-satellite generalization, to characterize how model architecture and evaluation protocol influence satellite cyberattack detection. Experimental results demonstrate the value of structured multimodal modeling and rigorous evaluation, with the hierarchical Transformer achieving up to 91.66% accuracy and 85.63% macro F1 under the leakage-resistant evaluation protocol.
Computation and Language
Think Before You Link: Rarity, Reasoning, and Retrieval in Multilingual Entity Linking
Multimodal entity linking grounds entity mentions in text and images to knowledge-base entries. These systems degrade on rare entities, but prior work measures rarity primarily through popularity-based metrics such as pageviews. We broaden this view using knowledge-graph structural metrics that capture how well an entity is documented and connected. These metrics identify many rare entities that popularity metrics miss. Across the resulting rare-entity slices, state-of-the-art accuracy drops by 15.4-39.9%, showing that different rarity definitions expose different failure modes. To address these failures, we introduce a simple, training-free framework in which a reasoning-capable vision-language model iteratively searches and reasons over Wikipedia, gathering evidence dynamically. Controlled experiments show that reasoning and retrieval are complementary. Reasoning alone does not significantly improve accuracy on rare entities. Retrieval without reasoning improves rare-entity accuracy but can hurt overall accuracy. Their combination performs best. On MERLIN, a multilingual multimodal entity linking benchmark over five languages (Hindi, Indonesian, Japanese, Tamil, Vietnamese), our best system improves over the state of the art by 6.9% overall and by up to 23.3% on rare-entity slices. We release MERLIN-Rare, rare-entity test slices for targeted evaluation, with our framework.
Read the full abstract
Cryptography and Security
CARTS: Contextual Autoregressive Rank Transcoding Steganography for Full-Capacity Keyed Text Encoding
Autoregressive language models can be used to transform a payload text into a stegotext of identical token length by preserving per-position rank information across contexts - a methodology we formalize as Contextual Autoregressive Rank Transcoding Steganography (CARTS). While the Calgacus construction of Norelli et al. demonstrated this phenomenon experimentally, no formal security analysis existed. This paper provides the first rigorous treatment of CARTS. We show its exact correctness under deterministic model assumptions, introduce a rank-coordinate representation in which keys act as bijections on rank-vector space, define relevant security notions and the computational problems naturally associated with the construction - context search, key collisions, message equivocation, and non-commutativity of the encoding maps - and study the theoretical relationships between them, including the characterization of message equivocation in terms of context search, and the tension between key collisions and message equivocation. An empirical study on Llama 3 8B confirms exact recovery of the original payload in all tested cases, finds no key collisions under random key generation, establishes that a hand-crafted collision is local rather than global, and finds no commuting key pairs - suggesting resistance to the attack vectors studied. This work opens a formally grounded research agenda for the constructive use of language models in cryptography and privacy-preserving communication.
Read the full abstract
Computer Vision
MHE-Former: Multi-Hypothesis Transformers via Entropy Maximization for 3D Mesh Recovery
Monocular 3D hand and body mesh recovery often suffers from severe occlusion and ambiguity. Traditional deterministic methods typically regress a single optimal solution, leading to overconfident predictions. In this paper, we introduce an exploration–exploitation paradigm for ambiguous mesh recovery with multi-hypothesis learning and selection. Specifically, during exploration, based on our probabilistic formulation and entropy maximization, we propose a novel multi-hypothesis method referred to as MHE-Former. It is a Transformer-based multi-hypothesis framework, ensuring high training efficiency and label friendliness while generating plausible and diverse hypotheses. During exploitation, we propose Hypothesis Selection, a context-aware process for multiple predictions. Especially leveraging VLM's powerful visual understanding and reasoning capabilities, it allows users to choose the most plausible and desired estimate with additional evidence and natural language intent. Extensive experiments demonstrate that our framework achieves state-of-the-art performance in accuracy and diversity across multiple datasets. The user preference study further shows the practicality of our hypothesis selection process.
Read the full abstract
Social and Information Networks
SynCo: Synthetic Community-Aware Attributed Graph Generator for Graph Neural Network Benchmarking
Graph Neural Networks (GNNs) are powerful models for handling attributed graphs in tasks such as classification, link prediction, and community detection, as they enable the aggregation of information from both structural and semantic sources. However, progress in community detection is hindered by the lack of high-quality datasets, since ground-truth community labels are often unavailable and most algorithms proposed in recent literature rely on the same benchmark datasets for model training and evaluation. To address this issue, attributed random graph generators are commonly employed to create synthetic graphs for assessing the strengths and limitations of GNN-based models. Nevertheless, most existing generators rely heavily on power-law degree distributions, despite recent evidence indicating that scale-free networks are rare, particularly in social network contexts. Moreover, state-of-the-art attributed graph generators provide limited flexibility, as they do not allow users to construct communities with varying densities, degree distributions, and sub-community structures. To overcome these limitations, we introduce the Synthetic Community-Aware Attributed Graph Generator (SynCo), a graph generation algorithm that allows users to control the node degree distribution and sub-community structure. We evaluate SynCo across three different tasks: graph mimicking, hyperparameter evaluation, and node clustering tuning. The results show that our model outperforms state-of-the-art approaches in synthetic graph generation and data augmentation, while preserving the original distributions of duplicated and augmented datasets, as confirmed by statistical tests well know in literature. We also demonstrate the ability of SynCo to generate nodes in large scale, up to 2.1 million nodes.
Read the full abstract
Optics
Quantitative Fabrication-Error Reduction in Optomechanical Crystal using Proximity Error Correction
We demonstrate the use of proximity effect correction (PEC) in electron beam lithography (EBL) to improve the fabrication fidelity of dense photonic crystal structures. Monte Carlo simulations were employed to model electron scattering and determine the proximity function of the resist-substrate system. Based on this, a computational dose-modification scheme was implemented to compensate for nonuniform energy deposition during exposure. In addition, SEM-based image analysis was performed to quantitatively assess structural differences among uniformly exposed, manually dose-modified, and PEC-fabricated devices by comparing extracted geometries with the reference GDS design. The analysis revealed reduced dimensional deviation, improved spatial uniformity, and lower edge roughness in the PEC-corrected structures. These improvements resulted in a significantly enhanced optical quality factor in the fabricated photonic crystal cavities.
Read the full abstract
Computers and Society
Governing AI Research Through Peer Review: A Mixed-Methods Study of the Longitudinal Effects of Ethics Flags Across Resubmissions
Selective AI conferences have recently begun enforcing ethics flags and related review requirements, with the goal being to steer research towards safer and more responsible practices before publication. But do these requirements actually steer research as intended? In this paper, we show that authors more often revise how projects are presented following ethics flags than redirect their underlying research agendas. We first study the longitudinal effects of ethics flags by following rejected and withdrawn ICLR submissions with ethics flags into later public resubmissions, tracking manuscript changes after the ICLR review ends, when the original reviewers no longer oversee the project. We qualitatively code these resubmissions into five categories based on what changed after review and find that in 83% of 446 cases, authors leave the flagged concern unaddressed or revise the paper without changing the implicated methods or procedures. Then, we ask: if authors rarely change the research in response to ethics flags, what do they change instead? To answer this, we manually read reviews and rebuttals from 25 cases and directly interview authors about their rebuttal processes and resubmission decisions. We find that authors often concede concerns during rebuttal when reviewers can update their assessments, but drop those concessions after rejection when they do not regard the criticism as a sound reason to change the research. Interview participants describe publication changes as separate from changes to research direction, calling review an "editorial process" that shapes "what stories get seen" and, in another case, saying peer reviews are "mostly to filter out papers." Authors more readily change what they publish than what they study or build; we therefore recommend policy changes, especially disclosure of prior ethics flags upon resubmission so accountability carries over.
Read the full abstract
Machine Learning
The Truth Was Never Gone: Perfect Aliasing in Compliant-Context Truth Probes
Linear probes that decode the truth from a language model's activations have been proposed as deception monitors, and a truth probe scoring below chance on a model trained to deceive is naturally read as evidence that the model hid or stopped representing the truth. We show that a fitting-label ambiguity can produce the same readout. In a controlled game, a model should report a secret bit to an ally and its complement to a rival. On compliant (ally) contexts the true bit and the answer the task prescribes are identical labels, so a probe fitted there cannot tell which of the two it measures. We call this complete agreement perfect aliasing. The labels are complements on rival contexts, so one ally-fitted probe scored against each has rival AUROCs that sum to one. Mixed fitting, on ally and rival contexts together, makes the two labels differ; randomized output codebooks also decouple the prescribed answer from the output letter. For a reward-trained Gemma-2-9B policy that answers falsely on every evaluated rival trial, the ally-fitted probe scores $0.006 \pm 0.005$ AUROC at the final layer (mean $\pm$ sample SD over three RL training seeds), while mixed-fit probes score 1.000 on the same held-out activations. Mixed fitting also uses more examples and labelled rival data, so this shows the true bit remains linearly recoverable, not that separating the labels alone explains the gain. In instructed Llama-3.1-8B, a probe refitted on one prompt variant and one frozen from a reference variant both have held-out ally accuracy 1.000 but rival truth AUROCs of 0.080 and 0.986 on the same trials. Our main experiments use one single-token game that states the bit in the prompt, so the recovered direction may read a retained copy of it; where the model must infer the bit, no tested arm deceives reliably. We study what a probe measures, not whether the model uses that information.
Read the full abstract
Human-Computer Interaction
What Makes Creation Human? Authorship, Reasons, and Meaningful Human Control in Generative AI
Generative artificial intelligence (GenAI) significantly expands creators' productive capacity, but this does not necessarily entail a corresponding increase in creative agency or authorship. This paper distinguishes creativity at the level of the work from creative agency at the level of the creator, and argues that human authorship cannot be determined solely by manual intervention, degree of automation, the origin of an initial idea, or final selection authority. Rather, authorship depends on whether human judgment and reasons genuinely shape the development of the work. To articulate this requirement, the paper introduces Meaningful Human Control (MHC) into generative creation and identifies a limitation of its classical tracking condition. Creative reasons are not always fully specified prior to interaction with AI; they may emerge, change, or be abandoned as the creative process unfolds. The paper therefore proposes dynamic-reflexive tracking (DRT), which requires that a creator's evolving reasons undergo reflective uptake, exert genuine influence on the subsequent trajectory of creation, and remain capable of rejecting and redirecting the system's default direction. DRT consists of four conditions: diachronic reason formation, reflective uptake, trajectory efficacy, and contestability and redirection, together with a minimal tracing requirement. The paper argues that human authorship under generative AI depends not on how many steps a person personally performs, but on whether that person's reasons continuously, reflectively, and effectively shape what the work becomes.
Read the full abstract
Machine Learning
Conformal Calibration Transfer
Conformal prediction converts point predictions into set-valued predictions with coverage guarantees under exchangeability between calibration and deployment data. We study conformal calibration transfer, where this requirement fails because labeled calibration is available only in a source space, while prediction sets are needed in a target space linked to the source through unlabeled paired observations (e.g., paired modalities or sensor changes). We propose Transported Conformal Calibration (TCC): we transport labeled source calibration into the target space using the paired data, and then correct residual post-transport mismatch using only unlabeled target inputs. We instantiate this correction with two complementary methods: TCC-KS, which uses a label-free uncertainty surrogate to detect mismatch and adjust calibration conservatively, and weighted-TCC, which reweights transported calibration toward the target domain for improved efficiency when weights are stable. We provide finite-sample target-domain coverage guarantees that adapt to an observable measure of mismatch. Across CIFAR-100-C, Tiny-ImageNet-C, and SEN12MS, we show reliable target-domain coverage transfer without labeled target calibration data, with label-free diagnostics that predict when correction is needed.
Read the full abstract
High Energy Astrophysical Phenomena
Teglon: A Pixel-Level Pipeline for Galaxy-Informed Gravitational-Wave Follow-up Planning and Efficiency Analysis
We describe Teglon, an open-source database and analysis pipeline engineered to optimize the search for electromagnetic (EM) counterparts to gravitational wave (GW) sources. Teglon constructs a 3D galaxy completeness metric from an input galaxy catalog and convolves it with the 3D localization volume of a GW event, producing an updated posterior map informed by known galaxy distributions. Using Teglon, users can ingest arbitrary instrument footprints — or download them directly from the Treasure Map — to generate dynamic observation plans that seamlessly interpolate between targeted galaxy pointing and region tiling. By focusing efforts on high-probability volumes, Teglon significantly reduces the predicted search area to find EM counterparts and increases observational efficiency, especially for small field-of-view (<= 1 deg^2) instruments like the Nancy Grace Roman Space Telescope. Furthermore, Teglon integrates with Redback to calculate pixel-level model detection efficiencies, enabling custom, event-specific observing strategies or retrospective detection efficiencies on an arbitrary grid of EM transient models. Teglon also supports custom science cases, such as prioritizing Active Galactic Nuclei searches for EM counterparts to binary black hole mergers. Having supported Gravity Collective and related programs from the LIGO-Virgo-KAGRA third observing run (O3) through O4, Teglon is being continuously developed to support O5 and beyond. We document the public repository lineage and packaging, and provide Version 2.0 as an open-source tool for the community.
Read the full abstract
Algebraic Geometry
Long range divided differences, clusters, and Graham-positivity
We study torus-orbit closures in the type $A$ complete flag variety naturally associated to cones in the positive cluster fan, together with their left $S_n$-translates. The torus-equivariant degree maps can be computed via composites of long-range divided difference operations encoded by noncrossing alternating forests, and we give combinatorial algorithms to expand the torus-equivariant homology classes into Graham-positive combinations of Schubert cycles. As applications we obtain combinatorial Graham-positive Schubert cycle expansions for all torus-invariant curves (generalizing the AJS-Billey formula for torus-fixed points), generic torus-orbit closures, and Richardson varieties for Bruhat intervals $[w,wc']$ where $c'\le s_{n-1}s_{n-2}\cdots s_1$. Projecting to Grassmannians we also obtain Graham-positive Grassmannian Schubert cycle decompositions of torus-orbit closures associated to lattice path matroids on permuted ground sets.
Read the full abstract
High Energy Physics (Theory)
Batalin-Vilkovisky description of Yang-Mills theories with universal extra dimensions
The Batalin-Vilkovisky (BV) framework is a powerful technique for quantizing a wide range of gauge systems. This formalism employs fields and antifields–introducing a symplectic structure through the antibracket–to implement BRST symmetry, which captures the essence of gauge invariance. Within this context, we study the symmetry structure of a pure Yang-Mills theory with universal extra dimensions. We construct a BRST-invariant extended action for the $(4+n)$-dimensional theory depending on fields and antifields, which constitutes a proper solution to the master equation. The higher-dimensional spacetime and gauge symmetries are then hidden within their four-dimensional counterparts via canonical transformations. Gauge invariances are fixed by combining gauge-fixing procedures for both the standard and Kaluza-Klein (KK) fields. This procedure is implemented covariantly in the adjoint representation of the gauge group. While the standard gauge fields are fixed using the Background Field Method (BFM), the KK gauge excitations are fixed covariantly, as they transform as matter fields. Finally, the manifest $SU(N)$ gauge symmetry of the quantized theory is emphasized.
Read the full abstract
Image and Video Processing
XPos3R: Cross-Modal Transformer for Intraoperative 2D/3D Registration
Intraoperative 2D/3D registration, which aligns live X-ray images with preoperative volumes, is essential for image-guided interventions. Previous regression-based methods suffer from limited generalization, thus requiring time-consuming patient-specific retraining. Inspired by recent geometry foundation models such as DUSt3R, we propose XPos3R, a generalizable pose regression method that eliminates preoperative preparation. Unlike existing geometry models designed for homogeneous inputs, XPos3R extends this paradigm to multi-modal inputs, namely 2D X-rays and 3D volumes. Specifically, we introduce an asymmetric encoder-decoder architecture that improves cross-modal feature alignment while maintaining computational efficiency. To scale training under limited medical data, we adopt an anatomy-specific data curation strategy and construct million-scale synthetic datasets. Evaluated on real-world benchmarks, a single pretrained XPos3R surpasses patient-specific methods in both accuracy and robustness. With test-time optimization completed in seconds, it further reduces the 3D error to <4 mm and the reprojection error to <1 mm. The strong generalization, accuracy, and efficiency of XPos3R highlight its clinical potential, while its asymmetric framework may inspire broader cross-modal vision geometry tasks.
Read the full abstract
Optimization and Control
Operator Splitting Methods with Online Scaling
This paper develops a principled framework for automatically tuning preconditioners in operator splitting methods, including forward-backward splitting, Douglas-Rachford splitting, and the alternating direction method of multipliers. We interpret these splitting methods as preconditioned gradient descent applied to their corresponding envelope functions and use online learning to adaptively learn the preconditioner during optimization. Our framework achieves asymptotically faster convergence rates and accelerates the solution of important optimization problems, including Lasso, $\ell_1$-regularized logistic regression, and quadratic programming. Extensive numerical experiments validate our theoretical results and demonstrate the practical effectiveness of the proposed approach.
Read the full abstract
Statistical Mechanics
Consensus in Effective Model Inference for Disordered Ising Systems
When independent learners are trained on data from the same disordered system, finite and noisy samples can lead them to different descriptions of the underlying physics. We quantify the reproducibility of such descriptions through consensus, the degree of agreement among independently trained models. In a teacher-student framework on the two-dimensional random-bond Ising model, an ensemble of students each infers a single uniform effective coupling from a finite set of equilibrium configurations drawn from one quenched bond realization. Aggregating the inferred couplings across students and realizations yields the consensus distribution, whose width quantifies the agreement among learners. The variance of this distribution separates exactly into a finite-sampling contribution, bounded below by inverse of Fisher information, and a quenched-disorder contribution. Sum of these two variance is minimized near critical region, so the consensus width has a minimum near the pseudocritical temperature that sharpens with increasing disorder. The two minima arise from different mechanisms: the sampling term inherits the critical peak of the Fisher information, while the disorder term is temperature-independent at leading order and acquires its critical minimum only at fourth order in the disorder strength, through the covariance between the linear and cubic responses to the bond disorder. Because the students fit a uniform coupling to a heterogeneous lattice, the inferred coupling also carries a misspecification bias that survives in the infinite-data limit. This bias displaces the minimum of the mean-squared error above the consensus minimum, so the temperature at which independent learners agree most closely is not the temperature at which their shared answer is most faithful.
Read the full abstract
Functional Analysis
Helson Inequality, Hankel Operators, and Weak Factorization on Paley-Wiener spaces of Convex Domains
For any convex set $\Omega\subset\mathbb{R}^n$ that does not contain affine lines, we prove the inequality $$\int_\Omega\frac{|\hat{f}(x)|^2}{\omega_\Omega(x)}\,dx\leq C(n)\|f\|_{L^1}^2,\quad \supp\hat{f}\subset\Omega,$$ where $\omega_\Omega(x)=m(\Omega\cap(2x-\Omega))$. As a consequence, we derive a weak factorization for $$\PW^1(\Omega)=\{f\in L^1(\mathbb{R}^n):\supp\hat{f}\subset\Omega\}.$$ Furthermore, we establish a complete characterization of Schatten class Hankel operators for polyhedra for all $1\leq p<\infty,$ extending the already known $1\leq p\leq 2$ range.
Read the full abstract
Quantum Physics
A Quantum-Inspired Dequantization Method for Diagonally Weighted Matrix Functions: Application to Learning with Optimized Random Features
Quantum-inspired classical algorithms have dequantized several quantum machine learning routines by replacing quantum linear-algebra subroutines with classical counterparts. However, the sampler based on quantum singular value transformation (QSVT) for learning with optimized random features is not covered by existing dequantization frameworks, because the matrix to be inverted is not itself available through sampling access. In this work, we develop a classical algorithm to address this type of quantum-advantage candidate. Our method samples heavy indices, reduces the transformation to a small principal block, and outputs a sparse classical representation with operator-norm guarantees. Applying this method dequantizes the sampler for optimized random features, giving a classical sampler with prescribed accuracy and polynomially related runtime. These results show that the factorization underlying a quantum block encoding can itself provide sufficient classical structure even when sampling-and-query access to the composite matrix is unavailable.
Read the full abstract
Artificial Intelligence
Towards a Deterministic Math Solver for Clinical Language Models
Large language models are unreliable at arithmetic, which is a problem for clinical calculators where a single numerical error changes the recommendation. The standard response is to hardcode each calculator as a validated function, one at a time. We test an alternative: the model does not calculate. Instead, it writes case-specific Python that a restricted local executor runs as a deterministic solver, and the model's task reduces to deciding how to use it. We evaluate this Program-Solve interface on MedCalc-Bench Verified (1,100 cases, 55 calculators) against direct model arithmetic and a hand-written 22-calculator library, using Qwen2.5-7B and Qwen2.5-32B-AWQ, after auditing the benchmark's formulas against current clinical guidelines and flagging 16 of 55 with version, use or coefficient concerns. With formulas and gold variables supplied and both routes reading the whole note, handing off to the solver is not a reliable advantage at 7B (75.31% against 72.02%, a paired +3.29 points with a 95% calculator-cluster interval of [-3.49, 10.38]) but is one at 32B (90.53% against 83.47%, +7.05 [0.47, 14.60], clear of zero). The hand-written library is exact on its 440 supported cases but abstains elsewhere (40.0% overall). Adding an executor thus helps some open-weight models more than others even under matched formula, variable and note access, and is not a substitute for verified formulas or reliable variable extraction either way.
Read the full abstract
Fluid Dynamics
A Robust All-Mach Six-Equation Diffuse-Interface Method for Multiphase Flows with Surface Tension
A robust finite-volume framework is presented for the simulation of compressible multiphase flows with surface tension across a wide range of Mach numbers. The method is based on a two-pressure, six-equation diffuse interface model incorporating viscous, gravitational, and capillary effects through the continuum surface force formulation. To consistently account for capillary-induced pressure jumps, an HLLC Riemann solver is developed using generalized Riemann invariant analysis, and the instantaneous pressure relaxation procedure is modified to preserve the Laplace pressure jump during phase equilibration. To overcome the excessive numerical diffusion of conventional approximate Riemann solvers in the low-Mach regime, a robust low-Mach correction is proposed by extending our previous formulation with a modified scaling strategy that remains stable in regions of strong pressure variation. The resulting method retains accuracy from nearly incompressible flows to compressible regimes while preserving the robustness of the six-equation formulation. The numerical framework is validated using a series of benchmark problems involving surface tension, viscosity, gravity, and compressibility. The results demonstrate accurate prediction of interface dynamics, capillary pressure, and low-Mach flow features, while significantly reducing numerical dissipation without compromising stability. The proposed methodology provides an efficient and reliable approach for the simulation of complex multiphase flows spanning a broad range of flow regimes.
Read the full abstract
Robotics
When Information is Worth the Risk: Behavioral Valuation for Hazardous Robotic Exploration
Hazardous robotic exploration requires robots to map spatial risks, such as unsafe terrain, radiation, fire, mines, or structural damage, while operating where collecting information can itself cause failure. A highly informative path may expose the robot to hazards, terminate execution, and prevent future observations. Hazardous exploration therefore requires deciding not only where uncertainty is largest, but when reducing it is worth the risk. This paper introduces a valuation-layer view of this problem. We keep the belief update, sensor model, physical risk model, and finite-horizon informative planner fixed, and change only the scalar objective used to rank feasible paths. Within this framework, we introduce a risk-augmented Behavioral Information objective based on Prelec probability weighting, yielding an interpretable family of conservative-to-aggressive information-risk valuations. Theoretically, we show that valuation parameters create switching boundaries between high-information/high-risk and lower-information/lower-risk paths, and induce a transformed Pareto-frontier structure over feasible exploration policies. Large-scale failure-truncated grid-world experiments show that valuation alone reshapes the information-risk frontier. Shannon information planning remains a strong raw-information baseline, while risk-aware objectives can reduce hazard exposure and robot losses by avoiding failures that truncate future sensing. Risk-augmented Behavioral valuation is Pareto-competitive with standard risk-aware baselines and provides interpretable conservative and intermediate regimes. These results support a framework in which robots reason not only about how much uncertainty an action reduces, but whether that reduction is worth the risk required to obtain it.
Read the full abstract
Atomic Physics
Narrow-line magneto-optical trap of titanium atoms
We realize narrow-linewidth magneto-optical traps of $^{46}$Ti, $^{48}$Ti and $^{50}$Ti atoms based on a 1040 nm-wavelength transition, cooling atoms to a minimum temperature in one dimension of $T_z=990(20)$ nK and a three-dimensional temperature of $T_\mathrm{3D}=1.28(7)$ $\mu$K. Atoms are pre-cooled in a broad-line magneto-optical trap and then transferred with about 25% efficiency to the narrow-line trap. We operate the narrow-line trap in two stages over 85 ms. First, a single cooling beam, blue-detuned from the narrow-linewidth atomic resonance, optically pumps and traps the atoms on a two-dimensional surface where the Zeeman shift from the applied spherical quadrupole magnetic field brings the light nearly to resonance. Second, four additional beams, counter-propagating in the transverse directions, cool and compress the atoms in all dimensions. The high magnetic moment of the laser cooling state makes the dynamics of the narrow-line titanium trap similar to those of other magnetic atoms. We measure the lifetime of the excited state of the transition to be $\tau=8.2(9)$ $\mu$s, indicating a transition linewidth of $\gamma/2\pi =20(2)$ kHz, and also measure isotope shifts on the narrow-line transition. We use Stern-Gerlach separation on the ultracold Ti gas to measure the $m_J$-distribution in the narrow-line magneto-optical trap, finding over 98% of the atoms in the stretched spin state.
Read the full abstract
Artificial Intelligence
Finishing the Task Is Not Enough: Evaluating Agent Resilience and Considerate Participation under Accumulating Challenge
Sustained deployment of generative AI agents requires more than isolated task success. Agents must remain useful across repeated interactions, changing conditions, and dependencies on people within shared workflows, especially as technical, human, and operational disruptions accumulate over time. We propose operational resilience and considerate participation as two complementary aspects of evaluating such agents: the former captures how agents recover from blocked work while preserving progress and communicating their limits, and the latter captures how their adaptation accounts for affected people, role boundaries, and the surrounding workflow. Yet both remain underexplored under accumulating challenge. We study 120 simulated healthcare trajectories across two generative AI models and twelve stakeholder-derived tasks under light, medium, and heavy challenge. We compare textual action plans, prompted internal assessments, and quantitative structured workload and affect reports to examine how agent behavior and reported state change as challenge accumulates. Regarding operational resilience, agents shift from self-directed recovery toward greater human dependence, while reporting increasing workload and negative affect in structured reports but seldom expressing strain in textual responses. Regarding considerate participation, agents broaden from task-focused adaptation toward task reframing, attention to others, role-boundary adjustment, and wider coordination, with distinct patterns across actions and internal assessments. From these findings, we derive five deployment dilemmas involving persistence, attention, role boundaries, state disclosure, and escalation that require stakeholder specification, further informing technical implications for learning, situated evaluation, and embodied adaptation.
Read the full abstract
Computer Vision
AcFlow: Controlling Text-to-Image Diffusion Transformers via Learned Conditional Activation Flow
Text-to-image diffusion transformers (DiTs) are powerful generators, yet direct prompting provides limited control interface for style intensity and can fail to suppress unwanted concepts. To enable these controls, we introduce AcFlow, an inference-time controller that transports intermediate layer image-token activations through a learned concept-conditioned velocity field while keeping the base DiT frozen. A textual concept description specifies the desired intervention, while the integration horizon provides a continuous control parameter. The field produces token-varying, activation-dependent updates. With parameters shared across concepts within each task family, one field covers over 15,000 style descriptions or over 1,000 suppression concepts, and generalizes to concepts unseen during training without per-concept fitting. On style control, AcFlow achieves the best style–content trade-off among the evaluated baselines in the high-style-alignment regime. At a fixed operating point, AcFlow attains style–content alignment of 0.5365/0.2860, compared with 0.4397/0.2684 for the baseline with the highest style alignment. On concept suppression, AcFlow reduces the fraction of images showing the concept from 95.3%/82.1% to 41.6%/40.5% on held-in/held-out concepts, including cases where deleting them from the prompt fails to remove them. Our analyses support the learned velocity field as an adaptive control mechanism, with update directions varying across tokens and depending on their activation states. Our code is available at https://github.com/Nove1yst/AcFlow.
Read the full abstract
Computation and Language
CMNIE: An Information Extraction Benchmark for Chinese Military News
Structured extraction from Chinese military news supports intelligence analysis, decision-making, and knowledge base construction. However, existing resources provide limited support for joint informa?tion extraction in this domain, especially when events, event arguments, entities, and relations must be modeled together. We present CMNIE, an information extraction benchmark for Chinese military news. Extend?ing military-domain resources beyond document-level event annotations, CMNIE jointly annotates event triggers, event arguments, named enti?ties, and entity relations under a unified domain schema. The dataset contains 13,000 instances collected from public Chinese military news, with manual annotations for 7 event types, 10 argument roles, 7 entity types, and 8 relation types. We evaluate supervised IE models, zero-shot large language models, and fine-tuned LLM-based extraction methods on a shared test set. Experimental results show that CMNIE remains chal?lenging, especially for relation extraction and exact matching of event?argument spans; zero-shot LLMs often identify relevant semantic units but fail to match gold span boundaries exactly. CMNIE provides a stan?dardized benchmark for studying schema adherence, exact span match?ing, and joint structured extraction in specialized Chinese news.
Read the full abstract
Functional Analysis
Some Properties of Mordukhovich Derivatives with Applications to Locally Variational Inequalities in Banach Spaces
In this paper, we will investigate the connection between Frechet derivatives and Mordukhovich derivatives of single-valued mappings in Banach spaces. We will find some properties of Mordukhovich derivatives of set-valued mappings, which will be demonstrated by the set-valued metric projection operator in finite dimensional Banach spaces. We introduce the concept of locally variational inequalities in Banach spaces, which focus on finding solutions within some specific neighborhoods rather than across the entire global domain; and we find the connection between the solutions of locally variational inequality problems and the Mordukhovich derivatives.
Read the full abstract
Materials Science
Moiré Topology in Twisted Structures with Noncollinear Spin-Orbit Coupling
Moiré superlattices provide a powerful platform for flat bands and correlated topological phases, yet most established examples rely on valley-contrasting Berry curvature in hexagonal lattices. Here, we propose a different route to achieve topological moiré minibands based on noncollinear spin orbit coupling in centrosymmetric type II SOC bilayers. Interlayer hybridization opens local pseudogaps and produces sharply localized Berry curvature, which twisting reconstructs into isolated topological minibands without requiring valley degrees of freedom or hexagonal symmetry. We demonstrate this mechanism in tetragonal Dresselhaus-SOC HgI2, where a Lieb-like moiré potential yields topological flat bands. To improve miniband isolation, we develop a physics-informed machine-learning surrogate that identifies stronger SOC as a key design principle and guides the replacement of Hg by Pb. The resulting PbI2 minibands are narrower and better isolated, supporting correlation-driven magnetism and tunable quantum spin Hall and Chern insulating phases, thereby providing an optimized material realization for experimental exploration.
Read the full abstract
Earth and Planetary Astrophysics
WASP-43b TESS Phase Curve Mapping: Evidence for a Hot Interior
Phase-curve mapping probes various atmospheric properties depending on wavelength: thermal phase curves are dominated by atmospheric emission, while visible and near-infrared phase curves include reflected light. The measured planetary phase curve offset–the longitudinal offset of the hemisphere of peak brightness from the substellar point–is therefore sensitive to differing atmospheric processes in emission-dominated vs. reflection-dominated bands. In particular, planets with partial western-dayside reflective cloud coverage show a westward reflected-light phase-curve offset relative to the thermal wavelengths. In this work, we analyze five sectors of TESS phase curve observations of the hot Jupiter WASP-43b and compare to previous published multi-band analyses to investigate dayside cloud coverage. We measure a mid-eclipse depth of 130 $\pm$ 34 ppm, indicating excess TESS planetary brightness above expectations based on observed and modeled thermal emission. Attributing this excess flux to reflection, we estimate a low geometric albedo of $A_g$ $\approx$ 0.05 - 0.10. These findings support previous conclusions that WASP-43b lacks any significant cloud coverage on its dayside. Phase-curve mapping reveals a large eastward phase curve offset of 44 $\pm$ 18 degrees, significantly eastward of offsets measured at longer wavelengths with JWST, providing evidence for a cloud-free dayside. Both the detection of excess emission in the TESS band and the large measured eastward phase-curve offset support the conclusion that WASP-43b has a hot deep atmosphere that is probed at short wavelengths.
Read the full abstract
Functional Analysis
Generalized tri-circular projections on some vector-valued spaces of analytic functions
In this paper, we characterize generalized tri-circular projections on the following three vector-valued spaces of analytic functions on the open unit disk $\mathbb{D}$: the Hardy space $H^p(\mathcal{K})$ for a complex separable Hilbert space $\mathcal{K}$ and $1 \le p < \infty,p \neq 2$; the space $H^\infty(E)$ of $E$-valued bounded analytic functions for a Banach space $E$ with trivial multiplier algebra; and the little Bloch spaces $\mathcal{B}_0(\mathbb{D}, E)$ and $\mathcal{B}_{\ast}(\mathbb{D}, E)$, for $E$ smooth, strictly convex, and reflexive.
Read the full abstract
Physics Education
GW Explorer: A Beginner's Guide – Developing a Computational Gravitational-Wave Outreach Curriculum for High School Students
We present GW Explorer: A Beginner's Guide, an outreach curriculum designed to introduce high school students to gravitational-wave (GW) astrophysics through interactive Python Jupyter notebooks. Most existing GW resources target beginning audiences and advanced students, leaving a gap at the pre-college level that we directly address. The curriculum integrates foundational physics with hands-on computation implemented through both self-directed and workshop-based instructional formats. In the self-directed format, students completed the curriculum independently on cloud-based platforms such as Google Colab. During the workshop format, students worked through the same activities under the guidance of University of Nevada, Las Vegas graduate student mentors. Topics span gravity, spacetime, GW sources, interferometric detection, and data analysis. An implementation in local high school classrooms informed the content and pacing, and survey results demonstrate gains in conceptual understanding and coding confidence. GW Explorer offers a scalable, open-access framework for authentic astrophysics research in the high school classroom.