Published: 2026-03-11 17:59:42
Authors: Tao Zhong, Yixun Hu, Dongzhe Zheng, Aditya Sood, Christine Allen-Blanchette
Categories: cs.LG, cond-mat.mtrl-sci, cs.AI, cs.CV, physics.ins-det
Abstract:
We propose Neural Field Thermal Tomography (NeFTY), a differentiable physics framework for the quantitative 3D reconstruction of material properties from transient surface temperature measurements. While traditional thermography relies on pixel-wise 1D approximations that neglect lateral diffusion, and soft-constrained Physics-Informed Neural Networks (PINNs) often fail in transient diffusion scenarios due to gradient stiffness, NeFTY parameterizes the 3D diffusivity field as a continuous neural field optimized through a rigorous numerical solver. By leveraging a differentiable physics solver, our approach enforces thermodynamic laws as hard constraints while maintaining the memory efficiency required for high-resolution 3D tomography. Our discretize-then-optimize paradigm effectively mitigates the spectral bias and ill-posedness inherent in inverse heat conduction, enabling the recovery of subsurface defects at arbitrary scales. Experimental validation on synthetic data demonstrates that NeFTY significantly improves the accuracy of subsurface defect localization over baselines. Additional details at https://cab-lab-princeton.github.io/nefty/
Published: 2026-03-11 17:59:40
Authors: Yan-Bo Lin, Jonah Casebeer, Long Mai, Aniruddha Mahapatra, Gedas Bertasius, Nicholas J. Bryan
Categories: cs.CV, cs.AI, cs.LG, cs.MM, cs.SD
Abstract:
Generating music that temporally aligns with video events is challenging for existing text-to-music models, which lack fine-grained temporal control. We introduce V2M-Zero, a zero-pair video-to-music generation approach that outputs time-aligned music for video. Our method is motivated by a key observation: temporal synchronization requires matching when and how much change occurs, not what changes. While musical and visual events differ semantically, they exhibit shared temporal structure that can be captured independently within each modality. We capture this structure through event curves computed from intra-modal similarity using pretrained music and video encoders. By measuring temporal change within each modality independently, these curves provide comparable representations across modalities. This enables a simple training strategy: fine-tune a text-to-music model on music-event curves, then substitute video-event curves at inference without cross-modal training or paired data. Across OES-Pub, MovieGenBench-Music, and AIST++, V2M-Zero achieves substantial gains over paired-data baselines: 5-21% higher audio quality, 13-15% better semantic alignment, 21-52% improved temporal synchronization, and 28% higher beat alignment on dance videos. We find similar results via a large crowd-source subjective listening test. Overall, our results validate that temporal alignment through within-modality features, rather than paired cross-modal supervision, is effective for video-to-music generation. Results are available at https://genjib.github.io/v2m_zero/
Published: 2026-03-11 17:58:35
Authors: Sujit Sakharam Damase, James Eldred Pascoe
Categories: math.ST, cs.IT, math.CA, math.FA, math.MG
Abstract:
Standard thresholding techniques for correlation matrices often destroy positive semidefiniteness. We investigate the construction of positive definite functions that vanish on specific sets $K \subseteq [-1,1)$, ensuring that the thresholded matrix remains a valid correlation matrix. We establish existence results, define a criterion for faithfulness based on the linear coefficient of the normalized Gegenbauer expansion in analogy with Delsarte's method in coding theory, and provide bounds for thresholding at single points and pairs of points.
We prove that for correlation matrices of rank $n$, any soft-thresholding operator that preserves positive semidefiniteness necessarily induces a geometric collapse of the feature space, as quantified by an $\mathcal{O}(1/n)$ bound on the faithfulness constant. Such demonstrates that geometrically unbiased soft-thresholding limits the recoverable signal.
Published: 2026-03-11 17:56:26
Authors: CMS Collaboration
Categories: hep-ex
Abstract:
Massive leptophobic Z' bosons decaying to a pair of charginos are searched for in proton-proton collisions at $\sqrt{s}$ = 13 TeV, using data samples collected by the CMS experiment in 2016, 2017, and 2018, corresponding to a total integrated luminosity of 138 fb$^{-1}$. The Z' bosons originate from an additional U(1)' gauge symmetry extended to the minimal supersymmetric standard model. The final state consists of two oppositely charged leptons and missing transverse momentum. The signal extraction is performed with a parametrized neural network. The measurements are found to be consistent with the standard model expectations. Upper limits are set on the Z' boson production cross sections as a function of the Z' and chargino masses. The analysis excludes Z' boson masses up to about 3.5 TeV for the specific case of Z' bosons decaying exclusively to charginos, with the charginos decaying to W bosons and neutralinos.
Published: 2026-03-11 17:55:45
Authors: Nicolas Béreux, Giovanni Catania, Aurélien Decelle, Francesca Mignacco, Alfonso de Jesús Navas Gómez, Beatriz Seoane
Categories: q-bio.NC, cond-mat.dis-nn, cond-mat.stat-mech
Abstract:
Large-scale electrophysiological recordings now allow simultaneous monitoring of thousands of neurons across multiple brain regions, revealing structured variability in neural population activity. Understanding how these collective patterns emerge from microscopic neural interactions requires models that are scalable, predictive, and interpretable. Statistical physics provides principled frameworks to address this complexity, including maximum-entropy models that offer transparent descriptions of collective neural activity but remain largely limited to pairwise interactions and modest system sizes. Here, we use Restricted Boltzmann Machines (RBMs) to model the activity of $\sim1500$-$2000$ simultaneously recorded neurons from the Allen Institute Visual Behavior Neuropixels dataset, spanning multiple cortical and subcortical regions of the mouse brain. RBMs extend the maximum-entropy framework through latent variables, enabling the capture of higher-order dependencies while allowing explicit extraction of effective interaction networks. Recent advances in efficient Markov Chain sampling and training enable accurate learning of these models at this scale. RBMs reproduce the complex statistics of neural recordings with high accuracy. Generated samples match empirical pairwise and higher-order correlations, as well as global statistics such as the distribution of population activity. The inferred parameters provide direct access to effective neuronal interactions, revealing coordination patterns in population activity. These couplings display clear anatomical structure: neurons within visual cortical areas show stronger interactions, consistent with visually driven behavior, while cross-area couplings are weaker. Despite being trained on temporally shuffled data, Markov Chain Monte Carlo simulations also reproduce the global relaxation dynamics of neural activity.
Published: 2026-03-11 17:53:20
Authors: Oshin Daoud, Haifa Fares, Amor Nafkha, Yahia Medjahdi, Laurent Clavier
Categories: eess.SP
Abstract:
This letter investigates phase noise (PN) mitigation in generalized receiver spatial modulation (GRSM) massive MIMO systems at mmWave under a common local oscillator (CLO). Under CLO, the received energy remains invariant relative to the no-PN scenario, enabling reliable energy-based spatial detection using the no-PN threshold. PN-sensitivity and geometry-based metrics are introduced to design compact, PN-resilient MQAM symbol pools with low detection complexity. PN robustness is further improved through an enhanced PN-aware GRSM-MQAM system that exploits spatial modulation (SM) to recover part of the MQAM bits and strategically maps spatial-pattern Hamming weights to reduce the effective PN impact. In addition, a practical single-stage PN estimation/compensation architecture is proposed, while a benchmark double-stage compensation is adopted to quantify the upper bound achievable via separate Tx/Rx PN mitigation. Results show that under PN, the overall BER is mainly dominated by MQAM symbol detection errors, especially for denser constellations, whereas spatial detection remains robust. The proposed single-stage compensation improves PN resilience, while the benchmark double-stage compensation approaches near PN-free performance.
Published: 2026-03-11 17:50:38
Authors: Mingyang Song, Mao Zheng, Chenning Xu
Categories: cs.CL
Abstract:
The paradigm of LLM-as-a-judge relies on a critical assumption, namely that high inter-evaluator agreement indicates reliable and objective evaluation. We present two complementary findings that challenge this assumption. \textbf{First}, we demonstrate that this consensus is frequently illusory. We identify and formalize \textbf{Evaluation Illusion}, a phenomenon where LLM judges generate sophisticated critiques yet anchor scores on shared surface heuristics rather than substantive quality. Through a large-scale study of 105,600 evaluation instances (32 LLMs $\times$ 3 frontier judges $\times$ 100 tasks $\times$ 11 temperatures), we show that model-level agreement (Spearman $ρ= 0.99$) masks fragile sample-level agreement (Pearson $\bar{r} = 0.72$; absolute agreement ICC $= 0.67$), that merely sharing rubric structure restores 62\% of total agreement, and that high-quality outputs paradoxically receive the \textit{least} consistent evaluations. \textbf{Second}, we demonstrate that dynamically generating evaluation rubrics grounded in domain knowledge produces more meaningful assessment. We introduce MERG (Metacognitive Enhanced Rubric Generation), a knowledge-driven rubric generation framework whose domain-selective effects confirm this. Agreement \textit{increases} in codified domains (Education +22\%, Academic +27\%) where knowledge anchors evaluators on shared standards, while it decreases in subjective domains where genuine evaluative pluralism emerges. These findings suggest that evaluation rubrics should be dynamically enriched with expert knowledge rather than relying on generic criteria, with implications for reward modeling in RLAIF.
Published: 2026-03-11 17:48:45
Authors: Tycho F. A. van der Ouderaa, Mart van Baalen, Paul Whatmough, Markus Nagel
Categories: cs.LG
Abstract:
Scalar quantization of large language models (LLMs) is fundamentally limited by information-theoretic bounds. While vector quantization (VQ) overcomes these limits by encoding blocks of parameters jointly, practical implementations must avoid the need for expensive lookup mechanisms or other explicit codebook storage. Lattice approaches address this through highly structured and dense packing. This paper explores the Leech lattice, which, with its optimal sphere packing and kissing configurations at 24 dimensions, is the highest dimensional lattice known with such optimal properties. To make the Leech lattice usable for LLM quantization, we extend an existing search algorithm based on the extended Golay code construction, to i) support indexing, enabling conversion to and from bitstrings without materializing the codebook, ii) allow angular search over union of Leech lattice shells, iii) propose fully-parallelisable dequantization kernel. Together this yields a practical algorithm, namely Leech Lattice Vector Quantization (LLVQ). LLVQ delivers state-of-the-art LLM quantization performance, outperforming recent methods such as Quip\#, QTIP, and PVQ. These results highlight the importance of high-dimensional lattices for scalable, theoretically grounded model compression.
Published: 2026-03-11 17:48:37
Authors: Rafał Błaszkiewicz, Margot Young, Albane Théry, Talia Calazans, Yoichiro Mori, Maciej Lisicki, Arnold J. T. M. Mathijssen
Categories: physics.bio-ph, physics.flu-dyn
Abstract:
Motile cilia drive biological fluid transport through whip-like beating motions that synchronize into metachronal waves. The lengths of these cilia span three orders of magnitude, from microns in human airways to millimeters in ctenophores. While recent studies have considered ciliary flows at intermediate Reynolds numbers, the effect of inertia on coordinated particle transport remains unexplored. Here, we address this gap using "Pufflets," the inertial counterparts of Stokeslets. These Pufflets describe rapidly accelerating flows generated by short-lived impulses, encoded by spatiotemporally singular momentum injections. To produce such rapid impulses experimentally, we designed an Atwood machine that generates long-lived Pufflet flows, which we capture with high-speed PIV measurements that agree well with analytical theory and simulations. Moreover, we find that pairs of equal and opposite Pufflets can drive net particle displacements and mixing due to time reversal symmetry breaking, which would be impossible in Stokes flow. Finally, we consider metachronal waves of Pufflets. Remarkably, we discover that particles can surf on these waves by coasting inertially from one cilium to the next, leading to highly efficient particle transport. This work paves the way toward understanding rapidly accelerating flows and collective transport driven by biological and artificial cilia.
Published: 2026-03-11 17:42:09
Authors: Serat M. Saad, Yuan-Sen Ting
Categories: astro-ph.SR, astro-ph.GA, astro-ph.IM
Abstract:
Recent work by Chae et al. (2026) reported a gravitational anomaly in 36 wide-binary pairs, finding a gravity boost factor of $γ\equiv G_{\rm eff}/G_{\rm N} \approx 1.60_{-0.14}^{+0.17}$ at low accelerations, consistent with predictions from Modified Newtonian Dynamics (MOND). We reanalyze the same dataset using a hierarchical Bayesian model that infers a global $γ$ across all systems while fitting three-dimensional orbital elements. Our model yields $γ= 1.12^{+0.27}_{-0.22}$, consistent with Newtonian gravity ($γ= 1$) at the $\sim0.4σ$ level. To identify the source of the discrepancy, we perform a test using an approach similar to Chae et al. (2026), replacing the semi-major axis with a geometric de-projection of the observed projected separation. This test yields $γ= 1.56^{+0.21}_{-0.18}$, closely matching the result of Chae et al. (2026). This suggests that the inferred value of $γ$ is sensitive to how the three-dimensional orbital separation is modeled, and including an independent semi-major axis parameter can account for velocity excesses that would otherwise be attributed to non-Newtonian gravity.
Published: 2026-03-11 17:33:38
Authors: Thomas Thiemann
Categories: gr-qc
Abstract:
The definition of the phase space of field theories in presence of boundaries of Cauchy surfaces requires a choice of boundary conditions or decay behaviour of those fields. Often these conditions are motivated in part by the decay behaviour of the initial data of known exact solutions.
In the case of gauge field theories the initial data are not free but are subject to initial value constraints. Still, the decay behaviour is commonly specified for the kinematical, i.e. unconstrained phase space. This can lead to the following practical problem: The constraints are preferably solved for field variables on which they depend only algebraically, i.e. not involving derivatives, as otherwise one would need to solve partial differential equations. However, the specified decay behaviour may prevent from doing that.
On the other hand, a precise specification of decay for all kinematical fields appears unnecessary because the decay of gauge degrees of freedom is not observable. Yet, knowledge of their decay is required as one needs to compute Poisson brackets on the kinematical phase space in order to define what gauge invariance means. Thus the interplay between the constraint structure and the decay properties of the kinematical phase space is complex.
In this contribution we develop a reduced phase space induced approach to the decay problem. Upon specifying gauge conditions tailored to the algebraic structure of the constraints, these define a split of the kinematical phase space into gauge and true degrees of freedom. Then the decay conditions of the kinematical phase space is systematically parametrised by a choice of decay for just the true degrees of freedom (i.e. the reduced phase space), the decay of the gauge degrees of freedom then follows unambiguously from solving both the constraints and the gauge conditions.
Published: 2026-03-11 17:27:41
Authors: David Gómez-Cambronero, Daniel Munteanu, Ana Isabel González-Tablas
Categories: cs.CR
Abstract:
In this paper, we present a laboratory study focused on the impact of post-quantum cryptography (PQC) algorithms on multiple layers of stateful HTTP over TLS transactions: the TCP handshake, the intermediate TCP-TLS layer, the TLS handshake, the intermediate TLS layer, and the HTTP application layer. To this end, we propose a laboratory architecture that emulates a real-world setup in which a load test of up to 100 transactions per second is sent to a load balancer, which in turn forwards them to a backend server that returns the responses. Each set of tests is executed using the TLS 1.3 key exchange groups as follows: traditional (or non-PQC), hybrid PQC and pure PQC. Each set of tests also varied the backend response size. Across more than thirty experiments, we performed data reduction and statistical analysis for each layer, to determine the specific impact of each algorithm (PQC and traditional) at every stage of the HTTP-over-TLS transaction.
Published: 2026-03-11 17:25:07
Authors: Tahani Mtar, Radhouane Fekih-Salem
Categories: math.DS
Abstract:
We propose a system of differential equations modeling the competition between two obligate mutualistic species for a single nutrient in a chemostat. Each species promotes the growth of the other, and growth occurs only in the presence of its partner. The three-dimensional model incorporates interspecific density-dependent growth functions and distinct removal rates. We perform a mathematical analysis by characterizing the multiplicity of equilibria and deriving conditions for their existence and stability. Using MatCont, we construct numerical operating diagrams in the parameter space of dilution rate and input substrate concentration, providing a global view of the qualitative dynamics of the system. One-parameter bifurcation diagrams with respect to the input substrate then reveal a variety of dynamical transitions, including saddle-node, Hopf, limit point of cycles LPC, period-doubling PD, and homoclinic bifurcations. When mortality is included, the system exhibits a richer dynamical repertoire than in the mortality-free case, with stable and unstable periodic orbits, tri-stability between equilibria and limit cycles, and several codimension-two bifurcations, including Bogdanov-Takens (BT), cusp of cycles (CPC), resonance points (R1 and R2), and generalized Hopf GH points. These features allow coexistence not only around positive equilibria but also along stable limit cycles, reflecting more realistic ecological dynamics. In contrast, neglecting mortality restricts coexistence to equilibria only. Overall, this study highlights the critical role of mortality in shaping complex dynamics in obligate mutualism, producing multistability and oscillatory coexistence patterns that may better represent natural microbial or ecological systems.
Published: 2026-03-11 17:14:57
Authors: Peter Balogh
Categories: cs.LG
Abstract:
We show that MLP layers in transformer language models perform binary routing of continuous signals: the decision of whether a token needs nonlinear processing is well-captured by binary neuron activations, even though the signals being routed are continuous. In GPT-2 Small (124M parameters), we find that specific neurons implement a consensus architecture -- seven "default-ON" neurons and one exception handler (N2123 in Layer 11) that are 93-98% mutually exclusive -- creating a binary routing switch. A cross-layer analysis reveals a developmental arc: early layers (L1-3) use single gateway neurons to route exceptions without consensus quorums; middle layers (L4-6) show diffuse processing with neither gateway nor consensus; and late layers (L7-11) crystallize full consensus/exception architectures with increasing quorum size (1 to 3 to 7 consensus neurons). Causal validation confirms the routing is functional: removing the MLP at consensus breakdown costs 43.3% perplexity, while at full consensus removing it costs only 10.1% -- exceeding a 4x difference. Comparing binary vs. continuous features for the routing decision confirms that binarization loses essentially no information (79.2% vs. 78.8% accuracy), while continuous activations carry additional magnitude information (R^2 = 0.36 vs. 0.22). This binary routing structure explains why smooth polynomial approximation fails: cross-validated polynomial fits (degrees 2-7) never exceed R^2 = 0.06 for highly nonlinear layers. We propose that the well-established piecewise-affine characterization of deep networks can be complemented by a routing characterization: along the natural data manifold, the piecewise boundaries implement binary decisions about which tokens need nonlinear processing, routing continuous signals through qualitatively different computational paths.
Published: 2026-03-11 17:12:06
Authors: Liese Bekkers, Frank Neven, Lorrens Pantelis, Stijn Vansummeren
Categories: cs.DB
Abstract:
We introduce the problem of Poisson sampling over joins: compute a sample of the result of a join query by conceptually performing a Bernoulli trial for each join tuple, using a non-uniform and tuple-specific probability. We propose an algorithm for Poisson sampling over acyclic joins that is nearly instance-optimal, running in time O(N + k \log N) where N is the size of the input database, and k is the size of the resulting sample. Our algorithm hinges on two building blocks: (1) The construction of a random-access index that allows, given a number i, to randomly access the i-th join tuple without fully materializing the (possibly large) join result; (2) The probing of this index to construct the result sample. We study the engineering trade-offs required to make both components practical, focusing on their implementation in column stores, and identify best-performing alternatives for both. Our experiments on real-world data demonstrate that this pair of alternatives significantly outperforms the repeated-Bernoulli-trial algorithm for Poisson sampling while also demonstrating that the random-access index by itself can be used to competively implement Yannakakis' acyclic join processing algorithm when no sampling is required. This shows that, as far a query engine design is concerned, it is possible to adopt a uniform basis for both classical acyclic join processing and Poisson sampling, both without regret compared to classical join and sampling algorithms.
Published: 2026-03-11 16:45:58
Authors: Ilijas Farah
Categories: math.LO, math.OA
Abstract:
Stone duality is an indispensable tool for the study of compact, zero-dimensional, Hausdorff spaces. In the case of general compact Hausdorff spaces one can get quite a bit of mileage by considering the `Wallman duality' between compact spaces and lattices of closed sets. I will argue that the Gelfand--Naimark duality between compact Hausdorff spaces and unital, commutative \cstar-algebras provides great insight into compact Hausdorff spaces, and \v Cech--Stone remainders and their autohomeomorphisms in particular.
Published: 2026-03-11 16:21:54
Authors: Sam Arkle, Andrew Polonsky
Categories: cs.LO, math.LO
Abstract:
We present a constructive formalization of Abstract Rewriting Systems (ARS) in the Agda proof assistant, focusing on standard results in term rewriting. We define a taxonomy of concepts related to termination and confluence and investigate the relationships between them and their classical counterparts. We identify, and eliminate where possible, the use of classical logic in the proofs of standard ARS results. Our analysis leads to refinements and mild generalizations of classical termination and confluence criteria. We investigate logical relationships between several notions of termination, arising from different formulations of the concept of a well-founded relation. We illustrate general applicability of our ARS development with an example formalization of the lambda calculus.
Published: 2026-03-11 16:18:51
Authors: Sahar Choukir, Nirosh Manohara, Chandra Veer Singh
Categories: cs.CE, cond-mat.mtrl-sci, physics.app-ph
Abstract:
Current research on three-dimensional metamaterial has largely focused on conventional strut, plate, and shell-based lattice designs. Although these designs offer several advantages, they possess inherent limitations that can restrict their performance in certain applications, motivating the exploration of alternative structural topologies. Here, we present a large-scale, symmetry guided framework for the generation and analysis of architected metamaterials based on all 36 cubic space groups. Using a voxel-based representation, we construct a database of approximately 1.95 million periodic unit cells spanning a broad range of relative densities and topological complexity. This dataset reveals a rich elastic property landscape shaped by crystallographic symmetry, including rare pentamode designs with high bulk to shear ratios such as $K/G \approx 166$ , isotropic-auxetic architectures with Poisson's ratio as low as $ν=-0.76$, and structures achieving up to 93% of the Hashin-Shtrikman upper bound on stiffness. Complementing the dataset, we develop a three-dimensional convolutional neural network surrogate model trained and evaluated on the full database to predict strain-energy density values under uniaxial, shear, and hydrostatic loading. Together, this work establishes a comprehensive atlas of cubic symmetric metamaterials and provides a pre-trained model for the accelerated discovery and design of 3D architected materials with extreme mechanical properties.
Published: 2026-03-11 16:18:07
Authors: Qinxin Wu, Fucheng Niu, Hengchuan Zhu, Yifan Sun, Ye Shen, Xu Li, Han Wu, Leqi Liu, Zhiwen Pan, Zuozhu Liu, Fudong Zhu, Bin Feng
Categories: cs.CV
Abstract:
Generative AI has advanced rapidly in medical report generation; however, its application to oral and maxillofacial CBCT reporting remains limited, largely because of the scarcity of high-quality paired CBCT-report data and the intrinsic complexity of volumetric CBCT interpretation. To address this, we introduce CBCTRepD, a bilingual oral and maxillofacial CBCT report-generation system designed for integration into routine radiologist-AI co-authoring workflows. We curated a large-scale, high-quality paired CBCT-report dataset comprising approximately 7,408 studies, covering 55 oral disease entities across diverse acquisition settings, and used it to develop the system. We further established a clinically grounded, multi-level evaluation framework that assesses both direct AI-generated drafts and radiologist-edited collaboration reports using automatic metrics together with radiologist- and clinician-centered evaluation. Using this framework, we show that CBCTRepD achieves superior report-generation performance and produces drafts with writing quality and standardization comparable to those of intermediate radiologists. More importantly, in radiologist-AI collaboration, CBCTRepD provides consistent and clinically meaningful benefits across experience levels: it helps novice radiologists improve toward intermediate-level reporting, enables intermediate radiologists to approach senior-level performance, and even assists senior radiologists by reducing omission-related errors, including clinically important missed lesions. By improving report structure, reducing omissions, and promoting attention to co-existing lesions across anatomical regions, CBCTRepD shows strong and reliable potential as a practical assistant for real-world CBCT reporting across multi-level care settings.
Published: 2026-03-11 16:14:52
Authors: Matti Karppa
Categories: cs.DS
Abstract:
We introduce the Huffman-Bucket Sketch (HBS), a simple, mergeable data structure that losslessly compresses a HyperLogLog (HLL) sketch with $m$ registers to optimal space $O(m+\log n)$ bits, with amortized constant-time updates, acting as a drop-in replacement for HLL that retains mergeability and substantially reduces memory requirements. We partition registers into small buckets and encode their values with a global Huffman codebook derived from the strongly concentrated HLL rank distribution, using the current cardinality estimate for determining the mode of the distribution. We prove that the Huffman tree needs rebuilding only $O(\log n)$ times over a stream, roughly when cardinality doubles. The framework can be extended to other sketches with similar strongly concentrated distributions. We provide preliminary numerical evidence that suggests that HBS is practical and can potentially be competitive with state-of-the-art in practice.
Published: 2026-03-11 16:10:55
Authors: Daniel Pezzi
Categories: math.CA
Abstract:
We prove the discrete restriction conjecture holds with no loss when $p>\frac{2d}{d-4}$ and $d\geq 5$. That is, we show optimal $L^p$ bounds for eigenfunctions of the Laplacian on the square torus for large values of $p$. This improves the results Bourgain and Demeter. Our proof method is a refinement of the circle method approach previously used to establish results with a subpolynomial loss. This represents the first sharp $L^p$ bounds for eigenfunctions on the torus since the work of Cooke and Zygmund.
We present applications to bounds for spectral projectors and the additive energy of lattice points on higher dimensional spheres. These results are similarly sharp. We also prove results with a logarithmic loss that hold in a wider range of $p$.
Published: 2026-03-11 15:59:43
Authors: Kazunori Nakayama
Categories: gr-qc, hep-ph, hep-th
Abstract:
In the most general formulation of gravity, the metric and connection are independent degrees of freedom, and the connection may include torsion and non-metricity (or distortion, collectively) degrees of freedom, resulting in a huge number of possible dynamical fields. However, the most fields are either non-dynamical or extremely heavy and the general relativity is recovered at low energy. We find a unique naturally light vector- or scalar-like distortion field, which can be dynamical and have phenomenological implications. In particular, a light scalar particle that mixes with the Higgs boson naturally appears.
Published: 2026-03-11 15:59:27
Authors: Jeyong Park, Mingdi Luo, Louk Rademaker, Jurgen Smet, Mathias S. Scheurer, Laura Classen
Categories: cond-mat.mes-hall, cond-mat.str-el
Abstract:
We study the correlated ground states of twisted mono-bilayer graphene with and without proximity-induced spin-orbit coupling (SOC) from a transition-metal dichalcogenide layer placed on top. We perform self-consistent Hartree-Fock calculations that allow the variational space to include multi-$Q$ translational symmetry broken states for all integer and half-integer fillings of the conduction bands, where signatures of correlated, topological states have been reported experimentally. We find interaction-induced insulators that retain moiré translational symmetry at integer fillings, but that break this symmetry at half-integer fillings. We argue that translational symmetry breaking arises from half-filled polarized bands, even when SOC is present. Yet, we find that small SOC can already crucially affect the spin nature of correlated states. Generally, Ising SOC favors out-of-plane spin polarization and spin-valley locking, while Rashba SOC favors in-plane spin order. If only one of these two terms is present, we find that, depending on the type of SOC, it drives a transition from a tetrahedal antiferromagnet to either a coplanar, non-coplanar, or collinear spin-density wave state for half-integer fillings. The frustration associated with the simultaneous presence of both types of SOC can induce chiral, non-coplanar order in parameter ranges where the ground state in the absence of SOC is collinear.
Published: 2026-03-11 15:53:02
Authors: Radek Honzik
Categories: math.LO
Abstract:
We analyse the Boolean-valued random forcing $B_{M,Ω}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in set theory. We observe that under the assumption that $M$ is a non-standard $ω_1$-saturated model of true arithmetics of size $ω_1$, and $Ω\in M$ is a non-standard number, $B_{M,Ω}$ is isomorphic to the probability (random) algebra corresponding to the product measure space on $2^{ω_1}$ (and hence does not depend on $M$ and $Ω$). Thus, in a well-defined sense, the forcing $B_{M,Ω}$ adds a "random integer" to the model $M$, using a non-separable algebra corresponding to $2^{ω_1}$. If $G$ is a generic filter for $B_{M,Ω}$ over a transitive model of set theory $V$, we naturally define in $V[G]$ two-valued generic extensions $M[G]^{R}$ of $M$ which correspond to Boolean-valued models in Krajicek's book (where $R$ ranges over collections of random variables which function as names for new integers). We study the relationship between the linear order $(M,<)$ and its extensions $(M[G]^R,<)$, proving several results on the extent of the mutual density of new integers in $M[G]^{R}$ and the "ground-model" integers in $M$. At the end, we discuss some advantages and limitations of interpreting forcing in bounded arithmetics (and other weak theories) in the framework of set-theoretic forcing, providing an alternative to an axiomatic approach to forcing in bounded arithmetics formulated by Atserias and Müller in Partially definable forcing and bounded arithmetic, Archive for Mathematical Logic 54 (2015), 1-33.
Published: 2026-03-11 15:46:30
Authors: Amy S. Inwood, Peter J. Smith, Philippa A. Martin, Graeme K. Woodward
Categories: eess.SP
Abstract:
In this paper, we analyse the performance of a reconfigurable intelligent surface (RIS) aided system where the RIS is divided into subsurfaces. Each subsurface is designed specifically for one user, who is served on their own frequency band. The other subsurfaces (those not designed for this user) provide additional uncontrolled scattering. A new subsurface RIS design is developed based on the optimal single-user design for a pure line-of-sight (LoS) base station (BS) to RIS channel. This is also extended to arbitrary BS-RIS channels. For our method, exact closed form solutions for the mean SNR and a mean rate upper bound are derived for the BS-RIS LoS scenario. For each user, the designed subsurface performs optimally in LoS conditions and is remarkably robust to non-LoS conditions. The system design drives down complexity to extremely low levels, reducing RIS design and receiver processing complexity and reducing the channel estimation requirements. We also quantify the complexity-performance trade-off for the new design relative to multi-user approaches.
Published: 2026-03-11 15:44:22
Authors: Chris Bertinato
Categories: cs.NI
Abstract:
Authoritative Domain Name System (DNS) response selection defines query-time response selection based on resolver-visible context and per-answer metadata, yielding different observable outcomes for the same query under different conditions. Although such behavior is widely deployed and often described informally as traffic steering, its semantics have not been formalized independently of particular configuration languages or implementations.
This paper shows that authoritative DNS response selection inhabits a bounded semantic domain determined directly by DNS protocol constraints. Requirements such as finiteness of responses, RRset atomicity, termination, cacheability, and restriction to resolver-visible inputs jointly limit the expressive power of any query-time selection mechanism. We formalize authoritative response selection as a class of DNS-admissible functions and prove that every such function admits a finite normal form consisting of conditional restriction over observable context followed by selection among a finite candidate set.
We further show that this bounded semantic domain carries intrinsic algebraic structure induced by DNS semantics, enabling principled reasoning about composition, expressiveness loss, and semantic collapse. Concrete authoritative systems, configuration models, and serialized encodings are modeled uniformly as semantic restrictions of this domain. This framework supports precise reasoning about equivalence, representability, and approximation across heterogeneous authoritative DNS systems, grounded directly in protocol semantics rather than implementation detail.
Published: 2026-03-11 15:35:55
Authors: Yichi Zhu, Kan Ling, Xu Liu, Hengrun Zhang, Huiqun Yu, Guisheng Fan
Categories: cs.AI, cs.IR
Abstract:
Medication errors pose a significant threat to patient safety, making pharmacist verification (PV) a critical, yet heavily burdened, final safeguard. The direct application of Large Language Models (LLMs) to this zero-tolerance domain is untenable due to their inherent factual unreliability, lack of traceability, and weakness in complex reasoning. To address these challenges, we introduce PharmGraph-Auditor, a novel system designed for safe and evidence-grounded prescription auditing. The core of our system is a trustworthy Hybrid Pharmaceutical Knowledge Base (HPKB), implemented under the Virtual Knowledge Graph (VKG) paradigm. This architecture strategically unifies a relational component for set constraint satisfaction and a graph component for topological reasoning via a rigorous mapping layer. To construct this HPKB, we propose the Iterative Schema Refinement (ISR) algorithm, a framework that enables the co-evolution of both graph and relational schemas from medical texts. For auditing, we introduce the KB-grounded Chain of Verification (CoV), a new reasoning paradigm that transforms the LLM from an unreliable generator into a transparent reasoning engine. CoV decomposes the audit task into a sequence of verifiable queries against the HPKB, generating hybrid query plans to retrieve evidence from the most appropriate data store. Experimental results demonstrate robust knowledge extraction capabilities and show promises of using PharmGraph-Auditor to enable pharmacists to achieve safer and faster prescription verification.
Published: 2026-03-11 15:25:11
Authors: Sam Looi
Categories: math.FA, math.CV, math.SP
Abstract:
We show that a positive limit inferior of the Berezin transform does not imply essential positivity for radial Toeplitz operators on the Bergman spaces $A^2(\mathbb B_d)$ and the Fock spaces $F^2(\mathbb C^d)$ in every complex dimension $d\ge 1$. In particular, this disproves the Perälä--Virtanen conjecture in its original one-dimensional Bergman form and shows that the corresponding radial Berezin criterion fails in all dimensions in both the Bergman and Fock settings. For each $d\ge 1$ we construct explicit bounded real-valued radial symbols $f$ for which $\liminf_{|z|\to1^-}\widetilde f(z)>0$ on $A^2(\mathbb B_d)$ and $\liminf_{|z|\to\infty}\widetilde f(z)>0$ on $F^2(\mathbb C^d)$, while the essential spectrum of $T_f$ contains a negative point. In both settings, the proofs reduce to explicit asymptotics for one-dimensional oscillatory integrals. The examples arise because, for radial symbols, the eigenvalue sequence and the Berezin transform are different asymptotic averages of the same oscillatory symbol, and these averages attenuate the oscillation by different factors.
Published: 2026-03-11 15:21:54
Authors: Wenxuan Ma, Chaofan Zhang, Yinghao Cai, Guocai Yao, Shaowei Cui, Shuo Wang
Categories: cs.RO
Abstract:
Recent advancements in integrating tactile sensing into vision-language-action (VLA) models have demonstrated transformative potential for robotic perception. However, existing tactile representations predominantly rely on qualitative descriptors (e.g., texture), neglecting quantitative contact states such as force magnitude, contact geometry, and principal axis orientation, which are indispensable for fine-grained manipulation. To bridge this gap, we propose FG-CLTP, a fine-grained contrastive language tactile pretraining framework. We first introduce a novel dataset comprising over 100k tactile 3D point cloud-language pairs that explicitly capture multidimensional contact states from the sensor's perspective. We then implement a discretized numerical tokenization mechanism to achieve quantitative-semantic alignment, effectively injecting explicit physical metrics into the multimodal feature space. The proposed FG-CLTP model yields a 95.9% classification accuracy and reduces the regression error (MAE) by 52.6% compared to state-of-the-art methods. Furthermore, the integration of 3D point cloud representations establishes a sensor-agnostic foundation with a minimal sim-to-real gap of 3.5%. Building upon this fine-grained representation, we develop a 3D tactile-language-action (3D-TLA) architecture driven by a flow matching policy to enable multimodal reasoning and control. Extensive experiments demonstrate that our framework significantly outperforms strong baselines in contact-rich manipulation tasks, providing a robust and generalizable foundation for tactile-language-action models.
Published: 2026-03-11 15:20:51
Authors: Harald Weedon-Fekjær, Elsebeth Lynge, Niels Keiding
Categories: stat.ME
Abstract:
There is a great need for evaluating screening programs, but analysing data from population screening is often complicated by a delayed screening effect. In cancer screening, only new, not yet clinically diagnosed cases, might benefit from screening through earlier treatment. Hence, mortality data following screening should be analysed based on refined mortality, separating cases based on diagnosis before and after first screening invitation. Historically, refined mortality has been implemented by selecting comparison groups from the available data to disentangle the causal effect. While giving valid estimates, the ignorance of large parts of the available data has limited study precision. In BMJ 2014, Weedon-Fekjær et al. used a new estimation approach applying all the available Norwegian mammography screening data. The estimation uses historic pre-screening data on time from clinical diagnosis to death estimating the proportion of post-screening mortality which is expected to be based on cases incident before first screening invitation, in the absence of a screening effect. Utilizing this expected proportion of post-screening incident cases, Poisson regression offsets are added to align the expected number of cases. The screening effect is then estimated adjusting for relevant covariables. While the method increases study precision, it has not been easily available and widely adopted. We here explain the method in detail, add maximum likelihood estimation, and lay the foundation for widespread use. Applying the method on Norwegian and Danish data, bootstrap confidence intervals are considerably narrower than intervals seen using other refined mortality methods, especially for the gradually introduced Norwegian program.
Published: 2026-03-11 14:57:06
Authors: Yujie Zheng, Zhuo Li, Shengtao Zhang, Hanjing Wang, Junjie Sheng, Jiaqian Wang, Junchi Yan, Weinan Zhang, Ying Wen, Bo Tang, Muning Wen
Categories: cs.LG, cs.AI, cs.CL
Abstract:
Deploying Large Language Models to data-scarce programming domains poses significant challenges, particularly for kernel synthesis on emerging Domain-Specific Architectures where a "Data Wall" limits available training data. While models excel on data-rich platforms like CUDA, they suffer catastrophic performance drops on data-scarce ecosystems such as NPU programming. To overcome this cold-start barrier without expensive fine-tuning, we introduce EvoKernel, a self-evolving agentic framework that automates the lifecycle of kernel synthesis from initial drafting to continual refining. EvoKernel addresses this by formulating the synthesis process as a memory-based reinforcement learning task. Through a novel value-driven retrieval mechanism, it learns stage-specific Q-values that prioritize experiences based on their contribution to the current objective, whether bootstrapping a feasible draft or iteratively refining latency. Furthermore, by enabling cross-task memory sharing, the agent generalizes insights from simple to complex operators. By building an NPU variant of KernelBench and evaluating on it, EvoKernel improves frontier models' correctness from 11.0% to 83.0% and achieves a median speedup of 3.60x over initial drafts through iterative refinement. This demonstrates that value-guided experience accumulation allows general-purpose models to master the kernel synthesis task on niche hardware ecosystems. Our official page is available at https://evokernel.zhuo.li.
Published: 2026-03-11 14:50:59
Authors: Zitai Xu, Guoding Liu
Categories: quant-ph
Abstract:
Efficient entanglement distillation is a central task in quantum information science and future quantum networks. At the core of distillation protocols are the quantum error correction and detection schemes which enhance the fidelity of entangled pairs. Conventional protocols focus on digital systems, which typically require complicated compiled circuits, high-fidelity multi-qubit operations and delicate pulse-level control that impose high demands on near-term hardware. Crucially, the leading physical platforms for quantum networks, trapped ions and neutral atoms, are governed by native many-body Hamiltonians inherently suited for analog, continuous-time evolution. Adopting these natural dynamics is simpler than engineering digital logic via delicate pulse-level control. Motivated by this experimental reality, we seek to leverage the intrinsic analog capabilities for efficient entanglement distillation. In this work, we introduce the Hamiltonian entanglement distillation protocol, which exploits the intrinsic information scrambling generated by random time evolution under native Hamiltonians. We establish a quantitative connection between output fidelity and Out-of-Time-Order Correlators, showing that efficient scrambling directly implies good distillation performance. Since generic Hamiltonians are naturally efficient scramblers, the capability for distillation is ubiquitous: almost all Hamiltonians in the Hilbert space suffice for high-fidelity distillation. Numerical simulations of representative Rydberg-atom and trapped-ion systems further confirm that robust performance could be achieved using only short-range interactions and evolution times feasible in current experiments. By avoiding the complexity of digital circuit control, our approach substantially relaxes experimental requirements, providing a scalable route to entanglement engineering on current analog quantum platforms.
Published: 2026-03-11 14:03:08
Authors: Hong-Xuan Jiang, Xinyu Li, Yosuke Mizuno, Ziri Younsi, Christian M. Fromm
Categories: astro-ph.HE
Abstract:
The recent evidence for a nanohertz gravitational wave background from Pulsar Timing Arrays highlights the urgent need to identify electromagnetic counterparts to supermassive binary black holes. Here, we perform global 3D general relativistic magnetohydrodynamic (GRMHD) simulations of a secondary black hole (mass ratio $q=0.1$) interacting with a Magnetically Arrested Disk around a primary black hole using a time-dependent superposed Kerr-Schild metric and post-processed general relativistic radiation transfer calculations based on thermal electron distribution function (eDF). We explore three orbital configurations: a vertical impact orbit, a coplanar embedded orbit, and a high-spin, eccentric, inclined scenario. Despite clear orbital periodicity and recurrent shock formation, the thermal synchrotron light curves frequently lack expected shock-induced flares. In vertical impacts, shock brightenings are typically sub-dominant to the stochastic MAD variability of the primary black hole, unless viewed at specific alignment phases. Conversely, coplanar orbits produce distinctive, rapid flares driven by gravitational self-lensing. We identify a frequency-dependent emission hierarchy: the primary black hole dominates sub-millimeter flux, while the secondary dominates near-infrared emission due to higher electron temperatures in thermal eDF. Finally, spin-orbit coupling drives Lense-Thirring precession, yielding twisted, wobbling jets reminiscent of OJ~287. Crucially, we demonstrate that intrinsic MAD turbulence may easily mask shock-induced flares at radio frequencies. We strongly advocate coordinated sub-millimeter and near-infrared monitoring to robustly isolate supermassive binary black hole self-lensing signatures.
Published: 2026-03-11 13:45:58
Authors: Georgia Christofidi, Francisco Álvarez-Terribas, Ioannis Roumpos, Nicolas Kourtellis, Jesus Omaña Iglesias, Thaleia Dimitra Doudali
Categories: cs.DC
Abstract:
Microservices are a dominant architecture in cloud computing, offering scalability and modularity, but also posing complex deployment challenges. As data centers contribute significantly to global carbon emissions, carbon-aware scheduling has emerged as a promising mitigation strategy. However, most existing solutions target batch, high-performance, or serverless workloads and assume access to global-scale infrastructure. Such an assumption does not hold for many national or regional small to medium-sized enterprises (SMEs) with microservice applications, which represent the real-world majority. In this paper, we present Aceso, an Adaptive Carbon- and Efficiency-aware placement for microservices that considers carbon, cost, and latency constraints. Aceso dynamically places microservices across geographically constrained regions using a scalable optimization strategy that leverages insight-based search space pruning techniques. Evaluation on a real-world deployment shows that Aceso quickly adapts to real-time changes in workload and carbon intensity and reduces carbon emissions by 37.4% and operational cost by 3.6%, on average, compared to a static deployment within a single country, while consistently meeting SLOs. In this way, Aceso enables carbon- and cost-aware microservice deployment for latency-sensitive applications in regionally limited infrastructures for SMEs.
Published: 2026-03-11 11:17:04
Authors: Adel Abbout
Categories: cond-mat.mes-hall, physics.comp-ph
Abstract:
We investigate a gauge transformation based on the successive elimination of time-dependent onsite potentials at individual sites in finite or infinite systems. Our analysis shows that this transformation renormalizes the inward hoppings by a phase factor $e^{i φ(t)}$ and the outward hoppings by $e^{-i φ(t)}$. We further demonstrate how this procedure facilitates the reduction and simulation of pulse propagation in scattering systems, while significantly simplifying the time-ordered integrals involved in the time evolution operator for time-dependent Schrodinger equation.
Published: 2026-03-11 11:04:21
Authors: Tongzhu Li, Junlong Yu
Categories: math.DG
Abstract:
A critical point metric is a critical point of the total scalar curvature functional restricted to the space of constant scalar curvature metrics on a closed manifold with unit volume. It was conjectured in 1980's that every critical point metric must be Einstein. In this paper, we prove that this conjecture is true if the norm of the traceless Ricci operator $|\widetilde{Ric}|$ is constant. For $3$-dimensional case, we prove that the conjecture is true, if the traceless Ricci operator satisfies $tr((\widetilde{Ric})^3)\geq -\frac{R}{12}|\widetilde{Ric}|^2$, where $R$ denotes the scalar curvature. where R denotes the scalar curvature.
Published: 2026-03-11 11:02:23
Authors: Teodora Mihailescu, Peter R. Young, David H. Brooks, Deborah Baker, Lucie M. Green, David M. Long, Lidia van Driel-Gesztelyi
Categories: astro-ph.SR
Abstract:
Plasma composition in flaring regions has been shown to have significant spatial and temporal variations, likely driven by dynamical processes that take place as a consequence of the sudden energy release at the reconnection site. The origins of these variations, as well as the effects they might, in turn, have on flare loops dynamics are not yet fully understood. In this work, we investigate the link between flare loop cooling times and plasma composition evolution in the loops formed during the M-class flare peaking at 13:56 UT on the 2022 April 2 using high cadence Hinode EIS spectroscopic observations. The analysis focuses on quantifying the cooling rate (using a series of emission lines covering a wide temperature range) and plasma composition evolution (using the Ca XIV 193.866 A/Ar XIV 194.401 A diagnostic) at the apex and footpoint of the flare loop arcade. Results show slower cooling and a FIP bias of 2.4 +/- 0.2 in the loop footpoint and faster cooling and a stronger FIP bias of 2.8 +/- 0.2 in the loop apex. The potential effects of plasma composition changes on the radiative cooling process of flare loops are also investigated by comparing observed loop cooling times to those predicted by simulations from the EBTEL 0D hydrodynamic model. The EBTEL simulations show that an higher FIP bias would lead to a faster radiative cooling rate and, therefore, shorter cooling times. This suggests that the variation in FIP bias observed in the two features could be responsible for the different cooling times observed.
Published: 2026-03-11 10:56:58
Authors: Adam Trybus, Bartosz Bartnicki, Remigiusz Kinas
Categories: cs.CL
Abstract:
This paper presents a research program dedicated to evaluating and advancing the reasoning capabilities of Bielik, a Polish large language model. The study describes a number of stages of work: initial benchmarking and creation of evaluation methodology, analyzing of comparative results with other LLMs and outlining of future prospects that take into account the limitations of the analyses conducted so far and aims to keep Bielik in the race give the ever-changing -- and competitive -- AI landscape.
Published: 2026-03-11 10:24:29
Authors: Nikita Geldhauser, Alexander Henke, Maksim Zhykhovich
Categories: math.AG
Abstract:
We investigate cohomological invariants and motivic invariants of semisimple algebraic groups arising in the Freudenthal magic square. Besides, we show that if the Rost invariant of a strongly inner group of type $E_7$ is a sum of at most two symbols modulo 2, then it is isotropic over an odd degree field extension, and use this fact to give a different proof of a result of Petrov and Rigby. Moreover, we construct a cohomological invariant of degree 5 for certain groups of type $^2E_6$ which detects their isotropy.
Published: 2026-03-11 10:20:42
Authors: Yuji Chen, Alistair Plum, Hansi Hettiarachchi, Diptesh Kanojia, Saroj Basnet, Marcos Zampieri, Tharindu Ranasinghe
Categories: cs.CL, cs.CV
Abstract:
The goal of news image captioning is to generate captions by integrating news article content with corresponding images, highlighting the relationship between textual context and visual elements. The majority of research on news image captioning focuses on English, primarily because datasets in other languages are scarce. To address this limitation, we create the first multilingual news image captioning benchmark, MUNIChus, comprising 9 languages, including several low-resource languages such as Sinhala and Urdu. We evaluate various state-of-the-art neural news image captioning models on MUNIChus and find that news image captioning remains challenging. We also make MUNIChus publicly available with over 20 models already benchmarked. MUNIChus opens new avenues for further advancements in developing and evaluating multilingual news image captioning models.
Published: 2026-03-11 10:15:53
Authors: Balázs Patkós
Categories: math.CO
Abstract:
A family $\mathcal{G}$ of sets is a weak copy of a poset $P$ if there is a bijection $f:P\rightarrow \mathcal{G}$ such that $p\leqslant q$ implies $f(p)\subseteq f(q)$. If $f$ satisfies $p\leqslant q$ if and only if $f(p)\subseteq f(q)$, the $\mathcal{G}$ is a strong copy of $P$. We study the anti-Ramsey numbers $\mathrm{ar}(n,P), \mathrm{ar^*}(n,P)$, the maximum number of colors used in a coloring of $2^{[n]}$ that does not admit a rainbow weak or strong copy of $P$, respectively. We establish connections to the well-studied extremal numbers $\mathrm{La}(n,P)$ and $\mathrm{La^*}(n,P)$ and determine asymptotically $\mathrm{ar^*}(n,T)$ for all tree posets $T$ and $\mathrm{ar^*}(n,O_{2k})$ for all crown posets $O_{2k}$.
Published: 2026-03-11 10:15:42
Authors: Dongmyoung Lee, Wei Chen, Xiaoshuai Chen, Rui Zong, Petar Kormushev
Categories: cs.RO
Abstract:
Robotic cloth manipulation remains challenging due to the high-dimensional state space of fabrics, their deformable nature, and frequent occlusions that limit vision-based sensing. Although dual-arm systems can mitigate some of these issues, they increase hardware and control complexity. This paper presents Touch G.O.G., a compact vision-based tactile gripper and perception/control framework for single-arm bimanual cloth manipulation. The proposed framework combines three key components: (1) a novel gripper design and control strategy for in-gripper cloth sliding with a single robot arm, (2) a Vision Foundation Model-backboned Vision Transformer pipeline for cloth part classification (PC-Net) and edge pose estimation (PE-Net) using real and synthetic tactile images, and (3) an encoder-decoder synthetic data generator (SD-Net) that reduces manual annotation by producing high-fidelity tactile images. Experiments show 96% accuracy in distinguishing edges, corners, interior regions, and grasp failures, together with sub-millimeter edge localization and 4.5° orientation error. Real-world results demonstrate reliable cloth unfolding, even for crumpled fabrics, using only a single robotic arm. These results highlight Touch G.O.G. as a compact and cost-effective solution for deformable object manipulation.
Published: 2026-03-11 09:51:15
Authors: El-Mehdi Mehiri, Sandi Klavžar
Categories: math.CO, cs.DM
Abstract:
The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper, explicit formulas, and compact ones whenever possible, for the M-polynomial under different graph products whose vertex sets are the Cartesian product of the factors are developed. The products studied are the direct, the Cartesian, the strong, the lexicographic, the symmetric-difference, the disjunction, and the Sierpiński product. The obtained formulas yield a unified structural description of how vertex-degree interactions propagate under graph constructions and extend existing results for degree-based indices at the polynomial level.
Published: 2026-03-11 09:50:50
Authors: Jean-Baptiste Vincent, Gábor Kovács, Balázs V. Nagy, Frank Preusker, Naomi Murdoch, Maurizio Pajola, Michael Kueppers, Patrick Michel, Seiji Sugita, Hannah Goldberg
Categories: astro-ph.EP, astro-ph.IM
Abstract:
As the first asteroid deflection test, NASA's successfully hit asteroid Dimorphos (secondary of the binary asteroid 65803 Didymos) with the DART kinetic impactor on September 26, 2022. To fully characterise the physical properties of the objects, and measure precisely the effects of this impact in the context of planetary defence, ESA launched the Hera mission on 7 October 2024, with scheduled arrival at Didymos in fall 2026. Among the core payload of the mission, the Asteroid Framing Cameras are two identical imaging systems that will support navigation and scientific activities, by acquiring images from various distances and observing geometries during the course of the mission. Built by ena-Optronik (Germany), the cameras match the requirements designed by the science team and will provide data that supports a wide range of investigations: hazard detection, system dynamics, shape reconstruction, surface morphology and mapping, and surface photometry. Each instrument is a panchromatic camera equipped with a 5.5 x 5.5 degree field of view, and an angular resolution of 93.7 micro-radians per pixel. The cameras shall provide the necessary data to address the mission requirements through a global mapping of the two components of the binary system at spatial scales of 2-3 m/pixel in the Early Characterisation Phase, 1-2 m/pixel in the Detailed Characterisation Phase, and 0.5-2 m/pixel in the Close Operation Phase. Dedicated flybys will bring the resolution down to < 10 cm/pixel on specific areas of interest on Dimorphos, such as the DART impact site and the JUVENTAS cubesat landing site. Here, we present the technical specifications of the camera, as well as the status of the calibration. We then summarise the planned operations in cruise and at the asteroids. Finally, we provide examples of the scientific investigations and products that will make use of the data returned by the cameras
Published: 2026-03-11 09:49:44
Authors: Edoardo Spezzano, Tomas Jezo, Michael Klasen, Ingo Schienbein
Categories: hep-ph
Abstract:
This study explores the heavy-quark contributions to polarized structure functions in deep-inelastic scattering at next-to-leading order. The structure functions $g_1$, $g_4$, $g_5$, $g_6$, and $g_7$ are computed, while $g_2$ and $g_3$ are excluded due to the higher-twist suppression. The calculations are performed within the ACOT renormalization scheme, which ensures theoretical consistency across kinematic regions where heavy quarks transition from being dynamically produced to fully active degrees of freedom. By incorporating heavy-flavor contributions at next-to-leading-order, this work provides deeper insights into their role in polarized structure functions and the spin-dependent dynamics of QCD. Both analytical results and their numerical implementation are presented.
Published: 2026-03-11 09:48:42
Authors: Jiarui Cao, Zixuan Wei, Yuxin Liu
Categories: cs.LG, cs.AI
Abstract:
We reveal a precise mathematical framework about a new family of generative models which we call Gradient Flow Drifting. With this framework, we prove an equivalence between the recently proposed Drifting Model and the Wasserstein gradient flow of the forward KL divergence under kernel density estimation (KDE) approximation. Specifically, we prove that the drifting field of drifting model (arXiv:2602.04770) equals, up to a bandwidth-squared scaling factor, the difference of KDE log-density gradients $\nabla \log p_{\mathrm{kde}} - \nabla \log q_{\mathrm{kde}}$, which is exactly the particle velocity field of the Wasserstein-2 gradient flow of $KL(q\|p)$ with KDE-approximated densities. Besides that, this broad family of generative models can also include MMD-based generators, which arises as special cases of Wasserstein gradient flows of different divergences under KDE approximation. We provide a concise identifiability proof, and a theoretically grounded mixed-divergence strategy. We combine reverse KL and $χ^2$ divergence gradient flows to simultaneously avoid mode collapse and mode blurring, and extend this method onto Riemannian manifold which loosens the constraints on the kernel function, and makes this method more suitable for the semantic space. Preliminary experiments on synthetic benchmarks validate the framework.
Published: 2026-03-11 09:36:28
Authors: Mikhail S. Podoshvedov, Sergey A. Podoshvedov
Categories: quant-ph
Abstract:
We develop a quantum teleportation protocol of an unknown optical single rail qubit using a hybrid quantum channel composed of continuous variable (CV) states of certain parity. The quantum channel is characterized by two parameters: a squeezing parameter of single-mode squeezed vacuum (SMSV) state and the beam splitter (BS) parameter used to implement it. The CV part of the hybrid state belongs to Alice, while discrete variable (DV) half is controlled by Bob. The third parameter of the protocol is a parameter of the beam splitter, used to mix the CV components of the hybrid quantum state with unknown optical single-rail qubit. Even though the number of measurement results Alice sends may increase, Bob can obtain the original qubit half the time with an appropriate choice of parameter values. In almost half the remaining cases, Bob obtains the original qubit with distorted amplitudes, and both participants know the value of the distortion factors. This means that as the amount of classical information transmitted by Alice increases, they both gain greater access to partial information about the unitary transformations that the teleported qubits undergo, allowing Bob to continue using them or attempt to recover them to improve the protocol's efficiency. The proposed method is a generalization of quantum teleportation with a nonlocal photon used as a quantum channel and unknown single-rail optical qubit.
Published: 2026-03-11 09:27:38
Authors: Artur Blois, Ben-Hur Eidt, Paulo Lupatini, Osmar R. Severiano
Categories: math.DS, math.CV
Abstract:
Let $φ$ be a holomorphic self-map of the open unit disk $\mathbb{D}.$ In this article, we study the shadowing phenomenon for composition operators $C_φf=f\circ φ$ on the Hardy space $H^2(\mathbb{D}).$ We mainly characterize all the composition operators induced by linear fractional self-maps of $\mathbb{D}$ that have the positive shadowing property.
Published: 2026-03-11 09:25:41
Authors: Matti Vahs, Joris Verhagen, Jana Tumova
Categories: cs.RO
Abstract:
Partially Observable Markov Decision Processes (POMDPs) provide a principled framework for robot decision-making under uncertainty. Solving reach-avoid POMDPs, however, requires coordinating three distinct behaviors: goal reaching, safety, and active information gathering to reduce uncertainty. Existing online POMDP solvers attempt to address all three within a single belief tree search, but this unified approach struggles with the conflicting time scales inherent to these objectives. We propose a layered, certificate-based control architecture that operates directly in belief space, decoupling goal reaching, information gathering, and safety into modular components. We introduce Belief Control Lyapunov Functions (BCLFs) that formalize information gathering as a Lyapunov convergence problem in belief space, and show how they can be learned via reinforcement learning. For safety, we develop Belief Control Barrier Functions (BCBFs) that leverage conformal prediction to provide probabilistic safety guarantees over finite horizons. The resulting control synthesis reduces to lightweight quadratic programs solvable in real time, even for non-Gaussian belief representations with dimension $>10^4$. Experiments in simulation and on a space-robotics platform demonstrate real-time performance and improved safety and task success compared to state-of-the-art constrained POMDP solvers.
Published: 2026-03-11 09:25:38
Authors: Zhi-Yuan Fan, Liu-Yong Cheng
Categories: quant-ph
Abstract:
We propose two schemes to achieve remote entanglement distribution between two mechanical nodes with a significant frequency mismatch, based on optomechanical systems. The first scheme utilizes the physical mechanism to redistribute the quantum entanglement initially established in a dispersively-coupled optomechanical system with a megahertz mechanical resonance to a distant optomechanical system which embodies the tripleresonant interaction induced by the scattering of gigahertz mechanical phonon. We also provide a fast optical pulse protocol to realize the long-distance entanglement distribution from the optomechanical system supporting the gigahertz mechanical mode to the megahertz mechanical mode included in a distant optomechanical system. Specifically, these two schemes respectively demonstrate the megahertz-to-gigahertz and gigahertz-tomegahertz entanglement distribution in the quantum network of optical photons and phonons. This work may facilitate the application of various mechanical systems in hybrid quantum network-based quantum technologies and fundamental physical research.