Researcher profile

Siddharth Gupta

Siddharth Gupta contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 15 - UnverifiedVerification L1Unclaimed author
3works
0followers
3topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

3 published item(s)

preprint2026arXiv

Beyond Masks: The Case for Medical Image Parsing

Medical imaging research has spent a decade getting very good at one thing: producing per-voxel masks. Masks tell us size, volume, and location, and a decade of clinical infrastructure rests on those outputs. Yet the report a radiologist writes contains almost nothing a mask can express. We argue that medical imaging research should adopt medical image parsing as its central output: a structured representation in which entities, attributes, and relationships are emitted together and mutually consistent. Entities are the named structures and findings, present or absent. Attributes describe those entities, capturing things like margin regularity, enhancement pattern, or severity grade. Relationships connect them, naming where one structure sits relative to another, what abuts what, and what has changed since the prior scan. A good parse satisfies three properties, in order: (1) decision (the parse names the right things in the current image), (2) reconstruction (its content is rich enough to regenerate that image), and (3) prediction (its content is rich enough to forecast how the patient state will evolve). Quantitative measurements are derived from this content; they are not predicted alongside it. To test how close the field is to producing such an output, we audit eleven representative systems against the three parsing primitives plus closure. None emits a well-formed parse. Entities are largely solved. Attributes, relationships, and closure remain near-empty. The path forward is not a new architecture. It is a commitment to a richer output, and to training signals that reward it. Segmentation taught models to measure. Parsing asks them to explain.

preprint2021arXiv

Multivariate Analysis of Scheduling Fair Competitions

A \emph{fair competition}, based on the concept of envy-freeness, is a non-eliminating competition where each contestant (team or individual player) may not play against all other contestants, but the total difficulty for each contestant is the same: the sum of the initial rankings of the opponents for each contestant is the same. Similar to other non-eliminating competitions like the Round-robin competition or the Swiss-system competition, the winner of the fair competition is the contestant who wins the most games. The {\sc Fair Non-Eliminating Tournament} ({\sc Fair-NET}) problem can be used to schedule fair competitions whose infrastructure is known. In the {\sc Fair-NET} problem, we are given an infrastructure of a tournament represented by a graph $G$ and the initial rankings of the contestants represented by a multiset of integers $S$. The objective is to decide whether $G$ is \emph{$S$-fair}, i.e., there exists an assignment of the contestants to the vertices of $G$ such that the sum of the rankings of the neighbors of each contestant in $G$ is the same constant $k\in\mathbb{N}$. We initiate a study of the classical and parameterized complexity of {\sc Fair-NET} with respect to several central structural parameters motivated by real world scenarios, thereby presenting a comprehensive picture of it.

preprint2021arXiv

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes

We investigate the parameterized complexity of finding subgraphs with hereditary properties on graphs belonging to a hereditary graph class. Given a graph $G$, a non-trivial hereditary property $Π$ and an integer parameter $k$, the general problem $P(G,Π,k)$ asks whether there exists $k$ vertices of $G$ that induce a subgraph satisfying property $Π$. This problem, $P(G,Π,k)$ has been proved to be NP-complete by Lewis and Yannakakis. The parameterized complexity of this problem is shown to be W[1]-complete by Khot and Raman, if $Π$ includes all trivial graphs but not all complete graphs and vice versa; and is fixed-parameter tractable (FPT), otherwise. As the problem is W[1]-complete on general graphs when $Π$ includes all trivial graphs but not all complete graphs and vice versa, it is natural to further investigate the problem on restricted graph classes. Motivated by this line of research, we study the problem on graphs which also belong to a hereditary graph class and establish a framework which settles the parameterized complexity of the problem for various hereditary graph classes. In particular, we show that: $P(G,Π,k)$ is solvable in polynomial time when the graph $G$ is co-bipartite and $Π$ is the property of being planar, bipartite or triangle-free (or vice-versa). $P(G,Π,k)$ is FPT when the graph $G$ is planar, bipartite or triangle-free and $Π$ is the property of being planar, bipartite or triangle-free, or graph $G$ is co-bipartite and $Π$ is the property of being co-bipartite. $P(G,Π,k)$ is W[1]-complete when the graph $G$ is $C_4$-free, $K_{1,4}$-free or a unit disk graph and $Π$ is the property of being either planar or bipartite.