activity
20222025
most citedWeisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.SE2025

Leveraging Code Cohesion Analysis to Identify Source Code Supply Chain Attacks

Maor Reuben, Ido Mendel, Or Feldman +3

Supply chain attacks significantly threaten software security with malicious code injections within legitimate projects. Such attacks are very rare but may have a devastating impac…

cs.LG2025

Revisiting Node Affinity Prediction in Temporal Graphs

Or Feldman, Krishna Sri Ipsit Mantri, Moshe Eliasof +1

Node affinity prediction is a common task that is widely used in temporal graph learning with applications in social and financial networks, recommender systems, and more. Recent w…

cs.LG2025

FLASH: Flexible Learning of Adaptive Sampling from History in Temporal Graph Neural Networks

Or Feldman, Krishna Sri Ipsit Mantri, Carola-Bibiane Schönlieb +2

Aggregating temporal signals from historic interactions is a key step in future link prediction on dynamic graphs. However, incorporating long histories is resource-intensive. Henc…

cs.LG2023

Leveraging Temporal Graph Networks Using Module Decoupling

Or Feldman, Chaim Baskin

Modern approaches for learning on dynamic graphs have adopted the use of batches instead of applying updates one by one. The use of batches allows these techniques to become helpfu…

cs.LG2022★ 1 cited

Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings

Or Feldman, Amit Boyarski, Shai Feldman +3

Graph isomorphism testing is usually approached via the comparison of graph invariants. Two popular alternatives that offer a good trade-off between expressive power and computatio…