Source author record

Swati Chandna

Swati Chandna appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Methodology math.ST Statistics Theory Artificial Intelligence Digital Libraries Social and Information Networks stat.OT

Catalog footprint

What is connected

4works

7topics

4close collaborators

Actions

Connect this record

Open graph Browse works

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

CitePrism: Human-in-the-Loop AI for Citation Auditing and Editorial Integrity

Editors and reviewers are expected to ensure that manuscripts cite relevant, accurate, current, and ethically appropriate literature, yet manuscript-level citation auditing remains largely manual, fragmented, and difficult to scale. Citation context, metadata quality, self-citation patterns, and bibliographic integrity all affect whether a reference appropriately supports a local claim. We present CitePrism, a transparent hybrid decision-support framework for editorial citation auditing that combines LLM-assisted contextual reasoning, embedding-based semantic similarity, metadata verification, integrity-oriented flags, and human-in-the-loop analyst review. CitePrism extracts citation neighborhoods, enriches reference metadata, computes fused relevance scores, surfaces metadata and self-citation review prompts, and supports configurable threshold-based triage. In a preliminary validation on a single case-study manuscript with 104 references from pavement engineering, agreement with human binary relevance labels reached Cohen's kappa = 0.429. At operating threshold tau = 17, CitePrism flagged all human-labeled irrelevant citations, while also producing false positives requiring analyst review. These results suggest that CitePrism may support conservative editorial screening and citation-quality triage, but they do not establish general editorial performance. CitePrism is intended as pilot-stage decision support, not as an autonomous misconduct detector or automated editorial decision system. Broader validation across manuscripts, domains, annotators, baselines, and deployment settings is required before operational use.

preprint2026arXiv

Decision-Theoretic Robustness for Network Models

Bayesian network models (Erdos Renyi, stochastic block models, random dot product graphs, graphons) are widely used in neuroscience, epidemiology, and the social sciences, yet real networks are sparse, heterogeneous, and exhibit higher-order dependence. How stable are network-based decisions, model selection, and policy recommendations to small model misspecification? We study local decision-theoretic robustness by allowing the posterior to vary within a small Kullback-Leibler neighborhood and choosing actions that minimize worst-case posterior expected loss. Exploiting low-dimensional functionals available under exchangeability, we (i) adapt decision-theoretic robustness to exchangeable graphs via graphon limits and derive sharp small-radius expansions of robust posterior risk; under squared loss the leading inflation is controlled by the posterior variance of the loss, and for robustness indices that diverge at percolation/fragmentation thresholds we obtain a universal critical exponent describing the explosion of decision uncertainty near criticality. (ii) Develop a nonparametric minimax theory for robust model selection between sparse Erdos-Renyi and block models, showing-via robustness error exponents-that no Bayesian or frequentist method can uniformly improve upon the decision-theoretic limits over configuration models and sparse graphon classes for percolation-type functionals. (iii) Propose a practical algorithm based on entropic tilting of posterior or variational samples, and demonstrate it on functional brain connectivity and Karnataka village social networks.

preprint2022arXiv

Edge coherence in multiplex networks

This paper introduces a nonparametric framework for the setting where multiple networks are observed on the same set of nodes, also known as multiplex networks. Our objective is to provide a simple parameterization which explicitly captures linear dependence between the different layers of networks. For non-Euclidean observations, such as shapes and graphs, the notion of "linear" must be defined appropriately. Taking inspiration from the representation of stochastic processes and the analogy of the multivariate spectral representation of a stochastic process with joint exchangeability of Bernoulli arrays, we introduce the notion of edge coherence as a measure of linear dependence in the graph limit space. Edge coherence is defined for pairs of edges from any two network layers and is the key novel parameter. We illustrate the utility of our approach by eliciting simple models such as a correlated stochastic blockmodel and a correlated inhomogeneous graph limit model.

preprint2020arXiv

Nonparametric regression for multiple heterogeneous networks

We study nonparametric methods for the setting where multiple distinct networks are observed on the same set of nodes. Such samples may arise in the form of replicated networks drawn from a common distribution, or in the form of heterogeneous networks, with the network generating process varying from one network to another, e.g.~dynamic and cross-sectional networks. Nonparametric methods for undirected networks have focused on estimation of the graphon model. While the graphon model accounts for nodal heterogeneity, it does not account for network heterogeneity, a feature specific to applications where multiple networks are observed. To address this setting of multiple networks, we propose a multi-graphon model which allows node-level as well as network-level heterogeneity. We show how information from multiple networks can be leveraged to enable estimation of the multi-graphon via standard nonparametric regression techniques, e.g. kernel regression, orthogonal series estimation. We study theoretical properties of the proposed estimator establishing recovery of the latent nodal positions up to negligible error, and convergence of the multi-graphon estimator to the normal distribution. Finite sample performance are investigated in a simulation study and application to two real-world networks---a dynamic contact network of ants and a collection of structural brain networks from different subjects---illustrate the utility of our approach.