On the public citation graph
Learning a hidden graph using O(logn) queries per edge
0 signed · 53 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-540-27819-1_15openalex-snapshot
Learning a Hidden Graph Using O(log n) Queries Per Edge
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_12openalex-snapshot
Learning a Hidden Subgraph
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/istcs.1997.595169openalex-snapshot
Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs
inferredcites →https://doi.org/10.1145/369133.369152openalex-snapshot
An optimal procedure for gap closing in whole genome shotgun sequencing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20404openalex-snapshot
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_8openalex-snapshot
Learning Boolean Halfspaces with Small Weights from Membership Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_9openalex-snapshot
On Exact Learning Monotone DNF from Membership Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_5openalex-snapshot
Linear Time Constructions of Some $$d$$-Restriction Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_6openalex-snapshot
Non-adaptive Learning of a Hidden Hypergraph
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_13openalex-snapshot
Almost Optimal Cover-Free Families
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_9openalex-snapshot
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_12openalex-snapshot
Inferring Social Networks from Outbreaks
inferred← citeshttps://doi.org/10.1007/s00778-019-00587-4openalex-snapshot
The core decomposition of networks: theory, algorithms and applications
inferred← citeshttps://doi.org/10.1007/s10878-010-9291-0openalex-snapshot
Reconstruction of hidden graphs and threshold group testing
inferred← citeshttps://doi.org/10.1007/s10878-013-9603-2openalex-snapshot
Network construction with subgraph connectivity constraints
inferred← citeshttps://doi.org/10.1007/s11590-017-1131-zopenalex-snapshot
Learning a hidden uniform hypergraph
inferred← citeshttps://doi.org/10.1016/b978-0-444-52936-7.50018-5openalex-snapshot
Mechanizing Induction
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.035openalex-snapshot
Reconstructing Markov processes from independent and anonymous experiments
inferred← citeshttps://doi.org/10.1016/j.dam.2026.06.018openalex-snapshot
Finding the diameter of a tree with distance queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.030openalex-snapshot
Learning boolean halfspaces with small weights from membership queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.019openalex-snapshot
Non-adaptive learning of a hidden hypergraph
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.008openalex-snapshot
A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115121openalex-snapshot
Lower bounds for graph reconstruction with maximal independent set queries
inferred← citeshttps://doi.org/10.1080/0022250x.2010.509525openalex-snapshot
Recovering Social Networks from Individual Attributes
inferred← citeshttps://doi.org/10.1109/isit.2016.7541485openalex-snapshot
On multistage learning a hidden hypergraph
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195344openalex-snapshot
Non-Adaptive Learning of Random Hypergraphs with Queries
inferred← citeshttps://doi.org/10.1109/pimrc69400.2026.11711708openalex-snapshot
When Reliability is a Vulnerability - Exploiting and Mitigating URLLC for DoS in 5G and Beyond
inferred← citeshttps://doi.org/10.1109/tkde.2012.178openalex-snapshot
Identifying the Most Connected Vertices in Hidden Bipartite Graphs Using Group Testing
inferred← citeshttps://doi.org/10.1109/tpami.2023.3283784openalex-snapshot
Learning Hidden Graphs From Samples
inferred← citeshttps://doi.org/10.1142/s179383091000067xopenalex-snapshot
COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
inferred← citeshttps://doi.org/10.1145/1807167.1807263openalex-snapshot
Finding maximum degrees in hidden bipartite graphs
inferred← citeshttps://doi.org/10.1145/2188349.2188354openalex-snapshot
Exact and approximate algorithms for the most connected vertex problem
inferred← citeshttps://doi.org/10.1145/3404867openalex-snapshot
Edge Estimation with Independent Set Oracles
inferred← citeshttps://doi.org/10.1145/3409964.3461822openalex-snapshot
Parallel Network Mapping Algorithms
inferred← citeshttps://doi.org/10.23638/dmtcs-20-1-9openalex-snapshot
Non-adaptive Group Testing on Graphs
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.1405.0792openalex-snapshot
On Exact Learning Monotone DNF from Membership Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04137openalex-snapshot
Non-Adaptive Learning a Hidden Hipergraph
inferred← citeshttps://doi.org/10.48550/arxiv.1607.00507openalex-snapshot
Adaptive Learning a Hidden Hypergraph
inferred← citeshttps://doi.org/10.48550/arxiv.1801.07386openalex-snapshot
Learning Networks from Random Walk-Based Node Similarities
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07750openalex-snapshot
Adaptive Exact Learning of Decision Trees from Membership Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1905.03410openalex-snapshot
Learning Erdős-Rényi Random Graphs via Edge Detecting Queries
inferred← citeshttps://doi.org/10.48550/arxiv.2011.08611openalex-snapshot
Quantum algorithms for learning a hidden graph and beyond
inferred← citeshttps://doi.org/10.5555/1873601.1873652openalex-snapshot
Optimally reconstructing weighted graphs using 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.