Demo Data from EDBT 2026 / reviewers in the wild / expert
Himanshu Pal
dblp:397/7123
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Graph learning · 50% Trustworthy machine learning · 50% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network
dynamic graph neural network |
1.0 | 1 | 2026 | LORETTA: A Low Resource Framework to Poison Continuous Time Dynamic Graphs · AAAI 2026 |
Machine learning › Trustworthy machine learning › robustness
poisoning attack defense |
1.0 | 1 | 2026 | LORETTA: A Low Resource Framework to Poison Continuous Time Dynamic Graphs · AAAI 2026 |
Security and privacy of machine learning
adversarial attack |
1.0 | 1 | 2026 | LORETTA: A Low Resource Framework to Poison Continuous Time Dynamic Graphs · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
temporal importance metrics · 2.0negative sampling · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LORETTA: A Low Resource Framework to Poison Continuous Time Dynamic GraphsabstractTemporal Graph Neural Networks (TGNNs) are increasingly used in high-stakes domains, such as financial forecasting, recommendation systems, and fraud detection. However, their susceptibility to poisoning attacks poses a critical security risk. We introduce LoReTTA (Low Resource Two-phase Temporal Attack), a novel adversarial framework on Continuous-Time Dynamic Graphs, which degrades TGNN performance by an average of 29.47% across 4 widely benchmark datasets and 4 State-of-the-Art (SotA) models. LoReTTA operates through a two-stage approach: (1) sparsify the graph by removing high-impact edges using any of the 16 tested temporal importance metrics, (2) strategically replace removed edges with adversarial negatives via LoReTTA’s novel degree-preserving negative sampling algorithm. Our plug-and-play design eliminates the need for expensive surrogate models while adhering to realistic unnoticeability constraints. LoReTTA degrades performance by upto 42.0% on MOOC, 31.5% on Wikipedia, 28.8% on UCI, and 15.6% on Enron. LoReTTA outperforms 11 attack baselines, remains undetectable to 4 leading anomaly detection systems, and is robust to 4 SotA adversarial defense training methods, establishing its effectiveness, unnoticeability, and robustness. Himanshu Pal, Venkata Sai Pranav Bachina, Ankit Gangwal, Charu Sharma |
AAAI | 1 |
| 2025 | Reducing Misclassification Risk in Dynamic Graph Neural Networks Through Abstention
Jayadratha Gayen, Himanshu Pal, Naresh Manwani, Charu Sharma |
ASONAM (2) | 2 |