Research works

AI failures in the eyes of the downstream developer: a first look at concerns, practices, and challenges

Abstract With the advancement of AI models, more software systems are adopting AI as a component to facilitate automation. Pre-trained models (PTMs) have become a cornerstone of AI-based software, allowing for rapid integration and development with lower training cost. However, t...

Time-dependent queue length distribution in queues fed by K customers in a finite interval

Abstract We consider queueing models, where customers arrive according to a continuous-time binomial process on a finite interval. In this arrival process, a total of K customers arrive in the finite time interval [0, T ], where arrival times of those K customers are independent...

Numerical study on instability of rock structural planes induced by stress disturbances

<title>Abstract</title> The activities in deep underground engineering may induce variations in the stress state of the rock, increasing the risk of engineering disasters. The decrease in normal stress <italic>σ</italic>_n and the increase in shear stress <italic>τ</ita...

Influencing factors of fertilization failure during in vitro fertilization

<title>Abstract</title> <bold>Objective:</bold> To explore the influencing factors of fertilization failure (FF) during in vitro fertilization (IVF) to prevent and manage it in clinical practice and improve treatment efficiency. <bold>Methods: </bold>IVF cycles were included and...

Saturated Partial Embeddings of Planar Graphs

ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph , we say that a plane subgraph is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to would either violate planarity or make t...

Even better sums of squares over quintic and cyclotomic fields

Abstract We classify all totally real number fields of degree at most 5 that admit a universal quadratic form with rational integer coefficients; in fact, there are none over the previously unsolved cases of quartic and quintic fields. This fully settles the lifting problem for u...

The Alon-Tarsi number of $K_{3,3}$-minor-free graphs

The well known Wagner's theorem states that a graph is a planar graph if and only if it is $K_5$-minor-free and $K_{3,3}$-minor-free. Denote by $AT(G)$ the Alon-Tarsi number of a graph $G$. We show that for any $K_{3,3}$-minor-free graph $G$, $AT(G)\le 5$, there exists a matching...

Association of communication competence and nursing professionalism with burnout among nurses working at coronavirus residential treatment centers

Abstract Background : Owing to the increasing number of cases of the coronavirus disease, treatment facilities and nursing services were diversifying, necessitating appropriate hiring and operating guidelines. The purpose of this study was to identify the association of communica...

Preregistration of the Lateral-Difference Identity Trial II: a full-text comparison against seven prior articulations

Conditions fixed in advance for a second identity trial on the lateral difference. The first trial (10.5281/zenodo.21827989) is closed and every verdict it returned stands; this trial exists because its instrument carried two defects its own closure note prints. The candidate as...

Integer Circulant Determinants of Order 28

This preprint gives a complete effective classification of the determinants of 28 by 28 circulant matrices with integer entries. Writing |D| = 2^a 7^b m with gcd(m,14)=1, it proves the exact local floors, identifies (a,b)=(5,0) and (0,2) as the only exceptional faces, and proves...

CAA-X V3: Intention is All You Need — A Manifesto for Goal-Driven AI

This repository contains V3 of the CAA-X (Cognitive Atom Architecture eXtension) research program, subtitled "Intention is All You Need: A Manifesto for Goal-Driven AI." V3 marks a deliberate paradigm shift from the engineering-focused V0–V2 trilogy toward a foundational critique...

The Theory of Data: An Introduction — Analytical Meaning, Lawful Transformation, and Governed Results

The Theory of Data: An Introduction presents an accessible introduction to the Theory of Data for analysts, data engineers, analytics engineers, semantic-layer developers, and AI engineers. The Theory begins from a distinction that analytical systems often leave implicit: produci...

Preregistration of the Lateral-Difference Identity Trial

Conditions fixed in advance for an identity trial on a determination of the corpus's own working doctrine. The candidate distinguishes this own obtaining from another own obtaining within the same who-region where both obtain the same repeatable manner. It is compared against thr...

Artian Inertial Mass Operator and Three-Readout Spectral Equivalence Theorem

When does the coefficient in Newton's second law become a finite spectrum rather than an inserted input? The paper constructs a positive finite source operator from funded completed-event classes. For a finite region \(\mathcal R\), \[ \widehat B_{\mathcal R} = \sum_{p\in\mathfra...

The Exact Perimeter of Semantic Energy: What I(Y;Z) Does and Does Not License — A Scoped Property Inventory for E_sem — Dissipation, Conservation, No-Cloning, the Failure of Extensivity, and the Estimation Tax

The MOBIUS corpus defines semantic energy as E_sem := I(Y;Z), the Shannon mutual information between a semantic source Y and an interpreting internal representation Z. The reverse-derived cosmology (MRDC) identified this as the *only* quantity surviving unchanged from the prior c...

Termination by Novelty: A Machine-Checked Theory of Anti-Regress Guards for Reflective Governance Processes — Why Step-Local Change Guards Cannot Stop Regress, and What Can

Reflective processes — governance loops, self-review cycles, self-evolving software pipelines — face a canonical failure mode: infinite regress, the accumulation of meta-deliberation without state update. The MOBIUS anti-regress architecture (the "M guard") answers this operation...

Sequential, Never Layered: A Formal Theory of Governance Overlay Collapse — Why Stacked Overlays Interfere, When Stacking Turns Harmful, and the Capacity Law of the Overlay Portfolio

Inference-time governance of language-model systems is built from *overlays*: system-prompt policies, metacognitive check organs, safety checklists, routing disciplines. Each overlay, alone, can improve output quality. The natural engineering move — stack every beneficial overlay...

Why Reflection Should Be Shallow: Contractive Gains, Finite Optimal Depth, and the Rumination Regime — A Cost–Benefit Theory of Iterated Self-Revision, with a Capacity-Gated Crossover

How many times should a system re-read and revise its own answer? Empirical work in the MOBIUS measurement campaign found a consistent answer across thirteen open-weight model capacities: once or twice — never zero above a capacity threshold, never many, and *less than zero* belo...

What Two Gates Buy You: Selective-Risk Guarantees and the Non-Identifiability of Abstention Cascades — Product Laws, Error Diversity, and Why Unlabeled Logs Can Certify Coverage but Never Risk

Production retrieval-augmented systems increasingly abstain through *cascades* of heterogeneous gates — a cheap mechanical check before the model call, a content-aware rule inside it. What does the second gate actually buy, when does gate ordering matter, and what can be certifie...

The Crossover Theorem: Existence, Uniqueness, and the Impossibility of Axis-Blind Governance Gates — Benefit–Burden Monotonicity, Single-Crossing as a Falsifiable Signature, and a Corrected Folk Claim About Dose Ordering

The July 2026 MOBIUS measurement campaign reported an operational law for inference-time governance: the same governance prompt that damages a small language model improves a large one, with the sign of the effect flipping at roughly 4B parameters on the content axis — and flippi...