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 "power optimal non contiguous spectrum access in multi front end radio enabled point to point link"):
  Abstract: Non-contiguous spectrum chunks allow wireless links to flexibly access a wide amount of bandwidth. Multi- Channel Multi-Radio (MC-MR) and Non-Contiguous Orthogonal Frequency Division Multiplexing (NC-OFDM) are the two commercially viable strategies to access non-contiguous spectrum chunks. MC-MR accesses multiple non-contiguous chunks by activating multiple front ends which, in turn, increases the circuit power consumption of each of the activated front ends. NC-OFDM accesses non-contiguous spectrum chunks with a single front end by nulling remaining subchannels but increases spectrum span which, in turn, increases the power consumption of ADC and DAC. This work focuses on a point-to-point link where transmitter and receiver have multiple front ends and can employ NC-OFDM technology. We investigate optimal spectrum fragmentation in each front end from a system power (summation of transmit power and circuit power) perspective. We formulate a mixed integer non-linear program (MINLP) to perform power control and scheduling, and minimize system power by providing a greedy algorithm (O(M^3 I)) where M and I denote the number of channels and radio front ends respectively.

Includes members:
  Member "system power minimization to access non contiguous spectrum in cognitive radio networks":
    also connected through other hyperedges:
      (none)
  Member "towards a communication theoretic understanding of system level power consumption":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient beam coordination strategies with rate dependent processing power")

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)