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: "product multicommodity flow in wireless networks"
  Abstract: We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in terms of the spectral properties of appropriate network graphs are obtained in both an information-theoretic sense and for a combinatorial interference model (e.g., protocol model). These provide an inner approximation to the n 2-dimensional capacity region. Our results hold for general node distributions, traffic models, and channel fading models. We first establish that the random source-destination model assumed in many previous results on capacity scaling laws, is essentially a one-dimensional approximation to the capacity region and a special case of PMF. We then build on the results for a wireline network (graph) that relate PMF to its spectral (or cut) properties. Specifically, for a combinatorial interference model given by a network graph and a conflict graph, we relate the PMF to the spectral properties of the underlying graphs resulting in simple computational upper and lower bounds. These results show that the 1/radicn scaling law obtained by Gupta and Kumar for a geometric random network can be explained in terms of the scaling law of the conductance of a geometric random graph. For the more interesting random fading model with additive white Gaussian noise (AWGN), we show that the scaling laws for PMF can again be tightly characterized by the spectral properties of appropriately defined graphs-such a characterization for general wireless networks has not been available before. As an implication, we obtain computationally efficient upper and lower bounds on the PMF for any wireless network with a guaranteed approximation factor.

Connected through hyperedge HE-1 (induced by source paper "gossip based information spreading in mobile networks"):
  with members:
    - "tight bounds on information dissemination in sparse mobile networks"
    - "information spreading in stationary markovian evolving graphs"
    - "information propagation speed in mobile and delay tolerant networks"
    - "manets high mobility can make up for low transmission power"
    - "the impact of mobility on gossip algorithms"
    - "throughput and delay in random wireless networks with restricted mobility"
    - "fast distributed algorithms for computing separable functions"

Connected through hyperedge HE-2 (induced by source paper "the balanced unicast and multicast capacity regions of large wireless networks"):
  with members:
    - "on capacity scaling in arbitrary wireless networks"
    - "wireless ad hoc networks strategies and scaling laws for the fixed snr regime"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "an energy based comparison of long hop and short hop routing in mimo networks"):
  with members:
    - "wireless ad hoc networks strategies and scaling laws for the fixed snr regime"

Connected through hyperedge HE-4 (induced by source paper "interference alignment in dense wireless networks"):
  with members:
    - "the ergodic capacity of phase fading interference networks"
    - "interference alignment based sum capacity bounds for random dense gaussian interference networks"
    - "the balanced unicast and multicast capacity regions of large wireless networks"
    - "on capacity scaling in arbitrary wireless networks"
    - "ergodic interference alignment"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "information theoretic operating regimes of large wireless networks"
    - "on information theoretic scaling laws for wireless networks"

Connected through hyperedge HE-5 (induced by source paper "euclidean prize collecting steiner forest"):
  with members:
    - "a polynomial time approximation scheme for euclidean steiner forest"
    - "prize collecting network design on planar graphs"
    - "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth"
    - "dial a ride from k forest"

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.IT(Information Theory)