Tootfinder

Mapping the Perseus Galaxy Cluster with XRISM: Gas Kinematic Features and their Implications for Turbulence
Congyao Zhang, Irina Zhuravleva, Annie Heinrich, Elena Bellomi, Nhut Truong, John ZuHone, Eugene Churazov, Megan E. Eckart, Yutaka Fujita, Julie Hlavacek-Larrondo, Yuto Ichinohe, Maxim Markevitch, Kyoko Matsushita, Fran\c{c}ois Mernier, Eric D. Miller, Koji Mori, Hiroshi Nakajima, Anna Ogorzalek, Frederick S. Porter, Ay\c{s}eg\"ul T\"umer, Shutaro Ueda, Norbert Werner

Mapping the Perseus Galaxy Cluster with XRISM: Gas Kinematic Features and their Implications for Turbulence
In this paper, we present extended gas kinematic maps of the Perseus cluster by combining five new XRISM/Resolve pointings observed in 2025 with four Performance Verification datasets from 2024, totaling 745 ks net exposure. To date, Perseus remains the only cluster that has been extensively mapped out to ~0.7$r_{2500}$ by XRISM/Resolve, while simultaneously offering sufficient spatial resolution to resolve gaseous substructures driven by mergers and AGN feedback. Our observations cover multipl…

Language Generation in the Limit: Noise, Loss, and Feedback
Yannan Bai, Debmalya Panigrahi, Ian Zhang
https://arxiv.org/abs/2507.15319 https://

Language Generation in the Limit: Noise, Loss, and Feedback
Kleinberg and Mullainathan (2024) recently proposed a formal framework called language generation in the limit and showed that given a sequence of example strings from an unknown target language drawn from any countable collection, an algorithm can correctly generate unseen strings from the target language within finite time. This notion was further refined by Li, Raman, and Tewari (2024), who defined stricter categories of non-uniform and uniform generation. They showed that a finite union of …

diveXplore at the Video Browser Showdown 2024
Klaus Schoeffmann, Sahar Nasirihaghighi
https://arxiv.org/abs/2508.20560 https://arxiv.org/pdf/2508.20560

diveXplore at the Video Browser Showdown 2024
According to our experience from VBS2023 and the feedback from the IVR4B special session at CBMI2023, we have largely revised the diveXplore system for VBS2024. It now integrates OpenCLIP trained on the LAION-2B dataset for image/text embeddings that are used for free-text and visual similarity search, a query server that is able to distribute different queries and merge the results, a user interface optimized for fast browsing, as well as an exploration view for large clusters of similar video…

Optimizing Peer Grading: A Systematic Literature Review of Reviewer Assignment Strategies and Quantity of Reviewers
Uchswas Paul, Shail Shah, Sri Vaishnavi Mylavarapu, M. Parvez Rashid, Edward Gehringer
https://arxiv.org/abs/2508.11678

Optimizing Peer Grading: A Systematic Literature Review of Reviewer Assignment Strategies and Quantity of Reviewers
Peer assessment has established itself as a critical pedagogical tool in academic settings, offering students timely, high-quality feedback to enhance learning outcomes. However, the efficacy of this approach depends on two factors: (1) the strategic allocation of reviewers and (2) the number of reviews per artifact. This paper presents a systematic literature review of 87 studies (2010--2024) to investigate how reviewer-assignment strategies and the number of reviews per submission impact the …

Quadratic Kernel for Cliques or Trees Vertex Deletion
Soh Kumabe
https://arxiv.org/abs/2509.16815 https://arxiv.org/pdf/2509.16815

Quadratic Kernel for Cliques or Trees Vertex Deletion
We consider \textsc{Cliques or Trees Vertex Deletion}, which is a hybrid of two fundamental parameterized problems: \textsc{Cluster Vertex Deletion} and \textsc{Feedback Vertex Set}. In this problem, we are given an undirected graph $G$ and an integer $k$, and asked to find a vertex subset $X$ of size at most $k$ such that each connected component of $G-X$ is either a clique or a tree. Jacob et al. (ISAAC, 2024) provided a kernel of $O(k^5)$ vertices for this problem, which was recently improve…