Pith. sign in

REVIEW 2 cited by

Question Answering Over Temporal Knowledge Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.01515 v1 pith:UN5CUK2X submitted 2021-06-03 cs.LG

classification cs.LG
keywords temporaldatasetkgqagraphsknowledgeansweringareacronkgqa
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Temporal Knowledge Graphs (Temporal KGs) extend regular Knowledge Graphs by providing temporal scopes (start and end times) on each edge in the KG. While Question Answering over KG (KGQA) has received some attention from the research community, QA over Temporal KGs (Temporal KGQA) is a relatively unexplored area. Lack of broad coverage datasets has been another factor limiting progress in this area. We address this challenge by presenting CRONQUESTIONS, the largest known Temporal KGQA dataset, clearly stratified into buckets of structural complexity. CRONQUESTIONS expands the only known previous dataset by a factor of 340x. We find that various state-of-the-art KGQA methods fall far short of the desired performance on this new dataset. In response, we also propose CRONKGQA, a transformer-based solution that exploits recent advances in Temporal KG embeddings, and achieves performance superior to all baselines, with an increase of 120% in accuracy over the next best performing method. Through extensive experiments, we give detailed insights into the workings of CRONKGQA, as well as situations where significant further improvements appear possible. In addition to the dataset, we have released our code as well.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BYOKG-RAG: Multi-Strategy Graph Retrieval for Knowledge Graph Question Answering

    cs.CL 2025-07 reject novelty 6.0 of 10

    BYOKG-RAG combines LLM-generated entities, paths, queries, and candidate answers with multiple graph retrieval tools to answer questions over custom knowledge graphs without training data.

  2. MTPChat: A Multimodal Time-Aware Persona Dataset for Conversational Agents

    cs.CL 2025-02 conditional novelty 6.0 of 10

    MTPChat adds explicit date stamps and synthetic earlier responses to multimodal persona dialogues, defines two temporal retrieval tasks, and reports modest gains from a gated fusion module.

Pith tools