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: "a tight bound on the maximum interference of random sensors in the highway model"
  Abstract: Consider n sensors whose positions are represented by n uniform, independent and identically distributed random variables assuming values in the open unit interval (0; 1). A natural way to guarantee connectivity in the resulting sensor network is to assign to each sensor as its range, the maximum of the two possible distances to its two neighbors. The interference at a given sensor is dened as the number of sensors that have this sensor within their range. In this paper we prove that the expected maximum interference of the sensors is ( p lnn).

Connected through hyperedge HE-1 (induced by source paper "a note on interference in random point sets"):
  with members:
    - "bounding interference in wireless ad hoc networks with nodes in random position"

Connected through hyperedge HE-2 (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"
    - "minimizing interference in ad hoc networks with bounded communication radius"
    - "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)