GraphLit introduces Dynamic Heterogeneous Character Networks (DHCNs) that structure long novels into temporally localized graphs aligning characters with their textual contexts. Using a masked graph autoencoder, GraphLit learns rich literary representations and outperforms text-only, graph-only, and prior hybrid baselines on 12 character-related tasks. Ablation studies show that grounding characters in context is the primary performance driver, while narrative order and character relationships offer task-dependent gains, and the framework is applied to analyze the link between narrative non-linearity and dynamic social features.
arXiv:2607. 20477v1 Announce Type: new Abstract: {\em Text-Attributed Graphs} (TAGs) have emerged as an expressive data model for integrating graph topology with rich textual semantics.
arXiv:2607. 00052v1 Announce Type: cross Abstract: GraphRAG is an extension of retrieval-augmented generation (RAG) that supports large language models (LLMs) by referring to graph-structured data as external knowledge.
The paper introduces Critic's Eye, a method for computational motif discovery that models a play as a heterogeneous Narrative Topology Graph and performs discriminative inference over global structural evidence. It achieves 84.8% Hit@5 on a benchmark, nearly quadrupling the performance of large foundation models such as Gemini-3-pro-preview. The authors argue that explicit structural priors outperform mere parameter scaling for decoding the complex architecture of long‑form literature.
arXiv:2609.07107v1 Announce Type: new Abstract: Micro-dramas, characterized by ultra-short durations and hyper-dense storylines, pose unique challenges for video understanding that conventional bench...
arXiv:2506. 02568v2 Announce Type: replace Abstract: Large Language Models (LLMs) have demonstrated substantial efficacy in advancing graph-structured data analysis.
arXiv:2606. 31166v1 Announce Type: cross Abstract: Text-attributed graphs (TAGs), where each node carries a natural language description, require models to jointly reason over text and graph topology.
FRAGMENT is a two‑stage generative framework that models documents as typed relational graphs, factorizing the joint distribution into structure and content components. The first stage, the Architect, uses a causally masked Transformer to autoregressively generate graph topology and spatial relations, while the second stage, the Builder, employs a GATv2-based graph attention network to add bounding boxes, text, and visual style attributes. The framework provides explicit likelihood models for anomaly scoring and supports prompt‑conditioned, entity‑aware editing via cross‑attention.
HeTGB is a new benchmark for heterophilic text‑attributed graphs, consisting of five real‑world datasets where nodes have rich textual descriptions. It allows systematic evaluation of graph neural networks, pre‑trained language models, and co‑training methods on node classification. The benchmark highlights the utility of text attributes, the challenges of heterophilic TAGs, and the limitations of current models.
Bridge-LP is a new framework for link prediction on text‑attributed graphs that combines Graph Neural Networks and Language Models. It introduces three design components: jumping connections for robust language model training, compressed embeddings to encode neighborhood information, and a cache embedding strategy to reduce computational cost. Experiments on nine datasets show that Bridge‑LP outperforms 40 existing models, achieving up to a 43.06% improvement in Mean Reciprocal Rank.
arXiv:2606. 10461v1 Announce Type: cross Abstract: Text-attributed Graphs (TAGs) incorporate textual node attributes with graph structures to describe rich relational semantics.
arXiv:2608. 15055v1 Announce Type: new Abstract: Hypergraphs effectively model higher-order groupwise relationships beyond pairwise interactions, while pretrained language models (PLMs) and large language models (LLMs) provide rich semantic understanding from textual attributes.
NS-ST-GraphRAG is a neuro‑symbolic spatio‑temporal GraphRAG framework designed to process long‑form literary narratives by integrating ontology‑guided extraction, deterministic constraint checking, dual temporal coordinates, spatial scene attributes, and dynamic sub‑graph retrieval. It selects the appropriate graph state based on the temporal and spatial scope of a query, grounding generated answers in traceable evidence. The authors also introduce Red‑Chamber‑QA, an open multi‑hop question‑answering benchmark for classical Chinese literature, and report that NS‑ST‑GraphRAG outperforms a frozen‑window baseline and a closed‑book model on a held‑out 120‑question split.