In briefMeasuring How Much Communication Helps Multi-Agent Target Tracking at Limited Data Rates
SummaryThis paper studies how useful communication is for stationary agents cooperatively tracking a moving target when they can only exchange information at limited rates. Each agent uses range and bearing measurements with an extended Kalman filter, quantizes its state estimate, and fuses shared information via covariance intersection. Results show very low rates can hurt performance due to coarse quantization, while moderate rates capture most of the gain, with diminishing returns at higher rates.
Danial Dehghani, Maximilian L\"ubke, Zahra Seifaei et al.
In briefPhOSv1: Scaling model sleeping on one server by sharing GPU contexts for faster autoscaling
SummaryThis paper addresses autoscaling in model-as-a-service systems, where existing model sleeping methods keep each sleeping model's GPU context resident, so the cost grows with the number of models. The authors present PhOSv1, which routes each engine's GPU context allocation through a central daemon via API remoting, deduplicating shared contexts. This lets a single server keep many more models asleep. The evaluation reports scale-up time matching vanilla vLLM sleep mode while substantially reducing GPU memory footprint.
In briefAn exact parallel dense Gauss-Seidel method trading parallel runtime for preprocessing time
SummaryThe Gauss-Seidel method is widely used for solving linear equation systems because it converges well, but its data dependencies make parallelization difficult. This paper proposes a new parallel Gauss-Seidel algorithm that achieves better parallel runtimes in exchange for more preprocessing time. The algorithm can be tuned to offer trade-offs between preprocessing time and the best achievable parallel runtime.
Mugurel-Ionu\c{t} Andreica, Pantelimon George Popescu, Eliana-Dina T\^ir\c{s}a
In briefTRACEs: An Embedded Provenance Architecture for Distributed Scientific Workflows
SummaryLarge-scale scientific workflows run on distributed HPC resources, which makes it hard to explain how data products are generated and why similar runs give different results. TRACEs is a provenance architecture for distributed containerized workflows that embeds data lineage and execution context directly in every generated data artifact, and it stays compatible with existing workflow management systems. Evaluated on a seven-stage E. coli variant-calling workflow across multiple HPC nodes, it achieved 100% provenance completeness under distributed execution. It also traced a 200-fold difference in variant counts to differences in input sequencing data without re-executing the workflow.
In briefLevel crossing rate bounds for products of independent nonstationary fading processes
SummaryThis paper develops a unified framework for the instantaneous total level crossing rate (LCR) of products of independent positive nonstationary fading processes. Universal upper and lower bounds are derived from an exact decomposition of the product derivative and signed crossing imbalance, using only factor-wise crossing statistics. The authors introduce a drifting Gaussian-derivative (DGD) class, giving bounds via an exact Gaussian-mixture representation that capture aggregate drift and derivative fluctuations. Numerical results show that the DGD bounds closely bracket the exact LCR.
In briefOptimal self-orthogonal binary linear codes
SummaryThe paper completes the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with a given minimum distance. For nine-dimensional codes it gives exact values and bounds for minimum distance up to 64. Using a geometric view of linear codes as multisets of points, the authors redo the classification for dimensions up to seven without computer assistance. They also prove that [93,9,44]_2 codes do not exist.
In briefInformation geometry of Sinkhorn divergence on a Hilbert manifold
SummaryThis paper studies the metric tensor that the Sinkhorn divergence, a debiased entropic optimal transport cost, induces on probability measures defined along curves. The authors construct a real-analytic Hilbert manifold on which this tensor is a weak Riemannian metric, and extend Eguchi's geometric construction to third order. They also show the metric is bounded above by a multiple of the Fisher-Rao metric on the smooth stratum.
In briefDynamic Resource Scaling for Quantum Circuit Simulations on HPC Systems
SummaryThis paper makes the QuEST state-vector simulator malleable using the DMR framework, so one job can resize its node allocation between quantum circuits with different qubit counts. Because no state vector persists between circuits, resizing needs no data redistribution, and a checkpoint of the next circuit's index allows resumption. The authors evaluate reconfiguration overhead on MareNostrum 5 and show that a single job can run circuits of varying sizes with negligible overhead.
\'I\~nigo Ar\'ejula-A\'isa, Sergio Iserte, Petter Sand{\aa}s et al.
In briefSupport-distribution conditions for MSRD codes reduce to one inequality
SummaryThis paper studies linear maximum sum-rank distance (MSRD) codes and counts codewords with a prescribed nonzero support. It proves that a family of nonnegativity conditions, conjectured by Byrne, Gluesing-Luerssen, and Ravagnani, is equivalent to a single condition at the vector of total dimension d+1 obtained by filling the longest blocks first. The result yields an explicit existence criterion over every finite field. The paper also shows an infinite family of parameters that satisfies the joint condition yet admits no such linear code.
In briefEnergy-efficient uplink RSMA using a Rydberg atomic quantum receiver
SummaryThis paper studies an uplink rate-splitting multiple access (RSMA) network that uses a Rydberg atomic quantum receiver (RAQR) to maximize energy efficiency. To handle the direct-readout RAQR's amplitude-only measurements, the authors propose a phase alignment mechanism that linearizes the received signal while keeping channel energy. For symmetric rate requirements, they derive closed-form power allocation from KKT conditions, while for asymmetric requirements they propose a block coordinate descent power allocation and a low-complexity paired allocation scheme. Simulations show the KKT-based scheme achieves the highest energy efficiency, and the low-complexity scheme cuts computation with moderate efficiency loss.
In briefLength limits for MDS algebraic geometry codes from curves of any positive genus
SummaryThis paper studies the length of maximum distance separable (MDS) algebraic geometry codes built from curves of arbitrary positive genus. For fixed genus, it proves that the ratio of length to field size is asymptotically at most 1/2 when both dimension and codimension grow faster than the logarithm of the field size. It also gives explicit bounds under logarithmic dimension conditions. The bounds hold in every characteristic and do not depend on the choice of curve or evaluation set. The proof combines character sums on the Jacobian with an estimate for sums of distinct points.
In briefA uniform upper bound on the length of MDS codes from genus-two curves
SummaryThis paper studies the maximal length of MDS algebraic geometry codes built from genus-two curves over finite fields. For codes of length n and dimension k with 3≤k≤n-3, the authors prove n<(2q+10√q+16)/3 for every prime power q, regardless of the parity of k. This gives a uniform upper bound of 2q/3+O(√q), which is strictly smaller than q+1 when q≥125.
In briefA sharp Fisher-information inequality for Boolean pairs, proving the Amari–Kobayashi conjecture
SummaryThe paper considers two terminals that observe correlated uniform binary vectors and each compress their observation to one bit. It proves that, for every blocklength and correlation parameter in (-1,1), the Fisher information kept by the two bits is maximized by matching parity functions of a suitable degree, resolving a conjecture of Amari and Kobayashi. The proof combines a Fourier-based bound on the derivative of the normalized covariance with a scalar inequality for signed polynomials under a global range constraint.
WhyThe authors prove the Amari–Kobayashi conjecture on Fisher information of Boolean pairs, combining a Fourier bound with a signed-polynomial inequality for all blocklengths.
In briefSecure wireless communication using flexible reflectors: joint optimization of their position and rotation for physical-layer security
SummaryThis paper studies secure communication over non-line-of-sight links aided by flexible reflectors (FRs), passive metallic plates on movable platforms, and jointly optimizes their positions and rotations to maximize the secrecy rate. For a single FR, it proposes a Fibonacci segmentation search (FSS) method and a lower-complexity cross-entropy search (CES) method, then extends both to multiple FRs. Simulations show FSS achieves significant secrecy rate gains over benchmarks, while CES offers a favorable runtime-performance tradeoff.
In briefProximity Gaps for One-Point Algebraic Geometric Codes
SummaryThis paper studies proximity gaps and correlated agreement for general one-point algebraic geometry (AG) codes, properties that underpin the soundness of interactive oracle proofs. It extends known results for Reed-Solomon codes, proving correlated agreement and soundness bounds for these codes. Using Garcia-Stichtenoth towers, it builds asymptotically good code families and gives two counterexamples showing limits beyond half the minimum distance.
WhyThe authors extend proximity gap and correlated agreement results from Reed-Solomon to general one-point AG codes, with length-independent soundness and counterexamples.
In briefSpeeding up finite Markov chains via Bregman projections and partition design
SummaryThe paper studies Gibbs averaging of finite Markov chains with a prescribed stationary distribution, built from a Gibbs kernel induced by a state-space partition. It proves that the projected chain GPG is an information projection for admissible Bregman generators, with a Pythagorean identity and a dual characterization. For reversible ergodic baselines, Gibbs averaging does not increase the squared weighted Frobenius distance to stationarity, so the mixing time does not increase. The paper also gives partition-selection objectives and algorithms, and a numerical experiment compares the projected chains with a local Metropolis sampler.
In briefFragmented Obedient Equilibria in Routing Games: a new equilibrium concept for competing mediators recommending routes
SummaryThe paper studies routing games where competing mediators recommend routes to fixed nonatomic populations. Each mediator chooses a randomized flow allocation to minimize its population's expected travel cost, subject to users having no conditional expected gain above a tolerance ε from ignoring recommendations. The authors define fragmented obedient equilibria (FOE) and prove existence under a lower-hemicontinuity assumption on obedient policy correspondences. Under affine edge latencies, the problem reduces exactly to first and second flow moments, and for networks with at most four routes each best response is a semidefinite program. A Braess network example shows that relaxing obedience can lower FOE costs, though gaps to the social optimum and optimal obedient pooling can persist.
In briefWhen Heterogeneity Helps: GPU and WSE Complementarity in Systems
SummaryThis paper studies unified systems that combine GPUs and wafer-scale engines (WSEs) for AI workloads. The two differ in compute, memory, and communication organization, which creates both architectural complementarity and extra overheads. The authors propose a hierarchical benchmarking methodology to characterize GPU-WSE heterogeneous execution and the conditions for exploiting complementarity. They also present an analytical performance model that identifies when heterogeneity becomes a bottleneck and when it yields system-level gains.
In briefPDScope: Resolving the Prefill-Decode Trade-off in Memory-Limited MoE Inference
SummaryThis paper addresses local deployment of MoE-based LLMs on CPU-GPU nodes, where limited GPU memory forces most experts into CPU memory. Prefill is compute-bound and favors aggressive GPU loading, while decode is I/O-bound and needs conservative transfers, creating a trade-off under low batching. PDScope decouples the two phases, predicting expert activations and optimizing placement, prefetching, and execution for each, using a static computation graph, cache prefetching, and zero-copy asynchronous I/O. On mainstream MoE models, it reports 2.5-10.3x higher prefill throughput and 2.1-6.1x higher decode throughput than existing systems.
In briefPhase retrieval of bandlimited signals via Morlet and companion wavelets
SummaryThe paper shows that complex bandlimited signals can be uniquely recovered, up to a global phase factor, from two families of wavelet transform magnitudes. These families arise from translations of a fixed dilated Morlet wavelet and a fixed companion wavelet, sampled at twice the Nyquist rate in two frequency bins. The authors reformulate both families as modulated Gaussian convolution measurements of an auxiliary bandlimited signal and apply a Gaussian convolution uniqueness result. They prove that samples on (4B)^{-1}Z determine every signal in PW_B^2, using significantly fewer sampling points than earlier wavelet phase retrieval methods.
In briefConsumer welfare limits of market segmentation when some consumers are captive
SummaryThe paper studies a duopoly with captive and contested consumers and characterizes every pair of consumer and producer surplus achievable under some market composition and some public segmentation, constructing a market for each pair. The achievable set is lens-shaped. At any industry profit level, consumer welfare is lowest when captive and contested consumers are perfectly separated, and highest in an unsegmented market where the two firms have equal numbers of captives.
In briefTrade-offs between communication and privacy in distributed storage using shared secret keys
SummaryThis paper studies distributed storage in which all transmissions occur over a public channel, with privacy provided by shared secret keys. A user stores a file across L servers so that any t servers can reconstruct it, while any z colluding servers learn at most a fraction α of the file. For a fixed key length n, the authors characterize the trade-off between the privacy leakage α and the maximum securely storable file size. They also determine the minimum local randomness, public communication, and storage needed to achieve this optimal trade-off.
In briefRadar sensing of fast, distant targets in overspread channels using Zak-OTFS and modular arithmetic
SummaryThis paper addresses aliasing in delay-Doppler (DD) modulation when the channel spread factor exceeds one, which is common in long-range mobility scenarios such as drones and satellites. The authors propose a two-frame design that combines DD bases with different delay and Doppler periods on the same bandwidth and frame size, and use modular arithmetic on wrapped peak positions to recover each target. They introduce two receivers, DS and DS-XC, with DS-XC including cross-pilot cancellation. In a 100 km drone scenario, DS-XC detects 98% of targets, compared with 81% for the best baseline.
Andrea Novero, Mudasir Ahmad Sheikh, Danish Nisar et al.
In briefGenerative rate-distortion-perception theory on Riemannian manifolds: how much information is needed for generated outputs to stay accurate on curved spaces.
SummaryThe paper studies how much source information must be sent so that a receiver's generated outputs meet fidelity and reliability requirements on compact Riemannian manifolds, while preserving the source distribution. It proposes a generative rate-distortion-perception framework without common randomness and gives a single-letter characterization of the asymptotic operational function. For uniform sources on compact homogeneous manifolds, geometric lower and upper bounds coincide, giving an exact limiting result. On unit spheres, it shows that for dimension d≥2, adding d bits per source symbol can reduce the distortion radius by more than half.
In briefDistOptimize: Automatic Optimizer for Distributed Protocols
SummaryThis paper presents DistOptimize, an automatic optimizer for distributed protocols that avoids safety risks from manual changes. It adapts throughput optimizations from academic languages to production frameworks, verifies the rewrites' correctness in Rocq, and automates their application using calibration and ILP-based search. Applied to fundamental protocols and protocols used at AWS, it improves throughput by up to 4x while increasing latency by at most 0.3ms.
David Chu McElroy, Shadaj Laddad, Lucky Katahanas et al.
In briefRARE: A new equilibrium for pricing games where sellers can respond to price changes
SummaryThis paper studies pricing games in markets where budget-constrained buyers choose utility-maximizing bundles and each seller sets a price for one good. It proposes Response-Aware Rational Equilibrium (RARE), in which any seller's deviation can be deterred by other sellers' responses, and shows that RARE exists under certain conditions, with approximate versions for some cases. The authors also analyze a price-raising dynamic that reaches an approximate RARE.
Bhaskar Ray Chaudhury, Jugal Garg, Xin Huang et al.
In briefPrincipal-agent hypothesis testing with adaptive, sequential experimentation
SummaryThis paper studies principal-agent hypothesis testing, where a principal rewards an agent based on data the agent generates. It extends the single-shot framework to sequential settings, where evidence accumulates over time, rewards may be deferred or paid incrementally, and the agent can stop the contract at a strategically chosen time. The main result shows that such contracts, called null-deterring, are characterized by e-processes.
In briefTight Bounds for Anonymous Parity Certification
SummaryThis paper studies how many bits per vertex are needed to certify that a graph has even order in the anonymous radius-one local certification model. The authors prove the complexity on general graphs is Θ(log log n) bits, closing a gap left by prior work. They also show graphs of degeneracy at most d can be certified with O(log d) bits, and identify nowhere-dense classes where constant-size certificates cannot be guaranteed.
WhyThe authors close the gap to a tight Θ(log log n) bound for anonymous radius-one even-order certification and characterize degeneracy and nowhere-dense classes.
In briefRandom Non-Commutative Error-Correcting Codes: Extending Random Coding Theory to Arbitrary Groups
SummaryThis paper builds on the non-commutative error-correcting codes introduced by Chapman, Dinur, and Lubotzky, studying random codes over arbitrary groups as an analogue of classical random coding. It examines how far the classical Gilbert-Varshamov (GV) bound extends to this setting, showing that random universal codes of linear size in free groups are asymptotically bad. The authors characterize exactly which families of finite groups admit good random codes, namely those with uniform polynomial maximal-subgroup growth. They also give explicit quantitative bounds on rate and optimal distance based on intrinsic group parameters, and prove that families of finite solvable groups always form GV families.
In briefSlant: Deliberately Uneven Traffic Routing to Save Resources in Microservices
SummaryLoad balancers in microservice systems usually aim for even request distribution without considering how routing affects autoscaling signals and resource efficiency. This paper presents Slant, a resource-aware load balancing framework that intentionally creates safe traffic imbalance to improve utilization and works with existing vertical pod autoscalers without modification. In experiments on three microservice benchmarks, Slant reduces allocated CPU cores by up to 26% and lowers P99 latency by up to 18% compared to Round-Robin.
Congwei Zhang, Chieh-Jan Mike Liang, Mengbai Xiao et al.
In briefSensor-side hardwired units for parallel vision pre-processing that frees the host CPU
SummaryThe paper proposes placing small, fixed hardware datapaths (HDPUs) directly at the image sensor, each performing one always-on task in parallel on the pixel stream and sending only compact results to the host. The authors build three units (Canny edges, Harris corners, and a line tracker that issues steering decisions) on a low-cost Artix-7 FPGA using 2,568 LUTs and an estimated 0.318 W. A full-system simulation compares these units with a frame-based host program, showing much earlier responses and lower host CPU load.
WhyThe authors propose sensor-attached hardwired units for parallel vision pre-processing, implement them on an Artix-7 FPGA, and report full-system simulation comparisons against host latency.
In briefUpper bounds on CSP non-redundancy using locally decodable codes
SummaryThis paper studies non-redundancy in constraint satisfaction problems (CSPs), which measures how many logically independent clauses a CSP instance can contain. The authors present a new method that uses locally decodable codes (LDCs) and locally correctable codes (LCCs) to upper-bound the non-redundancy of certain relations. Applying this approach, they obtain improved upper bounds for the BCK predicate and its Boolean variant, and give the first Boolean predicate whose non-redundancy provably is not of the form n^{k±o(1)}.
WhyThe authors bound CSP non-redundancy via 2-query LDC and LCC structure, improving BCK bounds and reporting a first Boolean predicate outside the n^{k±o(1)} form.
Joshua Brakensiek, David Conlon, Venkatesan Guruswami et al.
