human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "scheduling wireless links in the physical interference model by fractional edge coloring"):
  Abstract: We consider the problem of scheduling the links of wireless mesh networks for capacity maximization in the physical interference model. We represent such a network by an undirected graph $G$, with vertices standing for network nodes and edges for links. We define network capacity to be $1/\chi'^*_\mathrm{phys}(G)$, where $\chi'^*_\mathrm{phys}(G)$ is a novel edge-chromatic indicator of $G$, one that modifies the notion of $G$'s fractional chromatic index. This index asks that the edges of $G$ be covered by matchings in a certain optimal way. The new indicator does the same, but requires additionally that the matchings used be all feasible in the sense of the physical interference model. Sometimes the resulting optimal covering of $G$'s edge set by feasible matchings is simply a partition of the edge set. In such cases, the index $\chi'^*_\mathrm{phys}(G)$ becomes the particular case that we denote by $\chi'_\mathrm{phys}(G)$, a similar modification of $G$'s well-known chromatic index. We formulate the exact computation of $\chi'^*_\mathrm{phys}(G)$ as a linear programming problem, which we solve for an extensive collection of random geometric graphs used to instantiate networks in the physical interference model. We have found that, depending on node density (number of nodes per unit deployment area), often $G$ is such that $\chi'^*_\mathrm{phys}(G)<\chi'_\mathrm{phys}(G)$. This bespeaks the possibility of increased network capacity by virtue of simply defining it so that edges are colored in the fractional, rather than the integer, sense.

Includes members:
  Member "scheduling wireless links by vertex multicoloring in the physical interference model":
    also connected through other hyperedges:
      (none)
  Member "scheduling links for heavy traffic on interfering routes in wireless mesh networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence")
  Member "algorithms for wireless capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "a constant factor approximation for wireless capacity maximization with power control in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reception capacity definitions game theory and hardness")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)