The proliferation of online news poses a challenge to extracting structured timelines from unstructured content. While recent studies have shown that Large Language Models (LLMs) can assist Timeline Summarization (TLS), these approaches primarily treat models as passive generators. The emergence of Large Reasoning Models (LRMs) presents an opportunity to reason over events actively, enabling iterative evidence acquisition, the detection of missing events, and the validation of temporal consistency. To systematically leverage the reasoning capabilities of LRMs, we propose TimelineReasoner, a novel framework that shifts TLS from static generation to an active, reasoning-driven process. Unlike prior work, TimelineReasoner adopts a two-stage framework: Global Cognition, which tracks events at a macroscopic level and continuously updates a global event memory, and Detail Exploration, which identifies informational gaps and refines the timeline via targeted document retrieval. To support this, TimelineReasoner incorporates several specialized mechanisms, including an Event Scraper for retrieving temporal event descriptions, a Timeline Updater for refining the timeline, and a Supervisor for detecting gaps in the timeline and guiding retrieval. Experimental results on open-domain TLS datasets demonstrate that TimelineReasoner significantly outperforms existing LLM-based TLS methods in terms of timeline accuracy, coverage, and coherence. On closed-domain TLS datasets, our method performs on par with or exceeds state-of-the-art approaches. This work not only pushes the boundaries of TLS but also highlights the broader potential of LRM-based reasoning frameworks for timeline summarization.
Figures & tables
Figure 1. Comparison of methods using LLMs for TLS. (a) A method that uses LLMs to generate event nodes and constructs an event graph for timeline derivation via cluster ranking. (b) A framework that employs iterative self-questioning to link events, merging generated sub-timelines into a final output. (c) TimelineReasoner (Ours) : An active, reasoning-driven framework using LRMs. It maintains a dynamic global event memory during Global Cognition and employs an agentic loop for Detail Exploration to iteratively refine the timeline.
Figure 2. Framework of TimelineReasoner. It contains two stages: Global Cognition searches for the news query, uses an LRM to generate global event memory, and dynamically updates it in the later process. Detailed Exploration takes a main reasoning model as the core agent, which is equipped with several specialized mechanisms, Event Scraper, Timeline Updater, and Supervisor, to dynamically refine the timeline memory to obtain the final timeline. The Framework of TimelineReasoner.
January 24, 1984: Unveiling of the Macintosh computer.
November 10, 2001: Introduction of the iPod.
Global Event Memory ξ (Abbreviated):
January 24, 1984: Unveiling of the Macintosh Computer. This event introduced the first mass-market personal computer…November 10, 2001: Introduction of the iPod. This announcement marked Apple’s successful entry into the consumer electronics market….
Table 1. Illustrative example of event metadata and global event memory.
Method
Model
Concat F1
Agree F1
Align F1
Date F1
ROUGE-1
ROUGE-2
ROUGE-1
ROUGE-2
ROUGE-1
ROUGE-2
DIRECT
Qwen2.5-32B
0.2611
0.0587
0.0382
0.0131
0.0408
0.0138
0.1473
QwQ-32B
0.2682
0.0554
0.0457
0.0142
0.0487
0.0152
0.1824
Qwen2.5-72B
0.2908
0.0673
0.0559
0.0188
0.0613
0.0210
0.2102
REWRITE
Qwen2.5-32B
0.2779
0.0620
0.0413
0.0122
0.0447
0.0142
0.1631
QwQ-32B
0.2862
0.0609
0.0527
0.0170
0.0580
0.0179
0.1892
Table 2. Experimental results on Open-TLS. The boldfaced score in each column denotes the best result. And the underlined score marks the second-highest result among the compared methods. Relative improvements (%) of TimelineReasoner over the best baseline are reported in parentheses.
Method
Model
Crisis
T17
Align R-1
Align R-2
Date F1
Align R-1
Align R-2
Date F1
CLUST
0.0610
0.0131
0.2260
0.0822
0.0201
0.4070
EGC
0.0791
0.0149
0.2911
0.1031
0.0239
0.5501
LLM-TLS
Qwen2.5-32B
0.0701
0.0199
0.2732
0.0878
0.0204
0.5157
QwQ-32B
0.0678
0.0189
0.2700
0.0852
0.0178
0.5133
DIRECT
Qwen2.5-32B
0.0162
0.0040
0.0639
0.0537
0.0132
0.3408
Table 3. Closed-domain TLS performance comparison. The boldfaced score indicates the highest result, while the underlined score marks the second-highest result among the compared methods. Relative improvements (%) of TimelineReasoner over the best baseline are reported in parentheses.
Parameter
N
Concat F1
Agree F1
Align F1
Date F1
ROUGE-1
ROUGE-2
ROUGE-1
ROUGE-2
ROUGE-1
ROUGE-2
Ninit
10
0.3333
0.0739
0.0811
0.0260
0.0926
0.0331
0.3336
20
0.3631
0.0884
0.1130
0.0400
0.1233
0.0411
0.3764
30
0.3357
0.0768
0.0966
0.0322
0.1035
0.0358
0.3777
40
0.3434
0.0821
0.0992
0.0346
0.1068
0.0362
0.3535
Nexp
10
0.3361
0.0759
0.0933
0.0277
0.1050
0.0298
0.3352
Table 4. Impact of retrieval scale ( N ) on Open-TLS performance. We evaluate the impact of the number of documents in the Initialization of Global Event Memory ( Ninit ) and the Detailed Exploration ( Nexp ). Bold indicates the best, underlined indicates the second best.
Method
CHRONOS
TimelineReasoner
LLM-TLS
Token
~0.7M
~0.9M
~47M
Performance
0.0295
0.0331
0.0199
Table 5. Comparison of token consumption and performance (Align ROUGE-2) across TLS methods
Method
Concat F1
Agree F1
Align F1
Date F1
ROUGE-1
ROUGE-2
ROUGE-1
ROUGE-2
ROUGE-1
ROUGE-2
Ours
0.363
0.089
0.113
0.040
0.123
0.041
0.376
w/o Update Global Event Memory
0.330
0.073
0.088
0.027
0.095
0.032
0.338
w/o Global Event Memory
0.298
0.055
0.038
0.011
0.045
0.012
0.154
w/o Timeline Updater
0.318
0.075
0.088
0.028
0.094
0.030
0.339
w/o Supervisor
0.338
0.082
0.102
0.036
0.111
0.037
0.360
Table 6. Ablation study conducted on Open-TLS. The boldfaced score indicates the highest result.
LLM
Concat F1
Agree F1
Align F1
Date F1
R-1
R-2
R-1
R-2
R-1
R-2
CHRONOS
QwQ-32B
0.322
0.075
0.090
0.029
0.093
0.029
0.303
Qwen2.5-72B
0.338
0.080
0.096
0.030
0.099
0.033
0.332
DS-V3.2
0.359
0.089
0.097
0.036
0.104
0.038
0.351
Ours
Table 7. Performance comparison under different backbone models on the Open-TLS benchmark. The best and second-best results are in bold and underlined . DS-V3.2 is short for DeepSeek-V3.2.
Reasoning chain of TimelineReasoner
You are a reasoning assistant with the ability to perform web searches to help create an accurate chronological timeline.
…
The event development process:
…
Now, proceed to make the necessary search queries to confirm these points and ensure accuracy.
First, verifying the Mac Studio M2 Ultra’s announcement date:
Table 8. Case study of the process of TimelineReasoner generating a timeline.