EDBT 2026 Demo / reviewers in the wild / expert
Sidharth Agarwal
dblp:317/0618
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0007-9838-125XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.
| Network and information security
1 paper |
Security and privacy of machine learning · 67% Cryptographic protocols and secure computation · 33% | |
| Artificial intelligence
2 papers |
Graph learning · 82% Efficient and distributed learning · 18% | |
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 50% Graph data management · 50% |
Topics — the 7 heaviest of 8, 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 |
0.9 | 1 | 2025 | MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks · SIGIR 2025 |
Security and privacy of machine learning › model security
model integrity |
0.7 | 1 | 2023 | PublicCheck: Public Integrity Verification for Services of Run-time Deep Models · SP 2023 |
Security and privacy of machine learning › verifiable machine learning
model verification |
0.7 | 1 | 2023 | PublicCheck: Public Integrity Verification for Services of Run-time Deep Models · SP 2023 |
Cryptographic protocols and secure computation › integrity auditing
public auditing |
0.7 | 1 | 2023 | PublicCheck: Public Integrity Verification for Services of Run-time Deep Models · SP 2023 |
Recommender systems
sequential recommendation |
0.3 | 1 | 2025 | MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks · SIGIR 2025 |
Graph data management › temporal graph
temporal interaction networks |
0.3 | 1 | 2025 | MINTT: Memory Inductive Transfer for Temporal Graph Neural Networks · SIGIR 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.2 | 1 | 2023 | PublicCheck: Public Integrity Verification for Services of Run-time Deep Models · SP 2023 |
Methods — techniques the papers use, named apart from their topics
transfer learning · 1.7bipartite encoding · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MINTT: Memory Inductive Transfer for Temporal Graph Neural NetworksabstractInteractions between entities are often time-dependent in real-world systems such as e-commerce, social networks, streaming platforms, finance, and healthcare, and are best modeled as temporal interaction graphs. The temporal dimension plays a crucial role in modern recommendation systems, which rely on future link predictions. Temporal Graph Neural Networks (TGNN) have demonstrated state-of-the-art performance in future link prediction tasks for temporal interaction graphs. However, these models often require substantial training data unavailable in real-world settings. A potential solution to data scarcity is model pre-training on semantically related datasets. Unfortunately, transferring the TGNN model from one dataset to another is not trivial, as it contains node-specific memory modules vital for performance, resulting in them being inherently non-transferable. To overcome this limitation, we propose a novel transfer method that effectively utilizes common attributes between source and target datasets by decoupling graph nodes and corresponding attributes via bipartite encoding. This decoupling facilitates the transfer of memories and other inductive biases from source datasets to a target dataset. We evaluate the proposed transfer technique on real-world datasets and establish that it improves the performance of TGNN on the target dataset by 56% compared to the no-transfer methods and 36% over the state-of-the-art baselines in data-scarce settings. Tanishq Dubey, Sidharth Agarwal, Srikanta J. Bedathur |
SIGIR | 2 |
| 2023 | PublicCheck: Public Integrity Verification for Services of Run-time Deep ModelsabstractExisting integrity verification approaches for deep models are designed for private verification (i.e., assuming the service provider is honest, with white-box access to model parameters). However, private verification approaches do not allow model users to verify the model at run-time. Instead, they must trust the service provider, who may tamper with the verification results. In contrast, a public verification approach that considers the possibility of dishonest service providers can benefit a wider range of users. In this paper, we propose PublicCheck, a practical public integrity verification solution for services of run-time deep models. PublicCheck considers dishonest service providers, and overcomes public verification challenges of being lightweight, providing anti-counterfeiting protection, and having fingerprinting samples that appear smooth. To capture and fingerprint the inherent prediction behaviors of a run-time model, PublicCheck generates smoothly transformed and augmented encysted samples that are enclosed around the model's decision boundary while ensuring that the verification queries are indistinguishable from normal queries. PublicCheck is also applicable when knowledge of the target model is limited (e.g., with no knowledge of gradients or model parameters). A thorough evaluation of PublicCheck demonstrates the strong capability for model integrity breach detection (100% detection accuracy with less than 10 black-box API queries) against various model integrity attacks and model compression attacks. PublicCheck also demonstrates the smooth appearance, feasibility, and efficiency of generating a plethora of encysted samples for fingerprinting. Shuo Wang 0012, Alsharif Abuadbba, Sidharth Agarwal, Kristen Moore, Ruoxi Sun 0001, Minhui Xue 0001, Surya Nepal, Seyit Ahmet Çamtepe, Salil S. Kanhere |
SP | 3 |