--- title: "Ruiyi Yan — author profile and papers — Elamur Research" description: "Ruiyi Yan, Beijing University of Posts and Telecommunications: 2 papers on Elamur Research (2026), h-index 2 — affiliations, topics…" canonical: "https://research.elamur.ai/free/en/authors/ruiyi-yan/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/ruiyi-yan/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Ruiyi Yan # Ruiyi Yan Ruiyi Yan has 2 papers in our library, in 2026; often with [Yugo Murawaki](https://md.research.elamur.ai/free/en/authors/yugo-murawaki/). 2 papers in our library · 2026 [OpenAlex](https://openalex.org/A5017568845) · [ORCID](https://orcid.org/0009-0000-4127-6212) · [**h-index 2**](https://openalex.org/authors/A5017568845) · [19 works](https://openalex.org/works?filter=author.id:A5017568845) · [26 citations](https://openalex.org/works?filter=author.id:A5017568845&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/ruiyi-yan/#papers) · [⭐ Paper Stars ranking: #13106](https://md.research.elamur.ai/free/en/paper-stars/page/132/#star-13106) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Ruiyi+Yan) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Ruiyi+Yan) · [dblp](https://dblp.org/search?q=Ruiyi+Yan) · [ACL Anthology](https://aclanthology.org/search/?q=Ruiyi+Yan) ## Affiliations [🎓**Kyoto University** Kyoto · Japan 2025–2026 · 11 papers*current*](https://md.research.elamur.ai/free/en/universities/kyoto-university/) · [🎓**Beijing University of Posts and Telecommunications** Beijing · China 2026 · 1 paper*current*](https://md.research.elamur.ai/free/en/universities/beijing-university-of-posts-and-telecommunications/) · [🎓**Beijing Institute of Technology** Beijing · China 2023–2024 · 4 papers](https://md.research.elamur.ai/free/en/universities/beijing-institute-of-technology/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 7 The field of science this work belongs to (OpenAlex fields).[Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Engineering · 1 work](https://md.research.elamur.ai/free/en/shelves/engineering/) · [Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computer Vision and Pattern Recognition · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-vision-and-pattern-recognition/) · [Electrical and Electronic Engineering · 1 work](https://md.research.elamur.ai/free/en/shelves/engineering/electrical-and-electronic-engineering/) · [Arts and Humanities · 1 work](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Language and Linguistics · 1 work](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) ## Works by year ### 2020s [**2026** 2 papers](https://md.research.elamur.ai/free/en/authors/ruiyi-yan/year/2026/) ## Papers The most cited first (OpenAlex and our library). 1. **[Efficient Provably Secure Linguistic Steganography via Range Coding](https://md.research.elamur.ai/free/en/papers/yan-2026-efficient-provably-secure-linguistic-steganography/)** *(2026 · 1 citation)* Linguistic steganography hides secret messages inside ordinary-looking generated text. Provably secure schemes keep the language model's output distribution unchanged (zero KL divergence), but they usually give up embedding capacity or speed. The authors, Yan and Murawaki of Kyoto University, return to range coding… 2. **[Anchored Sliding Window: Toward Robust and Imperceptible Linguistic Steganography](https://md.research.elamur.ai/free/en/papers/yan-2026-anchored-sliding-window-robust-imperceptible/)** *(2026)* LLM-based linguistic steganography usually assumes the stegotext reaches the receiver unchanged. Because extraction repeats autoregressive inference, altering one token corrupts decoding of everything after it. The earlier robust method, WinStega, conditions only on the most recent tokens. This makes it robust, but… ## Co-authors here 1 co-author with a page, the most papers together first. - [Yugo Murawaki](https://md.research.elamur.ai/free/en/authors/yugo-murawaki/) ×2 ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Annual Meeting of the Association for Computational Linguistics (ACL)](https://md.research.elamur.ai/free/en/venues/acl/) ×2: [ACL 2026](https://md.research.elamur.ai/free/en/venues/acl/2026/) ×2 Updated 2 November 2026