human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications"
  Abstract: We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of $\mathcal{NP}$ decision problems. We consider $\mathcal{NP}$ problems that have long instances but relatively short witnesses. The question is whether one can efficiently compress an instance and store a shorter representation that maintains the information of whether the original input is in the language or not. We want the length of the compressed instance to be polynomial in the length of the witness and polylog in the length of original input. Such compression enables succinctly storing instances until a future setting will allow solving them, either via a technological or algorithmic breakthrough or simply until enough time has elapsed. In this paper, we first develop the basic complexity theory of compression, including reducibility, completeness, and a stratification of $\mathcal{NP}$ with respect to compression. We then show that compressibility (say, of SAT) would have vast implications for cryptography, including constructions of one-way functions and collision resistant hash functions from any hard-on-average problem in $\mathcal{NP}$ and cryptanalysis of key agreement protocols in the “bounded storage model” when mixed with (time) complexity-based cryptography.

Connected through hyperedge HE-1 (induced by source paper "Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal"):
  with members:
    - "Parameterized Algorithms for Deletion to (r,ell)-Graphs"
    - "Edge Bipartization Faster than \(2^k\)"

Connected through hyperedge HE-2 (induced by source paper "On the randomness complexity of efficient sampling"):
  with members:
    - "In search of an easy witness: exponential time vs. probabilistic polynomial time"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics