This study aims to predict Tumor, Node, and Metastasis (TNM) stage labels independently, with the Cancer Genome Atlas (TCGA) pathology report as the sixth shared task of SMM4H-HeaRD 2026. The problem is framed as three multi-label classification tasks. We explore both classical and deep learning approaches using Term Frequency-Inverse Document Frequency (TF-IDF) features and embeddings from ClinicalBERT, BioBERT, and PubMedBERT. These representations are used with Logistic Regression (LR), Light Gradient Boosting Machine (LightGBM), Feed-Forward Neural Networks (FFNN), and Wide Residual Networks (WRN). Our results show that individual embeddings perform similarly to the TNM label classification, while their combination improves its predictive ability. WRN achieves AUROC scores of 0.839 (T), 0.8502 (N), and 0.803 (M) with F1-scores of 0.622, 0.702, and 0.9337, respectively, for the training phase. LightGBM with TF-IDF performs best with AUROC scores of 0.9368 (T), 0.9524 (N), and 0.8311 (M) and F1-scores of 0.7559 (T), 0.7384 (N), and 0.7017 (M) during the training phase. Furthermore, the result of the Codabench for the test sets indicates a Macro-F1 score of 0.978, 0.957, and 0.879
We revisit the relationship between two fundamental models of distributed computation: the asynchronous message-passing model with up to $f$ crash failures ($\operatorname{AMP}_f$) and the Heard-Of model with up to $f$ message omissions ($\operatorname{HO}_f$). We show that for $n > 2f$, the two models are equivalent with respect to the solvability of colorless tasks, and that for colored tasks the equivalence holds only when $f = 1$ (and $n > 2$). The separation for larger $f$ arises from the presence of silenced processes in $\operatorname{HO}_f$, which may lead to incompatible decisions. The proofs proceed through bidirectional simulations between $\operatorname{AMP}_f$ and $\operatorname{HO}_f$ via an intermediate model that captures this notion of silencing. The results extend to randomized protocols against a non-adaptive adversary, indicating that the expressive limits of canonical rounds are structural rather than probabilistic. Together, these results delineate precisely where round-based abstractions capture asynchronous computation, and where they do not.
This paper presents our system for the SMM4H-HeaRD 2025 shared tasks, specifically Task 4 (Subtasks 1, 2a, and 2b) and Task 5 (Subtasks 1 and 2). Task 4 focused on detecting mentions of insomnia in clinical notes, while Task 5 addressed the extraction of food safety events from news articles. We participated in all subtasks and report key findings across them, with particular emphasis on Task 5 Subtask 1, where our system achieved strong performance-securing first place with an F1 score of 0.958 on the test set. To attain this result, we employed encoder-based models (e.g., RoBERTa), alongside GPT-4 for data augmentation. This paper outlines our approach, including preprocessing, model architecture, and subtask-specific adaptations
Anonymity is a powerful component of many participatory media platforms that can afford people greater freedom of expression and protection from external coercion and interference. However, it can be difficult to effectively implement on platforms that leverage spoken language due to distinct biomarkers present in the human voice. In this work, we explore the use of voice anonymization methods within the context of a technology-enhanced civic dialogue network based in the United States, whose purpose is to increase feelings of agency and being heard within civic processes. Specifically, we investigate the use of two different speech transformation and synthesis methods for anonymization: voice conversion (VC) and text-to-speech (TTS). Through a series of two studies, we examine the impact that each method has on 1) the empathy and trust that listeners feel towards a person sharing a personal story, and 2) a speaker's own perception of being heard, finding that voice conversion is an especially suitable method for our purposes. Our findings open up interesting potential research directions related to anonymous spoken discourse, as well as additional ways of engaging with voice-based
There are many models of distributed computing, and no unifying mathematical framework for considering them all. One way to sidestep this issue is to start with simple communication and fault models, and use them as building blocks to derive the complex models studied in the field. We thus define operations like union, succession or repetition, which makes it easier to build complex models from simple ones while retaining expressivity. To formalize this approach, we abstract away the complex models and operations in the Heard-Of model. This model relies on (possibly asynchronous) rounds; sequence of digraphs, one for each round, capture which messages sent at a given round are received before the receiver goes to the next round. A set of sequences, called a heard-of predicate,defines the legal communication behaviors -- that is to say, a model of communication. Because the proposed operations behave well with this transformation of operational models into heard-of predicates, we can derive bounds, characterizations, and implementations of the heard-of predicates for the constructions.
In distributed computing, multiple processes interact to solve a problem together. The main model of interaction is the message-passing model, where processes communicate by exchanging messages. Nevertheless, there are several models varying along important dimensions: degree of synchrony, kinds of faults, number of faults... This variety is compounded by the lack of a general formalism in which to abstract these models. One way to bring order is to constrain these models to communicate in rounds. This is the setting of the Heard-Of model, which captures many models through predicates on the messages sent in a round and received on time. Yet, it is not easy to define the predicate that captures a given operational model. The question is even harder for the asynchronous case, as unbounded message delay means the implementation of rounds must depend on details of the model. This paper shows that characterising asynchronous models by heard-of predicates is indeed meaningful. This characterization relies on delivered predicates, an intermediate abstraction between the informal operational model and the heard-of predicates. Our approach splits the problem into two steps: first extract t
The Heard-Of model is a simple and relatively expressive model of distributed computation. Because of this, it has gained a considerable attention of the verification community. We give a characterization of all algorithms solving consensus in a fragment of this model. The fragment is big enough to cover many prominent consensus algorithms. The characterization is purely syntactic: it is expressed in terms of some conditions on the text of the algorithm. One of the recent methods of verification of distributed algorithms is to abstract an algorithm to the Heard-Of model and then to verify the abstract algorithm using semi-automatic procedures. Our results allow, in some cases, to avoid the second step in this methodology.
The mysterious sound known as The Hum has been reported worldwide for decades, yet its source often remains impossible to find。 Researchers tested whether people who hear it have exceptional low-frequency hearing or measurable sounds produced inside their ears, but neither explanation fit most participants。 The strongest possibility is that many ca
For $G$ a finite group and $T$ a $G$-Tambara functor, we construct the frame $\mathop{RadId}_G(T)$ of radical Tambara ideals and show that its points are the Nakaoka primes. We show that this frame is spatial and coherent, and deduce that the Nakaoka spectrum is a spectral space, recovering a recent result of Chan and Spitz.
Reinforcement learning (RL) has the potential to transform real-world decision-making systems by enabling autonomous agents to learn from experience. Deploying RL in real-world settings, especially in the context of human-robot interaction, requires defining state representations and reward functions, which are critical for learning efficiency and policy performance. Traditional RL approaches often rely on domain expertise and trial-and-error, necessitating extensive human involvement as well as direct interaction with the environment, which can be costly and impractical, especially in complex and safety-critical applications. This work proposes a novel RL framework that leverages off-policy evaluation (OPE) for state space and reward function selection, using only logged interaction data. This approach eliminates the need for real-time access to the environment or human-in-the-loop feedback, greatly reducing the dependency on costly real-time interactions. The proposed approach systematically evaluates multiple candidate state representations and reward functions by training offline RL agents and applying OPE to estimate policy performance. The optimal state space and reward funct
Human-robot interaction (HRI) evaluation relies almost exclusively on human-completed questionnaires, leaving the robot's perspective unexamined. We propose an \textit{inverted evaluation}, in which LLM-powered robots complete the same standardized instruments from their own perspective, and test whether these ratings agree with human ground truth. In Study~1, five LLMs completed HRI-CUES, Godspeed, and RoSAS questionnaires for 25~interactions ($N = 1{,}522$ evaluations) from the HRI-CUES dataset. LLMs achieved moderate-to-strong agreement on engagement dimensions (satisfaction $r$ up to $.65$ and enjoyment $r$ up to $.72$) with excellent test-retest reliability (ICC $\geq .82$), but \textit{systematically inverted} the comfort/strangeness dimension ($r = -.44$ to $-.67$, all $p < .05$), conflating engagement with comfort. In Study~2, a Nao robot running Claude~Sonnet~4.5 replicated these patterns in live interactions ($N = 4$), including real-time turn-by-turn assessment. The strangeness failure persisted across five models, synthetic controls, and embodied deployment for two participants. We argue that current LLM-based robots lack access to the internal affective states neede
To any essentially small tensor-triangulated category $\mathcal{K}$ and Thomason subset $Y \subseteq \mathrm{Spc}(\mathcal{K})$ we associate a ringed space $(\mathrm{Spf}(\mathcal{K},Y), \mathcal{O}_{\mathrm{Spf}(\mathcal{K},Y)}),$ called the formal spectrum of $(\mathcal{K},Y)$. We establish basic properties of this construction and compute it in several examples from algebraic geometry, chromatic homotopy theory, equivariant homotopy theory, and modular representation theory.
Demanding task environments (e.g., supervising a remotely piloted aircraft) require performing tasks quickly and accurately; however, periods of low and high operator workload can decrease task performance. Intelligent modulation of the system's demands and interaction modality in response to changes in operator workload state may increase performance by avoiding undesirable workload states. This system requires real-time estimation of each workload component (i.e., cognitive, physical, visual, speech, and auditory) to adapt the correct modality. Existing workload systems estimate multiple workload components post-hoc, but few estimate speech workload, or function in real-time. An algorithm to estimate speech workload and mitigate undesirable workload states in real-time is presented. An analysis of the algorithm's accuracy is presented, along with the results demonstrating the algorithm's generalizability across individuals and human-machine teaming paradigms. Real-time speech workload estimation is a crucial element towards developing adaptive human-machine systems.
We introduce a notion of stratification for rigidly-compactly generated tensor-triangulated categories relative to the homological spectrum and develop the fundamental features of this theory. In particular, we demonstrate that it exhibits excellent descent properties. In conjunction with Balmer's Nerves of Steel conjecture, we conclude that stratification admits a general form of descent. This gives a uniform treatment of several recent stratification results and provides a complete answer to the question: When does stratification descend? As a new application, we extend earlier work on the tensor triangular geometry of equivariant module spectra from finite groups to compact Lie groups.
We present the development of a new astrochemical research tool HILTRAC, the Highly Instrumented Low Temperature ReAction Chamber. The instrument is based on a pulsed form of the CRESU (Cinétique de Réaction en Écoulement Supersonique Uniforme, meaning reaction kinetics in a uniform supersonic flow) apparatus, with the aim of collecting kinetics and spectroscopic information on gas phase chemical reactions important in interstellar space or planetary atmospheres. We discuss the apparatus design and its flexibility, the implementation of pulsed laser photolysis followed by laser induced fluorescence (PLP-LIF), and the first implementation of direct infrared frequency comb spectroscopy (DFCS) coupled to the uniform supersonic flow. Achievable flow temperatures range from 32(3) - 111(9) K, characterising a total of five Laval nozzles for use with N2 and Ar buffer gases by pressure impact measurements. These results were further validated using LIF and DFCS measurements of the CH radical and OCS, respectively. Spectroscopic constants and linelists for OCS are reported for the 1001 band near $2890 - 2940 cm^{-1}$ for both $OC^{32}S$ and $OC^{34}S$, measured using DFCS. Additional peaks
We prove a thick subcategory theorem for the category of $d$-excisive functors from finite spectra to spectra. This generalizes the Hopkins-Smith thick subcategory theorem (the $d=1$ case) and the $C_2$-equivariant thick subcategory theorem (the $d=2$ case). We obtain our classification theorem by completely computing the Balmer spectrum of compact $d$-excisive functors. A key ingredient is a non-abelian blueshift theorem for the generalized Tate construction associated to the family of non-transitive subgroups of products of symmetric groups. Also important are the techniques of tensor triangular geometry and striking analogies between functor calculus and equivariant homotopy theory. In particular, we introduce a functor calculus analogue of the Burnside ring and describe its Zariski spectrum à la Dress. The analogy with equivariant homotopy theory is strengthened further through two applications: We explain the effect of changing coefficients from spectra to ${\mathrm{H}\mathbb{Z}}$-modules and we establish a functor calculus analogue of transchromatic Smith-Floyd theory as developed by Kuhn-Lloyd. Our work offers a new perspective on functor calculus which builds upon the previ
We prove a version of Quillen's stratification theorem in equivariant homotopy theory for a finite group $G$, generalizing the classical theorem in two directions. Firstly, we work with arbitrary commutative equivariant ring spectra as coefficients, and secondly, we categorify it to a result about equivariant modules. Our general stratification theorem is formulated in the language of equivariant tensor-triangular geometry, which we show to be tightly controlled by the non-equivariant tensor-triangular geometry of the geometric fixed points. We then apply our methods to the case of Borel-equivariant Lubin--Tate $E$-theory $\underline{E_n}$, for any finite height $n$ and any finite group $G$, where we obtain a sharper theorem in the form of cohomological stratification. In particular, this provides a computation of the Balmer spectrum as well as a cohomological parametrization of all localizing $\otimes$-ideals of the category of equivariant modules over $\underline{E_n}$, thereby establishing a finite height analogue of the work of Benson, Iyengar, and Krause in modular representation theory.
We investigate to what extent we can descend the classification of localizing, smashing and thick ideals in a presentably symmetric monoidal stable $\infty$-category $\mathscr{C}$ along a descendable commutative algebra $A$. We establish equalizer diagrams relating the lattices of localizing and smashing ideals of $\mathscr{C}$ to those of $\mathrm{Mod}_{A}(\mathscr{C})$ and $\mathrm{Mod}_{A\otimes A}(\mathscr{C})$. If $A$ is compact, we obtain a similar equalizer for the lattices of thick ideals which, via Stone duality, yields a coequalizer diagram of Balmer spectra in the category of spectral spaces. We then give conditions under which the telescope conjecture and stratification descend from $\mathrm{Mod}_{A}(\mathscr{C})$ to $\mathscr{C}$. The utility of these results is demonstrated in the case of faithful Galois extensions in tensor triangular geometry.
We prove that a jointly conservative family of geometric functors between rigidly-compactly generated tensor triangulated categories induces a surjective map on Balmer spectra. From this we deduce a fiberwise criterion for Balmer's comparison map to be a continuous bijection. This gives short alternative proofs of the Hopkins--Neeman theorem and its generalization, due to Lau, to the case of a finite group acting trivially on an affine scheme.
Fluent human-robot collaboration requires a robot teammate to understand, learn, and adapt to the human's psycho-physiological state. Such collaborations require a computing system that monitors human physiological signals during human-robot collaboration (HRC) to quantitatively estimate a human's level of comfort, which we have termed in this research as comfortability index (CI) and uncomfortability index (unCI). Subjective metrics (surprise, anxiety, boredom, calmness, and comfortability) and physiological signals were collected during a human-robot collaboration experiment that varied robot behavior. The emotion circumplex model is adapted to calculate the CI from the participant's quantitative data as well as physiological data. To estimate CI/unCI from physiological signals, time features were extracted from electrocardiogram (ECG), galvanic skin response (GSR), and pupillometry signals. In this research, we successfully adapt the circumplex model to find the location (axis) of 'comfortability' and 'uncomfortability' on the circumplex model, and its location match with the closest emotions on the circumplex model. Finally, the study showed that the proposed approach can estim