ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “subshifts”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DMTheoreticalRecentJun 11, 2026

Frequencies of Patterns in Smooth Sequences Over the Alphabet $\{1,3\}$

Damien Jamet, Irène Marcovici, Léo Poirier, Thierry de la Rue

This paper uses ergodic theory to study statistical properties of smooth sequences over the odd alphabet {1,3}, defining a notion of type for those sequences and proving unique ergodicity for subshift…

View →
eess.IVcs.CRcs.ETRecentMay 19, 2026

Set Shaping Theory as a Complementary Payload-Shaping Layer for Steganography

Aida Koch, Logan Lewis, Lily Scott, Agi Weber

The paper proposes using Set Shaping Theory (SST) as a preprocessing layer for LSB steganography, demonstrating that it significantly reduces the statistical detectability of embedded messages without…

View →
cs.CLcs.AIRecentJun 1, 2026

From Layers to Submodules: Rethinking Granularity in Replacement-Based LLM Compression

Elia Cunegatti, Marcus Vukojevic, Erik Nielsen, Giovanni Iacca

The paper proposes SubFit, a novel compression technique that achieves superior LLM compression by replacing non-contiguous, submodule-level components (Attention and FeedForward) with lightweight res…

View →
cs.DMmath.COmath.DSTheoreticalRecentJun 11, 2026

The Curious Case of Reversible Elementary Second Order Cellular Automaton 115

Enrico Formenti, Supreeti Kamylia

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

View →
cs.DScs.LGstat.MLRecentJun 3, 2026

A General Framework for Dynamic Consistent Submodular Maximization

Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard +2 more

The paper develops a general framework for dynamic consistent submodular maximization, achieving constant-factor approximations with sublinear consistency for both cardinality and rank-$k$ matroid con…

View →
cs.CCRecentMay 31, 2026

Recursive Jump Operators and Optimal Proof Systems

Fabian Egidy

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…

View →
cs.CVcs.CRRecentMar 31, 2026

SHIFT: Stochastic Hidden-Trajectory Deflection for Removing Diffusion-based Watermark

Rui Bao, Zheng Gao, Xiaoyu Li, Xiaoyan Feng +2 more

The paper introduces SHIFT, a training-free attack that exploits the vulnerability of diffusion-based watermarking by stochastically deflecting the generative trajectory, achieving high removal rates…

View →
cs.CCq-bio.QMRecentJun 1, 2026

Structure-Informed Multiple Sequence Alignment: A Formal Model and Hardness Results

Yoshiki Kanazawa, Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter

The paper formally models structure-informed multiple sequence alignment (MSA-S) as an NP-complete optimization problem, establishing a strong computational complexity baseline for the field.

View →
cs.LGcs.AIRecentMay 29, 2026

dashi: A Python library for Dataset Shift Characterization to Support Trustworthy AI Development and Deployment

David Fernández-Narro, Pablo Ferri, Ángel Sánchez-García, Juan M. García-Gómez +1 more

The paper introduces 'dashi,' an open-source Python library that provides comprehensive tools for characterizing dataset shifts (covariate, prior, concept) to ensure robust and trustworthy AI developm…

View →
cs.CCcs.LGTheoreticalRecentJun 11, 2026

The Program Is Still There: A Conservation Law for Program Discovery

Jorge Miguel Silva

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

View →
cs.CGmath.ATmath.CORecentMay 29, 2026

Towards fast computation of higher discrete homology

Jacob Ender, Chris Kapulkin

The paper presents a novel and significantly faster algorithm for computing the second discrete homology group of a graph by identifying five basic quotient shapes of the 3-cube.

View →
cs.CRcs.ITRecentMar 17, 2026

Novel CRT-based Asymptotically Ideal Disjunctive Hierarchical Secret Sharing Scheme

Hongju Li, Jian Ding, Fuyou Miao, Cheng Wang +1 more

The paper proposes a novel CRT-based asymptotically perfect Disjunctive Hierarchical Secret Sharing (DHSS) scheme that overcomes security and information rate limitations of existing methods.

View →
cs.CRcs.AREmpiricalRecentJun 10, 2026

Partitioned Tags, Shared Data: Reconciling Strict Cache Isolation with Write-Shared Coherence

Kartik Ramkrishnan, Stephen McCamant, Antonia Zhai, Pen Chung Yew

This paper presents SCP, a cache partitioning design that combines strict eviction isolation with write-shared coherence to mitigate eviction-based cache side channels.

View →
math.CTcs.CRRecentMar 17, 2026

From Torsors to Topoi: An Introduction with a View Toward $Σ$-Protocols in Cryptography

Takao Inoué

This paper provides a focused, preparatory introduction to sheaves and topoi, establishing the necessary structural background to understand the advanced sheaf-theoretic framework used in cryptographi…

View →
cs.LGcs.AIRecentJun 1, 2026

Two-Fidelity Best-Action Identification for Stochastic Minimax Tree

Peter Chen, Xi Chen

The paper proposes 2FFS, a two-fidelity tree-search algorithm that efficiently identifies the best action in stochastic minimax trees by adaptively combining cheap, biased heuristic evaluations with e…

View →
cs.CCTheoreticalRecentJun 10, 2026

The Switching Lemma shows what the Switching Lemma cannot prove: an unconditional natural-proofs barrier

Bruno Loff, Suhail Sherif, Navid Talebanfard, Francesca Ugazio

This paper establishes an unconditional barrier for AC0-natural proofs, showing that they cannot prove lower bounds greater than $2^{n^{7/(d-5)}}$ against depth-$d$ circuits.

View →
math.NTcs.CRRecentMar 26, 2026

Second order Recurrences, quadratic number fields and cyclic codes

Minjia Shi, Xuan Wang, Bouazzaoui Zakariae, Jon-Lark Kim +1 more

The paper investigates generalized Wall-Sun-Sun primes, $WSS(d)$, and uses them to study the weight distributions of specific cyclic codes defined over $ ext{F}_p$ and $ ext{Z}_{p^2}$.

View →
cs.CRRecentApr 17, 2026

Stringology Based Cryptology

Victor Kebande

This paper proposes Stringology-Based Cryptology (SBC), a novel approach that analyzes the structural properties of cryptographic outputs by treating them as symbolic sequences, offering complementary…

View →
math.ATcs.DMmath.COTheoreticalRecentJun 11, 2026

Computing stable homology representations of graph configuration spaces

Eric Ramos, Claudia He Yun

Ramos and White's theorem on multiplicity stability of rational homology for configuration spaces of certain graphs is extended and computed for various families of graphs using computer algebra.

View →
cs.AIRecentJun 1, 2026

An Abstract Worlds Semantic Framework for Belief Change Operators

Daniel Grimaldi, M. Vanina Martinez, Ricardo O. Rodriguez

The paper introduces Abstract Worlds Semantics (AWS), a set-theoretic framework that treats worlds as primitive elements to provide a unified and generalized analysis of various belief change models.

View →