Time series databases store billions of points, yet answering natural-language shape queries like "plunge and then recover quickly" remains hard because large language models must bridge free-form language to raw numeric windows. TT-SAX proposes a minimal redesign of SAX that adds a second track of trend letters measured across neighboring segments, letting an LLM compile shape queries into regular expressions that can be matched efficiently at database scale. The paper is significant because it reframes symbolization design around LLM usability rather than classical distance or compression metrics.

Industrial organizations struggle to govern structured telemetry and unstructured documentation together because the work relies on scarce domain experts. The paper proposes contestable governance: specialist AI agents generate scored, cited arguments for metadata decisions, human stewards review and intervene before anything is committed, and an append-only record preserves full lineage. This design aims to stop unreviewed agent errors from propagating into downstream systems while making human oversight attributable and auditable.

Time series anomaly detection benchmarks traditionally optimize for detection accuracy while neglecting explainability and interpretability. This paper introduces SHAD, a real-world benchmark comprising 215 high-dimensional multivariate time series collected from distributed cloud storage systems, complete with per-dimension labels and rich semantic annotations. The authors evaluate 18 detection algorithms, probe spatial attribution for explainability, and test frozen LLMs for interpretability, demonstrating that accurate detection does not guarantee diagnostic utility and that zero-shot semantic interpretation remains largely unresolved.

STEER attacks the high inference cost of relational foundation models by shrinking their graph-sampled context using schema semantics instead of random dropping. The approach prompts an LLM once per task to rank foreign-key edges into relevance tiers, then probabilistically steers neighborhood traversal during sampling. Evaluated on RelBench across three state-of-the-art RFMs, it cuts average context size by about 40% while maintaining or slightly improving accuracy, offering a practical, model-agnostic optimization.

JoinGR attacks a real bottleneck in Text-to-SQL pipelines: dense retrievers rank tables independently and miss ones only identifiable through multi-hop join relationships. The method builds a column-level join graph with typed intra-table and foreign-key edges, selects semantic anchor tables via dense similarity, then propagates query-conditioned relevance deposits along edges using a lightweight learned scorer. Final table scores aggregate these deposits, making schema structure a first-class retrieval signal rather than an afterthought, which matters most for enterprise settings with cryptic table names and implicit relational dependencies.

The paper tackles the 'semantic parsing burden'—the effort required to translate natural language into structured RDF/OWL representations for knowledge graphs. It proposes the Semantic Ladder, a five-level framework ($L_1$ to $L_5$) enabling progressive formalization from raw text snippets to higher-order logic. By introducing Rosetta Statements as semantic anchors and emphasizing modular semantic units, the work aims to lower barriers to knowledge graph construction while maintaining semantic continuity.

CataractSAM-2 adapts Meta's Segment Anything Model 2 (SAM-2) for real-time semantic segmentation in cataract surgery videos. The core idea is to fine-tune only the prompt encoder and mask decoder while freezing the image encoder, enabling precise segmentation of anatomical structures and surgical instruments under challenging conditions like glare and occlusion. The paper also introduces an interactive annotation framework that propagates sparse user prompts across video frames to accelerate ground-truth generation.