Challenge: Historical research often focuses on finding exact record for a specific regnal month . classical Chinese sources are a canonical example of evidence-centric retrieval .
Approach: They propose a time-keyed retrieval benchmark that organizes records by month-level reign keys . they propose 'CTD', a dual-encoder that combines absolute context with offset biasing .
Outcome: The proposed benchmark organizes records by month-level reign keys and includes chrono-near confounders that mimic real retrieval failures.

Similar Papers

Re3: Relevance & Recency Retrieval for Mitigating Temporal Hallucination (2026.acl-long)

Copied to clipboard

Challenge: Existing retrievers suffer from temporal-semantic misalignment and outdated-document interference . Existing frameworks suffer from both temporal validity and outdated factual versions .
Approach: They propose a framework that mitigates temporal hallucinations by embedding heterogeneous temporal signals into the semantic space to ensure retrieval fidelity.
Outcome: Experiments show that Re3 outperforms baselines by 9.7% in generation accuracy . the framework outperformed strongest baselines on challenging dynamic tasks .
Benchmarking Temporal Reasoning and Alignment Across Chinese Dynasties (2026.eacl-short)

Copied to clipboard

Challenge: Existing temporal reasoning benchmarks rely on rule-based construction and lack contextual depth . a recent study found existing LLMs struggle with nuanced temporal understanding .
Approach: a benchmark is designed to evaluate LLMs on temporal reasoning in Chinese dynasties.
Outcome: a new benchmark evaluates LLMs on temporal reasoning across Chinese dynasties . it emphasizes cross-entity relationships, pairwise temporal alignment, contextualized and culturally-grounded reasoning . results show existing LLM benchmarks struggle with nuanced temporal understanding .
QuCo-RAG: Quantifying Uncertainty from the Pre-training Corpus for Dynamic Retrieval-Augmented Generation (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for reducing LLM hallucinations rely on model-internal signals . Existing approaches rely only on model internal signals, resulting in unreliability .
Approach: They propose a method that shifts from subjective confidence to objective statistics . they leverage Infini-gram for millisecond-latency queries over 4 trillion tokens .
Outcome: The proposed method reduces hallucinations in large language models by reducing uncertainty in the model.
Temporal Referential Consistency: Do LLMs Favor Sequences Over Absolute Time References? (2025.emnlp-main)

Copied to clipboard

Challenge: Existing efforts to ensure temporal consistency in large language models are lacking in time-sensitive fields . temporal reasoning is essential for time- sensitive fields such as finance and healthcare . a new benchmark aims to improve temporal referent consistency of LLMs .
Approach: They propose a temporal referential consistency benchmark with a resource TEMP-ReCon to assess LLMs across temporal references.
Outcome: The proposed model improves LLMs' temporal consistency by comparing them to baseline models.
Systems’ Agreements and Disagreements in Temporal Processing: An Extensive Error Analysis of the TempEval-3 Task (L18-1)

Copied to clipboard

Challenge: Temporal Processing systems are crucial for timelines and storylines . TempEval-3 is the latest evaluation campaign on open-domain TP in english .
Approach: They present a Temporal Processing system that incorporates high level lexical semantic features and uses them to evaluate temporal relation classification.
Outcome: The proposed system achieves the best scores for event detection and temporal relation classification from raw text, but the errors are not as robust as previous systems.
Temporal-Aware Soft Prompt Tuning for Automatic Text Dating (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for automatic text dating overlook the evolution of word meanings in texts spanning long periods.
Approach: They propose a temporal-aware text representation that dynamically captures both semantic variance and invariance.
Outcome: The proposed approach outperforms existing methods on two diachronic datasets.
Benchmarking and Enabling Efficient Chinese Medical Retrieval via Asymmetric Encoders (2026.acl-long)

Copied to clipboard

Challenge: Effective medical text retrieval requires high accuracy and low latency.
Approach: They propose a benchmark for medical text retrieval in Chinese using a symmetric architecture . CARE is a lightweight encoder with an LLM-based encoder for offline document encoding .
Outcome: The proposed benchmark surpasses state-of-the-art symmetric models on CMedTEB . it matches high retrieval quality without increasing latency, and it performs well on a single GPU .
Beyond Semantics: How Temporal Biases Shapes Retrieval in Transformer and State-Space Models (2026.eacl-long)

Copied to clipboard

Challenge: In-context learning depends on what appears in the prompt and on when it appears.
Approach: They construct prompts with repeated anchor tokens and average their predictions over hundreds of random permutations of the intervening context.
Outcome: The proposed model predicts the same tokens over hundreds of permutations over time.
Decoding the Market’s Pulse: Context-Enriched Agentic Retrieval Augmented Generation for Predicting Post-Earnings Price Shocks (2026.eacl-long)

Copied to clipboard

Challenge: Existing methods for forecasting large stock price movements after corporate earnings calls are prone to **narrative bias** Existing approaches lack temporal-causal reasoning and are unable to predict large stock prices.
Approach: They propose a retrieval-augmented framework that deploys a team of cooperative LLM agents . they retrieve structured evidence from a Causal-Temporal Knowledge Graph built from financial statements and earnings calls .
Outcome: The proposed framework outperforms larger LLMs and fine-tuned models in macro-F1, MCC, and Sharpe for the same forecasting horizon.
diaNED: Time-Aware Named Entity Disambiguation for Diachronic Corpora (P18-2)

Copied to clipboard

Challenge: Named Entity Disambiguation (NED) systems perform well on news articles but quality drops when inputs span long time periods.
Approach: They propose a time-aware method that resolves ambiguities even when mention contexts give only few cues.
Outcome: The proposed method improves on a newly created diachronic corpus.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations