activity
20172026
most citedCup length as a bound on topological complexity

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

collaborators

6 papers

cs.DL2026

Measuring research data reuse in scholarly publications using generative artificial intelligence: Open Science Indicator development and preliminary results

Lauren Cadwallader, Iain Hrynaszkiewicz, parth sarin +1

Numerous metascience studies and other initiatives have begun to monitor the prevalence of open science practices when it is more important to understand the 'downstream' effects o…

cs.DL2026

RenoBench: A Citation Parsing Benchmark

Parth Sarin, Juan Pablo Alperin, Adam Buttrick +1

Accurate parsing of citations is necessary for machine-readable scholarly infrastructure. But, despite sustained interest in this problem, existing evaluation techniques are often…

cs.CL2025

Citation Parsing and Analysis with Language Models

Parth Sarin, Juan Pablo Alperin

A key type of resource needed to address global inequalities in knowledge production and dissemination is a tool that can support journals in understanding how knowledge circulates…

cs.CL2024★ 1 cited

A global AI community requires language-diverse publishing

Haley Lepp, Parth Sarin

In this provocation, we discuss the English dominance of the AI research community, arguing that the requirement for English language publishing upholds and reinforces broader regi…

math.RA2018

On the geometry of Tensor Network States of Grids

Parth Sarin

We discuss the geometry of a class of tensor network states, called projected entangled pair states in the Physics literature. We provide initial results towards a question of Vers…

math.AT2017★ 1 cited

Cup length as a bound on topological complexity

Parth Sarin

Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological…