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: "sinr diagram with interference cancellation"
  Abstract: In this paper we study the reception zones of a wireless network in the SINR model with receivers that employ \emph{interference cancellation} (IC), a technique that allows a receiver to decode interfering signals, and \emph{cancel} them from the received signal in order to decode its intended message. We first derive some important topological properties of the diagram describing the reception zones and their connections to \emph{high-order Voronoi diagrams} and other related geometric objects. We then discuss the computational issues that arise when seeking an efficient description of the zones. Our main fundamental result states that although potentially there are exponentially many possible cancellation orderings (and consequently reception cells), in fact there are much fewer nonempty such cells. We prove a (tight) linear bound on the number of cells and provide a polynomial time algorithm to describe the diagram. Moreover, we introduce a novel measure, referred to as the \emph{Compactness Parameter}, which influences the tightness of our bounds. We then utilize the properties established for reception diagrams to devise a logarithmic time algorithm for answering \emph{point-location} queries for networks with IC.

Connected through hyperedge HE-1 (induced by source paper "resolving sinr queries in a dynamic setting"):
  with members:
    - "dynamic geometric data structures via shallow cuttings"
    - "dynamic planar voronoi diagrams for general distance functions and their algorithmic applications"
    - "batched point location in sinr diagrams via algebraic tools"
    - "approximating minimization diagrams and generalized proximity search"
    - "the topology of wireless communication"

Connected through hyperedge HE-2 (induced by source paper "batched point location in sinr diagrams via algebraic tools"):
  with members:
    - "approximating minimization diagrams and generalized proximity search"
    - "computing the distance between piecewise linear bivariate functions"
    - "the topology of wireless communication"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "wireless scheduling with power control"
    - "fast multipoint evaluation of bivariate polynomials"

Connected through hyperedge HE-3 (induced by source paper "braess s paradox in wireless networks the danger of improved technology"):
  with members:
    - "the topology of wireless communication"
    - "wireless connectivity and capacity"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "on a game theoretic approach to capacity maximization in wireless networks"
    - "sinr diagrams towards algorithmically usable sinr models of wireless networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "generalized perron frobenius theorem for nonsquare matrices"):
  with members:
    - "the topology of wireless communication"

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)