Md Khan, Md Sadek, Hossain Asif, Tanzila Khan
We lifted 7 functions out of this paper's own repositories and ran 6 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| TanzilaKhan1/TSNN-Code | — | 6 of 7 |
| Function | Status | Where it lives |
|---|---|---|
| SheafNeighborAggregation | Ran | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("3d1cdbb2328b5741") |
| TSNNConfig | Ran | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("be75881882bcc8c0") |
| householder_apply | Ran | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("edd8e71174533509") |
| make_mlp | Ran | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("950ac6837947adb3") |
| sinusoidal_time_encoding | Ran | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("225d3d18f1bd8e05") |
| transport_apply | Ran | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("ab55f93a12518853") |
| TSNNCore | Not yet run | TanzilaKhan1/TSNN-Code/tsnn/model.py pointer only (licence: NONE) · get_code("a714286def5aac82") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We introduce Temporal Sheaf Neural Networks (TSNN), a temporal link prediction framework that equips each node with a time-varying orthogonal frame and compares node states only after explicit transport between local coordinate systems. In contrast to existing continuous-time graph models that operate in a shared global embedding space, TSNN models node-specific and evolving interaction semantics through dynamic local frames. The model parameterizes per-node frames via efficient low-rank Householder products, preserves stored hidden states exactly under frame updates, and uses a geometric-residual decoder that anchors predictions on transported distances while learning residual corrections. All computations are strictly causal and use only the pre-event history. We show that the symmetric degree-normalized sheaf Laplacian is orthogonally similar to the symmetric normalized graph Laplacian, with the random-walk normalized form similar in the corresponding degree metric; the full-active, feature-scaled diffusion used by TSNN is exactly a metric-gradient step on the combinatorial sheaf Dirichlet energy, with a degree-free monotone-descent and non-expansiveness guarantee. Frame drift perturbs updates only linearly. Across TGB v2 link-prediction and temporal-heterogeneous leaderboards, together with the DGB benchmark suite, TSNN matches or surpasses the strongest prior methods on most benchmarks, with the largest improvements on graphs exhibiting strong node-role heterogeneity. Ablations confirm the distinct benefit of dynamic frames, orthogonal transport, and geometric-residual decoding. 2 * Equal contribution. 2 Code, configs, and reproduction scripts: https://github.com/TanzilaKhan1/TSNN-Code.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2606.10071")
get_code_for_paper("2606.10071")
have("2606.10071")
Connect an agent — have() is free.