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: "lecture notes on network information theory"
  Abstract: These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at this http URL The previous (and obsolete) version of the lecture notes can be found at this http URL

Connected through hyperedge HE-1 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario"):
  with members:
    - "massive mimo multicasting in noncooperative cellular networks"
    - "on noisy arq in block fading channels"
    - "distributed compressive csit estimation and feedback for fdd multi user massive mimo systems"
    - "massive mimo for next generation wireless systems"
    - "finite block length analysis of the incremental redundancy harq"
    - "downlink training techniques for fdd massive mimo systems open loop and closed loop training with memory"
    - "noncoherent trellis coded quantization a practical limited feedback technique for massive mimo systems"
    - "quasi static multiple antenna fading channels at finite blocklength"

Connected through hyperedge HE-2 (induced by source paper "on the performance of rf fso links with and without hybrid arq"):
  with members:
    - "on the performance of the relay arq networks"
    - "on noisy arq in block fading channels"
    - "finite block length analysis of the incremental redundancy harq"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "on the capacity of free space optical intensity channels"
    - "hybrid arq in multiple antenna slow fading channels performance limits and optimal linear dispersion code design"
    - "performance of hybrid arq in block fading channels a fixed outage probability analysis"

Connected through hyperedge HE-3 (induced by source paper "on the performance of millimeter wave based rf fso links with harq feedback"):
  with members:
    - "ergodic capacity analysis of free space optical links with nonzero boresight pointing errors"
    - "harq feedback in spectrum sharing networks"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "on the capacity of free space optical intensity channels"

Connected through hyperedge HE-4 (induced by source paper "on the performance of the relay arq networks"):
  with members:
    - "green communication via power optimized harq protocols"
    - "green communication via type i arq finite block length analysis"
    - "distributed power allocation strategies for parallel relay networks"

Connected through hyperedge HE-5 (induced by source paper "wiflix adaptive video streaming in massive mu mimo wireless networks"):
  with members:
    - "performance analysis of massive mimo for cell boundary users"
    - "a control theoretic approach to adaptive video streaming in dense wireless networks"
    - "adaptive video streaming for wireless networks with multiple users and helpers"
    - "achieving large multiplexing gain in distributed antenna systems via cooperation with pcell technology"
    - "optimal user cell association for massive mimo wireless networks"
    - "what will 5g be"
    - "nova qoe driven optimization of dash based video delivery in networks"
    - "loss visibility optimized real time video transmission over mimo systems"

Connected through hyperedge HE-6 (induced by source paper "the sender excited secret key agreement model capacity reliability and secrecy exponents"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "on the dispersions of three network information theory problems"
    - "key generation using external source excitation capacity reliability and secrecy exponent"
    - "secret key agreement with channel state information at the transmitter"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"
    - "wiretap channel with causal state information"
    - "strongly secure privacy amplification cannot be obtained by encoder of slepian wolf code"

Connected through hyperedge HE-7 (induced by source paper "conditions for a monotonic channel capacity"):
  with members:
    - "capacity of a nonlinear optical channel with finite memory"
    - "calculation of mutual information for partially coherent gaussian channels with applications to fiber optics"
    - "optimal alphabets and binary labelings for bicm at low snr"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"

Connected through hyperedge HE-8 (induced by source paper "secure transmission of sources over noisy channels with side information at the receivers"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "discriminatory lossy source coding side information privacy"
    - "secure lossy source coding with side information at the decoders"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "joint source channel coding with side information using hybrid digital analog codes"
    - "two way source coding with a helper"
    - "shannon s secrecy system with informed receivers and its application to systematic coding for wiretapped channels"

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)