Searcharxiv⌕ Search

arXiv subjects

Eunmi Kim

Publications and source records attributed to Eunmi Kim.

12 recordsLinked to original sources

XL-SafetyBench: A Country-Grounded Cross-Cultural Benchmark for LLM Safety and Cultural Sensitivity

Current LLM safety benchmarks are predominantly English-centric and often rely on translation, failing to capture country-specific harms. Moreover, they rarely evaluate a model's ability to detect culturally embedded sensitivities as distinct from universal harms. We introduce XL-SafetyBench, a suite of 5,500 test cases across 10 country-language pairs, comprising a Jailbreak Benchmark of country-grounded adversarial prompts and a Cultural Benchmark where local sensitivities are embedded within innocuous requests. Each item is constructed via a multi-stage pipeline that combines LLM-assisted discovery, automated validation gates, and dual independent native-speaker annotators per country. We report Attack Success Rate (ASR) alongside Neutral-Safe Rate (NSR) to separate principled refusal from non-engagement, and introduce the Cultural Sensitivity Rate (CSR) for recognizing embedded sensitivities. Evaluating 10 frontier and 27 local LLMs reveals two key findings. First, strong jailbreak robustness does not always come with strong cultural awareness, showing why the two should be evaluated separately. Second, local models exhibit a strong ASR-NSR trade-off (r = -0.81), suggesting that low attack success in several local models reflects non-engagement rather than safe refusal. XL-SafetyBench enables more nuanced, cross-cultural safety evaluation in the multilingual era.

cs.CL↗

SURE: Framework for Safety to Construct Trustworthy AI

Warning: This paper contains harmful and offensive text. Recently, large language models such as GPT-4, and Claude have revolutionized tasks in various domains. As the use of these large language models increases, people are increasingly concerned about AI safety and demand that large language models behave responsibly and safely. As a result, there has been growing global interest in developing methods to ensure AI safety. However, the detailed criteria for AI safety may vary depending on the country, culture, and policies of the company you serve. In this study, we propose SURE (A Safe and Unified AI Framework foR Everyone), which is designed as a framework for customizing the attributes of AI safety and ensuring the defined AI safety. Within SURE, we establish taxonomies for adversarial prompts that could threaten AI safety and construct prompts based on the taxonomies. We then define templates for desirable AI responses to these prompts and design an absolute safety scoring scheme. Finally, we conduct AI alignment using the datasets to gradually ensure AI safety. The effectiveness of SURE is demonstrated through experiments with various base models.

cs.CR↗

KidnapRAG: A Black-Box Attack for Hijacking Reasoning in Agentic Retrieval-Augmented Generation Systems

Retrieval-Augmented Generation (RAG) systems are vulnerable to poisoning attacks that inject malicious documents into the retrieval process to manipulate model outputs. Recent Agentic RAG systems are more robust to such attacks because they iteratively perform retrieval and reasoning, allowing them to ignore weakly relevant poisoned documents and preserve the reasoning chain induced by the user query. However, existing attacks on Agentic RAG systems often assume white-box access to system prompts, reasoning traces, retrievers, or model parameters, limiting their applicability in realistic settings. In this paper, we study black-box poisoning attacks against Agentic RAG systems, where the attacker can only publish externally retrievable poisoned documents. We propose KidnapRAG, a sequential poisoning attack that hijacks the agent's multi-step reasoning chain using three role-specific documents: Bait, Chain-Link, and Mal-Ins, which attract initial retrieval, induce query reformulation, and provide attacker-controlled evidence, respectively. Experiments across multiple Agentic RAG frameworks, LLM backbones, and benchmarks show that KidnapRAG consistently outperforms existing poisoning baselines under black-box conditions. Further analyses show that KidnapRAG progressively weakens the original retrieval intent, redirects retrieval behavior, and increases reliance on attacker-controlled evidence. Our code is publicly available at https://github.com/chanwoochoi316/KidnapRAG.

cs.CR↗

Responsible AI Technical Report

KT developed a Responsible AI (RAI) assessment methodology and risk mitigation technologies to ensure the safety and reliability of AI services. By analyzing the Basic Act on AI implementation and global AI governance trends, we established a unique approach for regulatory compliance and systematically identify and manage all potential risk factors from AI development to operation. We present a reliable assessment methodology that systematically verifies model safety and robustness based on KT's AI risk taxonomy tailored to the domestic environment. We also provide practical tools for managing and mitigating identified AI risks. With the release of this report, we also release proprietary Guardrail : SafetyGuard that blocks harmful responses from AI models in real-time, supporting the enhancement of safety in the domestic AI development ecosystem. We also believe these research outcomes provide valuable insights for organizations seeking to develop Responsible AI.

cs.CL↗

Inequalities for the number of $t$-hooks in two partition classes arising from sum-product identities

Motivated by recent study on the number of $t$-hooks in partitions arising from Euler's partition identity, we investigate the number of $t$-hooks in the sets from the first Rogers-Ramanujan identity and the first little Göllitz identity. In particular, for $t=1,2$, we obtain the generating functions for the number of $t$-hooks and prove $t$-hook inequalities by deriving asymptotic formulas.

math.NT↗

The Littlewood decomposition via colored Frobenius partitions

The Littlewood decomposition for partitions is a well-known bijection between partitions and pairs of $t$-core and $t$-quotient partitions. This decomposition can be described in several ways, such as the $t$-abacus method of James or the biinfinite word method of Garvan, Kim, and Stanton. In a recent study, Frobenius partitions have proven to be a highly useful tool in dealing with partition statistics related to $t$-core partitions. Motivated by this study, in this paper, we present an alternative description of the Littlewood decomposition using Frobenius partitions. We also apply our approach to self-conjugate partitions and doubled distinct partitions, and give new characterizations of their $t$-cores and $t$-quotients.

math.CO↗

Inequalities and asymptotics for hook lengths in $\ell$-regular partitions and $\ell$-distinct partitions

In this article, we study hook lengths in $\ell$-regular partitions and $\ell$-distinct partitions. More precisely, we establish hook length inequalities between $\ell$-regular partitions and $\ell$-distinct partitions for hook lengths $2$ and $3$, by deriving asymptotic formulas for the total number of hooks of length $t$ in both partition classes, for $t = 1, 2, 3$. From these asymptotics, we show that the ratio of the total number of hooks of length $t$ in $\ell$-regular partitions to those in $\ell$-distinct partitions tends to a constant that depends on $\ell$ and $t$. We also provide hook length inequalities within $\ell$-regular partitions and within $\ell$-distinct partitions.

math.CO↗

Modularity of moments of reciprocal sums for partitions into distinct parts

In this paper, we determine modularity properties of the generating function of $s_k(n)$ which sums $k$-th power of reciprocals of parts throughout all of the partitions of $n$ into distinct parts. In particular, we show that the generating function for $s_k (n)$ is related to Maass Eisenstein series and sesquiharmonic Maass forms.

math.NT↗

On the distribution of $t$-hooks of doubled distinct partitions

Recently, Griffin, Ono, and Tsai examined the distribution of the number of $t$-hooks in partitions of $n$, which was later followed by the work of Craig, Ono, and Singh on the distribution of the number of $t$-hooks in self-conjugate partitions of $n$. Motivated by these studies, in this paper, we further investigate the number of $t$-hooks in some subsets of partitions. More specifically, we obtain the generating functions for the number of $t$-hooks in doubled distinct partitions and the number of $t$-shifted hooks in strict partitions. Based on these generating functions, we prove that the number of $t$-hooks in doubled distinct partitions and the number of $t$-shifted hooks in strict partitions are both asymptotically normally distributed.

math.CO↗

Improved asymptotics for moments of reciprocal sums for partitions into distinct parts

In this paper we strongly improve asymptotics for $s_1(n)$ (respectively $s_2(n)$) which sums reciprocals (respectively squares of reciprocals) of parts throughout all the partitions of $n$ into distinct parts. The methods required are much more involved than in the case of usual partitions since the generating functions are not modular and also do not posses product expansions.

math.NT↗

ClovaCall: Korean Goal-Oriented Dialog Speech Corpus for Automatic Speech Recognition of Contact Centers

Automatic speech recognition (ASR) via call is essential for various applications, including AI for contact center (AICC) services. Despite the advancement of ASR, however, most publicly available call-based speech corpora such as Switchboard are old-fashioned. Also, most existing call corpora are in English and mainly focus on open domain dialog or general scenarios such as audiobooks. Here we introduce a new large-scale Korean call-based speech corpus under a goal-oriented dialog scenario from more than 11,000 people, i.e., ClovaCall corpus. ClovaCall includes approximately 60,000 pairs of a short sentence and its corresponding spoken utterance in a restaurant reservation domain. We validate the effectiveness of our dataset with intensive experiments using two standard ASR models. Furthermore, we release our ClovaCall dataset and baseline source codes to be available via https://github.com/ClovaAI/ClovaCall.

cs.LG↗

On the number of even and odd strings along the over partitions of n

Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k (n) \geq B_k (n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is the number of odd (resp. even) strings along the overpartitions of n. We introduce m-strings and show that how this new combinatorial object is related with another positivity conjecture of Andrews, Chan, Kim, and Osburn. Finally, we confirm that the positivity conjecture is also true for large enough integers.

math.NT↗