On the public citation graph

Testability and repair of hereditary hypergraph properties

0 signed · 72 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.1002/rsa.20017openalex-snapshot
Regularity Lemma for k‐uniform hypergraphs
inferredcites →https://doi.org/10.1002/rsa.20108openalex-snapshot
Applications of the regularity lemma for uniform hypergraphs
inferredcites →https://doi.org/10.1002/rsa.20117openalex-snapshot
The counting lemma for regulark‐uniform hypergraphs
inferredcites →https://doi.org/10.1007/3-540-45465-9_87openalex-snapshot
Efficient Testing of Hypergraphs
inferredcites →https://doi.org/10.1007/bf01058727openalex-snapshot
Symmetries on random arrays and set-indexed processes
inferredcites →https://doi.org/10.1007/bf01903717openalex-snapshot
Integer sets containing no arithmetic progressions
inferredcites →https://doi.org/10.1007/bf02125347openalex-snapshot
Quasi-random graphs
inferredcites →https://doi.org/10.1007/bfb0099420openalex-snapshot
École d'Été de Probabilités de Saint-Flour XIII — 1983
inferredcites →https://doi.org/10.1007/s00039-007-0599-6openalex-snapshot
Szemerédi’s Lemma for the Analyst
inferredcites →https://doi.org/10.1007/s004930070001openalex-snapshot
Efficient Testing of Large Graphs
inferredcites →https://doi.org/10.1007/s11854-008-0001-0openalex-snapshot
A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma
inferredcites →https://doi.org/10.1016/0047-259x(81)90099-3openalex-snapshot
Representations for partially exchangeable arrays of random variables
inferredcites →https://doi.org/10.1016/j.aim.2008.07.008openalex-snapshot
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
inferredcites →https://doi.org/10.1017/s0963548305007236openalex-snapshot
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
inferredcites →https://doi.org/10.1017/s0963548307008553openalex-snapshot
Regular Partitions of Hypergraphs: Regularity Lemmas
inferredcites →https://doi.org/10.1137/06064888xopenalex-snapshot
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
inferredcites →https://doi.org/10.1137/060652294openalex-snapshot
Every Monotone 3‐Graph Property is Testable
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/1060590.1060611openalex-snapshot
Every monotone graph property is testable
inferredcites →https://doi.org/10.1145/1162349.1162351openalex-snapshot
Locally testable codes and PCPs of almost-linear length
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/335305.335315openalex-snapshot
On the efficiency of local decoding procedures for error-correcting codes
inferredcites →https://doi.org/10.1214/08-ps124openalex-snapshot
On exchangeable random variables and the statistics of large graphs and hypergraphs
inferredcites →https://doi.org/10.4007/annals.2007.166.897openalex-snapshot
Hypergraph regularity and the multidimensional Szemerédi theorem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20507openalex-snapshot
A unified framework for testing linear‐invariant properties
inferred← citeshttps://doi.org/10.1002/rsa.20521openalex-snapshot
The poset of hypergraph quasirandomness
inferred← citeshttps://doi.org/10.1002/rsa.20641openalex-snapshot
σ ‐algebras for quasirandom hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.20720openalex-snapshot
Local reconstruction of low‐rank matrices and subspaces
inferred← citeshttps://doi.org/10.1002/rsa.21126openalex-snapshot
Hypergraph regularity and random sampling
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_698openalex-snapshot
Local Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_27openalex-snapshot
A Note on the Testability of Ramsey’s Class
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_13openalex-snapshot
Extremal Problems for Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_29openalex-snapshot
Local Property Reconstruction and Monotonicity
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_698-1openalex-snapshot
Local Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/s11856-011-0080-yopenalex-snapshot
A removal lemma for systems of linear equations over finite fields
inferred← citeshttps://doi.org/10.1007/s11856-021-2228-8openalex-snapshot
Testing graphs against an unknown distribution
inferred← citeshttps://doi.org/10.1016/j.aim.2012.06.022openalex-snapshot
A measure-theoretic approach to the theory of dense hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.003openalex-snapshot
On the removal lemma for linear systems over Abelian groups
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104044openalex-snapshot
Posets are easily testable
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.01.007openalex-snapshot
Testable and untestable classes of first-order formulae
inferred← citeshttps://doi.org/10.1016/j.jcta.2015.02.006openalex-snapshot
Differential calculus on graphon space
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.06.005openalex-snapshot
The inducibility of blow-up graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.05.011openalex-snapshot
Online containers for hypergraphs, with applications to linear equations
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.12.003openalex-snapshot
Minimum number of edges that occur in odd cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.04.009openalex-snapshot
A characterization of testable hypergraph properties
inferred← citeshttps://doi.org/10.1016/j.jfa.2011.04.004openalex-snapshot
Quantum invariant families of matrices in free probability
inferred← citeshttps://doi.org/10.1017/cbo9781139506748.002openalex-snapshot
Graph removal lemmas
inferred← citeshttps://doi.org/10.1017/fms.2014.22openalex-snapshot
EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
inferred← citeshttps://doi.org/10.1017/s0963548312000363openalex-snapshot
Testing Odd-Cycle-Freeness in Boolean Functions
inferred← citeshttps://doi.org/10.1070/rm9956openalex-snapshot
Semantic limits of dense combinatorial objects
inferred← citeshttps://doi.org/10.1093/imrn/rnz214openalex-snapshot
Removal Lemmas with Polynomial Bounds
inferred← citeshttps://doi.org/10.1109/ccc.2010.30openalex-snapshot
Lower Bounds for Testing Function Isomorphism
inferred← citeshttps://doi.org/10.1109/focs.2017.84openalex-snapshot
A Characterization of Testable Hypergraph Properties
inferred← citeshttps://doi.org/10.1137/1.9781611973730.100openalex-snapshot
Density and regularity theorems for semi-algebraic hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.179openalex-snapshot
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
inferred← citeshttps://doi.org/10.1137/100785429openalex-snapshot
Testing Fourier Dimensionality and Sparsity
inferred← citeshttps://doi.org/10.1137/100791075openalex-snapshot
Sublinear Time Algorithms
inferred← citeshttps://doi.org/10.1137/110837863openalex-snapshot
Noise Tolerance of Expanders and Sublinear Expansion Reconstruction
inferred← citeshttps://doi.org/10.1137/15m1007355openalex-snapshot
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
inferred← citeshttps://doi.org/10.1145/1989727.1989728openalex-snapshot
Online geometric reconstruction
inferred← citeshttps://doi.org/10.1214/10-aap728openalex-snapshot
Random graphs with a given degree sequence
inferred← citeshttps://doi.org/10.1214/13-aos1155openalex-snapshot
Estimating and understanding exponential random graph models
inferred← citeshttps://doi.org/10.1214/ejp.v20-4188openalex-snapshot
Limits of sequences of Markov chains
inferred← citeshttps://doi.org/10.17863/cam.9680openalex-snapshot
Online containers for hypergraphs, with applications to linear equations
inferred← citeshttps://doi.org/10.4115/jla.2012.4.4openalex-snapshot
A correspondence principle for the Gowers norms
inferred← citeshttps://doi.org/10.4115/jla.v4i0.139openalex-snapshot
10.4115/jla.v4i0.139
inferred← citeshttps://doi.org/10.4213/rm9956openalex-snapshot
Семантические пределы плотных комбинаторных объектов
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95187openalex-snapshot
The Removal Lemma: algebraic versions and applications
inferred← citeshttps://doi.org/10.5860/choice.51-1543openalex-snapshot
Compactness and contradiction
inferred← citeshttps://doi.org/10.70675/4ffa7c72z7a2bz42c2z89c0ze543dc810c4fopenalex-snapshot
Embedding problems in uniformly dense hypergraphs
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.