Search arXiv⌕ Search

arXiv subjects

Amit Kumar

Publications and source records attributed to Amit Kumar.

At least 19 recordsLinked to original sources

Hyper-dual group inverse: existence, characterizations, and applications

Motivated by the recent work of Xiao and Zhong [AIMS Math. 9 (2024), 35125--35150: MR4840882], we propose a generalized inverse for a hyper-dual matrix called hyper-dual group generalized inverse (HDGGI). Firstly, we characterize the existence of the HDGGI of a hyper-dual matrix and we show that it is unique, whenever exists. The HDGGI is then used to solve a linear hyper-dual system. We discuss the minimal $P$-norm least-squares properties of hyper-dual group inverse. We also exploit some sufficient conditions under which the reverse and forward-order laws for a particular form of the HDGGI and hyper-dual Moore-Penrose generalized inverse (HDMPGI) hold. Using the definition of dual matrix of order $n$, we finally establish necessary and sufficient condition for the existence of the group inverse of a dual matrix of order $n$.

math.RA↗

Reasoning-Search-Augmented LLMs: An Operational Taxonomy, Benchmark Analysis and Controlled Evidence Synthesis

Large language models (LLMs) demonstrate impressive emergent reasoning capabilities, yet they remain constrained by fixed model parameters and finite context windows. Even when augmented with static retrieval, they can produce statements that are unsupported by, or even contradictory to, retrieved evidence. This leads to hallucinations, difficulty incorporating up-to-date information, and failures to correctly interpret or reconcile sources. Recent work addresses these limitations by tightly coupling step-by-step reasoning with interactive search, treating retrieval as an action within an iterative agentic loop rather than a one-shot preprocessing step. This study reviews frameworks that implement such reasoning-search loops by interleaving planning, querying, retrieval, integration, verification, and stopping. We analyze these systems through four architectural axes: retrieval coupling, controller design, knowledge source, and grounding strictness. We separately treat the learning signal as a cross-cutting dimension because prompting, supervision, preference optimization, and reinforcement learning can instantiate the same architecture while producing materially different search, stopping, and grounding behavior. We further distinguish benchmark difficulty from RSA-loop demand and synthesize controlled within-study ablations and quality-cost deltas, avoiding invalid pooling across heterogeneous model backbones, retrievers, corpora, and evaluation protocols. Our goal is to clarify the landscape of reasoning-search-augmented LLMs and outline a unified perspective on the design choices shaping future research.

cs.IR↗

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems

In the online hitting set problem, sets arrive over time, and the algorithm has to maintain a subset of elements that hit all the sets seen so far. Alon, Awerbuch, Azar, Buchbinder, and Naor (SICOMP 2009) gave an algorithm with competitive ratio $O(\log n \log m)$ for the (general) online hitting set and set cover problems for $m$ sets and $n$ elements; this is known to be tight for efficient online algorithms. Given this barrier for general set systems, we ask: can we break this double-logarithmic phenomenon for online hitting set/set cover on structured and geometric set systems? We provide an $O(\log n \log\log n)$-competitive algorithm for the weighted online hitting set problem on set systems with linear shallow-cell complexity, replacing the double-logarithmic factor in the general result by effectively a single logarithmic term. As a consequence of our results we obtain the first bounds for weighted online hitting set for natural geometric set families, thereby answering open questions regarding the gap between general and geometric weighted online hitting set problems.

cs.DS↗

Slow heat-driven flow in a gas of hard disks

We study a slow heat-driven flow in a gas of elastically colliding hard disks confined to a long channel. The initial state consists of two regions with large temperature and density contrasts but nearly equal pressures, leading to a low-Mach-number, nearly isobaric evolution. In the dilute limit, the corresponding isobaric hydrodynamic theory reduces to a previously known ideal-gas description. We extend this theory to finite densities by incorporating a non-ideal equation of state of a hard-disk fluid, and solve the resulting one-dimensional equations numerically. Finite-density effects produce appreciable deviations from the ideal-gas prediction. We then test the theory directly against event-driven molecular dynamics simulations of hard disks and find very good agreement in both the dilute and finite-density regimes. The results provide, to our knowledge, the first particle-level test of isobaric gas dynamics of a strongly inhomogeneous cooling flow.

cond-mat.stat-mech↗

Flow Reconstruction from Sparse Measurements in Urban Drainage Networks: An Application and Evaluation of Data-Driven Sparse Sensing

Urbanization and increasingly frequent intense storms are placing stress on urban drainage networks. While dense monitoring of urban drainage networks is desirable, practical constraints in time, budget, and technology hinder its full implementation. How to monitor and predict flow conditions across the entire network under constrained resources is a major challenge. To address this, we utilized and evaluated an established data-driven sparse sensing (DSS) workflow for sensor placement optimization and sewer flow reconstruction in a 77-node urban drainage network. A validated SWMM parameterization was used to construct a spatial basis using singular value decomposition (SVD), select rank-specific layouts using pivoted QR, and define the reconstruction decoder. Applied to 225 held-out simulations combining 25 plausible calibrated parameter sets with 9 rainfall events, a 3-node monitoring layout (4% of the network) achieved a median system-level Nash-Sutcliffe efficiency (NSE) of 0.791 and a 10th percentile of 0.719; all simulations exceeded NSE = 0.700. The pivoted QR-selected sensor sets were benchmarked against reference sensor configurations obtained from Greedy D-optimal and genetic algorithm, matching their performance without requiring iterative layout searches. We further evaluated the framework's robustness by introducing multiplicative Gaussian noise and simulating individual sensor failures, finding that performance was insensitive to noise but varied based on the location of lost monitored nodes. The reconstruction's sensitivity to monitored node loss was consistently associated with energy-weighted modal exposure with a leave-one-node-out Spearman correlation coefficient of 0.781, which was strongly correlated with the lost node's upstream drainage area, mean adjacent circular-conduit diameter, and nodal active flow fraction.

cs.AI↗

Robotic Valve Turning: Axial Misalignment Correction Using Reaction Torque Feedback

In this work, we propose a haptic update control law that uses reaction torques to correct axial misalignment during robotic valve manipulation. Unlike vision-based estimates, which can be affected by calibration errors, occlusion, and uncertainty in the contact geometry, reaction torques arise directly from the physical interaction between the gripper and valve. A geometric relationship exists between the error (misalignment) vector and these torques. The primary aim of this work is to propose a stable controller exploiting this geometric property. Our control law is proven to be uniformly asymptotically stable. Simulations are performed for verification. Furthermore, we experimentally test the robustness of our method using a Kinova Gen3 robotic arm for initial misalignments ranging from $-15^\circ$ to $15^\circ$ at 3 different valve positions and report the resulting data distribution. The absolute value of the median misalignment across all 18 test cases is found to be within $2.46^\circ$ and that of reaction torques within $0.23\mathrm{Nm}$.

cs.RO↗

Uber's Failover Architecture: Reconciling Reliability and Efficiency in Hyperscale Microservice Infrastructure

Operating a global, real-time platform at Uber's scale requires infrastructure that is both resilient and cost-efficient. Historically, reliability was ensured through a costly 2x capacity model--each service provisioned to handle global traffic independently across two regions--leaving half the fleet idle. We present Uber's Failover Architecture (UFA), which replaces the uniform 2x model with a differentiated architecture aligned to business criticality. Critical services retain failover guarantees, while non-critical services opportunistically use failover buffer capacity reserved for critical services during steady state. During rare "full-peak" failovers, non-critical services are selectively preempted and rapidly restored, with differentiated Service-Level Agreements (SLAs) using on-demand capacity. Automated safeguards, including dependency analysis and regression gates, ensure critical services continue to function even while non-critical services are unavailable. The quantitative impact is significant: UFA reduces steady-state provisioning from 2x to 1.3x, raising utilization from ~20% to ~30% while sustaining 99.97% availability. To date, UFA has hardened over 4,000 unsafe dependencies, eliminated over one million CPU cores from a baseline of about four million cores.

cs.DC↗

Jet transport coefficients associated with fermionic two-point correlators in a weakly-coupled plasma

A new set of jet-medium transport coefficients stemming from jet-medium exchanges involving Glauber quarks encoded in $\hat{\mathcal{F}}_i$ [Phys. Rev. C 111, 054913 (2025), Phys. Rev. C 113, 055207] are obtained by computing the tree-level leading-order $2\to2$ scattering rates and their moments using the approach developed in Refs. [arxiv 2608.17160, arxiv 2608.17161]. Sizeable deviations away from the leading logarithmic dependence of jet-medium transport coefficients and scattering rate are observed here, as previously mentioned in Refs.[arxiv 2608.17160, arxiv 2608.17161]. A closed-form expression for $\hat{\mathcal{F}}_i$ accurate to $\lesssim 10$\% or better is obtained, enabling our approach to be used within Monte Carlo simulations of jet-medium interactions. Monte Carlo simulations incorporating $\hat{\mathcal{F}}_i$ are sensitive to flavor hydrodynamization dynamics as the medium created in nucleus-nucleus collisions transitions from the early-time Glasma dynamics to the quark-gluon plasma fluid.

hep-ph↗

The GOTO Telescope Control System

The Gravitational-wave Optical Transient Observer (GOTO) operates a network of robotic, wide-field survey telescopes searching for optical transients to gravitational-wave signals and other astronomical events. Since 2023, the network has comprised two antipodal sites in the Canary Islands and Australia, each hosting two independent robotic mounts. The GOTO Telescope Control System (G-TeCS) is a custom Python software package that manages all operational aspects of the network; from alert processing and target scheduling to onsite hardware operations and monitoring. The central system consists of an alert monitor, observation database and scheduler, which issues targets to the four nodes. Each telescope operates using a system of independent control daemons, with a pilot master control program to coordinate nightly operations. This architecture, in development since 2015, provides a flexible and robust system that now successfully operates the fully autonomous network.

astro-ph.IM↗

Early Near-Infrared Excess and Rapid Disk-Corona Evolution in the Tidal Disruption Event 2024aepd

We present multi-wavelength observations of the tidal disruption event (TDE) 2024aepd, spanning primarily the first $\sim$300 days after discovery. A prominent near-infrared (NIR) excess is detected as early as $\sim$40 days. Its nearly flat power-law spectrum strongly deviates from the Rayleigh-Jeans tail of the UV-optical blackbody. Although a conventional dust-echo origin cannot be completely ruled out, free-free emission from a reprocessing photospheric envelope provides a more plausible explanation. The spectral break between the UV-optical and NIR components shifts to higher frequencies, while the inferred density-profile index remains nearly constant, suggesting evolving reprocessing conditions within a broadly unchanged density structure. In addition, the X-ray spectrum is initially dominated by a thermal disk component accompanied by a hard excess. From $\sim$178 days onward, the spectrum becomes power-law dominated and subsequently hardens, indicating the rapid emergence and strengthening of a hot corona. These results provide evidence for frequency-dependent reprocessing at early times and for the rapid development of a disk-corona system, placing new constraints on the structure and evolution of the reprocessing layer around supermassive black holes.

astro-ph.HE↗

Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications

Sensitivity oracles preprocess a graph so that queries can be answered after any $f$ edge insertions and deletions, without recomputing from scratch. For structural optimization problems the known landscape is limited: for flows and cuts, all known compact oracles handle only $f\le2$ failures; existing oracles for $s$- and global min-cut apply only to undirected graphs; and for matchings, arborescence and spanning-tree packings, and arboricity, no efficient oracle is known for $f>1$. We present a unified algebraic framework based on sensitivity oracles for matroid packing, covering, and parity of sparse linear matroids, yielding the first oracles supporting an arbitrary number $f$ of updates across all of these problems (all constructions randomized Monte-Carlo). Concretely, we obtain efficient oracles for exact $(s,t)$-max-flow/min-cut, resolving an open problem of Baswana, Bhanja, and Pandey (ICALP'22) with near-optimal space; for all-pairs $k$-bounded flow, generalizing the near-optimal reachability oracle of Brand and Saranurak (FOCS'19, the case $k=1$); the first oracles for any $f$ for directed $s$- and global min-cut; oracles for $k$-disjoint arborescences, $k$-disjoint spanning trees, colorful spanning trees, and arboricity; and oracles for the existence of an $α$-factor, with perfect matching as the case $α=1$. We further introduce the \emph{subset sensitivity model}, in which updates are confined to a susceptible edge set of size $σ$ fixed during preprocessing. Here we decouple updates from the matroid representation and eliminate the dependence on $k$ and the matroid density altogether: all of the above are supported with $\widetilde O(f^ω)$ query time and $O(fσ^2)$ space. We also prove a matching $Ω(\min\{σ^2,n^2\})$-bit lower bound when $f\ge2$, establishing optimality.

cs.DS↗

A MOF-reinforced self-foaming sponge for mechanically robust triboelectric membranes with improved resistance to humidity

Porous triboelectric materials offer significant potential for enhancing the performance of triboelectric nanogenerators, yet their practical application is limited by structural instability and humidity-induced performance degradation. In this work, a bio-derived, sustainable polyamide containing disulfide linkages was developed to enable spontaneous formation of a porous dielectric without external templating. Hydrophilic MOF fillers comprising HKUST-1 crystals are incorporated within the porous matrix to reinforce the membrane structure and regulate moisture effects. Mechanical characterization demonstrates that HKUST-1 suppresses pore collapse and improves structural robustness under repeated deformation, while analysis of stress-strain behaviour reveals the critical role of pore stability in achieving stable triboelectric output. In addition, HKUST-1 mitigates humidity-induced charge dissipation by confining water molecules within its framework, giving enhanced triboelectric output stability and reduced performance degradation under increasing relative humidity compared to the neat porous system. This work demonstrates a strategy that integrates self-foamed porous structures, sustainable polymer design, and functional filler reinforcement to engineer mechanically robust and environmentally stable triboelectric systems.

cond-mat.mtrl-sci↗

Machine Learning-Based Characterisation of the Non-Markovian Dynamics of a Nitrogen-Vacancy Centre

The interaction between a quantum system and its environment can be characterized by the spectral density function: knowing its structure is important for optimizing applications of quantum technologies such as quantum sensing protocols. In this work, we present the first experimental demonstration of a machine learning-based reconstruction of reaction-coordinate spectral density parameters from NV centre Rabi dynamics. Unlike the previous work, we recover all spectral density parameters rather than only the central frequency, and benchmark the performance of the neural network against the Cramér-Rao bound and maximum likelihood estimator. Our results demonstrate that the model predicted by the neural network can reliably reproduce the NV dynamics over the estimation window, and can produce estimates for some parameters with variances comparable to that of maximum likelihood.

quant-ph↗

Stress-Testing the Robustness of LLM-Based Causal Inference

Why do some of the world's most powerful Artificial Intelligence (AI) systems still struggle to reason about cause and effect? Causal discovery, the ability to discern the underlying drivers of a system, is fundamental to scientific inquiry and has traditionally relied on structured data and statistical methods. Recently, Large Language Models (LLMs) have been explored as an alternative paradigm for causal inference, leveraging their broad knowledge and reasoning capabilities. Yet, despite their linguistic fluency, LLMs often rely on surface-level pattern recognition rather than genuine causal logic. While it is known that LLMs stumble in this domain, we lack a precise map of where, why, and how significantly these failures occur. In this paper, we propose a systematic stress-test framework across six critical dimensions: model scale, causal graph complexity, prompting strategy, metadata quality, data quality, and sensitivity to uncertainty. Our findings reveal a significant "optimism bias" in LLMs; models consistently overestimate causal links, leading to low precision across the board. Furthermore, we demonstrate that traditional evaluation metrics can be deceptive: while reasoning-heavy models lead in performance, the highest scores often occur when uncertainty in inference is overlooked. Once uncertainty is integrated into the evaluation, performance drops, providing a more honest reflection of causal reliability. We also find that, while scaling model size improves outcomes, these gains are fragile; performance degrades sharply as the quality of metadata decreases. This work serves as a practical guide to the blind spots of LLMs, offering a clear-eyed assessment of when these tools can be integrated into a causal discovery pipeline and when they are likely to lead researchers astray.

cs.LG↗

From Causal Plausibility to Causal Reliability: Evaluating LLMs as Calibrated Direct Causal-Edge Classifiers

Large language models (LLMs) are increasingly used to provide prior causal knowledge for structural causal discovery, yet whether their direct-edge judgments and confidence can be trusted remains unclear. We systematically evaluate 12 instruction-tuned open-weight models across six benchmark causal graphs, five prompting strategies, and four confidence sources: verbalized, logit-based, cross-prompt agreement, and cross-model agreement. Under our language-only pairwise protocol, our evaluation yields three key findings. (i) LLM-based causal judgments are strongly recall-dominant: models predict overly dense graphs with many false-positive edges, while prompting mainly shifts the precision-recall trade-off rather than resolving overprediction. Gains from model scale diminish on the largest graphs and do not eliminate miscalibration. (ii) LLMs often capture causal relatedness without reliably identifying directness or orientation. Relative to published reference graphs, models misclassify 40.0% of indirect and 36.0% of reversed non-edges as direct edges, versus 28.2% of other non-edges. Moreover, 80.8% and 84.6% of these false positives receive verbalized confidence of at least 80%, revealing substantial overconfidence in structurally incorrect predictions. (iii) Conventional confidence estimates are unreliable, whereas agreement offers a more promising signal. Logit-based confidence frequently collapses near 1.0 regardless of correctness, while cross-prompt and cross-model agreement achieve better mean calibration and discrimination, though their advantages are not statistically significant after Holm correction. A benchmark-familiarity audit further identifies potential familiarity in five model-dataset pairs, all involving AsiaM. Overall, our results suggest LLMs are better viewed as sources of externally validated soft causal priors than as direct evidence of causal structure.

cs.LG↗

Quantum Destabilization of Skyrmions in Centrosymmetric Frustrated Magnets

We investigate the role of the spin quantum number $s$ on the stability of skyrmions in a $J_1-J_2-J_3$ centrosymmetric quantum Heisenberg model on a square lattice using the neural network quantum states method. Our results reveal that the skyrmion stability $Q$ is severely degraded when transitioning from the semiclassical regime to the extreme quantum limit ($s=1/2$), where it ultimately vanishes. We demonstrate that this destabilization is driven by quantum longitudinal fluctuations, with $Q$ exhibiting a power-law decay as a function of the reciprocal spin moment $1/s$. Notably, the extreme quantum limit ($s=1/2$) deviates drastically from this scaling behavior, exhibiting distinct physics compared to larger spin moments. Furthermore, we reveal the microscopic origin of this decay by establishing a quantitative correspondence between skyrmion stability, entanglement, and local spin magnitude: as the local second Rényi entropy (an indicator of entanglement) increases and the local spin magnitude is suppressed, the skyrmion stability vanishes linearly. This regime marks a quantum state where the skyrmion number $C$ remains as remanent geometric feature of the spin orientations, yet the skyrmion stability $Q$ vanishes due to the longitudinal suppression of the local spin magnitude. Our findings suggest that classically robust skyrmion phases in frustrated lattices are fundamentally restricted to high-spin materials, indicating that a spin moment must of at least $s = 3/2$ is required for the realization of stable, atomic-scale topological textures.

cond-mat.str-el↗

Relaxation approach to quantum-mechanical modeling of ferroelectric and antiferroelectric phase transitions

Ferroelectrics and antiferroelectrics are the electric counterparts of ferromagnets and antiferromagnets. These materials undergo temperature- and electric-fieldinduced phase transitions that give rise to their characteristic hysteresis loops. Modeling such hysteresis loops and associated phase transitions enables both a deeper fundamental understanding and reliable property predictions for this important class of materials. To date, modeling has largely relied on classical approaches, often remaining qualitative and/or empirical. Traditional interpretation of these transitions rests on two assumptions: (i) they are activated Arrhenius-type processes and (ii) they occur well within the classical regime. Here, we demonstrate that a model can instead be built on two \orthogonal" assumptions: (i) the phase transitions are relaxational processes and (ii) they require a quantum mechanical treatment. Applying this model to both antiferroelectrics and ferroelectrics overcomes the limitations of traditional models and enables efficient first-principles simulations of phase transitions. The success of our unconventional approach highlights the significance of quantum mechanics in transitions long regarded as purely classical. We anticipate that this framework will be applicable to a broad range of phase transitions, including magnetic, elastic, multiferroic, and electronic, along with modeling of quantum tunneling, rates of chemical reactions, and others.

cond-mat.mtrl-sci↗

Failed jet breakout in the metal-poor broad-lined type Ic supernova 2026gzf

A long-standing question in the death of massive stars is the role of relativistic jets. While many gamma-ray bursts and some fast X-ray transients seem to be associated with broad-lined type Ic supernovae, the opposite is not true. The lack of observable jet emission in those Ic-BL SNe can be explained by invoking off-axis jets, choked jets that inject all their energy into the stellar envelope, baryon-loaded jets for which the prompt high-energy emission is strongly suppressed, or non-jetted SNe. The lack of exact explosion time in the majority of SNe presents an obstacle to distinguish between these scenarios. Here we report the properties of SN 2026gzf associated with the X-ray thermal Einstein Probe shock-breakout EP260321a at z=0.0343. The absence of compelling shocked cocoon and radio emission up to 54 days, combined with initial expansion velocities of ~30,000 km/s and a circumstellar shell of ~0.07 M$_\odot$, favour a scenario for SN 2026gzf in which a jet was choked in the circumstellar shell. Our high-spatial resolution images of the SN environment show that the progenitor was located between two highly star-forming regions with a metallicity lower than any previously known Ic-BL SN. As the first case of a Ic-BL SN associated with high-energy prompt emission without the signature of a jet, SN 2026gzf provides a unique perspective to understand the successful launch of relativistic jets during the deaths of massive stars.

astro-ph.HE↗