Related papers: Directionality of the Voynich Script

Large reasoning models (LRMs) generate complex reasoning traces with planning, reflection, verification, and backtracking. In this work, we introduce ReasoningFlow, a unified schema for analyzing the semantic structures of these complex…

The Voynich MS is an illustrated 15th century manuscript, whose text is written in an unknown alphabet, which has not been translated until today. In 2004 Gordon Rugg published a paper in which he proposed that this text is likely to be…

LLM text decoding is key component for perceived LLM quality. We demonstrate two experiments showing that decoding methods could be improved by manipulation of token probabilities. First, we test few LLM on SummEval summary scoring dataset,…

The inherent capabilities of a language model (LM) and the reasoning strategies it employs jointly determine its performance in reasoning tasks. While test-time scaling is regarded as an effective approach to tackling complex reasoning…

As the adoption of LLMs becomes more widespread in software coding ecosystems, a pressing issue has emerged: does the generated code contain social bias and unfairness, such as those related to age, gender, and race? This issue concerns the…

While a lot of recent research focuses on enhancing the textual reasoning capabilities of Large Language Models (LLMs) by optimizing the multi-agent framework or reasoning chains, several benchmark tasks can be solved with 100\% success…

This paper addresses the behavior of the Lov\'asz number for dense random circulant graphs. The Lov\'asz number is a well-known semidefinite programming upper bound on the independence number. Circulant graphs, an example of a Cayley graph,…

Verifying a conjecture of Petkov{\v{s}}ec, we prove that the lettericity of an n-vertex path is precisely $\left\lfloor \frac{n+4}{3}\right\rfloor$.

Encoded (or ciphered) manuscripts are a special type of historical documents that contain encrypted text. The automatic recognition of this kind of documents is challenging because: 1) the cipher alphabet changes from one document to…

Large Language Models (LLMs) have been shown to be biased in prior work, as they generate text that is in line with stereotypical views of the world or that is not representative of the viewpoints and values of historically marginalized…

A majority digraph is a finite simple digraph $G=(V,\to)$ such that there exist finite sets $A_v$ for the vertices $v\in V$ with the following property: $u\to v$ if and only if "more than half of the $A_u$ are $A_v$". That is, $u\to v$ if…

We show how the twisting of spectral triples induces a transition from an euclidean to a lorentzian noncommutative geometry, at the level of the fermionic action. More specifically, we compute the fermionic action for the twisting of a…

Steering vectors are a lightweight method for controlling language model behavior by adding a learned bias to the activations at inference time. Although effective on average, steering effect sizes vary across samples and are unreliable for…

Large language models (LLMs) have been shown to encode truth of statements in their activation space along a linear truth direction. Previous studies have argued that these directions are universal in certain aspects, while more recent work…

If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We…

The record of the beginning of the most widespread legal system in the world is contained in millions of pages of handwritten text. Most of the records of the first centuries of the Anglo-American legal system are hand-written in a highly…

Ternary paths consist of an up-step of one unit, a down-step of two units, never go below the $x$-axis, and return to the $x$-axis. This paper addresses the enumeration of partial ternary paths, ending at a given level $i$, reading the path…

We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between transition-based parsing and…

A locally testable code (LTC) is an error-correcting code that has a property-tester. The tester reads $q$ bits that are randomly chosen, and rejects words with probability proportional to their distance from the code. The parameter $q$ is…

Logically constrained rewrite systems (LCTRSs) are a versatile and efficient rewriting formalism that can be used to model programs from various programming paradigms, as well as simplification systems in compilers and SMT solvers. In this…