Papers › Improving Temporal Link Prediction via Temporal Walk Matrix Projection

Improving Temporal Link Prediction via Temporal Walk Matrix Projection

5 Oct 2024arXiv:2410.04013archive 2025-07-28

Xiaodong Lu, Leilei Sun, Tongyu Zhu, Weifeng Lv

Temporal link prediction, aiming at predicting future interactions among entities based on historical interactions, is crucial for a series of real-world applications. Although previous methods have demonstrated the importance of relative encodings for effective temporal link prediction, computational efficiency remains a major concern in constructing these encodings. Moreover, existing relative encodings are usually constructed based on structural connectivity, where temporal information is seldom considered. To address the aforementioned issues, we first analyze existing relative encodings and unify them as a function of temporal walk matrices. This unification establishes a connection between relative encodings and temporal walk matrices, providing a more principled way for analyzing and designing relative encodings. Based on this analysis, we propose a new temporal graph neural network called TPNet, which introduces a temporal walk matrix that incorporates the time decay effect to simultaneously consider both temporal and structural information. Moreover, TPNet designs a random feature propagation mechanism with theoretical guarantees to implicitly maintain the temporal walk matrices, which improves the computation and storage efficiency. Experimental results on 13 benchmark datasets verify the effectiveness and efficiency of TPNet, where TPNet outperforms other baselines on most datasets and achieves a maximum speedup of 33.3 × compared to the SOTA baseline. Our code can be found at https://github.com/lxd99/TPNet.

PaperPDFCodeCode Syntology ranMethod as code

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 12 code samples harvested from 1 repository linked to this paper: 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: official repository: 12 samples from 1 repository, 8 ran (6 with no instrument failure; 2 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 between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

lxd99/tpnet officialmentioned in paperpytorchMITSyntology: 12 samples, 8 ran (2 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

12 samples harvested: 8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 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 last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · our draft was wrong
1ran; the contract check could not run
6ran
4unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from lxd99/tpnet. “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.

lxd99/tpnet official repository 12 samples, 8 ran (2 instrument-failed) · 4 unverified
FeedForwardNet models/TPNet.py ran · metamorphic tier: invariant MIT (permissive) · b949112ded585c96 · report fixture: signature x:Tensor/2/float · returned Tensor · level recorded 2026-09-22
MLPMixer in 6 papers models/TPNet.py ran · metamorphic tier: invariant MIT (permissive) · 0783ca0f8dd2b03d · report fixture: signature input_tensor:Tensor/3/float · returned Tensor · level recorded 2026-09-22
RandomProjectionModule models/TPNet.py ran MIT (permissive) · 061020737965193c · report fixture: signature src_node_ids:ndarray/1/int, dst_node_ids:ndarray/1/int, node_interact_times:ndarray/1/float · returned NoneType · level recorded 2026-09-24
TimeEncoder in 7 papers models/TPNet.py ran · metamorphic tier: invariant fingerprinted MIT (permissive) · 0c789edc2dc5688c · report fixture: signature timestamps:Tensor/2/float · returned Tensor · level recorded 2026-09-22
compute_src_dst_node_time_shifts in 6 papers models/MemoryModel.py ran MIT (permissive) · 727d90514a9a5475 · report fixture: signature src_node_ids:ndarray/1/int, dst_node_ids:ndarray/1/int, node_interact_times:ndarray/1/float · returned tuple · level recorded 2026-09-24
edge_bank_time_window_memory in 6 papers models/EdgeBank.py ran MIT (permissive) · 1de6e005e59cdf96 · report fixture: signature history_src_node_ids:ndarray/1/int, history_dst_node_ids:ndarray/1/int, history_node_interact_times:ndarray/1/float, time_window_mode:str/0/str, time_window_proportion:float/0/float · returned set · level recorded 2026-09-24
edge_bank_unlimited_memory in 8 papers models/EdgeBank.py ran · our draft was wrong MIT (permissive) · 0f56e3ae8a152b2b · report fixture: signature history_src_node_ids:ndarray/1/int, history_dst_node_ids:ndarray/1/int · returned set · level recorded 2026-09-24
predict_link_probabilities in 6 papers models/EdgeBank.py ran; the contract check could not run (RAISES) MIT (permissive) · 8bcef3dc22f0489a · report fixture: signature edge_memories:set/0/?, edges_tuple:tuple/1/list · returned ndarray · level recorded 2026-09-24
NeighborSampler models/TPNet.py unverified MIT (permissive) · 0c735a99a03bbb86 · report
TPNet models/TPNet.py unverified MIT (permissive) · a6c3b6089e63786c · report
TPNetEmbedding models/TPNet.py unverified MIT (permissive) · c849574271a0c04e · report
get_layer_type models/NAT.py unverified MIT (permissive) · 7878b72c4ebda48a · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for TPNet (graph method: TPNet). 7 bricks; individually on a fixture: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified. The assembly has not been run end-to-end.

  1. TPNet entry · level 0 · unverified · a6c3b6089e63786c
  2. NeighborSampler sampler · level 0 · unverified · 0c735a99a03bbb86
  3. RandomProjectionModule model · level 1 · ran · 061020737965193c
  4. TPNetEmbedding model · level 0 · unverified · c849574271a0c04e
  5. TimeEncoder helper · level 1 · ran · 0c789edc2dc5688c
  6. MLPMixer model · level 1 · ran · 0783ca0f8dd2b03d
  7. FeedForwardNet model · level 1 · ran · b949112ded585c96

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2410.04013") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Computational EfficiencyGraph Neural NetworkLink Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Graph Neural Network

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