arXiv:2607. 20286v1 Announce Type: cross Abstract: We propose a novel framework for computing rigorous bounds on the probability that a large language model (LLM) generates harmful output to a given prompt.
By Mahdi Nazeri, Anne-Kathrin Schmuck, Sadegh Soudjani, Alessandro Abate
arXiv:2607. 05995v1 Announce Type: cross Abstract: We propose a novel approach to mine patterns in spatio-temporal event data based on discovering frequent closed embedded sub-Directed Acyclic Graphs (DAGs).
By Piotr S. Maci\k{a}g
arXiv:2602. 17001v3 Announce Type: replace Abstract: Natural Language Querying for Time Series Databases (NLQ4TSDB) aims to assist non-expert users retrieve meaningful events, intervals, and summaries from massive temporal records.
By Zhao Tan, Yiji Zhao, Shiyu Wang, Chang Xu, Yuxuan Liang, Xiping Liu, Shirui Pan, Ming Jin
arXiv:2606. 11235v1 Announce Type: new Abstract: A key step in knowledge discovery is the evaluation of data mining results.
By Leonardo Pellegrina, Fabio Vandin
arXiv:2605. 02488v2 Announce Type: replace Abstract: Several applications demand the timely detection of critical situations, such as threats to safety and transparency, over high-velocity streams of symbolic events.
By Periklis Mantenoglou
We propose a novel framework for computing rigorous bounds on the probability that a large language model (LLM) generates harmful output to a given prompt. We study a new application of the Clopper-Pearson confidence intervals to obtain probably approximately correct (PAC) bounds for this problem.
arXiv:2607. 03188v1 Announce Type: cross Abstract: Episode mining aims to extract subsequences of events that possess certain distinctive properties and constitute facts valuable to the user.
By Maxim Ivanov, Matvei Smirnov, Alisa Strazdina, George Chernishev
arXiv:2607. 14770v1 Announce Type: new Abstract: Knowledge graph question generation (KGQG) aims to generate natural-language questions from structured graph evidence.
By Xuemeng Liu, Zhengpin Li, Wanpeng Tang, Haotong Xie, Wentao Zhang
arXiv:2607. 12279v1 Announce Type: cross Abstract: Writing a sentence of exactly twelve words; ending a DNA sequence at the right codon; formatting an ASCII table.
By Jacob Dunefsky, Wes Gurnee, Emmanuel Ameisen
arXiv:2503. 06573v3 Announce Type: replace-cross Abstract: Recent LLMs have shown remarkable success in following user instructions, yet handling instructions with multiple constraints remains a significant challenge.
By Gili Lior, Asaf Yehudai, Ariel Gera, Liat Ein-Dor
arXiv:2606. 19264v1 Announce Type: new Abstract: The knowledge encoded in large language models (LLMs) can serve as a substrate for structured reasoning over variables describing a complex world, but accessing this knowledge in a probabilistically coherent manner poses a difficult inference problem.
By Sanghyeok Choi, Henry Gouk, Esmeralda S. Whitammer
Large language models (LLMs) have demonstrated rapidly improving long-context capabilities, prompting a wave of benchmarks designed to evaluate them. However, existing long-context evaluations - from Needle-in-a-Haystack (NIAH) tests to more recent multi-hop reasoning and summarization tasks - predominantly measure average-case performance, and many are either saturated or lack robustness.