Tootfinder

XY-Tokenizer: Mitigating the Semantic-Acoustic Conflict in Low-Bitrate Speech Codecs
Yitian Gong, Luozhijie Jin, Ruifan Deng, Dong Zhang, Xin Zhang, Qinyuan Cheng, Zhaoye Fei, Shimin Li, Xipeng Qiu
https://arxiv.org/abs/2506.23325

XY-Tokenizer: Mitigating the Semantic-Acoustic Conflict in Low-Bitrate Speech Codecs
Speech codecs serve as bridges between speech signals and large language models. An ideal codec for speech language models should not only preserve acoustic information but also capture rich semantic information. However, existing speech codecs struggle to balance high-quality audio reconstruction with ease of modeling by language models. In this study, we analyze the limitations of previous codecs in balancing semantic richness and acoustic fidelity. We propose XY-Tokenizer, a novel codec that…

Semantic Numeration Systems as Dynamical Systems
Alexander Yu. Chunikhin
https://arxiv.org/abs/2507.21295 https://arxiv.org/pdf/2507.21295

Semantic Numeration Systems as Dynamical Systems
The foundational concepts of semantic numeration systems theory are briefly outlined. The action of cardinal semantic operators unfolds over a set of cardinal abstract entities belonging to the cardinal semantic multeity. The cardinal abstract object (CAO) formed by them in a certain connectivity topology is proposed to be considered as a linear discrete dynamical system with nonlinear control. Under the assumption of ideal observability, the CAO state equations are provided for both stationary…

Density, asymmetry and citation dynamics in scientific literature
Nathaniel Imel, Zachary Hafen
https://arxiv.org/abs/2506.23366 https://

Density, asymmetry and citation dynamics in scientific literature
Scientific behavior is often characterized by a tension between building upon established knowledge and introducing novel ideas. Here, we investigate whether this tension is reflected in the relationship between the similarity of a scientific paper to previous research and its eventual citation rate. To operationalize similarity to previous research, we introduce two complementary metrics to characterize the local geometry of a publication's semantic neighborhood: (1) \emph{density} ($ρ$), def…

Fun educational psychology experiment idea if anyone wants to run it by an IRB and get a paper published:
Get an entire compsci 1 class to take the RAADS-R. Then measure how easily/quickly they understood call/return stack semantics when the concept was first introduced (based on quiz/homework score, self reported "this makes sense" level, or something else).
And scatter plot the two against each other. Do you get two neat clusters?

Base-extension Semantics for Intuitionistic Modal Logics
Yll Buzoku, David. J. Pym
https://arxiv.org/abs/2507.06834 https://arxiv.org…

Base-extension Semantics for Intuitionistic Modal Logics
The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by proof-theoretic semantics, which is a logical realization of inferentialism, in which the meaning of constructs is understood through their use. The key idea in proof-theoretic semantics is that of a base of atomic rules, all of which refer only to propositional atoms …

To add a single example here (feel free to chime in with your own):
Problem: editing code is sometimes tedious because external APIs require boilerplate.
Solutions:
- Use LLM-generated code. Downsides: energy use, code theft, potential for legal liability, makes mistakes, etc. Upsides: popular among some peers, seems easy to use.
- Pick a better library (not always possible).
- Build internal functions to centralize boilerplate code, then use those (benefits: you get a better understanding of the external API, and a more-unit-testable internal code surface; probably less amortized effort).
- Develop a non-LLM system that actually reasons about code at something like the formal semantics level and suggests boilerplate fill-ins based on rules, while foregrounding which rules it's applying so you can see the logic behind the suggestions (needs research).
Obviously LLM use in coding goes beyond this single issue, but there are similar analyses for each potential use of LLMs in coding. I'm all cases there are:
1. Existing practical solutions that require more effort (or in many cases just seem to but are less-effort when amortized).
2. Near-term researchable solutions that directly address the problem and which would be much more desirable in the long term.
Thus in addition to disastrous LLM effects on the climate, on data laborers, and on the digital commons, they tend to suck us into cheap-seeming but ultimately costly design practices while also crowding out better long-term solutions. Next time someone suggests how useful LLMs are for some task, try asking yourself (or them) what an ideal solution for that task would look like, and whether LLM use moves us closer to or father from a world in which that solution exists.

Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds
Alexandre Le Nepvou
https://arxiv.org/abs/2506.17276 https://

Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds
This article develops a novel framework for modal logic based on the idea of stratified actualization, rather than the classical model of global possible worlds. Traditional Kripke semantics treat modal operators as quantification over fully determinate alternatives, neglecting the local, dynamic, and often asymmetric nature of actualization processes. We propose a system Stratified Actualization Logic (SAL) in which modalities are indexed by levels of ontological stability, interpreted as admi…

Modeling Uncertainty: From Simulink to Stochastic Hybrid Automata
Pauline Blohm, Felix Schulz, Lisa Willemsen, Anne Remke, Paula Herber
https://arxiv.org/abs/2506.14581

Modeling Uncertainty: From Simulink to Stochastic Hybrid Automata
Simulink is widely used in industrial design processes to model increasingly complex embedded control systems. Thus, their formal analysis is highly desirable. However, this comes with two major challenges: First, Simulink models often provide an idealized view of real-life systems and omit uncertainties such as, aging, sensor noise or failures. Second, the semantics of Simulink is only informally defined. In this paper, we present an approach to formally analyze safety and performance of embed…

Considerations on Everett J. Nelson's connexive logic
Davide Fazio, Raffaele Mascella
https://arxiv.org/abs/2506.10893 https://ar…

Considerations on Everett J. Nelson's connexive logic
This work explores Everett John Nelson's connexive logic, outlined in his PhD thesis and partially summarized in his 1930 paper \emph{Intensional Relations}, which is obtained by extending the system $\mathsf{NL}$ (reconstructed by E. Mares and F. Paoli) with a weak conjunction elimination rule explicitly assumed in the former but not in the latter. After a preliminary analysis of Nelson's philosophical ideas, we provide an algebraic-relational semantics for his logic and we investigate possibl…

This https://arxiv.org/abs/2506.00512 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGR_…

Pro3D-Editor : A Progressive-Views Perspective for Consistent and Precise 3D Editing
Text-guided 3D editing aims to precisely edit semantically relevant local 3D regions, which has significant potential for various practical applications ranging from 3D games to film production. Existing methods typically follow a view-indiscriminate paradigm: editing 2D views indiscriminately and projecting them back into 3D space. However, they overlook the different cross-view interdependencies, resulting in inconsistent multi-view editing. In this study, we argue that ideal consistent 3D ed…