On the public citation graph
Learning a Hidden Hypergraph
0 signed · 23 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-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.1007/s004530010033openalex-snapshot
Optimal Reconstruction of Graphs under the Additive Model
inferredcites →https://doi.org/10.1016/s0166-218x(98)00070-5openalex-snapshot
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
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/276698.276874openalex-snapshot
Adaptive versus nonadaptive attribute-efficient learning
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.1016/j.artint.2010.02.003openalex-snapshot
Optimal query complexity bounds for finding graphs
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.jcss.2007.06.006openalex-snapshot
Learning a hidden graph using O(logn) queries per edge
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.08.011openalex-snapshot
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
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.2025.115121openalex-snapshot
Lower bounds for graph reconstruction with maximal independent set queries
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929414openalex-snapshot
On Learning a Hidden Directed Graph with Path Queries
inferred← citeshttps://doi.org/10.1109/isit.2016.7541485openalex-snapshot
On multistage learning a hidden hypergraph
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.1109/isit63088.2025.11195344openalex-snapshot
Non-Adaptive Learning of Random Hypergraphs with Queries
inferred← citeshttps://doi.org/10.1109/tpami.2023.3283784openalex-snapshot
Learning Hidden Graphs From Samples
inferred← citeshttps://doi.org/10.1137/1.9781611973075.51openalex-snapshot
Optimally Reconstructing Weighted Graphs Using Queries: (Extended Abstract)
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.