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: "on the role of mmse estimation in approaching the information theoretic limits of linear gaussian channels shannon meets wiener"
  Abstract: We discuss why MMSE estimation arises in lattice-based schemes for approaching the capacity of linear Gaussian channels, and comment on its properties.

Connected through hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission"):
  with members:
    - "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"
    - "optimal resource allocation for power efficient mc noma with imperfect channel state information"
    - "improved decoding and error floor analysis of staircase codes"
    - "performance analysis of a hybrid downlink uplink cooperative noma scheme"
    - "on non orthogonal multiple access with finite alphabet inputs in z channels"

Connected through hyperedge HE-2 (induced by source paper "polar coding for common message only wiretap broadcast channel"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "universal polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "polar codes are optimal for lossy source coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "polar coding for the wiretap broadcast channel with multiple messages"):
  with members:
    - "polar coding for common message only wiretap broadcast channel"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "multi receiver wiretap channel with public and confidential messages"
    - "polar codes are optimal for lossy source coding"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the deterministic sum capacity of the multiple access wiretap channel"
    - "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-5 (induced by source paper "joint coordination channel coding for strong coordination over noisy channels based on polar codes"):
  with members:
    - "strong coordination of signals and actions over noisy channels"
    - "strong coordination over noisy channels is separation sufficient"
    - "empirical and strong coordination via soft covering with polar codes"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "polar codes for broadcast channels"
    - "strong coordination over multi hop line networks"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"

Connected through hyperedge HE-6 (induced by source paper "capacity of the gaussian two pair two way relay channel to within 1 2 bit"):
  with members:
    - "optimal dof region for the asymmetric two pair mimo two way relay channel"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "cyclic communication and the inseparability of mimo multi way relay channels"
    - "mimo multiway relaying with clustered full data exchange signal space alignment and degrees of freedom"
    - "degrees of freedom for the mimo multi way relay channel"
    - "the degrees of freedom of the mimo y channel"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "on the equal rate capacity of the awgn multiway relay channel"

Connected through hyperedge HE-7 (induced by source paper "preserving confidentiality in the gaussian broadcast channel using compute and forward"):
  with members:
    - "security in the gaussian interference channel weak and moderately weak interference regimes"
    - "compute and forward can buy secrecy cheap"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "secure degrees of freedom for gaussian channels with interference structured codes outperform gaussian signaling"

Connected through hyperedge HE-8 (induced by source paper "stealthy secret key generation"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"
    - "secret key agreement by soft decision of signals in gaussian maurer s model"

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)