human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "minimizing interference in ad hoc networks with bounded communication radius"
  Abstract: We consider a topology control problem in which we are given a set of $n$ sensors in the plane and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low receiver-based interference (i.e., we minimize the largest in-degree of the network). We give an algorithm that generates a network with $O(\log \Delta)$ interference, where $\Delta$ is the interference of a uniform-radius ad-hoc network. We then adapt the construction to the case in which no sensor can have a communication radius larger than $R_{\min}$, the minimum value needed to obtain connectivity. We also show that $\log \Delta$ interference is needed for some instances, making our algorithms asymptotically optimal.

Connected through hyperedge HE-1 (induced by source paper "packing short plane spanning graphs in complete geometric graphs"):
  with members:
    - "packing plane spanning trees into a point set"
    - "packing plane spanning trees and paths in complete geometric graphs"

Connected through hyperedge HE-2 (induced by source paper "max consensus in sensor networks non linear bounded transmission and additive noise"):
  with members:
    - "non linear distributed average consensus using bounded transmissions"
    - "robust analog function computation via wireless multiple access channels"
    - "finite time and asymptotic convergence of distributed averaging and maximizing algorithms"
    - "distributed consensus algorithms in sensor networks quantized data and random link failures"

Connected through hyperedge HE-3 (induced by source paper "on kinetic range spaces and their applications"):
  with members:
    - "interference minimization in asymmetric sensor networks"
    - "tight lower bounds for the size of epsilon nets"
    - "improved bounds and new techniques for davenport schinzel sequences and their generalizations"

Connected through hyperedge HE-4 (induced by source paper "interference minimization in asymmetric sensor networks"):
  with members:
    - "minimizing the maximum interference is hard"

Connected through hyperedge HE-5 (induced by source paper "bounding interference in wireless ad hoc networks with nodes in random position"):
  with members:
    - "a note on interference in random point sets"
    - "a tight bound on the maximum interference of random sensors in the highway model"
    - "local approximation schemes for topology control"
    - "minimizing the maximum interference is hard"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CG(Computational Geometry)