On the public citation graph

The Power of an Example

https://doi.org/10.1145/2930657
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s11280-006-0222-zopenalex-snapshot
Sampling Search-Engine Results
inferredcites →https://doi.org/10.1016/s0169-7552(98)00127-5openalex-snapshot
A technique for measuring the relative size and overlap of public Web search engines
inferredcites →https://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferredcites →https://doi.org/10.1109/sfcs.1977.24openalex-snapshot
Probabilistic computations: Toward a unified measure of complexity
inferredcites →https://doi.org/10.1137/0214060openalex-snapshot
On Approximation Algorithms for # P
inferredcites →https://doi.org/10.1137/070701649openalex-snapshot
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
inferredcites →https://doi.org/10.1137/080734066openalex-snapshot
Testing Symmetric Properties of Distributions
inferredcites →https://doi.org/10.1142/1936openalex-snapshot
Combinatorial Group Testing and Its Applications
inferredcites →https://doi.org/10.1145/1060745.1060784openalex-snapshot
Sampling search-engine results
inferredcites →https://doi.org/10.1145/1183614.1183699openalex-snapshot
Estimating corpus size via queries
inferredcites →https://doi.org/10.1145/1993636.1993727openalex-snapshot
Estimating the unseen
inferredcites →https://doi.org/10.1145/2422436.2422497openalex-snapshot
On the power of conditional samples in distribution testing
inferredcites →https://doi.org/10.1145/800061.808740openalex-snapshot
The complexity of approximate counting
inferredcites →https://doi.org/10.1214/aoms/1177731363openalex-snapshot
The Detection of Defective Members of Large Populations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_22openalex-snapshot
Improved Lower Bound for Estimating the Number of Defective Items
inferred← citeshttps://doi.org/10.1007/s00224-021-10043-yopenalex-snapshot
On Triangle Estimation Using Tripartite Independent Set Queries
inferred← citeshttps://doi.org/10.1007/s10878-025-01264-9openalex-snapshot
Improved lower bound for estimating the number of defective items
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.015openalex-snapshot
A tight lower bound on non-adaptive group testing estimation
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.02.002openalex-snapshot
Almost optimal query algorithm for hitting set using a subset query
inferred← citeshttps://doi.org/10.1109/icdm58522.2023.00063openalex-snapshot
Interactive Activities Initiation through Retrieving Hidden Social Information Networks
inferred← citeshttps://doi.org/10.1109/isit.2015.7282829openalex-snapshot
Adaptive estimation in weighted group testing
inferred← citeshttps://doi.org/10.1109/isit.2016.7541524openalex-snapshot
Estimating the number of defectives with group testing
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518234openalex-snapshot
Adaptive Surveillance Testing for Efficient Infection Rate Estimation
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653897openalex-snapshot
Estimation of the Number of Complexes in Complex Group Testing
inferred← citeshttps://doi.org/10.1137/1.9781611975994.177openalex-snapshot
Nearly optimal edge estimation with independent set queries
inferred← citeshttps://doi.org/10.1145/3178876.3186111openalex-snapshot
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples
inferred← citeshttps://doi.org/10.1145/3394486.3403073openalex-snapshot
How to Count Triangles, without Seeing the Whole Graph
inferred← citeshttps://doi.org/10.1145/3404867openalex-snapshot
Edge Estimation with Independent Set Oracles
inferred← citeshttps://doi.org/10.2139/ssrn.4875498openalex-snapshot
Tight Lower Bounds on Non-Adaptive Group Testing Estimation
inferred← citeshttps://doi.org/10.4086/toc.2018.v014a019openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2020.26openalex-snapshot
Hyperedge Estimation using Polylogarithmic Subset Queries
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2022.48openalex-snapshot
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.7openalex-snapshot
Constructing Large Matchings via Query Access to a Maximal Matching Oracle
inferred← citeshttps://doi.org/10.48550/arxiv.1411.7346openalex-snapshot
A Chasm Between Identity and Equivalence Testing with Conditional Queries
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.