Skip to content

GraphLit: Learning Text-Enriched Dynamic Character Network Representations for Literary Study

May 2026 · arXiv.org · Vol abs/2605.28643 · 1 citation · 68 references
Computer Science

TL;DR

Dynamic Heterogeneous Character Networks are introduced, which organize long novels into temporally localized heterogeneous graphs that align characters with their textual contexts, and GraphLit is proposed, a self-supervised learning framework that learns rich literary representations through a masked graph autoencoder objective.

Abstract

Methods to represent literary texts as graphs or sequences of graphs mainly focus on representing character interactions, and often overlook another crucial aspect: the textual context in which characters interact. We introduce Dynamic Heterogeneous Character Networks (DHCNs), which organize long novels into temporally localized heterogeneous graphs that align characters with their textual contexts. We extract around 20,000 DHCNs from Project Gutenberg, and propose GraphLit, a self-supervised learning framework that learns rich literary representations through a masked graph autoencoder objective. Across a wide range of 12 character-related tasks, GraphLit improves over text-only, graph-only and prior hybrid baselines. Ablations over different kinds of dynamic graph structures and architectural elements show that grounding characters in their context is the main performance driver, while explicitly encoding narrative order and character relationships provide task-dependent improvements. Finally, we demonstrate the applicability of DHCNs and GraphLit for literary analysis by studying the link between narrative non-linearity and dynamic social features.

View source

Similar papers

Book Open access Aug 2026

A Comprehensive Benchmark for Graph Textual Summarization

This paper develops a comprehensive benchmark construction framework and constructs three diverse benchmark datasets and proposes a unified evaluation framework that assesses both linguistic quality and factual consistency, providing a comprehensive approach to evaluating generated summaries for content fidelity and ac...

Xiaoxuan Gou, Weiguo Zheng, Han-Qing Guo et al. · 0 citations
Preprint Aug 2026

TAHB: A Comprehensive Benchmark for Text-Attributed Hypergraph Learning

TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-base...

D. Y. Kang, Junghyun Kim, Ju-hyun Jeon et al. · 0 citations
Book Open access Aug 2026

Continual-GraphLLM: Dynamic Graph Large Language Model with Invariance Regularized Adaptive Multi-Scale Experts

A novel Continual Learning Dynamic Graph LLM framework (Continual-GraphLLM) is proposed to continually adapt to incoming patterns by routing them to experts specialized in similar past patterns, while mitigating the overwriting of previously learned patterns by assigning new experts to unseen patterns.

Tianhang Wan, Xin Wang, Haibo Chen et al. · 0 citations
#machine learning Preprint Sep 2026

TemporalGraphLLM: Temporal Graph Neural Networks with Large Language Models for Dynamic Text-Attributed Graphs

Dynamic text-attributed graphs (DTAGs), where nodes, edges, and textual attributes evolve over time, are crucial in applications such as social networks, citation graphs, and knowledge graphs. However, existing approaches struggle to jointly model the temporal evolution of graph structures and the semantic richness of...

Moran Beladev, Orly Eitan, Gilad Katz et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.