Structural understanding of natural language requires explicit recovery of internal meaning structures (entities, facts, nested relations), yet current structural-analytic tasks are fragmented by inconsistent task requirements across datasets.We investigate the problem of robust cross-task structural understanding under heterogeneous requirements across structural-analytic tasks and outline a perspective called Analytic NLP in which tasks can be reformulated into a representation-thendecision paradigm.In this paper, we suggest a solution for the representation layer, called Lingua-Graph, which explicitly captures entities, facts, and relations.By representing predictions as explicit graphs with labeled nodes and edges, Lingua-Graph also improves interpretability, enabling transparent inspection and error analysis of intermediate meaning structures.We construct a labeled Lingua-Graph dataset and train a baseline parser.Experiments show that Lingua-Graph provides substantially higher entity-structure hostability than alternative representations on average, and OpenIE systems based on Lingua-Graph achieve superior performance on three benchmarks, demonstrating that better intermediate structures translate into downstream gains.The data, code and the trained model are publicly released at https://github.com/rudaoshi/Lingua.

Rumor blocking approaches in social networks aim to identify a small set of counter-rumor seed nodes and compete with rumor cascades to quickly stop the propagation of rumors. However, current rumor blocking methods assume complete knowledge of rumor node positions, which is often unattainable in real-world scenarios. In this paper, we introduce the concept of Uncertainty Rumor Blocking, where we address the uncertainty surrounding rumor node locations by considering a set of suspicious nodes, each associated with a probability indicating the likelihood of rumor propagation. As traditional node selection algorithms become inadequate under uncertain conditions, we propose a Graph Neural Network-based Inverse Reinforcement Learning (G-IRL) approach to effectively select counter-rumor seed nodes. Through comprehensive experimentation on three datasets, we demonstrate the consistent superiority of our G-IRL over state-of-the-art baseline methods for node selection in the context of uncertainty rumor containment.

The oracle bone inscription (OBI) recognition plays a significant role in understanding the history and culture of ancient China. However, the existing OBI datasets suffer from a long-tail distribution problem, leading to biased performance of OBI recognition models across majority and minority classes. With recent advancements in generative models, OBI synthesis-based data augmentation has become a promising avenue to expand the sample size of minority classes. Unfortunately, current OBI datasets lack large-scale structure-aligned image pairs for generative model training. To address these problems, we first present the Oracle-P15K, a structure-aligned OBI dataset for OBI generation and denoising, consisting of 14,542 images infused with domain knowledge from OBI experts. Second, we propose a diffusion model-based pseudo OBI generator, called OBIDiff, to achieve realistic and controllable OBI generation. Given a clean glyph image and a target rubbing-style image, it can effectively transfer the noise style of the original rubbing to the glyph image. Extensive experiments on OBI downstream tasks and user preference studies show the effectiveness of the proposed Oracle-P15K dataset and demonstrate that OBIDiff can accurately preserve inherent glyph structures while transferring authentic rubbing styles effectively. The dataset, code, and pre-trained models are available at https://github.com/LJHolyGround/Oracle-P15K.