Papers › Once Upon a Time in Graph: Relative-Time Pretraining for Complex Temporal Reasoning

Once Upon a Time in Graph: Relative-Time Pretraining for Complex Temporal Reasoning

23 Oct 2023arXiv:2310.14709archive 2025-07-28

Sen yang, Xin Li, Lidong Bing, Wai Lam

Our physical world is constantly evolving over time, rendering challenges for pre-trained language models to understand and reason over the temporal contexts of texts. Existing work focuses on strengthening the direct association between a piece of text and its time-stamp. However, the knowledge-time association is usually insufficient for the downstream tasks that require reasoning over temporal dependencies between knowledge. In this work, we make use of the underlying nature of time, all temporally-scoped sentences are strung together through a one-dimensional time axis, and suggest creating a graph structure based on the relative placements of events along the time axis. Inspired by the graph view, we propose RemeMo (Relative Time Modeling), which explicitly connects all temporally-scoped facts by modeling the time relations between any two sentences. Experimental results show that RemeMo outperforms the baseline T5 on multiple temporal question answering datasets under various settings. Further analysis suggests that RemeMo is especially good at modeling long-range complex temporal dependencies. We release our code and pre-trained checkpoints at this url (https://github.com/DAMO-NLP-SG/RemeMo).

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 11 samples from 1 repository, 7 ran (7 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

damo-nlp-sg/rememo officialmentioned in papermentioned on GitHubpytorchMITSyntology: 11 samples, 7 ran (0 instrument-failed) · 4 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

7ran
4unverified

Licence: 2 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. For 2 of them, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from damo-nlp-sg/rememo. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

damo-nlp-sg/rememo official repository 11 samples, 7 ran (0 instrument-failed) · 4 unverified
compute_input_and_target_lengths in 5 papers src/pretrain_t5/run_seq2seq.py ran MIT (permissive) · 69550b5d230761f5 · report fixture: signature inputs_length:int/0/int, noise_density:float/0/float, mean_noise_span_length:float/0/float · returned tuple · level recorded 2026-09-24
covert_date_to_text src/pretrain_t5/generate_date_text.py ran MIT (permissive) · 7500c3f837580431 · report fixture: signature year:int/0/int, month:int/0/int, day:int/0/int · returned str · level recorded 2026-09-24
date_format_transform src/pretrain_t5/generate_date_text.py ran fingerprinted MIT (permissive) · 4e246616d6a7f5e8 · report fixture: signature date:int/0/int · returned str · level recorded 2026-09-24
date_format_transform src/pretrain_t5/t5_dataset.py ran MIT (permissive) · dba56fa83a4729f4 · report fixture: signature date_tuple:tuple/1/str · returned tuple · level recorded 2026-09-24
shift_tokens_right in 49 papers
census: 9 implementations from 11 papers, 3 distinct outputs on one shared input
src/pretrain_t5/data_collator_for_t5.py ran MIT (permissive) · 221d15006e945daa · report fixture: signature input_ids:ndarray/2/int, pad_token_id:int/0/int, decoder_start_token_id:int/0/int · returned ndarray · level recorded 2026-09-24
time_gap_to_label src/pretrain_t5/t5_dataset.py ran fingerprinted MIT (permissive) · a06f7e78a244046e · report fixture: signature time_gap:int/0/int, threshold:int/0/int · returned int · level recorded 2026-09-24
time_scale_to_label src/pretrain_t5/t5_dataset.py ran MIT (permissive) · b0c08ae410f3b5ce · report fixture: signature time_gap_a:float/0/float, time_gap_b:float/0/float · returned int · level recorded 2026-09-24
generate_random_date_inside_span src/pretrain_t5/generate_date_text.py unverified MIT (permissive) · 871891cce8847d7f · report
get_optimizer in 228 papers src/pretrain_t5/optimizer.py unverified MIT (permissive) · caead9af98f52f4b · report
postprocess_qa_predictions in 10 papers src/odqa_t5/utils_qa.py unverified MIT (permissive) here; the stored copy is pointer only · ac56d3e7b79dbc18 · report
postprocess_qa_predictions_with_beam_search in 10 papers src/odqa_t5/utils_qa.py unverified MIT (permissive) here; the stored copy is pointer only · 8c51f5aaf2f659e2 · report

Tasks

Question Answering

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdafactorAttentionAttention DropoutBPEDense ConnectionsDropoutGated Linear UnitInverse Square Root ScheduleLayer NormalizationLinear LayerMulti-Head AttentionResidual ConnectionSentencePieceSoftmaxT5

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections