Computer Science and Mathematics

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Deep Bhattacharjee

Abstract: A language in \(\mathrm{ENP}\) needs \(c(\delta)N\sqrt{\log N}\) wires in circuits, unambiguous circuits and integer tensor networks over gates of fan-in \(N^{1-\delta}\), and a language in \(\mathsf{S_2E}\) needs \(2^{N-N^{1-\delta}}/16\); the P versus NP problem remains open.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Frank Vega

Abstract: Minimum Vertex Cover has a classical linear-time ratio of 2, and under the Unique Games Conjecture no polynomial-time algorithm achieves a fixed ratio below 2 unless \(\mathrm{P}=\mathrm{NP}\). We present version 0.1.6 of Salvador, a linear-time ensemble of seventeen strategies, numbered in the order in which they are computed: twelve base strategies (component amplification before a maximal matching, the maximal matching itself, degree and weight heuristics, reductions to auxiliary problems that are solved exactly, a decomposition into bipartite layers, a weighted subdivision reduction and a bounded-treewidth dynamic program), followed by five improvers (a union pass, local search, reduce-and-search, consensus forcing and a swap-maximize refinement). We prove that every strategy runs in \(O((n+m)\,\alpha(n))\) time, and that the returned cover has at most \(2\tau-r\) vertices, where \(r\) is the number of components with an edge, so the ratio is at most 1.999999999 whenever \(\tau\le10^{9}r\). We prove exactness or a bounded ratio on several classes of graphs, among them every bipartite graph on which the Hopcroft–Karp phases of the layer strategy reach a maximum matching, and we give a per-instance certificate: a cover with at most \(2L-|M|\) vertices, for a lower bound \(L\le\tau\) and the maximal matching \(M\), is within ratio \(3/2\) on that instance. In a reproducible suite the returned cover satisfies \(|C|\le2\tau-|M|\) on all 291 tested graphs with a known optimum and is certified on the six without one, although single strategies violate it; on the 68 DIMACS clique complements it is never worse than Hvala and optimal on 39 instances against 18. Whether \(|C|\le2\tau-|M|\) holds on every graph is stated as a conjecture: a proof would give a linear-time \(3/2\)-approximation and would refute the Unique Games Conjecture unless \(\mathrm{P}=\mathrm{NP}\).

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Frank Vega

Abstract: The Minimum Independent Dominating Set problem asks for a smallest maximal independent set of a graph. Unless \(\mathrm{P}=\mathrm{NP}\) it is not approximable within \(n^{1-\varepsilon}\) for any \(\varepsilon>0\); it is NP-complete on cubic planar bipartite graphs and NP-hard to approximate within \(\delta B\) on bipartite graphs of maximum degree \(B\). We present version 0.0.9 of Siriaisa, an ensemble of eighteen strategies that adapts the vertex cover algorithm Salvador and the independent set algorithm Esperanza to independent domination: its exact subproblems are forests, solved by a conditioned tree dynamic program, in place of the bipartite structures of Salvador; one base strategy splits every vertex of degree larger than \(\lfloor\sqrt n\rfloor\) into unconnected copies; and the improvers include a weighted swap search. We prove that the output is an independent dominating set computed in \(O(n+m)\) expected time, with ratio at most \(\Delta\), optimal on forests, and with ratio at most \(\sqrt n\) on three classes of graphs. The degree-splitting strategy computes a dominating set of size at most \(\lfloor\sqrt n\rfloor\,(i(G)+s(G))\) on every graph, for an explicit splitting excess \(s(G)\), and the output satisfies the same bound when the decoded set is independent. The excess is at most \(n(\sqrt n+1)\), largest on complete graphs, zero for \(n\ge D^2\) on every family of bounded degree \(D\), among them the NP-hard and UG-hard bounded-degree families, and \(O(\sqrt n)\) on planar graphs; on complete multipartite, crown, wheel and double-star graphs the output is optimal. We conjecture the ratio \(O(\sqrt n)\) on all graphs; a proof would imply \(\mathrm{P}=\mathrm{NP}\). In a reduction from satisfiability, every independent dominating set of the graph of a formula with \(N\) variables and \(t\) copies of every clause, \(t\) at least the largest clause width \(W\), is a satisfying assignment, with \(N\) vertices, or has at least \(t+N\) vertices; with \(t=W\), every independent dominating set of ratio smaller than \(1+W/N\) is a satisfying assignment. This proves the \(n^{1-\varepsilon}\) inapproximability directly from satisfiability, without a gap from the PCP theorem. Through a reduction of Chlebík and Chlebíková, with an explicit edge gadget that turns a graph \(H\) into a graph \(h(H)\) with \(i(h(H))=\tau(H)+2|E(H)|\), where \(\tau(H)\) is the minimum vertex cover size, every output on \(h(H)\) decodes into a vertex cover of \(H\); we state the conditional consequences under the Unique Games Conjecture, for which a proof has been reported but not yet peer reviewed, on general graphs and, through the result of Austrin, Khot and Safra, on bounded-degree graphs. In reproducible experiments the output is optimal on 9999 of 10,000 graphs with an exact integer-program optimum, on all 95 of 112 bipartite graphs whose optimum was proved, on all 18 instances of the set cover reduction, and on 2 of the 30 instances of the vertex cover reduction with a proved optimum; on ten Khot–Regev YES instances the decoded vertex cover has ratio between 1.25 and 1.8665. We also report the results on the 68 complements of the DIMACS clique benchmark.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Marcelo Augusto de Araújo

Abstract: Background: Scientific figures are often treated as illustrations, although their evidential value depends on whether they can be traced to, and regenerated from, the underlying data. Methods: We evaluated a catalog of 4986 seismic events recorded by the Seismology Center of the University of São Paulo (USP) between 22 May 2023 and 21 May 2026, stored in a dimensional Data Warehouse and analyzed with SQL-based OLAP queries (aggregations by year, magnitude scale, region, weekday, semester and author; contingency tables; continuous percentiles; Top-N rankings). Results: The queries reproduced well-established seismological patterns: shallow events (≤10 km; 52.2%) of moderate to strong magnitude predominated (median 4.81), epicenters traced plate boundaries, and Brazilian intraplate events were weaker than international ones. The same queries exposed two data-quality problems: duplicated spellings of an author name and eight magnitude scales instead of the six defined in the model. Conclusions: Mediating visualization through data manipulation languages gives figures reproducibility, traceability, computational accuracy and, in principle, scalability, and adds a diagnostic capacity that purely illustrative charts lack. These languages are therefore a central methodological tool for environmental and geological data analysis, with reliability that remains conditional on the quality of data loading and modeling.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Frank Vega

Abstract: SatyPy is a Python package that decides Boolean formulas in conjunctive normal form through a graph problem, and this paper describes its version 0.0.6. The graph of a formula has a vertex for every literal and for every clause, an edge between the two literals of each variable, and an edge between each clause and each of its literals. We prove that the independent dominating sets of this graph that contain no clause vertex are exactly the satisfying assignments, one literal per variable. SatyPy simplifies the formula by unit propagation and pure literals, eliminates over \( \mathrm{GF}(2) \) the exclusive-or constraints that its clauses write, decides the residual formula exactly if all its clauses have two literals, and otherwise looks for such a set with a weighted local search and branches on a shortest clause falsified by the set found, up to depth \( \max(2,\lfloor\log_3(m+N)\rfloor) \) for \( m \) clauses and \( N \) variables. We prove that every answer SATISFIABLE carries a verified assignment, so that the only error of SatyPy is a false negative, a satisfiable formula answered UNSATISFIABLE; that an answer UNSATISFIABLE is proved when it comes from an exact stage and otherwise rests on the completeness of the search, which on formulas with two or three literals per clause would imply \( \mathrm{P}=\mathrm{NP} \); and that the expected running time is \( O(R\,(\|\varphi\|+N\log N+F)) \), with \( R \) the number of searches of the branching and \( F=400\,000 \), which is \( O((N+m)(\|\varphi\|+N\log N+F)) \) for formulas with at most three literals per clause. A wrong answer UNSATISFIABLE on a satisfiable formula requires the failure of \( d+1 \) searches on satisfiable formulas. Since the error is one-sided, we study the randomized variant of the procedure, in which every search draws its seed at random: if every search on a satisfiable residual formula fails with probability at most \( p \), an answer UNSATISFIABLE on a satisfiable formula has probability at most \( p^{d+1}\le p^{3} \), and a constant \( p<1 \) would place the satisfiability of formulas with at most three literals per clause in the randomized class \( \mathrm{RP} \), that is, \( \mathrm{NP}=\mathrm{RP} \), because the probability is at most \( \tfrac14 \) once \( d \) exceeds a constant that depends on \( p \) and the remaining inputs have bounded size. The same conclusion holds if the reliability is assumed only on formulas with a unique solution, by the reduction of Valiant and Vazirani. In reproducible experiments, the answers agree with exhaustive search on all 188 small formulas, with MiniSat on all 90 random 3-CNF formulas that MiniSat decides, and with the known answers on all 72 formulas of the DIMACS \( \texttt{aim} \) benchmark, and the first search succeeded on each of the 226 satisfiable formulas that it had to decide, and a search for a counterexample on 167 satisfiable formulas with few solutions or a rigid structure, in 501 runs, found none. On the 375 satisfiable formulas of the experiments that reach the search, none failed: the one-sided Clopper--Pearson upper bound at confidence 95% on the failure probability of a search is 0.00796, and for this value the bound \( p^{d+1} \) is at most \( 5.1\cdot10^{-7} \). Running SatyPy on large formulas is not practical.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Shuai Jiang

,

Haotian Li

,

Sayaka Kamei

,

Kazi Md. Rokibul Alam

,

Yasuhiko Morimoto

Abstract: In question answering (QA) for multi-constraint recommendation, the model must find every item that satisfies a request with several requirements. Still, training data that pair natural-language questions with complete answer sets are scarce. Such data can be synthesized by computing answers from an item catalog and using users’ ratings and reviews to select requests, yet the result may reveal whose evidence was used. We develop a QA data synthesis framework that protects these users using user-level differential privacy (DP), bounding each user’s total contribution and adding calibrated noise to the support statistics used to weight requests. Using one construction template, we build QA datasets for Movie, Beauty, and Recipe from pre-provided, rule-cleaned, and model-inferred attributes. In ablations without noise, an adversary who knows all other users’ data identifies, without false positives, every tested member whose evidence supports a request, up to 96% of members. Under DP with privacy budget ε=4, it flags at most 3.0% of members of these three datasets at a 1% false-positive rate, and an audit with repeated mechanism runs finds no evidence of privacy loss above ε. Models trained on private data retain at least 97% of the non-private ablation’s macro-averaged F1 on shared test questions.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Junda Chen

,

Carlo Vittorio Cannistraci

Abstract: Network science frequently seeks general laws of connectivity that persist across scales and disciplines, regardless of specific edge weights. A primitive in this setting is the computation of unweighted all-pairs shortest paths (APSP), which underlies measures of distance, centrality [1], and navigability [2]. However, the canonical Zuse-Moore breadth-first search (ZM-BFS) [3,4] algorithm is prohibitively slow for large and dense networks. Here, leveraging network science principles [2], we introduce CC-BFS: a dynamic programming algorithm for APSP. By prioritizing influential hubs, memoizing intermediate results and exploiting network hierarchy, CC-BFS drastically reduces computational effort, with up to 2500× speedup over ZM-BFS on scale-free networks. Furthermore, CC-BFS substantially outperforms the state-of-the-art direction-optimizing BFS (DO-BFS) [5] across diverse artificial and real-world benchmarks, while utilizing around 80% less memory. In practice, solving the APSP problem on dense and scale-free topologies can approach a time complexity of 0 (n2.5) and in networks with 100,000 nodes passes from over 2 days for ZM-BFS to around 2 minutes for CC-BFS, which represents a milestone potentially impacting many domains of science. CC-BFS scales across shared-memory threads and generalizes to related problems like computing network diameter and radius. By integrating network science into algorithm design, CC-BFS overcomes long-standing scalability challenges, opening new avenues for network-based computational analysis.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Junda Chen

,

Carlo Vittorio Cannistraci

Abstract: Connectivity laws conserved across systems, independently of edge weights, are compelling in network science. Many network metrics aggregate information counting all shortest-paths between node pairs, which is costly. Here we formalize the all-pairs shortest-path number (APSPN) problem and establish a shared computational foundation for these kinds of problems, including betweenness centrality (BC) and geometrical congruence (GC). We introduce the CC-APSPN kernel, which exploits network science principles to accelerate their shared computations on unweighted graphs via knowledge memoization, reducing runtime by up to 90% over the Brandes-APSPN baseline across diverse network topologies. Parallel CC-APSPN carries this acceleration onto multicore CPUs through batched source processing with a dedicated scheduling strategy, reducing exact BC and GC runtimes from hours to a few minutes on a 100,000-node network. Besides, we propose CC-bbBFS, a single-pair primitive for efficient sampling-based approximation of BC and GC. Together, these advances translate network-science-informed algorithm design into practical large-scale analysis.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Frank Vega

Abstract: The maximum independent set problem asks for the largest set of pairwise non-adjacent vertices in an undirected graph. It is NP-hard to approximate within \( n^{1-\varepsilon} \) for every \( \varepsilon>0 \), and under the Unique Games Conjecture it is hard to approximate within \( O(\Delta/\log^2\Delta) \) on graphs of maximum degree \( \Delta \); the Khot--Regev form of the conjecture, for which a proof has been reported but not yet peer reviewed, also rules out a \( (2-\varepsilon) \)-approximation of Minimum Vertex Cover. We present version 0.1.6 of ESPERANZA, which takes the better of a dynamic minimum-degree (Caro--Wei) greedy set and the complement of the SALVADOR vertex cover, and improves it by three budgeted local searches: repair-and-grow restarts at the cover vertices and at a maximum-degree vertex, chained local restarts realising \( (k,k+1) \)-improvements, and an iterated \( (1,2) \)-swap search. We prove that it runs in \( O((n+m)\,\alpha_{\mathrm A}(n)) \) expected time for fixed budgets, with \( \alpha_{\mathrm A} \) the inverse Ackermann function. We prove that the output is a maximal independent set, that its complementary vertex cover has at most \( 2\tau-r \) vertices, where \( \tau \) is the minimum cover size and \( r \) the number of components with an edge, and that the ratio is at most \( (\Delta+2)/3 \) on graphs of maximum degree \( \Delta \). We prove the ratio \( 2\sqrt n \) on every graph with \( \Delta\le\sqrt n \) and on three further classes, and state it for all graphs as a conjecture, whose proof would imply \( \mathrm{P}=\mathrm{NP} \). We also state the conjecture that the complementary cover has at most \( 2\tau-|M| \) vertices for the NetworkX minimum maximal matching \( M \); a proof would give a \( 3/2 \)-approximation for Minimum Vertex Cover and refute the Unique Games Conjecture unless \( \mathrm{P}=\mathrm{NP} \). In reproducible experiments the returned set is optimal on all \( 30\,000 \) graphs of a suite certified by an exact integer program; on \( 40 \) Khot--Regev YES instances with \( 640 \) to \( 2\,560 \) vertices the conjectured bound is certified on \( 38 \) and open on \( 2 \); and on \( 31 \) bounded-degree graphs the certified ratio is at most \( 1.0769 \) on the families with a planted independent set.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Evans Achara

Abstract: As technology continues to advance and enterprises increasingly deploy innovative digital technologies to power and transform their business processes, Smart Organizations are adopting Agentic Artificial Intelligence (Agentic AI) to automate, optimize, and enhance operational performance in the digital age. Unlike conventional AI systems that primarily execute predefined tasks and provide analytical insights, Agentic AI possesses autonomous decision-making, adaptive learning, goal-oriented reasoning, and proactive execution capabilities that enable organizations to respond dynamically to changing business environments. Within the context of Industry 5.0, which emphasizes human-centricity, sustainability, resilience, and intelligent collaboration between humans and machines, Agentic AI is emerging as a strategic enabler of business optimization and organizational transformation. This study explores the adoption of Agentic AI within industry 5.0 Smart Organizations and examines its impact on operational efficiency, decision-making quality, workforce productivity, customer experience, supply chain performance, and organizational resilience. Drawing upon Human–AI Collaboration Theory, Socio-Technical Systems Theory, Dynamic Capabilities Theory, and Industry 5.0 principles, the research proposes a conceptual framework that integrates autonomous AI agents, human expertise, and digital enterprise ecosystems to create adaptive and self-optimizing organizations. The study further investigates the critical success factors influencing Agentic AI adoption, including technological readiness, organizational culture, governance structures, workforce competencies, data infrastructure, and ethical considerations. The findings demonstrate that Agentic AI significantly contributes to business optimization by reducing operational inefficiencies, improving resource utilization, accelerating decision cycles, enhancing predictive capabilities, and enabling continuous process improvement. Furthermore, the research argues that the convergence of Industry 5.0 and Agentic AI represents a paradigm shift from traditional automation toward autonomous, collaborative, and intelligent enterprise ecosystems where humans and AI agents work synergistically to generate sustainable business value. The study contributes to the emerging body of knowledge on Industry 5.0 by providing theoretical and practical insights into how Smart Organizations can strategically leverage Agentic AI to achieve competitive advantage, organizational agility, and long-term business sustainability in the age of artificial intelligence.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Pavel Loskot

Abstract: This paper investigates the canonical problem of factoring a product of two primes, when these primes are represented as Euclidean divisions with different modulo coefficients. Such a representation creates a structure having specific properties that can be exploited in devising algorithmic factorization strategies. In particular, two factorization algorithms are presented, and shown to have a smaller complexity, for many, but not all prime pairs, than a naive direct enumeration of primes as well as well-known Pollard's methods. These algorithms assume that the search over a small set of modulo coefficients can be parallelized on a single processor offering vector machine instructions. The complexity here is defined empirically as the number of prime candidates that need to be tested. These results point at possibly new direction of exploring division structures of integer products, and designing factorization algorithms.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Alberto Merced Castro-Valencia

,

Manuel Soto-Pérez

,

José Carlos Rivera-Ramírez

Abstract: Credit allocation is usually left to a threshold rule applied to machine-learning estimates of default risk, and the stability of the explanations that justify it is rarely measured and never required. We formulate credit allocation as a stochastic combinatorial problem that minimises the conditional value-at-risk of portfolio loss subject to a return floor, a minimum ticket, an origination cost and a cap on the exposure-weighted instability of the Shapley attributions of the funded book. We solve it with a two-level simheuristic: a variable neighbourhood search over which applicants to fund, started from a rounded linear relaxation, and a simulation-driven cutting-plane method that optimises the amounts to a certified tolerance. On Polish bankruptcy data, with a Taiwanese cardholder dataset as control, the tail criterion gives up 9.2 per cent of expected profit out of sample and multiplies the profit retained in the worst 5 per cent of scenarios by 4.6. Stable explanations are costly on the primary data and free on the control. The exact solver proves optimality up to 75 applicants; at 100, where it proves none within an hour, the simheuristic matches its best incumbent in 45 seconds, within a certified 2.6 per cent.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Haotian Li

,

Shuai Jiang

,

Sayaka Kamei

,

Yasuhiko Morimoto

Abstract: Question-answering recipe recommendation tasks lack datasets with ground-truth labels. Existing methods often generate datasets from simple combinations of ingredient or tag constraints, leading to unnatural expressions and unreasonable constraints that are hard to reflect users’ real preferences. This paper proposes a construction method for a benchmark-style QA dataset for natural-language recipe recommendation. Driven by real user behavior, our method integrates external user query and review data to extract fine-grained preference signals by LLMs and maps them onto a knowledge-graphbased tag schema, thereby constructing QA data consisting of preference and ingredient constraints. Besides, a greedy strategy for constraint selection is also used to control the answer size, while tagbased re-ranking is applied to improve data quality. The generated dataset RecipeADQA contains natural-language questions, structured constraints, and answer sets, resulting in 128,465 instances. Experiments compare RecipeADQA with baseline datasets from two perspectives: data quality and retrieval-recommendation performance. The results show that ours outperforms existing methods on the same recipe knowledge graph in coverage, higher question quality in naturalness and constraint rationality, and better queryability. Moreover, we design a noise-augmented retrieve-and-rerank model, in which a lightweight parser first retrieves candidate recipes, and a small language model then selects and ranks relevant recipes from a noisy candidate pool. The model trained on RecipeADQA outperforms the same model trained on the baseline datasets. The relevant construction code and data have been open-sourced at a GitHub repository https://github.com/MorimoLab/RecipeADQA. Note: The paper has been accepted by "The 22nd International Conference on Advanced Data Mining and Applications 2026 (ADMA 2026)".

Review
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Khan Farhan Rafat

,

Arif Ur Rahman

Abstract: Data compression and encryption are conventionally performed as sequential operations, incurring redundant computational overhead, increasing the attack surface, and complicating system architectures. This systematic literature review analyzes 34 verified contributions published between 1948 and 2026 in IEEE, ACM, Springer, Elsevier, Wiley, IET, and NIST venues, following PRISMA 2020. We propose a four-level operational taxonomy (L0–L3) for defining what it means for a scheme to be unified rather than merely coordinated as well as the structure of header consolidation: an L3 scheme consolidates the compression and encryption headers into a single object, typically carried by the key. Only two schemes achieve L3, both restricted by domain-specific assumptions. We discover two structural constraints—the redundancy duality and the header duality—which explain why L3 schemes are restricted to domain-specific, and that the latter is a security constraint: the compression header leaks source statistics and the encryption header leaks cryptographic state, so consolidating them reduces the attack surface. We also show that source-type specificity is inherited by all joint schemes reviewed, and the review also reveals that no scheme achieves a source-independent compression ratio, and that formal security proofs under standard adversarial models (IND-CPA, IND-CCA, IND-CCA2, AE) are absent in each of the reviewed schemes, including the two L3 schemes.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Purva Bangad

,

Harikrishnan Girikumar

Abstract: In content-based recommendation, a second-stage (L2) reranker decides which of roughly a hundred retrieved items fill the first screen of results. The standard L2 model is a cross-encoder trained to score relevance. Decision models, general models that answer a typed question about a text with a probability, could offer an alternative through a single plain-language question. Whether they can is unknown: after retrieval most candidates are already on-topic, so the reranker must separate exact matches from close substitutes, a distinction decision models were not trained for, and sparse relevance labels make the comparison hard to measure. We cast a decision model as a pointwise reranker that asks, for each candidate, whether it exactly matches the request, and uses the answer probability as its score. We evaluate this under a pre-registered protocol: every model reranks the same frozen candidate lists, and a gain counts only if it holds both on the realistic retrieved lists and on fully labelled lists. On Amazon ESCI (1,000 requests) and Wayfair WANDS (299), the commercial Jev decision model, used zero-shot, improves P@10 over embedding order by 0.046 to 0.054 and significantly outperforms the Qwen3-Reranker cross-encoder on ESCI. The open decision model CLM-v0.1-8B ranks no better than random. Jev costs about four times more per request than the cross-encoder run on a rented cloud GPU, so the result is best read as evidence that some decision models can serve as high-precision L2 rerankers when accuracy at the top of the list matters more than serving cost.

Technical Note
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

David Vesterlund

Abstract: We investigate the round complexity of deterministic sequence programs with a fixed finite state per position, pointwise operations, prefix counts, and fixed-radius backward Boolean lookups. We establish a cut-capacity inequality: the number of distinct rows of the communication matrix for any admissible right-side output is at most the product of the per-round cut-message alphabets. We then determine exact row counts for binary multiplication and for two precisely specified versions of Montgomery reduction. For bounded-support counting, these lower bounds imply linear round complexity. Explicit, uniform constructions attain linear upper bounds using a constant-size step with support-one counters for multiplication and lazy Montgomery reduction, and a fixed four-phase public schedule for canonical reduction. We give exact encoding contracts, distinguish one-way cut information from ordinary circuit depth, and describe computational verification of finite instances. The theorem concerns a defined symbolic model and does not assert a lower bound for arbitrary softmax transformers.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Saeid Jafari

Abstract: We develop an exact computational framework for studying preopen sets, preclosure, and candidate p-bounded witnesses in finite digital windows. The framework combines finite-topology operations, exhaustive subset enumeration, witness filtering, and comparisons between digital topologies. We prove the correctness of the principal algorithms, describe their computational complexity, and give a worked example. We also explain the distinction between a witness found in a finite window and a counterexample in an infinite digital space. Since the term p-bounded witness can depend on the particular problem under investigation, the witness predicate is treated as an explicit input to the algorithm rather than being assigned an unjustified universal meaning.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Zhenhai Lu

,

Jungang Yang

,

Chao Zhang

,

Jingke Wan

,

Yao Li

Abstract: Task ontologies are core knowledge carriers for intelligent decision-making and multi-agent collaboration, yet traditional construction approaches suffer from low automation, inconsistent hierarchical semantics, insufficient relational modeling, and poor dynamic adaptability. To address these limitations, this study proposes a large language model (LLM)-driven automatic construction method for hierarchical task ontologies. Built upon domain corpus modeling, the framework integrates hierarchical feature extraction, dynamic weight clustering, and event gap identification to support end-to-end ontology generation and incremental updating. Comprehensive experiments on emergency rescue scenarios were conducted using three mainstream LLMs: Deepseek, Doubao, and ERNIE Bot. Quantitative results demonstrate that the proposed method yields superior F1-scores in feature extraction and overall ontology quality compared with classic BiLSTM-CRF and baseline ablation models. Consistent performance across multiple LLMs verifies the framework’s robustness, while the optimal results achieved by Doubao further validate the effectiveness and strong generalization capability of the proposed LLM-driven ontology construction paradigm.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Abicumaran Uthamacumaran

,

Hector Zenil

Abstract: Complexity science has proposed many measures of complexity, structure, information, emergence and (self-)organisation, often in isolation and without systematic understanding of their relationships, redundancies or distinct properties. As new measures continue to appear, comparative assessment is increasingly needed. Here, we systematically compare classical and recent complexity measures, characterising their relationships and sensitivities in discriminating the qualitative behaviour of discrete and continuous dynamical systems. The primary analysis used an initial 11-system benchmark comprising four elementary cellular automata, Lorenz dynamics, Mandelbrot and Julia fractals, three Boolean-network topologies, and a yeast association network. Across the binarization threshold sweep, Block-level Algorithmic Information Dynamics (AID) (\( |\Delta\mathrm{BDM}| \)) preserved cross-system rankings with mean Spearman agreement 0.881 (95\% CI, 0.848--0.910), \( \mathrm{ICC}(3,1)=0.893 \), and Kendall's \( W=0.894 \). Independent validation comprised a five-regime ladder spanning trivial/ordered, periodic/ordered, critical, chaotic, and maximally random dynamics, together with a continuous logistic-map sweep. In the categorical analysis, 2-D cell and block AID ranked first and second, respectively, in the task-specific composite combining categorical discrimination, Lyapunov tracking, and assigned perturbation capability. Post-hoc, 1-D BDM and Epiplexity separated critical from chaotic dynamics. Epiplexity and expiplexity-derived coding statistics did not distinguish chaotic from maximally random endpoints, whereas AID additionally retained signed, localised, multiscale intervention effects. Sequential structural epiplexity \( S_T \) separated validation categories (\( \epsilon_H^2=0.626 \), 95\% interval 0.515--0.782), with a much lower point separation effect size than Cell and Block AID (BDM perturbation). We develop a proposed characterisation of Epiplexity as a functional over an AID information landscape, making explicit the sufficiency assumptions needed to identify it with the original bounded-MDL definition. Thus, CTM/BDM provide estimators of algorithmic information, AID provides the perturbational calculus, and explicitly constructed scalar observables project selected aspects of that landscape.

Article
Computer Science and Mathematics
Data Structures, Algorithms and Complexity

Mahpara Saleem

,

Simon Polovina

,

Richard Fallon

Abstract: Enterprises expose thousands of data entities as machine-readable metadata through APIs such as SAP Graph and Microsoft Graph, while adopting AI agents that act on the same data. Yet architecture repositories, process-governance workflows, and agent platforms each build their own view of the enterprise, and none is anchored in a formally validated specification. This paper asks how formally validated metadata can be turned into governed transformation capabilities that support autonomous enterprise operation. Following Design Science Research, we contribute (i) a repositioning of the Moregraph platform as a semantic integration layer; (ii) a validation gate that restates published Conceptual Graph and Formal Concept Analysis (CGFCA) results as re-checkable invariants; (iii) a target-parametric Metadata-to-Governance Transformation (MGT) with explicit commit conditions; and (iv) an integrated architecture connecting one validated source to architecture (SAP LeanIX), process (SAP Signavio), and agent (SAP AI Core) governance, mapped onto the BTM Tripod’s People, Process, and Application pillars of Business Transformation Management. We separate what is formally validated, what is demonstrated in a working prototype (LeanIX), and what is proposed (Signavio, AI Core), and set out an evaluation strategy. The central claim is bounded: explicit semantic and policy constraints derived from validated metadata can limit or prevent human- or agent-initiated changes from producing unauthorised or inconsistent enterprise outcomes.

of 14