7,594+ open-access research outputs.
Intent-based networking promises to revolutionize telecommunications network management by enabling operators to specify high-level goals rather than low-level configurations. The TM Forum Intent Onto…
Topological entanglement entropy (TEE) is a key diagnostic of long-range entanglement in two-dimensional gapped phases of matter, but it can suffer from spurious contributions that overestimate the to…
This paper investigates the distribution of integral points on projective varieties via two distinct methods: the Ru-Vojta theorem and our higher-dimensional generalization of the Huang-Levin-Xiao ine…
We investigate the quantum nature of naked curvature singularities in Einstein-Yang-Mills (EYM) theory using the Horowitz-Marolf (HM) criterion, which assesses quantum singularities via the evolution …
The arrival of large language models (LLMs) capable of multi-step reasoning, tool use, and long-horizon planning has produced a qualitative shift in software engineering. Where earlier code-completion…
We shall introduce a stability condition for a coherent sheaf associated to an elliptic surface. Then we study the behavior under relative Fourier-Mukai transforms.…
We present a framework for non-Abelian p-loop, fracton, and planon condensation in 3+1 dimensions by constructing extended cage-net fracton models using decoupled layers of the Hu-Geer-Wu (HGW) string…
We propose MatchRDMA, a proactive, segmented, and rate-matched long-haul RDMA scheme for geo-distributed LLM training over OTN. By coordinating source and destination OTN rates, it improves inter-DC t…
The Conway-99 problem questions the existence of a strongly regular graph with 99 vertices and specific parameters. A \textit{strongly} regular graph is a regular graph that exhibits two additional pr…
Physical video understanding requires more than naming an event correctly. A model can answer a question about pouring, sliding, or collision from textual regularities while still failing to localize …
This paper presents a hybrid architecture for intelligent systems in which large language models (LLMs) are extended with an external ontological memory layer. Instead of relying solely on parametric …
As schema languages for RDF data become more mature, we are seeing efforts to extend them with recursive semantics, applying diverse ideas from logic programming and description logics. While ShEx has…
Continuous Integration and Deployment (CI/CD) workflows are central to modern software delivery, yet the reliability of agentic AI bots operating within these workflows remain underexplored. Using pul…
The choice of visualisation in empirical performance analysis is not a neutral presentation decision but an analytical one: different graphical forms reveal different features of the same dataset, and…
We determine the mod $p$ reductions of the semi-stable representations $V_{k, \mathcal{L}}$ of weight $k \in [p + 5, 2p]\cup[2p + 6, 3p + 1]$ and $v_p(\mathcal{L}) < 1-k/2$ for primes $p \geq 5$. In p…
In this paper, a new method for investigating Dirichlet's divisor problem is developed. For this purpose, integer points under the graph of a hyperbola are studied. Since many investigations in this d…
Let $\mathbb{F}_{q}$ be a finite field, and $A:=\mathbb{F}_{q}[T]$. In this article, we give explicit criteria, involving concrete valuations, on the coefficients of the Drinfeld $A$-modules of rank $…
Sub-Terahertz radio-stripe and distributed MIMO architectures promise extreme spatial reuse and multi-GHz bandwidths, but the cascaded fiber front-haul and RF hardware impairments strongly shape end-t…
The study of the combinatorics of the modular group and of Coxeter's friezes naturally leads to the investigation of a matrix equation, sometimes referred to as the Conway-Coxeter equation. The soluti…
Alan Turing is considered as a founder of current computer science together with Kurt Godel, Alonzo Church and John von Neumann. In this paper multiple new research results are presented. It is demons…
Free open-access publishing with Google Scholar indexing.
Submission Guide →