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 "quasi optimal grouping for broadcast systems with hierarchical modulation"):
  Abstract: Recently, we proposed to combine time sharing with hierarchical modulation to increase the transmission rate of broadcast systems. Our proposal involves to group the receivers in pairs in order to transmit with hierarchical modulation. We introduced several grouping strategies but the optimal matching remained an open question. In this letter, we show that the optimal grouping is the solution of an assignment problem, for which efficient algorithms exist such as the Hungarian method. Based on this algorithm, we study the performance of the optimal grouping in terms of spectrum efficiency for a DVB-S2 system.

Includes members:
  Member "dvb s2 spectrum efficiency improvement with hierarchical modulation":
    also connected through other hyperedges:
      (none)
  Member "combining adaptive coding and modulation with hierarchical modulation in satcom systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "64 apsk constellation and mapping optimization for satellite broadcasting using genetic algorithms")

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)