Data Structures and Algorithms
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Sunday 13 September
We study edge-weighted online bipartite matching under random arrival order, parameterized by the maximum offline degree $d$ and sampling fraction $\theta$. We analyze two sampling-based frameworks. For Deterministic Greedy Sampling, which computes prices from a fixed-size initial sample and then applies a local threshold rule, we derive an explicit worst-case competitive ratio and prove it tight within this policy family for every fixed $d\ge2$ and $\theta\in[0,1]$. The optimal sampling choice interpolates between no sampling for $d=1,2$ and a dense-limit guarantee of approximately $0.2562$, improving on the classical $1/8$ analysis while retaining linear per-arrival time. We also derive worst-case bounds on the variance of the number of matched offline agents, including order-tight behavior as $\theta\to1_-$ and an $O(\theta)$ bound as $\theta\to0_+$ for fixed $m,d$. For Black-Box Sampling–Matching, we introduce prefix-dependent reweighting followed by an arbitrary approximate offline matching solver and prove a transfer theorem whose guarantee is the offline approximation ratio times an explicit function of $d$ and $\theta$. With exact matching, the framework recovers the classical $1/e$ guarantee in the unbounded-degree limit.
Machine Learning
Retrieval-Guided Fine-Tuning as Noisy Estimation: Risk bounds and Architectural Analysis
Retrieval-Guided Fine-Tuning (RAG-FT) incorporates retrieved data directly into the training objective, but the statistical consequences of noisy retrieval during training remain theoretically undercharacterized. We study this question by modeling RAG-FT as an estimation problem in a multi-task linear regression framework, using an OLS proxy for single-layer linear self-attention to obtain finite-sample risk bounds. Under homoscedastic retrieval noise, we show that retrieval failure decays exponentially with task separation relative to noise, and derive explicit finite-sample conditions under which RAG-FT achieves lower risk than both target-only and full-corpus training. We then introduce a Distance-Proportional Noise (DPN) model, in which retrieval quality degrades with rank, and compare two estimators under the same retrieval process: the OLS proxy and the literal, uniform-weight forward pass of linear self-attention. We prove that the attention estimator's bias diverges as $\Theta(n^{2q})$ even under exact retrieval, while OLS risk remains $\Theta(d/n)$ for every noise exponent $q>0$. These results locate the instability not in noisy retrieval itself, but in the fixed, unweighted aggregation of the literal LSA forward pass, which reweighting by reliability empirically removes. We validate the predicted rate separation through direct simulation of the DPN model.
Read the full abstract
Combinatorics
Minimum blockers and extremal graphs for nonnested matchings
We classify all smallest sets of edge deletions that destroy every nonnested perfect matching in a complete ordered graph. The vertices have a fixed linear order. A perfect matching selects edges that use each vertex exactly once; it is nonnested when no selected edge has both endpoints strictly between those of another. On $2k$ vertices, exactly $k$ deletions are necessary, and we describe all $2^k+k-2$ minimum deletion sets for every $k\ge2$. Allowing a matching to leave vertices unused changes the extremal problem. Barát, Freschi and Tóth proposed that an $n$-vertex ordered graph avoiding a nonnested $k$-edge matching can have at most $(k-1)n$ edges. We construct counterexamples for every $k\ge5$ and $n\ge2k+1$. For $n\ge3k$, our constructions exceed the proposed value by a number of edges proportional to $k^2$, matching the order of the known upper bound on this excess. The classification follows from cuts between consecutive intervals; the larger constructions coordinate deletions at the two ends of the vertex order. The exact extremal value remains open in general.
Read the full abstract
Statistical Methodology
A Mathai-type Multivariate Nakagami-$m$ Distribution: Density, Closed-form Estimators, and Asymptotic Efficiency
In this study, we propose a novel multivariate Nakagami-$m$ distribution whose joint probability density function admits a fully closed-form expression. The proposed density is derived using a Mathai-type construction based on the partial sums of independent gamma random variables. For this distribution, the maximum likelihood estimator is not available in the closed form. To address this limitation, an asymptotically efficient closed-form estimator is developed by applying a one-step refinement to a $\sqrt{n}$-consistent initial estimator. Monte Carlo simulations demonstrate that the proposed estimator achieves a performance nearly identical to that of the numerically computed maximum likelihood estimator, while consistently outperforming the closed-form initial estimators. A real-data application further illustrates its practical utility.
Read the full abstract
Complex Variables
The curvature estimation of the complete Kähler-Einstein metrics on the disk bundles
In this paper, we study some geometric properties of the disk bundles over the complete Kähler manifolds. When the base space is the complete Kähler-Einstein manifold, we compute the holomorphic sectional curvature, Riemannian sectional curvature of the complete Kähler-Einstein metric on the disk bundle. Moreover, we present a parametric criteria for whether the manifold admits negative pinched property. When the base space is a bounded pseudoconvex domain equipped with its complete Kähler metric, the corresponding ball bundle in the $k$-direct sum of line bundles is a bounded pseudoconvex Hartogs domain with fiber dimension $k$ . If the base domain is simply-connected and $k\geq2$, we prove that the Bergman metric on such a Hartogs domain is Kähler-Einstein if and only if the domain is biholomorphically equivalent to a unit ball.
Read the full abstract
Cryptography and Security
Quantifying Observable High-Frequency Swapping on Arbitrum
Layer-2 rollups have reshaped Ethereum's transaction economy by replacing mempool competition with deterministic sequencing, sub-second block times, and negligible gas fees. While these properties suppress classical Miner/Maximal Extractable Value (MEV), they give rise to a new and previously unrecognized behavioral regime. In this paper, we introduce the concept of High-Frequency Swapping (HFS), referring to continuous single-hop swaps at machine cadence within decentralized exchanges. Despite its growing footprint, this phenomenon has not been systematically identified or quantified in prior work. We conduct a large-scale measurement of HFS on Arbitrum, using 18 months of full-chain data (Jan. 2023–Jun. 2024). Specifically, we construct a reproducible pipeline that isolates voluntary single-swap transactions, attributes them to the swapper level, and classifies HFS behavior through inter-arrival dynamics. The analysis uncovers 477 distinct HFS swappers responsible for nearly 30 million swaps and over $10^{11}$ USD in notional volume. Our study conducts a comprehensive empirical investigation of HFS from multiple perspectives. We begin with a global overview of activity patterns, and then examine temporal dynamics, swapper identity, token coverage, and venue concentration, and explore swap size, time gap, and order direction. Finally, we explore case-level behavior, including stablecoin arbitrage, CEX-DEX execution gaps, and short-horizon round-trip trading. Across these dimensions, we identify consistent structural regularities that distinguish HFS from conventional retail or arbitrage activity. This work provides a large-scale address-level empirical characterization of High-Frequency Swapping on Arbitrum and a broad empirical foundation for future research on decentralized market microstructure.
Read the full abstract
Quantum Physics
Exact computation of quantum wave functions for nonlinear potentials
Recent work shows that the Schrödinger equation can be solved exactly based only on classical least action. The computation is based on first computing the multi-valued action solutions of the Hamilton-Jacobi equation, computing the classical propagated density along all stationary action multipaths, and finally constructing the exact kernel and wave function based on these classical multi-valued quantities alone. The method requires that the propagated classical square root density along each stationary action path is harmonic, as is the case for basic examples such as e.g., the double-slit, quantum tunneling, or the Einstein-Podolsky-Rosen experiment. For more complex cases, residual Bohm-like quantum potentials along each stationary action path can be eliminated through a time-rescaling. This paper proposes an extended version of the above construction which avoids the need for time-rescaling even in the most general cases. This is achieved by introducing in the Hamilton-Jacobi equation a real viscosity term, which classically simply corresponds to replacing a lumped parameter model with a continuum model including a volumetric stress tensor. This keeps the earlier construction unchanged, except that the real stationary action multipaths are now real stationary viscous action multipaths defined with respect to an associated modified Lagrangian. As in the earlier version, the construction extends straightforwardly to the special and general relativistic contexts, thus describing in a common language the quantum, classical, and relativistic cases. Note that the global Bohm potential term in the lumped Hamilton-Jacobi equation associated with a Madelung transform does not have a classical equivalent, while the volumetric stress tensor term in our viscous Hamilton-Jacobi equation directly represents the real paths of a classical deformed particle field.
Read the full abstract
Number Theory
The weak Chinburg conjecture on Mahler measures
For every negative fundamental discriminant $-f$ and every $k\geq1$, we construct a rational function $R_{f,2k}\in\mathbb{Q}(x_1,\ldots,x_{2k})$ and a constant $r_{f,2k}\in\mathbb{Q}^\times$ such that \[ m(R_{f,2k})=r_{f,2k}L'(\chi_{-f},1-2k), \] where $m$ denotes the logarithmic Mahler measure and $\chi_{-f}$ is the quadratic Dirichlet character associated with $-f$. This proves the weak Chinburg conjecture. An independent construction using Bloch cycles yields a stronger result in two variables: there exists a nonzero polynomial $R_f\in\mathbb{Q}[x,y]$ satisfying \[ m(R_f)=4wL'(\chi_{-f},-1), \] where $w$ is the number of roots of unity in $\mathbb{Q}(\sqrt{-f})$.
Read the full abstract
Quantum Physics
NAQsim: Full-Stack Architecture Simulation Framework for Fast and Space-Efficient Neutral Atom Quantum Computing
Technological advances in neutral-atom platforms have opened a new path toward designing efficient protocols for fault-tolerant quantum computing (FTQC). However, each physical operation is still orders of magnitude slower than on other platforms, such as superconducting qubits. Therefore, architects must identify fast and efficient FTQC architectures, which require reliable modeling tools to explore various design choices across the software, classical hardware, and quantum device stacks of neutral-atom platforms. In this paper, we propose NAQsim, an open-source simulation framework for neutral-atom FTQC architectures based on transversal gates. As its key feature, NAQsim enables detailed full-stack architecture evaluation that opens opportunities to explore previously overlooked performance bottlenecks. As a first use case for NAQsim, we identify one such bottleneck, patch rotations, perform full-stack co-optimization, and finally derive a near-rotation-free architecture (D3-ROT). For practical FTQC benchmark workloads, D3-ROT achieves a 2.27x speedup from this single bottleneck alone, with minimal footprint overhead. These results point to a much broader space of full-stack optimizations that NAQsim makes accessible for transversal surface-code architectures and beyond.
Read the full abstract
Information Theory
On the Generalized Packing and Covering Radii of Codes
The minimum distance and the covering radius are two fundamental properties of the code. Both have been extended: the former to the generalized Hamming weights hierarchy, and the latter to the generalized covering radii hierarchy. In both cases, the lowest level of the hierarchies corresponds to the classical minimum distance and covering radius, respectively. From a geometric point of view, the minimum distance of the code determines the packing radius, which is upper bounded by the covering radius. It was conjectured this relation extends to all other orders of the hierarchy, namely, that the generalized packing radii are upper bounded by the generalized covering radii of the same order. In this paper we prove this conjecture is true for the second order radii. We also prove the conjecture holds for all orders when the code rate is at most $3/5$. Finally, we show that for any code rate in $(0,1)$, for all sufficiently long codes the conjecture holds for all orders.
Read the full abstract
Systems and Control
Collaborative Computation and Migration in Multi-UAV Networks with Semantic Communication
Uncrewed Aerial Vehicle (UAV)-assisted Mobile Edge Computing (MEC) is a key technology for future 6G networks, providing wide coverage and flexible computing services. However, the limited resources of UAVs and the dynamic changes in the network structure make it difficult to maintain high efficiency. Existing methods often ignore the semantic information of tasks and the complex relationships among UAVs and mobile terminals, resulting in poor coordination. This paper proposes a joint optimization framework for task offloading, task migration, and trajectory control in semantic communication-enabled multi-UAV edge computing systems, aiming to maximize semantic similarity while minimizing task latency and system energy consumption. To tackle the resultant problem, we develop a Heterogeneous Graph Attention Network-based Multi-Agent Twin Delayed Deep Deterministic Policy Gradient (HAN-MATD3) algorithm. Specifically, we use a heterogeneous graph to model the network topology and apply HAN to extract important semantic features. These features are then integrated into the MATD3 framework to support joint optimization.
Read the full abstract
Software Engineering
EchoFuzz: Empowering Smart Contract Fuzzing with Large Language Models
Smart contracts, serving as the cornerstone of decentralized applications, autonomously manage trillion-dollar digital assets, making them attractive targets for attacks. Fuzzing has emerged as a promising technique for detecting vulnerabilities in smart contracts, yet existing methods face two main challenges. (1) The logical gap in state transitions and combinatorial redundancy hinders effective tradeoffs between bug detection efficiency and state space exploration cost, leading to critical execution paths to be overlooked. (2) Rule-based sequence mutation strategies suffer from path redundancy and inadequate guidance from contract logic, resulting in performance bottlenecks that stall the exploration of in-depth vulnerability-oriented paths. To tackle these challenges, we propose EchoFuzz, an LLM-guided fuzzing framework introducing Vulnerable Function Call Sequences (VFCS) - minimal, behavior-preserving execution paths that expose bugs through key state transitions. EchoFuzz consists of two key procedures. First, we develop a chain-guided LLM approach, that combines static analysis with logical understanding to generate contract-specific VFCS candidates that eliminate combinatorial redundancy. Second, we adopt an iterative fuzzing strategy that uses LLMs with real-time feedback to adaptively steer fuzzer toward uncovered branches. Experiments show EchoFuzz outperforms state-of-the-art methods, achieving 29% higher branch coverage and detecting 62% more vulnerabilities. It also found 37 previously unknown vulnerabilities in real contracts, showing strong practicality.
Read the full abstract
Social and Information Networks
Measuring Time-Horizon Engagement Effectiveness: Persistence, Recency, and Re-Emergence
Online attention is commonly summarized using cumulative volume, peak activity, or arithmetic averages, but such measures can obscure differences between activity that is sustained over time, concentrated near the present, or renewed after dormancy. This paper introduces the Time-Horizon Engagement Effectiveness (TH-EE) framework, which constructs interpretable temporal profiles of online attention by distinguishing three related but non-equivalent properties: persistence, recency, and re-emergence. We evaluate the framework through controlled engagement traces, a proof-of-concept application to 1,850 YouTube videos across 37 topics (18 cohorts selected a priori as exemplars of persistent, acute, cyclical, and recently originating attention, and 19 cohorts corresponding to authoritatively debunked claims), and an event-level validation on eleven years of daily Wikipedia pageview series for the same topics. The controlled analyses show that the framework distinguishes distributed activity from concentrated bursts, introduces temporal-order sensitivity through recency weighting, and identifies renewed activity after a defined dormant interval. On the event-level series, the framework's reactivations co-locate with Kleinberg burst onsets, and PELT change points far more often than chance. The YouTube application shows that debunked-claim cohorts do not occupy a unique region of temporal-profile space; they exhibit heterogeneous patterns that overlap substantially with benign topics. These results support treating persistence, recency, and re-emergence as separate dimensions of online attention. TH-EE is a descriptive and comparative measurement framework, not a classifier of misinformation, coordination, intent, or content veracity.
Read the full abstract
Computer Vision
PuzzleMate: Benchmarking MLLMs for Egocentric Puzzle Assistance
Personal AI assistants hold the potential to evolve from digital interfaces into embodied companions capable of guiding users through complex physical activities. For these assistants to become integral to daily life, they must do more than identify objects; they must provide precise, step-by-step instructions that align with a user's real-time progress. While Multimodal Large Language Models (MLLMs) show promise in general visual understanding, their ability to deliver grounded, sequential guidance for fine-grained manipulation tasks remains largely unverified. In this paper, we choose the jigsaw puzzle as a strategic testbed for this capability. Unlike general object recognition, puzzle solving demands high-precision spatial reasoning, the ability to distinguish between minute geometric variations, and a rigorous adherence to sequential logic. We investigate this capability through PuzzleMate, a novel framework focused on jigsaw puzzle solving captured through an egocentric viewpoint. We deploy PuzzleMate in a user-in-the-loop study to evaluate how well state-of-the-art MLLMs perceive the current puzzle state and generate actionable next-step instructions. Our analysis reveals seven key bottlenecks that limit their effectiveness. Building on these insights, we propose a benchmark that enables systematic evaluation of MLLMs' reasoning capabilities for puzzle solving. Our findings reveal a substantial performance gap in current models like GPT-5.2 and Gemini-2.5-Pro; while these MLLMs are highly capable, they struggle to navigate the intricate reasoning and sequential logic essential for jigsaw puzzle assistance.
Read the full abstract
Plasma Physics
Superradiant Thomson Scattering via Oscillating Quasiparticles
The recently proposed concept of generalized superradiance (GS) allows for the generation of coherent radiation without the need for complex compression or prebunching of relativistic electrons. However, the quasiparticles in current GS schemes are formed through local electron accumulation and their sizes exceed 100 nm, restricting the achievable radiation wavelength. In this study, we demonstrate a realization of narrow quasiparticles with <10 nm widths through sheet-crossing. When an energy chirped electron beam collides with an intense laser pulse, lower energy electrons at the front slip back, forming an accelerating quasiparticle. These quasiparticles undergo transverse oscillations within the laser field, thereby extending GS emission from the Cherenkov regime into the synchrotron regime. Three-dimensional particle-in-cell simulations indicate the production of gigawatt-class chirped radiation in the 10-100 nm range. The proposed scheme is compatible with existing Thomson scattering facilities, paving the way for the generation of coherent ultrafast radiation.
Read the full abstract
Number Theory
An explicit power-saving bound for Sárközy's Theorem on shifted primes, assuming GRH
Assume the Generalised Riemann Hypothesis. If $A\subseteq \{1,...,N\}$ contains no two elements differing by $p+1$, $p$ prime, then $|A|\ll N^{\frac{89}{90} + o(1)}$.
Combinatorics
The Erdős–Chvátal Simplex Conjecture
We prove the Erdős–Chvátal simplex conjecture across its entire parameter range. If $2\le d<k$ and $(d+1)k\le dv$, then every $d$-simplex-free family of $k$-subsets of $[v]$ has at most $\binom{v-1}{k-1}$ members, with equality only for a full star.
Computer Vision
PRI-Net: A Lightweight Multimodal Framework for 3D UAV Localization
Accurate 3D localization of unmanned aerial vehicles (UAVs) remains challenging for existing multimodal approaches due to sparse LiDAR geometry, modality-imbalanced fusion, and redundant feature transmission over constrained edge-to-server links. To address these limitations, we propose PRI-Net, an efficient and lightweight multimodal fusion framework for UAV localization that integrates point cloud splatting, residual attention fusion, and an information bottleneck. Specifically, a 3D point cloud splatting (3DPCS) strategy is introduced to transform sparse LiDAR observations into geometrically consistent dense depth maps. A residual attention fusion (RAF) module is then designed to alleviate modal bias by using an image branch for coarse estimation and a gated fusion branch for refinement. In addition, a multimodal information bottleneck (MIB) module compacts features by filtering task-irrelevant redundancy. Experiments show that PRI-Net achieves high localization accuracy with lightweight architectures, while reducing feature dimensionality and improving edge-to-server UAV sensing efficiency and robustness.
Read the full abstract
Mesoscale and Nanoscale Physics
Giant second-harmonic generation in few-atomic layer metals
Quantum confinement restructures the electronic phase space of ultrathin metals, but the resulting density-of-states (DOS) change is not generically large. We show that, within a three-dimensional confinement theory based on the suppression of long-wavelength electronic states, the Fermi-level DOS enhancement on the weak-confinement branch is bounded by $(4/3)^{1/3}-1\simeq10.1\%$. Instead, confinement-induced redistribution of electronic phase space can be strongly amplified by resonant denominators in the second-order susceptibility. A minimal double-resonance closure predicts giant amplification when the film thickness approaches $L_c=(2\pi/n)^{1/3}$, where $n$ is the carrier density, and a dominant optical pathway lies within a dephasing linewidth of resonance. Applied to recent Ag(111) measurements, the theory gives an effective phase-space carrier density parameter $n_{\rm eff}\simeq3.6\times10^{20}\,\mathrm{cm}^{-3}$, a tenfold enhancement of $|\chi^{(2)}|$, and hence the observed $\sim100$-fold increase of thickness-normalized second-harmonic-generation efficiency, together with the observed non-oscillatory thickness dependence.
Read the full abstract
Sound
Bridging the Modality Gap in Long-Form Clinical Audio: A Comparative Study of Lightweight and Heavyweight End-to-End SOAP Generation
Automating clinical documentation from long-form doctor-patient conversations remains challenging for modern audio-language models. While cascaded ASR systems perform well, end-to-end (E2E) models often struggle with information loss and hallucinations on extended audio. For the BeTraC 2026 challenge, the ASLP team presents a fully E2E multimodal system that generates structured SOAP notes directly from audio, bypassing intermediate transcripts. We constructed a 1.41-million-sample multi-task corpus and applied a multi-stage pipeline: domain pre-training, supervised fine-tuning, and reward optimization. Evaluating the architecture under both Lightweight (3B) and Heavyweight (30B) constraints reveals that each training stage progressively enhances performance. Furthermore, scaling to 30B parameters substantially boosts concept extraction and summarization quality. Ultimately, our E2E systems consistently outperform representative cascaded ASR+LLM baselines, proving the efficacy of direct multimodal optimization for clinical documentation.
Read the full abstract
Computer Vision
DynEoMT: Learning Object Dynamicity from Online Segmentation Queries
Video segmentation models recognize and track objects over time, but they do not indicate whether each segmented region moves independently of the observing camera. This dynamicity attribute cannot be inferred from semantics alone and is confounded by camera ego-motion. We introduce \method, an online framework that augments query-based video segmentation with region-level dynamicity prediction. It jointly produces the original segmentation outputs and a dynamic or static state for each predicted region. At inference, DynEoMT uses only the current frame and propagated queries, without optical flow, depth, camera pose, previous RGB frames, or feature maps. Because established video segmentation benchmarks do not annotate this attribute, we also introduce a class-agnostic offline supervision pipeline using camera-compensated optical flow and confidence-aware temporal filtering. Across VIPSeg, OVIS, YouTube-VIS 2022, and VSPW, DynEoMT achieves balanced accuracies of 84.3, 68.0, 68.6, and 87.6, respectively, while largely preserving segmentation performance. These results show that segmentation-region dynamicity can be learned from propagated queries, enabling its online prediction without a dedicated motion-processing pipeline at inference. The complete code will be released as open source to enable full reproduction of the method and experiments.
Read the full abstract
Game Theory
Envy-Free Chore Allocation with Unit Subsidies under Negative Dichotomous Valuations
We study the allocation of indivisible chores with subsidies under negative dichotomous valuations, where the marginal disutility of every chore is either zero or one. This is the chore analogue of the dichotomous goods model of Barman et al. (2022), for which a subsidy of at most one unit per agent is known to suffice for envy-freeness. Our main contribution is to show that the same optimal guarantee holds for chores under no structural assumption beyond binary marginals. For every instance with negative dichotomous valuations, there exists a complete allocation $\mathcal{A}$ and a subsidy vector $p\in\{0,1\}^n$ with $\sum_{i\in N} p_i\le n-1$ such that $(\mathcal{A},p)$ is envy-free. Moreover, $\mathcal{A}$ is EF1 even before subsidies are paid. The subsidy bound is tight, and both the allocation and the subsidies can be computed in polynomial time in the value-oracle model. Unlike in the corresponding goods setting, a natural incremental extension approach does not work for chores. Our proof instead exploits key properties of an envy-free partial allocation and its associated equality graph to complete the allocation and determine which agents require subsidies. As a further extension of the main theorem, we establish the same optimal unit-subsidy guarantee for objective mixed instances with signed binary marginals, where every item is a good for all agents or a chore for all agents; these valuations need not be additive. The key step is to prove that the goods-side extension argument of Barman et al.~\cite{BKNS22} remains valid even when the previously allocated bundles contain chores. Finally, even for negative dichotomous chore valuations, we show that the unit-subsidy guarantee cannot, in general, be maintained if Pareto optimality is also required.
Read the full abstract
Mesoscale and Nanoscale Physics
First Demonstration of Flip DRAM from Process, Architecture to System to Push DRAM Scaling beyond 4F2: 2F2 Self-aligned Flip Vertical Channel Transistor (FVCT) DRAM and Flip WL (FWL) 3D-DRAM
For the first time, we proposed a novel stacking technology for DRAM scaling by flipping and backside processes, making full use of DRAM wafer's backside and investigating it on both 4F2 and 3D-DRAM. For 4F2 VCT, 2F2 Flip VCT featuring self-aligned back-to-back stacked 1T1C bitcell, with various BL and WL configurations, were studied and key process modules such as self-aligned stacked vertical channel, BL and WL formations, wafer bonding and flipping, substrate thinning and low-R Co storage node (SN) were successfully developed, addressing the potential thermal, misalign and parasitic concerns in the Flip VCT process. A full DRAM DTCO framework was also established from device to mat and chip level. Compared to 4F2 VCT DRAM with the same mat size, 2F2 FVCT delivers 27.5% less parasitics, 11% better sense margin, 16.3% higher charge sharing (CS) speed and 50% less area. For 3D-DRAM, a brand-new flip WL staircase design with peripheral circuit innovations was studied and proved to have 25% density gain, 15.1% faster turn-on speed and 6.8% less CS time, proving further extendibility of flip technology on DRAM.
Read the full abstract
Quantum Physics
Arithmetic of Bohr Frequencies Governs Uniform Mixing in Randomly Timed Quantum Spin Chains
Randomizing the readout time averages the mode interference in a quantum walk. We ask when this makes the site populations of a uniformly coupled $XY$ chain exactly uniform for every initial site. For $N\ge2$ spins, this is possible when $N+1$ is a power of two, a prime, or twice a prime. It is impossible when $15\mid(N+1)$, $21\mid(N+1)$, or $6\mid(N+1)$ with $N\ge11$. Uniformity uniquely fixes the averaged cosine coherences according to the mirror parities of the modes. Equal Bohr frequencies can impose incompatible coherence values. We classify these parity collisions using vanishing sums of roots of unity and prove existence in the positive cases through a phase distribution on a torus.
Read the full abstract
Computer Vision
AlayaVista: Streaming World Modeling from Panoramic States to Perspective Video
Interactive video world models must maintain broad scene context under camera motion while producing high-fidelity observations with low latency. Existing approaches face a representation trade-off: perspective models operate on local views and must preserve off-screen content over long rollouts, whereas broader spatial coverage is typically obtained by synthesizing full-sphere videos or constructing explicit 3D representations. Motivated by the complementary roles of global context and selective local acuity in visual perception, we present AlayaVista, a camera-controllable streaming video world model that decouples panoramic world evolution from perspective observation synthesis. Given a single perspective image, AlayaVista constructs a 360-degree scene prior using a pretrained panorama expansion model and then evolves the scene as a camera-conditioned panoramic latent state. A latent viewport renderer maps this state to the requested perspective video latents, while a perspective refiner restores details, suppresses artifacts, and performs super-resolution. To support efficient streaming, we adapt the panoramic generator to chunk-autoregressive generation and distill both panoramic generation and perspective refinement into few-step processes. To provide the supervision required by this design, we construct MUGEN, a large-scale real-world panoramic video dataset containing 1,318 hours of videos at resolutions of at least 4K, together with rich semantic and geometric annotations.
Read the full abstract
Optimization and Control
Three-Phase Unbalance Mitigation via DSO-FRA Coordination: A GNB-Based Chance-Constrained Model Considering PV Uncertainty
Although flexible resource aggregators (FRAs), represented by electric vehicle aggregators (EVAs) and load aggregators (LAs), possess inherent flexibility to mitigate three-phase unbalance, the key challenge lies in how to effectively incentivize them to actively participate in unbalance mitigation. To address this, this paper proposes a generalized Nash bargaining (GNB)-based chance-constrained coordinated operation model for the distribution system operator (DSO) and FRAs. In this framework, the DSO and FRAs cooperate to mitigate three-phase unbalance, where FRAs provide flexibility to reduce the DSO's unbalance mitigation costs, and the DSO offers economic incentives to FRAs in return. Bargaining power is tailored according to each participant's contribution to unbalance mitigation to ensure fair profit allocation. Moreover, a scenario-based chance-constrained formulation is integrated to handle photovoltaic (PV) output uncertainties. To solve the model, a distributed proximal decomposition algorithm (PDA) is introduced for the independent model, while the coordinated model is decomposed into a social welfare maximization subproblem and a payment bargaining subproblem, with an improved bilinear Benders decomposition algorithm developed to solve the former. Numerical results validate the effectiveness of the proposed method in mitigating unbalance, ensuring fair profit distribution, and enhancing robustness against uncertainties.
Read the full abstract
Astrophysics of Galaxies
Nitrogen-Loud Quasars from the Dark Energy Spectroscopic Instrument. II. Broad-Line Region Metallicity and Relative Nitrogen Enrichment
Whether the unusually strong nitrogen emission in nitrogen-loud (N-loud) quasars reflects high overall metallicity, enhanced nitrogen abundance relative to other elements, or both has long been debated. We analyze the broad-line region (BLR) abundances of 121 N-loud quasars at $2.13 \leq z \leq 3.90$ selected from the Dark Energy Spectroscopic Instrument Data Release 1 and construct a control sample of normal quasars matched in redshift, continuum luminosity, and virial black hole mass. Within the N-loud sample, metallicities inferred from N V/C IV span $\sim 3$-$50\,Z_\odot$ and are systematically higher than those inferred from the nitrogen-independent (Si IV+O IV])/C IV and Al III/C IV diagnostics, which agree closely and mainly span $\sim 1$-$20\,Z_\odot$. Compared with the matched controls, the N-loud quasars show systematically higher metallicities in both N V/C IV and (Si IV+O IV])/C IV, with median values approximately three times those of the controls. Notably, the discrepancy between the metallicities inferred from N V/C IV and (Si IV+O IV])/C IV becomes more pronounced toward the high-metallicity end of the N-loud sample, suggesting additional nitrogen enrichment beyond the overall metal enrichment. Together, these results indicate that N-loud quasars have both high overall BLR metallicity and enhanced relative nitrogen abundance, suggesting that relative nitrogen abundance is at least partially decoupled from overall metallicity. N-loud quasars therefore provide a high-metallicity laboratory for understanding how nuclear environments can produce unusual abundance patterns and offer a complementary view of how nitrogen enrichment arises across cosmic time.
Read the full abstract
Signal Processing
Sum Secrecy Rate Maximization for Secure ISAC
In an integrated sensing and communications (ISAC) system, targets may intercept information. We address this specific security issue in a full-duplex ISAC system with malicious eavesdroppers aiming to intercept uplink (UL) and downlink (DL) communication exchanges between the dual-functional radar and communication base station and legitimate communication users. We formulate an optimization framework to maximize the sum secrecy rate for both DL and UL, considering power budget constraints for sensing and communications. The optimization problem is non-convex, so we introduce an iterative joint Taylor-block cyclic coordinate descent (IJTB) method to approximate it as a convex problem. The IJTB method alternates between sub-problems: one for UL beamformers and another for UL power allocation, artificial noise covariance, and DL beamforming, using Taylor approximations to simplify optimization. Simulations demonstrate the effectiveness of our approach compared to standard benchmarks.
Read the full abstract
Information Theory
Channel-Aware Selection of Folded Bloom Filters for Distributed Systems
Periodic Bloom-filter transmission can impose substantial overhead in communication-constrained distributed systems. Lossless compression preserves membership behavior but provides a single transmission size, whereas established OR folding produces smaller representations with higher false-positive rates (FPRs) while preserving the no-false-negative property. This paper investigates channel-aware selection among OR-folded representations. The sender retains an unchanged canonical filter, constructs a catalog satisfying a maximum FPR, and selects the FPR-qualified representation with the largest retained length supported by the communication resources available at each reporting opportunity. Unlike folding driven principally by cardinality and false-positive constraints, selection is driven by time-varying communication conditions. Using two phishing URL datasets, the framework is evaluated under Five-State Markov Capacity, Gilbert–Elliott burst-error, and Rayleigh block-fading models. Channel-aware folding improves communication efficiency and receiver freshness relative to complete-filter and lossless-compression baselines when communication opportunities vary substantially. Under the more favorable Gilbert–Elliott model, it remains competitive in efficiency while maintaining the freshest receiver state. These results show that FPR-qualified folded views provide useful transmission operating points when a recent lower-fidelity update is preferable to delaying a larger representation.
Read the full abstract
Exactly Solvable and Integrable Systems
Vector rogue wave patterns associated with generalized Hermite and Okamoto polynomials
We establish rogue wave patterns associated with the fourth Painlevé equation $(\mathrm{P}_{\mathrm{IV}})$ in the multi-component nonlinear Schrödinger and Hirota equations. The generalized Hermite and generalized Okamoto polynomials arise in representations of rational solutions of $\mathrm{P}_{\mathrm{IV}}$, and we show that their roots determine two classes of rogue wave patterns when one of the internal parameters of rogue wave solutions is large. Specifically, the generalized Hermite polynomials arise from rogue wave solutions represented by Schur-polynomial determinants with consecutive indices, whereas the generalized Okamoto polynomials arise from analogous determinants with index jumps of three. Numerical examples for both equations agree with the predictions.