C-Unseen is a self‑interpretable framework designed to detect weak signals in Dynamic Temporal Knowledge Graphs (DTKGs). It defines a weak signal as a rare, semantically coherent subgraph that spreads across consecutive snapshots. The system uses a Rare Subgraphs Extractor, where a large language model identifies subgraphs that contrast with the dominant narrative through chain‑of‑thought reasoning, and a Weak Signal Alerter that tracks the persistence of these subgraphs over time to isolate true weak signals, outperforming keyword, topic, and graph‑based baselines.
arXiv:2605. 07121v2 Announce Type: replace Abstract: Temporal knowledge graphs (TKGs) represent time-stamped relational facts and support a wide range of reasoning tasks over evolving events.
arXiv:2603. 11479v3 Announce Type: replace-cross Abstract: Time Series Event Detection (TSED) aims to localize semantically meaningful events in time series data, with critical applications in high-stakes domains.
BERTilda is an explainable framework for tracking topic lifecycles in longitudinal text streams. It discovers topics independently in each time window using an embedding‑based topic model, then links topics across adjacent windows via a temporal graph that uses both semantic similarity and a bidirectional coverage signal derived from tweet‑to‑topic attribution. The graph‑based rules identify continuations, splits, merges, disappearances, and unclear transitions, and the method achieves up to 87% agreement with human annotators on a gold‑standard subset.
arXiv:2604. 12503v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have shown remarkable capabilities across various tasks but remain prone to hallucinations in knowledge-intensive scenarios.
Forecasting scientific relations can guide discovery by identifying promising connections before they emerge. Existing approaches often model concept semantics and graph structure separately or summar...
arXiv:2607. 14770v1 Announce Type: new Abstract: Knowledge graph question generation (KGQG) aims to generate natural-language questions from structured graph evidence.
The paper introduces a time‑aligned evolving concept graph framework that jointly models semantic and structural changes in scientific literature. By treating dated papers as shared update events, it reconstructs both semantic and structural states from the same publication history for each prediction time, and fuses these states at the pair level to forecast co‑occurrence, relation formation, and conditional relation type. Experiments on a large graph of 187,848 papers and 270,687 concepts show that refreshing context with graph updates boosts mean relation AUPRC by 16.6% and raises mean relation AUROC from 0.9290 to 0.9722.
arXiv:2606. 20162v1 Announce Type: new Abstract: Semantic-aware communication has emerged as a transformative paradigm for next-generation communication systems, shifting the fundamental goal from transmitting bit-level symbols to reliably recovering and understanding the semantic meaning of information.
arXiv:2607. 07716v1 Announce Type: cross Abstract: Temporal graphs are ubiquitous in real-world applications and Temporal Graph Networks (TGNs) have achieved superior predictive accuracy.
arXiv:2608. 12441v1 Announce Type: cross Abstract: Deep learning detectors for anomalies in dynamic graphs have reached strong accuracy, yet they remain opaque: when an edge is flagged, the analyst receives a score but no reason.
TTGBench is a new benchmark for temporal graph learning that evaluates both structural evolution and semantic drift in text‑attributed graphs. It includes six real‑world, text‑rich datasets with dual volatility and supports multi‑class and multi‑label temporal node classification, addressing gaps left by existing benchmarks. A comprehensive evaluation of 17 state‑of‑the‑art methods shows a clear divide: TGNNs excel at structural prediction but struggle with semantic tracking, while LLM‑based models perform better on semantic tasks but lag in structural prediction.
arXiv:2509. 09474v2 Announce Type: replace Abstract: We address the task of temporal knowledge graph forecasting with an inherently interpretable method based on symbolic rules.