Cryptography and Security
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Saturday 12 September
TCP-SYN port scanning often precedes cyber-attacks, and early detection of scanner fingerprints embedded in packet headers can provide timely intrusion alerts. Existing approaches are either too computationally expensive for line-rate operation or limited to offline analysis. This brief presents a lightweight FPGA architecture for reconfigurable line-rate fingerprint detection, where each fingerprint is compiled into a shallow Boolean LUT tree, enabling parallel evaluation with constant two-cycle latency regardless of fingerprint count, while resource cost grows linearly with fingerprint count. This detection core is decoupled from a MAC-layer frontend that performs streaming field extraction with no frame buffering or higher-layer state, allowing deployment across different line rates by modifying only the frontend. A Python framework automatically compiles Boolean expressions into synthesizable HDL, eliminating manual RTL changes. For TCP-SYN port-scan fingerprint detection, the architecture uses approximately 0.5% LUTs at 10 Gbps on a Versal VCK190 for 18 deployed fingerprints, with capacity for over 2,000 concurrent fingerprints, and under 2.5% on a Virtex-6 at 1 Gbps, with a detection latency of 10 ns at both rates, three to four orders of magnitude below typical per-packet processing latency in software intrusion-detection systems. The system was cross-validated against a software re-implementation on an 8-hour production packet trace, confirming detection correctness with zero false positives/negatives.
Computational Engineering
Trade-Adaptive Aggregation of Probabilistic Financial Forecasts
Financial NLP systems produce probabilistic forecasts from news, reports, and filings. Prediction markets can aggregate these forecasts sequentially, but their fees must reward information without overcharging low-risk updates. Existing quadratic-fee mechanisms use a state-blind bound, while a local-curvature envelope remains conservative because it prices every trade at the largest permitted span. We introduce SpanPM, a prediction-market mechanism that sets the local-curvature multiplier from each trade's realized payoff spread. Its fee dominates exact Bregman exposure trade by trade, preserves no arbitrage, information incorporation, expressiveness, and bounded worst-case loss, and yields a tighter overcharge factor approaching one as trade span vanishes. Repeated global best responses converge to a common belief and become full Newton steps locally, giving quadratic rather than damped-linear convergence. We implement a deterministic bounded one-dimensional multi-basin search, audited against a dense grid. Across paired synthetic experiments, SpanPM improves 20-round consensus error by several orders of magnitude over a fixed-envelope local baseline under the same hard cap. With evolving beliefs, it preserves 96–97% of the trader surplus achieved with exact Bregman fees while cutting excess fees by 94% relative to the global quadratic mechanism. These results establish a trade-adaptive prediction-market mechanism for sequential aggregation of probabilistic financial forecasts.
Read the full abstract
Theoretical Economics
An Explicit Solution for the Two-Bidder All-Pay Auction with Arbitrary Type Distributions
This paper provides an explicit characterization of the (unique) equilibrium of the two-bidder all-pay auction with asymmetrically distributed, independent private values. The characterization is achieved through recasting the problem into its equivalence in the quantile space and thereby obtaining equilibrium bid functions that involve only integrals and inverses of the primitives. No regularity assumption is required: the value distributions can be continuous, discrete, singular continuous, or any mixture of these. The explicit formula makes comparative statics transparent. Raising one bidder's value distribution in first-order stochastic dominance raises that bidder's equilibrium bid distribution in the same order. Perturbing a symmetric-bidder model has different revenue effects depending on the direction of the perturbation: whereas slightly weakening one of the two bidders reduces expected revenue, slightly strengthening one of the two has an ambiguous effect. The explicit formula also turns some involved arguments in the literature into direct corollaries.
Read the full abstract
Distributed Computing
Reducing Cold-Start Latency in Serverless Applications via Dynamic Slicing
We present PyXtrim, a system that reduces the cold-start latency of serverless applications through debloating. We focus on Python, a dominant language for serverless applications whose dynamic features and extensive use of native extensions make traditional static debloating particularly challenging. PyXtrim frames debloating as a dynamic slicing problem, using the application's externally visible behavior as the slicing criterion. Everything outside the resulting slice is removed, both from the application and its dependencies. Our key technical contribution is that the slice is computed by a cross-language dynamic dependence engine that tracks data and control dependences across Python and native code and identifies operations that interact with the operating system, which form the slicing criterion. As a result, PyXtrim can effectively handle real-world applications that rely on dynamic features such as reflection, interoperate with native code and interact with system resources. Across 31 applications on AWS Lambda, PyXtrim reduces cold-start latency by 21.7% and peak memory usage by 17.1% at the median. This is more than double the reduction achieved by the state of the art, while debloating each application in minutes.
Read the full abstract
Logic
Restrictions of Infinite Circuits
We present a new approach to lower bounds on Borel rank via a connection between Borel sets and infinite circuits. We prove an infinite analog to Håstad's switching lemma called the restriction lemma, which shows that by fixing the values of some inputs, we can simultaneously reduce the complexity of one Borel function while largely maintaining the complexity of another. This result provides a purely combinatorial proof of the Borel hierarchy theorem, as well as simple proofs of various Ramsey-like properties of Borel sets and functions. We prove that the restriction lemma is sharp and also discuss counterexamples demonstrating the limitations of the restriction technique, in the context of both Borel functions and $\mathsf{AC}^0$ circuit families.
Read the full abstract
Computational Engineering
Prediction-Market Seed Capital Recovery from Noise-Dominant Flow
Automated prediction markets require sponsors to prefund liquidity before observing order flow, creating a financing challenge at launch. We study whether nonnegative charges conditioned on observable payoff direction can improve recovery of this prefunded capital while limiting their effect on informed participation. We develop Seed Capital Flow (SCF), a direction-conditioned levy, in a stylized binary cost-function market with informed and liquidity-motivated traders. When order composition differs across directions, SCF concentrates the permitted fee burden on the direction with relatively more liquidity-motivated flow, whereas a uniform fee spreads it across both directions. Under a sufficiently tight common retention constraint, this allocation yields higher expected recovery capacity and can make additional liquidity choices financially viable. Synthetic numerical audits examine robustness to alternative flow patterns, stochastic arrivals, and label misspecification. The results characterize a mechanism-design tradeoff rather than an empirical prediction: the market remains prefunded, recovery is expected rather than guaranteed, and the analysis is limited to an opening-cohort setting.
Read the full abstract
Information Theory
Beam Squint and Aperture–Bandwidth Limitations in Wideband RIS-Assisted THz Links
This paper analyzes the ergodic rate of a wideband reconfigurable intelligent surface (RIS)-assisted terahertz link under beam squint and finite-resolution phase control. Independent Rayleigh fading on the two RIS-assisted hops produces double-Rayleigh cascaded amplitudes. Exact second- and fourth-order channel moments are derived by incorporating the frequency-dependent array response and phase-quantization errors. Moment matching then provides a Gamma approximation for the received power on each subcarrier and a tractable closed-form approximation for the wideband ergodic rate. A first-null bandwidth approximation characterizes the aperture–bandwidth limitation of frequency-flat RIS control. Monte Carlo simulations validate the analytical framework.
Read the full abstract
Distributed Computing
Real-World Deployment and Performance Characterisation of Fog-Based Deep Learning for Cold-Chain Temperature Prediction over LoRaWAN
Fresh fruits and vegetables (FFVs) are highly perishable, and cold-chain breaks contribute significantly to global food waste. While Machine Learning (ML) can enable proactive intervention, cloud-based inference faces challenges such as latency and data loss. Fog computing addresses these issues but has been tested only in simulation for FFV cold-chain temperature prediction. To the best of the authors' knowledge, this paper presents its first real-world deployment. A fog-deployed LSTM-GRU model predicted cold-room temperature using LoRaWAN sensor data collected from a South African apple cold-storage facility with induced cold-chain breaks. Running entirely on a Raspberry Pi 4 with no cloud dependency, the system generated conditional SHAP explanations only when a break is predicted. The deployed system predicts cold-room temperature with an MAE of 0.2{\deg}C at roughly 0.2 kWh per day ($\approx 0.7$ Wh per prediction). Predictions were delivered in under one second (555 ms), dominated by network and messaging rather than computation, with conditional explanations adding modest cost. SHAP consumes 28% more CPU but is well within the hardware's capacity. The model attributes its predictions primarily to temperature, humidity, and their interaction. Critically, the deployment surfaced what simulation cannot: a sensor-triggered single point of failure, alongside genuine resilience, autonomous recovery from infrastructure faults and continued operation through internet loss. These are the first published deployment benchmarks for fog-based temperature prediction in FFV cold chains, establishing that explainable temperature forecasting is feasible on resource-constrained edge hardware. Future work includes asynchronous sensor fusion, commercial cold chain deployment, alternative model architectures, and causal analysis.
Read the full abstract
Functional Analysis
Finite Polyhedral Models for the Space of Equivalent Norms
We study finite polyhedral models inside the projectivized space of equivalent norms $\mathcal{N}'(X)$ on a finite-dimensional Banach space $X$, endowed with the logarithmic distortion metric. Given a finite symmetric direction set $E$, we introduce the class of $\alpha E$-norms, defined as Minkowski functionals of symmetric polytopes whose vertices lie on the rays prescribed by $E$. We identify the admissible weights $\alpha$ for which this parametrization is non-redundant and prove that they give a one-to-one parametrization of the corresponding finite direction model $\mathcal{N}(E)$. We then refine this description by introducing complete, symmetric, simplicial $E$-fans, which encode the conical regions on which the associated polyhedral norms are linear. For a fixed fan $\mathcal{F}$, we define the corresponding geometric and coordinate fan models $\mathcal{N}(\mathcal{F})$ and $\mathcal{R}(\mathcal{F})$, and show that they are naturally isomorphic as cones. After quotienting by positive scalar multiplication, the coordinate models become isometric to the corresponding norm models: the logarithmic distortion metric on $\mathcal{N}'(E)$ and $\mathcal{N}'(\mathcal{F})$ is represented exactly by the Hilbert projective metric on the admissible weight spaces. Finally, we prove completeness results for these finite models and show how they provide finite-dimensional polyhedral approximations to the metric geometry of $\mathcal{N}'(X)$.
Read the full abstract
Fluid Dynamics
Lagrangian Dynamical Theory of the Velocity Gradient Tensor: Real Schur Form, Schur Frame, Characteristic Vorticity Modes, and Commutative Vorticity Operators
The present work proposes a novel Lagrangian dynamical theory for the velocity gradient tensor (VGT) $\bm{A}\equiv\bm{\nabla}\bm{u}$, formulated on the basis of its canonical real Schur form.... The proposed theory is expected to be useful for understanding the evolution dynamics of the VGT rotational invariants and intrinsic vorticity modes in a variety of vortical flows.
Read the full abstract
Discrete Mathematics
Two-Machine Flow Shop with a Fixed Non-Availability Interval on the Second Machine
This paper investigates a two-machine permutation flow shop in which the second machine is unavailable during one fixed interval $[s,t]$. We consider the non-resumable setting: an operation interrupted by the interval must restart from the beginning after the machine becomes available. The objective is to minimize the makespan. We establish three results. First, we give a polynomial-time $10/7$-approximation algorithm. Second, we develop a pseudopolynomial-time exact dynamic program. Third, we prove that the problem does not admit a fully polynomial-time approximation scheme (FPTAS) unless $\mathrm{P}=\mathrm{NP}$, even when the non-availability interval has unit length. Together, these results characterize a distinctive complexity profile: exact optimization is possible in pseudopolynomial time, whereas the usual route from such an algorithm to an FPTAS is impossible unless $\mathrm{P}=\mathrm{NP}$. They also reveal an approximability separation from the corresponding non-resumable problem with the interval on the first machine.
Read the full abstract
Data Structures and Algorithms
Should Tables Be Sorted? Revisited with a Large Language Model
We revisit the implicit membership problem in Yao's full-table model [Yao, 1981] and obtain, to our knowledge, the first quantitative improvements to his 45-year-old Ramsey bounds, most notably reducing the two-probe bound from tower-type to polynomial. In this model, an $n$-set $S\subseteq\{1,\ldots,m\}$ is stored as a permutation in an $n$-cell table, and queries decide whether $x\in S$. Let $G_q(n)$ be the largest universe size admitting a $q$-probe membership scheme for all $n$-sets. Yao determined the one-probe case exactly, proving $G_1(n)=2n-2$ for $n>2$, but the behavior for $q\ge2$ remained wide open. Fiat and Naor [1993] constructed schemes for universes of size $\exp(n^c)$ for some constant $c>0$ and sufficiently large constant $q$. For the first adaptive case, $q=2$, we prove $G_2(n)=O(n^2(\log n)^2)$. For every fixed integer $q\ge3$, we show that $G_q(n)$ is at most a tower of height $q-1$ with top $n^{1+o(1)}$; in particular, $G_3(n)\le\exp(n^{1+o(1)})$. The two-probe proof avoids Ramsey theory altogether; for larger fixed $q$, we use Ramsey theory only to make the first $q-1$ probes follow a fixed pattern, and then handle the last probe by the same non-Ramsey argument. Somewhat surprisingly, for each fixed $q$, we also show that implicit membership is as hard as implicit search up to a polynomial loss in universe size. Implicit search must return the cell containing $x$ when present and reject otherwise. For the analogous search threshold $H_q(n)$, we prove $H_q(n)\le G_q(n)\le n^q(H_q(n)+1)^{q+1}$ for every $q,n$. Thus, for every fixed $q$, one threshold is at most $\exp(n^{O(1)})$ if and only if the other is. The proofs were first generated by ChatGPT 5.5 Pro without mathematical hints; the membership-search equivalence emerged while pursuing an improved four-probe bound. The authors have validated and edited the proofs and assume responsibility for all content.
Read the full abstract
Quantum Physics
No cardinality bound for squashed entanglement
Squashed entanglement is an additive bipartite entanglement measure. For a state $\rho_{AB}$, it is defined as the infimum of all conditional mutual information $I(A:B\mid E)$ evaluated on extensions $\rho_{ABE}$. It was unresolved whether there is a bound on the dimension of the conditioning system, $E$, needed for this optimization. We show that no such cardinality bound is possible. Explicitly, we find that the squashed entanglement for a partially dephased Bell pair on two qubits cannot be achieved for any finite dimensional extension $E$. A crucial ingredient of this proof is a direct sum step, which in a sense, symmetrizes two purifying systems while keeping the conditional mutual information unchanged and the coherence no worse.
Read the full abstract
Signal Processing
Impact of PA Nonlinearities on AFDM Sensing: A Matched Filtering Perspective
Affine Frequency Division Multiplexing (AFDM) is a promising waveform for integrated sensing and communications (ISAC) due to its Doppler resilience. However, such waveforms exhibit a high peak-to-average power ratio (PAPR), and they require highly linear Power Amplifiers (PAs), which conflicts with ISAC requirements, where high transmit power for sensing is always beneficial. This paper investigates the impact of PA nonlinearities on the sensing performance of AFDM. Using the Bussgang decomposition of the nonlinearly amplified AFDM signal, we analyze the delay-Doppler ambiguity function for the sensing matched filtering and show that AFDM's sidelobes remain nearly unaffected. Simulation results confirm that AFDM outperforms OFDM in target detection under high Doppler and nonlinear amplification, highlighting its suitability for the sensing task.
Read the full abstract
Portfolio Management
Special Markowitz: Thermodynamic Formalism for the Joint Regularisation of Returns and Covariance
Special Markowitz (SM) regularises returns and covariance jointly, relative to a reference state (mu_ref, Sigma_ref). Each eigendirection of the whitened relative operator carries a signed spectral potential Phi_k, with persistence factor psi_k = exp(-Phi_k) > 0. Positive potentials attenuate empirical deviations from the reference geometry, zero potential preserves them, and negative potentials amplify them. The persistence factor psi_k governs both the return signal and the covariance deviation: the regularised deviation from the reference is psi_k times the empirical deviation. The logarithmic potential coordinate is characterised by a multiplicative composition law on the multiplicative group of positive real numbers; the Stein loss is characterised as the unique free-energy density (within a natural class) compatible with the resulting coupling. The SM pressure functional is additive across modes the defining property of Special Markowitz.
Read the full abstract
Medical Physics
Dosimetric equivalence of deep learning prostate contours after LDR brachytherapy: pre-declared margins, patient-level acceptance thresholds and the incremental predictive value of DVH indices
Background and purpose: Dose Volume Histogram (DVH) indices remain the main dose-effect metrics for toxicity prediction, but they depend on how contours were made. Inter-observer variability (IOV) is unavoidable and clinically accepted, so the question for automatic segmentation addresses equivalence: do automatic contours produce DVH errors comparable to human IOV, and can these indices predict patient-reported toxicity? Materials and methods: In 429 patients treated with iodine-125 LDR-BT monotherapy, indices from expert manual delineation were compared with a deterministic and a Bayesian nnUNet on a fixed dose distribution, by two-one-sided tests against margins set from CT contouring IOV. Logistic regression gave patient-level thresholds at 90\,% probability of equivalence. In 380 patients, eleven DHV indices were added to a clinical baseline predicting change in International Prostate Symptom Score (IPSS) at six horizons over 5 years, with nested cross-validation, bootstrap intervals and corrected $t$-tests. Results: All cohort-level comparisons of DVH indices were declared equivalent, with no interval consuming more than 44\,% of its equivalence margin. Individual agreement was weaker with equivalence rates from 55.9\,% to 89.7\,%, depending on the DVH index and automatic segmentation model. Thresholds ranged from 0.864 to 0.958 Dice. No DVH block improved IPSS prediction at any horizon. The largest improvement declared by bootstrap intervals was 0.12 IPSS points, well below the minimal clinically important difference, across all learners. Conclusion: Automatic contours matched expert dosimetry within human IOV on average, but individual equivalence requires a volume dependent quality metric threshold definition. Our DVH indices panel provides no significant predictive power for IPSS, irrespective of segmentation source and horizon.
Read the full abstract
High Energy Physics (Phenomenology)
From cross-section degeneracies to phase-sensitive observables in near-threshold J/psi production
Near-threshold $J/\psi$ production is sensitive to scalar and traceless spin-two chromoelectric structure in the nucleon. We study whether present integrated and differential measurements can separate these contributions and constrain their relative phase. The GlueX integrated cross section does not determine a unique scalar contribution: production and elastic scalar terms are strongly correlated, while flatter non-forward profiles drive the fitted scalar strength to zero. In a 38-point large-$\xi$ differential analysis, the scalar term is collinear at fixed kinematics with the retained C-GFF direction, leading to nearly degenerate solutions and strong profile dependence. A common single-channel final-state factor preserves the scalar-spin-two relative phase, whereas coupled-channel rescattering can modify it. Its determination therefore requires polarization-sensitive observables together with process-specific complex helicity amplitudes.
Read the full abstract
Number Theory
Reduction of integer tiles via CRT and base-p digits
Coven and Meyerowitz gave two cyclotomic conditions, (T1) and (T2), which characterize integer tiles whose cardinalities have at most two distinct prime factors. We prove that the same characterization holds without this restriction. The proof uses a reduction in Chinese remainder coordinates: slicing by the lowest base-p digit produces sets with a common tiling complement in a group of order smaller by a factor of p. This reduction preserves the cyclotomic data needed for an induction on the exponents in (T2).
Read the full abstract
Computer Vision
Quantum-Gated LiteSSD: A Parameter-Efficient Lightweight Hybrid Quantum-Classical Framework for Forward-Looking Sonar Object Detection
Forward-looking sonar object detection is essential for underwater perception, yet deployment on embedded platforms requires highly compact models. To address this challenge, we explore quantum computing and introduce Quantum-Gated LiteSSD, a parameter-efficient hybrid quantum–classical detector that reformulates QuCNet-style multi-circuit quantum processing as an identity-centered channel-gating mechanism for spatial feature modulation. Experiments on the Marine Debris Watertank dataset and UATD forward-looking sonar benchmarks demonstrate an effective parameter–accuracy trade-off. The proposed detector achieves 90.84% $\mathrm{mAP}_{50}$ on Watertank with approximately $62\times$ fewer parameters than YOLO26s and $164.3\times$ fewer parameters than SSD-VGG16. On UATD, the model achieves 70.37% $\mathrm{mAP}_{50}$ with only 0.150M parameters, making it approximately $4.1\times$ smaller than SSGA-YOLO while retaining meaningful multi-class detection capability.
Read the full abstract
General Relativity and Quantum Cosmology
Quasinormal modes of a charged covariant loop quantum black hole
This paper focuses on the quasinormal modes of a charged loop quantum black hole that preserves diffeomorphism covariance. We have examined the influence of the black hole charge Q and the quantum parameter {\zeta} on the quasinormal modes of neutral massless scalar field, neutral massive scalar field and massless charged scalar field. For the neutral massless scalar field, our work shows that as in the case of the corresponding uncharged black hole that has been examined by other authors, the turn-on of {\zeta} renders the real parts of the overtones a tendency to approach zero. Increasing Q can inhibit this tendency. For the neutral massive scalar field, when Q and {\zeta} are turned on, arbitrarily long-lived modes still exist. We also observe a non-monotonic behavior in the fundamental mode as the field mass varies for the first time. For the massless charged scalar field, our study shows that the asymptotic behaviors of the quasinormal modes of charged field and uncharged field are different as the extremal charge Qis approached. We also find that the real part of the fundamental mode tends to zero at some critical value eQfor a charged scalar field with field charge e.
Read the full abstract
Classical Analysis and ODEs
Orthonormal bases of spherical harmonics with maximal Lp norm growth
In this paper, we show that for every p>2, there is an orthonormal basis of spherical harmonics on the n-dimensional unit sphere which achieves the maximal Lp norm growth. More precisely, one basis achieves this growth for p up to the critical exponent 2(n+1)/(n-1), and another for p from the critical exponent up to infinity. The first basis is built from rotations of the real part of a highest weight spherical harmonic. The second is built from zonal harmonics whose poles are selected from a spherical design. In both cases, the selection uses the restricted invertibility theorem of Bourgain and Tzafriri. This extends earlier results of Bourgain and of the author (arXiv:1404.5016) on the 2-dimensional sphere for 2<p<=6 to all dimensions and all p>2, and improves the positive density subsequence there to a whole basis.
Read the full abstract
Networking
Towards a Connected Heterogeneous All-Medium Integrated Network (CHAIN) for Converged Connectivity Across Land, Sea, Air, and Space
Next-generation connectivity depends on data traversing multiple physical media within a single end-to-end path, yet research in optical fibre, free-space optical and radio wireless, non-terrestrial networks, and underwater communications has advanced largely in isolation. This fragmentation has a wider adverse impact on communication performance, deployment and adaption as the most demanding open problems in next-generation connectivity, cross-medium channel characterisation, transport-layer protocol design across heterogeneous latency regimes, and cross-domain orchestration, sit at the boundaries between domains and can only be addressed by bringing these challenges together in cross-domain systems. Space-air-ground integrated network research has begun to treat three domains analytically, and its recent extension to the sea surface represents the most ambitious multi-domain framework proposed to date, yet neither has produced experimental results, a deployed system, or a standards engagement. The subsurface and maritime domain remains absent from both. This paper proposes the connected heterogeneous all-medium integrated network (CHAIN), a framework that treats the undersea, maritime, terrestrial, aerial and space domains as a single design space. We identify an all-photonic network backbone as the unifying physical infrastructure, Artificial intelligence (AI)-driven orchestration as the cross-domain control layer, and the joints between domains as a unification challenge. We survey the state of the art across all domains and the existing cross-domain literature, develop the CHAIN framework and its technical pillars, characterise the five core open problems the field must resolve, and set out a research roadmap from near-term measurement campaigns and testbed validation through cross-medium field trials to global-scale deployment.
Read the full abstract
Differential Geometry
Legendrian submanifolds in the unit sphere with conformal Maslov form and constant sectional curvature
This paper is concerned with the study on Legendrian submanifolds with conformal Maslov form in the unit sphere $\mathbb{S}^{2n+1}$, which admits a Sasakian structure $(\varphi,\xi,\eta,g)$ for $n\ge2$. As the main result, we classify such submanifolds with constant sectional curvature, motivated by the classification result of the minimal Legendrian submanifolds with constant sectional curvature. Moreover, we prove that, for a closed Legendrian submanifold $M^n$ in $\mathbb{S}^{2n+1}$ with conformal Maslov form, if its sectional curvature satisfies the pinching $0\leq\sec_g\leq1$, then either $M^n$ is the totally geodesic Legendrian sphere with $\sec_g=1$, or $M^n$ is a closed embedded weighted Clifford torus with $\sec_g=0$. This extends the corresponding pinching theorem of Dillen–Vrancken (J Math Pures Appl 69:85–93 1990) from minimal Legendrian submanifolds to the conformal Maslov class under the same curvature bounds.
Read the full abstract
Instrumentation and Detectors
Demonstrating the thermal noise limit in a backaction-free bulk acoustic wave resonator chain for gravitational wave detection
We report the full sub-Kelvin characterization of the BAUSCIA high-frequency gravitational-wave antenna, based on cryogenic Bulk Acoustic Wave resonators coupled to SQUID amplifiers for signal readout. The end-to-end performance analysis of the experimental chain, from the sensor to the DAQ, demonstrates that resonator thermal noise dominates the noise budget at temperatures well below 100 mK for all investigated modes. The measurements also verify proper thermalization of the resonator modes and rule out significant SQUID backaction on the strain sensor, confirming that the system operates close to its fundamental limits with comparable resonator thermal noise and additive readout noise. From this characterization, we derive projected strain sensitivities in the range $1$–$10 \times 10^{-21}\,\mathrm{Hz}^{-1/2}$ for several resonant frequencies between 5 and 20~MHz, with corresponding fundamental thermal limits in the range $0.7$–$1.4 \times 10^{-21}\,\mathrm{Hz}^{-1/2}$. Equipped with three resonators and synchronized to an absolute global time reference for multi-site coincidences, the antenna is ready to enter a pilot science run.
Read the full abstract
Quantum Physics
Conditional Quantum Flow Matching for Data-Scarce Physiological Signal Augmentation
Generative augmentation is a standard remedy for label scarcity in physiological signal classification, but existing quantum generative models start from uninformative noise, ignoring class structure that is already available. We propose Conditional Quantum Flow Matching (CQFM): a single 306-parameter circuit, conditioned on both flow time and class label, transports a compact class-conditional prior toward the target distribution. Quantum flow matching as published is unconditional, so this is to our knowledge the first conditional one, and the first EEG augmentation on a parameterized quantum circuit. A nonnegative spectral embedding removes the need for tomography at readout. On BCI Competition IV-2a, starting from a prior rather than noise is worth $+5.1$ accuracy points over QuDDPM (9/9 subjects), though at that operating point a class-conditional Gaussian matches CQFM. Where the prior fails the transport earns its keep: given one transferred from other subjects it regains $+7.2$ TSTR points (9/9).
Read the full abstract
Artificial Intelligence
VeriDx: Earning the Right to Diagnose with Disease-Centric Verification
A correct diagnosis can still be reached for the wrong reasons. In clinical reasoning, every disease hypothesis creates obligations: key evidence must be checked, alternatives must be ruled out, contradictions must be resolved, useful tests must be considered, and closure must be justified. Current evaluations of medical LLMs mostly focus on final answers, local steps, or isolated facts, and therefore miss these hypothesis-induced commitments. We introduce VeriDx, a disease-centric verification framework that links free-form diagnostic reasoning to structured disease profiles. VeriDx tracks whether each hypothesis is satisfied, unresolved, or violated its clinical obligations, exposing failures such as missing critical tests, unresolved differentials, ignored contradictions, unsupported claims, and premature closure. We instantiate VeriDx for complex respiratory diagnosis using guideline-derived disease profiles and expert-annotated longitudinal cases. Our results show that many diagnostic errors are not isolated mistakes, but broken commitments made earlier in the reasoning process.
Read the full abstract
Software Engineering
Deterministic Temporal Reconciliation for Effective-Dated Identity Lifecycle Events
Identity lifecycle automation processes workforce changes that carry two distinct notions of time: when a business fact becomes effective and when an authoritative source last revised it. Corrections, cancellations, future-dated changes, duplicate delivery, and out-of-order arrival can therefore produce divergent account states when processors rely on transport order or effective time alone. This paper presents a deterministic temporal reconciliation method for effective-dated identity events. The method separates logical business facts from their physical revisions, deduplicates exact replays, selects the authoritative revision of each fact using transaction-time freshness, removes canceled facts, and then applies surviving facts in valid-time order. We establish permutation invariance, replay idempotence, revision dominance, and deterministic snapshot construction under explicit source assumptions. A reproducible synthetic fault-injection benchmark compares the method with arrival-order, effective-time, and transaction-time processing. Across 250,000 generated identity histories and 1,585,589 delivered records, the proposed method reconstructed the separately retained authoritative final state in all tested cases. At 75% delivery disorder, exact-state accuracy was 42.35% for arrival-order processing, 85.38% for effective-time sorting, 76.61% for transaction-time sorting, and 100% for the proposed method. A separate 40,000-permutation experiment produced the same final state for every tested permutation under the proposed reconciliation contract.
Read the full abstract
Information Retrieval
TF-IDF and BM25 Are Exact KL Divergences
TF-IDF and BM25 are two of the most widely used methods for scoring query-document relevance, yet neither has a standard probabilistic derivation that justifies it as a statistical method within a unified framework. We address this gap by showing that both scoring methods admit an exact interpretation as Kullback-Leibler divergences between two probability models. We treat the BM25 variant that includes the plus 1 correction in the IDF term, which is the one used in practice, and also discuss the original BM25 formulation without that correction. The resulting framework provides a common theoretical basis for TF-IDF and BM25, clarifies what they measure, and allows them to be compared theoretically with other information retrieval methods rather than only experimentally.
Read the full abstract
Artificial Intelligence
Schizophrenia Detection from EEG Signals: A Transformer Framework with Spectrogram Representation
Schizophrenia is a serious psychiatric disorder that affects millions of people worldwide, and its diagnosis remains primarily dependent on clinical assessment. Electroencephalography (EEG) provides a non-invasive approach to investigate brain activity and has shown potential to support automated Schizophrenia detection. However, existing EEG-based classification studies often suffer from limitations including small datasets, inconsistent preprocessing strategies, and evaluation protocols that may not adequately prevent subject-related data leakage. In this study, we propose an EEG-based Schizophrenia classification framework that transforms preprocessed EEG recordings into time-frequency representations using the Short-Time Fourier Transform. The generated spectrogram images are classified using both conventional Machine Learning algorithms, including Support Vector Machines, Random Forests, and XGBoost, and Deep Learning models, including convolutional architectures and CNN-Transformer hybrids. To ensure reliable evaluation, all data partitions are performed at the subject level, and image-level predictions are aggregated into subject-level decisions. On the independent test set of 18 subjects, the CNN-Transformer (CT-SZ) model achieves a subject-level AUC-ROC of 95.00%, while the CNN + Squeeze-and-Excitation + Transformer (CST-SZ) model achieves 92.50%.
Read the full abstract
Information Theory
Polarforming-Enabled Power-Splitting SWIPT: A GNN-Based Optimization Approach
Simultaneous wireless information and power transfer (SWIPT) is a critical technology for the future of the Internet of Things (IoT). However, ensuring a stable power supply in such networks remains a significant challenge. This work introduces dynamic polarization control as an additional degree of freedom (DoF) in SWIPT systems. We propose a system where both the base station (BS) and the users can adjust their antenna polarization, a technique known as polarforming. In addition, each user device is capable of splitting the incident signal to perform simultaneous information decoding (ID) and energy harvesting (EH). The resulting non-convex optimization, with many coupled variables, is solved using a graph neural network (GNN) that learns the sub-optimal beamforming, polarization, and power-splitting variables. Simulation results demonstrate that the proposed GNN-based dynamic polarforming optimization significantly outperforms fixed-polarization schemes, particularly under imperfect channel state information (CSI). Moreover, joint polarforming and GNN-based optimization maintain robust SWIPT performance under both polarization mismatch and imperfect CSI.