arXiv subjects

Raj Patel

Publications and source records attributed to Raj Patel.

17 recordsLinked to original sources

arXiv2026

Agentra: A Supervisable Multi-Agent Framework for Enterprise Intrusion Response

Enterprise intrusion response still depends on static playbooks and analyst-driven triage, creating delay between alert generation and containment. We present Agentra, a supervisable multi-agent Intrusion Response System (IRS) framework that converts alerts from IDS, EDR, and XDR platforms into structured incident response plans grounded in MITRE ATT&CK, MITRE D3FEND, and NIST CSF 2.0. Agentra decomposes response reasoning across role-scoped agents, validates proposed plans through a bounded Planner--Validator review loop, screens retrieved threat intelligence through a Moderator security gateway, gates actions through an Action Catalog and risk score, and records decisions in an append-only audit log. We evaluate Agentra against a static OASIS CACAO v2.0 cyber-playbook baseline on a 120-event corpus drawn from ThreatHunter-Playbook, Splunk BOTSv3, and DARPA OpTC. The strongest configuration improves FP-aware IRS F1 from 0.61 to 0.84 and restores the projected harmful-action rate to the static baseline level of 0.0% after Planner-only configurations introduce unsafe overreaction. These results indicate that multi-agent response planning can improve ontology-grounded IRS coverage while preserving analyst approval and auditability.

cs.CR↗

arXiv2026

The Value of Spike Timing: A Leakage-Resistant Benchmark of SNN Design Choices for Network Intrusion Detection

Spiking neural networks (SNNs) are increasingly studied for network intrusion detection, but comparative evidence on how neuron models and spike encodings affect performance remains limited. Evaluation choices can influence results when preprocessing, capture structure, or scenario information crosses the train--test boundary. We evaluate nine snnTorch neuron families with three spike encodings, yielding 27 SNN configurations across four intrusion-detection benchmarks. We screen the design space and then repeat the evaluation using train-only transforms, seed-independent partitions, and capture- or scenario-aware separation. In our study, LeakyParallel/latency ranked first in both 27-configuration evaluations. The leading configurations identified during screening also remained largely consistent under confirmation, indicating that screening preserved the ordering useful for design selection even when the measured performance changed under the stricter protocol. We then examine what latency coding contributes by holding the active spike set fixed and changing only its temporal organization. At the main T=25 operating point, mapping feature magnitude to spike time improved macro-F1 on all five confirmation protocols, while spreading the same spikes through time without that mapping could either improve or reduce performance. This shows that the effect of latency coding comes from both the information carried by spike time and how those spikes interact with the temporal dynamics of the network. Finally, sparse input encoding does not directly translate into sparse internal activity, although latency coding requires fewer fanout-weighted operations than rate coding in the evaluated models. Overall, the results show that SNN design choice, evaluation protocol, spike-timing representation, and computational activity should be examined separately when applying SNNs to static network-flow data.

cs.CR↗

arXiv2026

AgenticCyOps: Securing Multi-Agentic AI Integration in Enterprise Cyber Operations

Multi-agent systems (MAS) powered by LLMs promise adaptive, reasoning-driven enterprise workflows, yet granting agents autonomous control over tools, memory, and communication introduces attack surfaces absent from deterministic pipelines. While current research largely addresses prompt-level exploits and narrow individual vectors, it lacks a holistic architectural model for enterprise-grade security. We introduce AgenticCyOps (Securing Multi-Agentic AI Integration in Enterprise Cyber Operations), a framework built on a systematic decomposition of attack surfaces across component, coordination, and protocol layers, revealing that documented vectors consistently trace back to two integration surfaces: tool orchestration and memory management. Building on this observation, we formalize these integration surfaces as primary trust boundaries and define five defensive principles: authorized interfaces, capability scoping, verified execution, memory integrity & synchronization, and access-controlled data isolation; each aligned with established compliance standards (NIST, ISO 27001, GDPR, EU AI Act). We apply the framework to a Security Operations Center (SOC) workflow, adopting the Model Context Protocol (MCP) as the structural basis, with phase-scoped agents, consensus validation loops, and per-organization memory boundaries. Coverage analysis, attack path tracing, and trust boundary assessment confirm that the design addresses the documented attack vectors with defense-in-depth, intercepts three of four representative attack chains within the first two steps, and reduces exploitable trust boundaries by a minimum of 72% compared to a flat MAS, positioning AgenticCyOps as a foundation for securing enterprise-grade integration.

cs.CR↗

arXiv2025

IRSDA: An Agent-Orchestrated Framework for Enterprise Intrusion Response

Modern enterprise systems face escalating cyber threats that are increasingly dynamic, distributed, and multi-stage in nature. Traditional intrusion detection and response systems often rely on static rules and manual workflows, which limit their ability to respond with the speed and precision required in high-stakes environments. To address these challenges, we present the Intrusion Response System Digital Assistant (IRSDA), an agent-based framework designed to deliver autonomous and policy-compliant cyber defense. IRSDA combines Self-Adaptive Autonomic Computing Systems (SA-ACS) with the Knowledge guided Monitor, Analyze, Plan, and Execute (MAPE-K) loop to support real-time, partition-aware decision-making across enterprise infrastructure. IRSDA incorporates a knowledge-driven architecture that integrates contextual information with AI-based reasoning to support system-guided intrusion response. The framework leverages retrieval mechanisms and structured representations to inform decision-making while maintaining alignment with operational policies. We assess the system using a representative real-world microservices application, demonstrating its ability to automate containment, enforce compliance, and provide traceable outputs for security analyst interpretation. This work outlines a modular and agent-driven approach to cyber defense that emphasizes explainability, system-state awareness, and operational control in intrusion response.

cs.CR↗

arXiv2025

SafePassage: High-Fidelity Information Extraction with Black Box LLMs

Black box large language models (LLMs) make information extraction (IE) easy to configure, but hard to trust. Unlike traditional information extraction pipelines, the information "extracted" is not guaranteed to be grounded in the document. To prevent this, this paper introduces the notion of a "safe passage": context generated by the LLM that is both grounded in the document and consistent with the extracted information. This is operationalized via a three-step pipeline, SafePassage, which consists of: (1) an LLM extractor that generates structured entities and their contexts from a document, (2) a string-based global aligner, and (3) a scoring model. Results show that using these three parts in conjunction reduces hallucinations by up to 85% on information extraction tasks with minimal risk of flagging non-hallucinations. High agreement between the SafePassage pipeline and human judgments of extraction quality mean that the pipeline can be dually used to evaluate LLMs. Surprisingly, results also show that using a transformer encoder fine-tuned on a small number of task-specific examples can outperform an LLM scoring model at flagging unsafe passages. These annotations can be collected in as little as 1-2 hours.

cs.CL↗

arXiv2025

LLMZ+: Contextual Prompt Whitelist Principles for Agentic LLMs

Compared to traditional models, agentic AI represents a highly valuable target for potential attackers as they possess privileged access to data sources and API tools, which are traditionally not incorporated into classical agents. Unlike a typical software application residing in a Demilitarized Zone (DMZ), agentic LLMs consciously rely on nondeterministic behavior of the AI (only defining a final goal, leaving the path selection to LLM). This characteristic introduces substantial security risk to both operational security and information security. Most common existing defense mechanism rely on detection of malicious intent and preventing it from reaching the LLM agent, thus protecting against jailbreak attacks such as prompt injection. In this paper, we present an alternative approach, LLMZ+, which moves beyond traditional detection-based approaches by implementing prompt whitelisting. Through this method, only contextually appropriate and safe messages are permitted to interact with the agentic LLM. By leveraging the specificity of context, LLMZ+ guarantees that all exchanges between external users and the LLM conform to predefined use cases and operational boundaries. Our approach streamlines the security framework, enhances its long-term resilience, and reduces the resources required for sustaining LLM information security. Our empirical evaluation demonstrates that LLMZ+ provides strong resilience against the most common jailbreak prompts. At the same time, legitimate business communications are not disrupted, and authorized traffic flows seamlessly between users and the agentic LLM. We measure the effectiveness of approach using false positive and false negative rates, both of which can be reduced to 0 in our experimental setting.

cs.AI↗

arXiv2025

A Survey of Recent Advancements in Secure Peer-to-Peer Networks

Peer-to-peer (P2P) networks are a cornerstone of modern computing, and their security is an active area of research. Many defenses with strong security guarantees have been proposed; however, the most-recent survey is over a decade old. This paper delivers an updated review of recent theoretical advances that address classic threats, such as the Sybil and routing attacks, while highlighting how emerging trends -- such as machine learning, social networks, and dynamic systems -- pose new challenges and drive novel solutions. We evaluate the strengths and weaknesses of these solutions and suggest directions for future research.

cs.DC↗

arXiv2025

Towards Secure MLOps: Surveying Attacks, Mitigation Strategies, and Research Challenges

The rapid adoption of machine learning (ML) technologies has driven organizations across diverse sectors to seek efficient and reliable methods to accelerate model development-to-deployment. Machine Learning Operations (MLOps) has emerged as an integrative approach addressing these requirements by unifying relevant roles and streamlining ML workflows. As the MLOps market continues to grow, securing these pipelines has become increasingly critical. However, the unified nature of MLOps ecosystem introduces vulnerabilities, making them susceptible to adversarial attacks where a single misconfiguration can lead to compromised credentials, severe financial losses, damaged public trust, and the poisoning of training data. Our paper presents a systematic application of the MITRE ATLAS (Adversarial Threat Landscape for Artificial-Intelligence Systems) framework, supplemented by reviews of white and grey literature, to systematically assess attacks across different phases of the MLOps ecosystem. We begin by reviewing prior work in this domain, then present our taxonomy and introduce a threat model that captures attackers with different knowledge and capabilities. We then present a structured taxonomy of attack techniques explicitly mapped to corresponding phases of the MLOps ecosystem, supported by examples drawn from red-teaming exercises and real-world incidents. This is followed by a taxonomy of mitigation strategies aligned with these attack categories, offering actionable early-stage defenses to strengthen the security of MLOps ecosystem. Given the gradual evolution and adoption of MLOps, we further highlight key research gaps that require immediate attention. Our work emphasizes the importance of implementing robust security protocols from the outset, empowering practitioners to safeguard MLOps ecosystem against evolving cyber attacks.

cs.CR↗

arXiv2025

Navigating MLOps: Insights into Maturity, Lifecycle, Tools, and Careers

The adoption of Machine Learning Operations (MLOps) enables automation and reliable model deployments across industries. However, differing MLOps lifecycle frameworks and maturity models proposed by industry, academia, and organizations have led to confusion regarding standard adoption practices. This paper introduces a unified MLOps lifecycle framework, further incorporating Large Language Model Operations (LLMOps), to address this gap. Additionally, we outlines key roles, tools, and costs associated with MLOps adoption at various maturity levels. By providing a standardized framework, we aim to help organizations clearly define and allocate the resources needed to implement MLOps effectively.

cs.SE↗

arXiv2024

Finance-Informed Neural Network: Learning the Geometry of Option Pricing

We propose a Finance-Informed Neural Network (FINN) for option pricing and hedging that integrates financial theory directly into machine learning. Instead of training on observed option prices, FINN is learned through a self-supervised replication objective based on dynamic hedging, ensuring economic consistency by construction. We show theoretically that minimizing replication error recovers the arbitrage-free pricing operator and yields economically meaningful sensitivities. Empirically, FINN accurately recovers classical Black--Scholes prices and performs robustly in stochastic volatility environments, including the Heston model, while remaining stable in settings where analytical solutions are unavailable or unreliable. Fundamental pricing relationships such as put--call parity emerge endogenously. When applied to implied-volatility surface reconstruction, FINN produces surfaces that are consistently closer to observed market-implied volatilities than those obtained from Heston calibrations, indicating superior out-of-sample adaptability and reduced structural bias. Importantly, FINN extends beyond liquid option markets: it can be trained directly on historical spot prices to construct coherent option prices and Greeks for assets with no listed options. More broadly, FINN defines a new paradigm for financial pricing, in which prices are learned from replication and risk-control principles rather than inferred from parametric assumptions or direct supervision on option prices. By reframing option pricing as the learning of a pricing operator rather than the fitting of prices, FINN offers practitioners a practical and scalable tool for pricing, hedging, and risk management across both established and emerging financial markets.

cs.LG↗

arXiv2024

The Nearly Universal Disk Galaxy Rotation Curve

The Universal Rotation Curve (URC) of disk galaxies was originally proposed to predict the shape and amplitude of any rotation curve (RC) based solely on photometric data. Here, the URC is investigated with an extensive set of spatially-resolved rotation curves drawn from the PROBES-I, PROBES-II, and MaNGA data bases with matching multi-band surface brightness profiles from the DESI-LIS and WISE surveys for 3,846 disk galaxies. Common URC formulations fail to achieve an adequate level of accuracy to qualify as truly universal over fully sampled RCs. We develop neural network (NN) equivalents for the proposed URCs which predict RCs with higher accuracy, showing that URC inaccuracies are not due to insufficient data but rather non-optimal formulations or sampling effects. This conclusion remains even if the total RC sample is pruned for symmetry. The latest URC prescriptions and their NN equivalents trained on our sub-sample of 579 disk galaxies with symmetric RCs perform similarly to the URC/NN trained on the complete data sample. We conclude that a URC with an acceptable level of accuracy ($\Delta V_{\rm circ} \lesssim15$ per cent) at all radii would require a detailed modelling of a galaxy's central regions and outskirts (e.g., for baryonic effects leading to contraction or expansion of any dark-matter-only halo).

astro-ph.GA↗

arXiv2024

The dark balance: quantifying the inner halo response to active galactic nuclei feedback in galaxies

This paper presents a study of the impact of supermassive black hole (SMBH) feedback on dark matter (DM) halos in numerical NIHAO simulations of galaxies. In particular, the amount of DM displaced via active galactic nuclei (AGN) feedback and the physical scale over which AGN feedback affects the DM halo are quantified by comparing NIHAO simulations with and without AGN feedback. NIHAO galaxies with $\log(M_*/M_{\rm \odot})\geq 10.0$ show a growing central DM suppression of 0.2 dex (~40%) from z = 1.5 to the present relative to noAGN feedback simulations. The growth of the DM suppression is related to the mass evolution of the SMBH and the gas mass in the central regions. For the most massive NIHAO galaxies with $\log(M_*/M_{\rm \odot}) > 10.5$, partially affected by numerical resolution, the central DM suppression peaks at z = 0.5, after which halo contraction overpowers AGN feedback due a shortage of gas and, thus, SMBH growth. The spatial scale, or ``sphere of influence,'' over which AGN feedback affects the DM distribution decreases as a function of time for MW-mass galaxies (from ~16 kpc at z = 1.5 to ~7.8 kpc at z = 0) as a result of halo contraction due to stellar growth. For the most massive NIHAO galaxies, the size of the sphere of influence remains constant (~16 kpc) for z > 0.5 owing to the balance between AGN feedback and halo contraction.

astro-ph.GA↗

arXiv2023

Ultra-low radioactivity flexible printed cables

Flexible printed cables and circuitry based on copper-polyimide materials are widely used in experiments looking for rare events due to their unique electrical and mechanical characteristics. However, past studies have found copper-polyimide flexible cables to contain 400-4700 pg $^{238}$U/g, 16-3700 pg $^{232}$Th/g, and 170-2100 ng $^{nat}$K/g, which can be a significant source of radioactive background for many current and next-generation ultralow background detectors. This study presents a comprehensive investigation into the fabrication process of copper-polyimide flexible cables and the development of custom low radioactivity cables for use in rare-event physics applications. A methodical step-by-step approach was developed and informed by ultrasensitive assay to determine the radiopurity in the starting materials and identify the contaminating production steps in the cable fabrication process. Radiopure material alternatives were identified, and cleaner production processes and treatments were developed to significantly reduce the imparted contamination. Through the newly developed radiopure fabrication process, fully-functioning cables were produced with radiocontaminant concentrations of 20-31 pg $^{238}$U/g, 12-13 pg $^{232}$Th/g, and 40-550 ng $^{nat}$K/g, which is significantly cleaner than cables from previous work and sufficiently radiopure for current and next-generation detectors. This approach, employing witness samples to investigate each step of the fabrication process, can hopefully serve as a template for investigating radiocontaminants in other material production processes.

physics.ins-det↗

arXiv2022

FOON Creation and Traversal for Recipe Generation

Task competition by robots is still off from being completely dependable and usable. One way a robot may decipher information given to it and accomplish tasks is by utilizing FOON, which stands for functional object-oriented network. The network first needs to be created by having a human creates action nodes as well as input and output nodes in a .txt file. After the network is sizeable, utilization of this network allows for traversal of the network in a variety of ways such as choosing steps via iterative deepening searching by using the first seen valid option. Another mechanism is heuristics, such as choosing steps based on the highest success rate or lowest amount of input ingredients. Via any of these methods, a program can traverse the network given an output product, and derive the series of steps that need to be taken to produce the output.

cs.RO↗

arXiv2022

Quantum-Inspired Tensor Neural Networks for Partial Differential Equations

Partial Differential Equations (PDEs) are used to model a variety of dynamical systems in science and engineering. Recent advances in deep learning have enabled us to solve them in a higher dimension by addressing the curse of dimensionality in new ways. However, deep learning methods are constrained by training time and memory. To tackle these shortcomings, we implement Tensor Neural Networks (TNN), a quantum-inspired neural network architecture that leverages Tensor Network ideas to improve upon deep learning approaches. We demonstrate that TNN provide significant parameter savings while attaining the same accuracy as compared to the classical Dense Neural Network (DNN). In addition, we also show how TNN can be trained faster than DNN for the same accuracy. We benchmark TNN by applying them to solve parabolic PDEs, specifically the Black-Scholes-Barenblatt equation, widely used in financial pricing theory, empirically showing the advantages of TNN over DNN. Further examples, such as the Hamilton-Jacobi-Bellman equation, are also discussed.

cs.LG↗

arXiv2019

Estimator Vectors: OOV Word Embeddings based on Subword and Context Clue Estimates

Semantic representations of words have been successfully extracted from unlabeled corpuses using neural network models like word2vec. These representations are generally high quality and are computationally inexpensive to train, making them popular. However, these approaches generally fail to approximate out of vocabulary (OOV) words, a task humans can do quite easily, using word roots and context clues. This paper proposes a neural network model that learns high quality word representations, subword representations, and context clue representations jointly. Learning all three types of representations together enhances the learning of each, leading to enriched word vectors, along with strong estimates for OOV words, via the combination of the corresponding context clue and subword embeddings. Our model, called Estimator Vectors (EV), learns strong word embeddings and is competitive with state of the art methods for OOV estimation.

cs.CL↗

arXiv2016

Nanoscale electromechanics to measure thermal conductivity, expansion and interfacial losses

We study the effect of localized Joule heating on the mechanical properties of doubly clamped nanowires under tensile stress. Local heating results in systematic variation of the resonant frequency; these frequency changes result from thermal stresses that depend on temperature dependent thermal conductivity and expansion coefficient. The change in sign of the linear expansion coefficient of InAs is reflected in the resonant response of the system near a bath temperature of 20 K. Using finite element simulations to model the experimentally observed frequency shifts, we show that the thermal conductivity of a nanowire can be approximated in the 10-60 K temperature range by the empirical form $κ=b$T W/mK, where the value of $b$ for a nanowire was found to be $b=0.035$ W/mK$^2$, significantly lower than bulk values. Also, local heating allows us to independently vary the temperature of the nanowire relative to the clamping points pinned to the bath temperature. We suggest a loss mechanism (dissipation $\sim10^{-4}-10^{-5}$) originating from the interfacial clamping losses between the metal and the semiconductor nanostructure.

cond-mat.mes-hall↗