983 papers
The range from Cs to Lo encompasses a diverse spectrum of computer science research, bridging the gap between abstract algorithms and practical applications. These studies explore everything from the theoretical foundations of artificial intelligence and cryptography to the design of user-friendly interfaces and large-scale network systems. By translating complex computational concepts into clear insights, this collection helps readers understand how digital innovations shape our daily lives and future technologies.
Every new preprint in this category arrives directly from arXiv, the leading repository for cutting-edge research. Gist.Science processes each submission to provide two distinct perspectives: a concise, plain-language overview for general understanding and a detailed technical summary for experts seeking deeper methodological clarity. This dual approach ensures that valuable findings are accessible to everyone, regardless of their background in computer science.
Below are the latest papers in this dynamic field, offering fresh discoveries and rigorous analysis ready for your review.
This paper advances the theory of monoidal bicategories by introducing bicategorical versions of linear exponential comonads and codereliction transformations, thereby extending Joyal's differential calculus of analytic functors from single-variable to multi-variable contexts between presheaf categories.
This paper presents a Coq formalization of hyperspaces and subset operations over abstract exact real numbers and Polish spaces, deriving certified, error-free programs for tasks like fractal generation by establishing the computational equivalence between generic topological and efficient metric encodings via a nondeterministic continuity principle.
This paper argues that injectivity properties, rather than normalization, are the crucial and sufficient foundation for certifying decision procedures for definitional equality in dependent type theory, including for fully untyped conversion checkers.
This paper establishes the "Physical Counting Impossibility Theorem," which argues that no fixed-budget physical substrate can provide universal exact proof because the thermodynamic cost of retaining the necessary irreversible records eventually exceeds the system's finite capacity.
This paper introduces a calculus of fidelity-graded translations that treats verified translation as a composable graph of multiple routes, implemented in the "hurdy-gurdy" platform where LLM agents independently generate language pairs and their correctness is validated through architectural cross-checks rather than authorship.
The paper reports on CoreForge, an experiment demonstrating that large language models can successfully assist in building a functional unweighted MaxSAT solver directly from research papers through an iterative workflow, though the resulting system still requires human guidance and validation while lagging behind hand-engineered solvers in performance.
This article provides a comprehensive historical overview of the development, mathematical foundations, and practical applications of the process algebra formalisms μCRL and its successor mCRL2, highlighting their evolution from theoretical concepts to versatile tools for modeling and analyzing complex interacting computer systems.
This paper establishes that the reachability problem for 3-dimensional Vector Addition Systems with States (3-VASS) is in EXPSPACE by proving a doubly-exponential length bound on shortest runs through a hierarchical pumpability analysis, thereby improving upon the previously known 2-EXPSPACE upper bound.
This paper presents a formal verification in the Rocq proof assistant of an abstract, rule-based transition system for the DPLL SAT-solving procedure, establishing its correctness, completeness, and termination while extending it with the pure literal rule and deriving a concrete terminating solver from a verified abstract strategy.
This paper proposes a probabilistic model for generating realistic large labeled transition systems by integrating random graph theory with empirical data, demonstrating that these systems exhibit either convergence or 0-1 laws for LTL and CTL properties as their size approaches infinity, while also providing algorithms to determine these asymptotic limits.