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: "the approximate sum capacity of the symmetric gaussian k user interference channel"
  Abstract: We derive a new achievable sum rate for the symmetric Gaussian K-user interference channel. This sum rate is shown to be within a constant gap of the outer bound on the sum capacity of this channel for all values of interference level outside some outage set. The result is established through the use of lattice interference alignment. A new lattice-based extension to the Han-Kobayshi scheme is also introduced.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac"):
  with members:
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "asymptotically optimal scheduling for compute and forward"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of private information retrieval with partially known private side information"
    - "gaussian multiple access via compute and forward"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "the necessity of scheduling in compute and forward"
    - "the capacity of robust private information retrieval with colluding databases"

Connected through hyperedge HE-2 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "gaussian multiple access via compute and forward"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "distributed decode forward for relay networks"

Connected through hyperedge HE-3 (induced by source paper "an adaptive deep learning algorithm based autoencoder for interference channels"):
  with members:
    - "physical adversarial attacks against end to end autoencoder communication systems"
    - "deep learning based channel estimation for beamspace mmwave massive mimo systems"
    - "one bit ofdm receivers via deep learning"
    - "deep reinforcement learning autoencoder with noisy feedback"
    - "end to end learning of communications systems without a channel model"
    - "deep learning for joint source channel coding of text"
    - "an introduction to deep learning for the physical layer"
    - "training of deep neural networks based on distance measures using rmsprop"

Connected through hyperedge HE-4 (induced by source paper "structured mappings and conferencing common information for multiple access channels"):
  with members:
    - "a new achievable rate region for multiple access channel with states"
    - "quasi linear codes application to point to point and multi terminal source coding"
    - "distributed simulation of continuous random variables"
    - "exact common information"
    - "on interference networks over finite fields"
    - "achievable rate region for three user discrete broadcast channel based on coset codes"
    - "computing sum of sources over an arbitrary multiple access channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"

Connected through hyperedge HE-5 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation"):
  with members:
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "on media based modulation using rf mirrors"
    - "feasibility of interference alignment for the mimo interference channel"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "performance analysis and optimization for interference alignment over mimo interference channels with limited feedback"
    - "five disruptive technology directions for 5g"
    - "csi feedback reduction for mimo interference alignment"
    - "on feasibility of interference alignment in mimo interference networks"

Connected through hyperedge HE-6 (induced by source paper "homologous codes for multiple access channels"):
  with members:
    - "on general lattice quantization noise"
    - "towards an algebraic network information theory simultaneous joint typicality decoding"
    - "communication versus computation duality for multiple access channels and source coding"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a joint typicality approach to algebraic network information theory"
    - "optimal achievable rates for interference networks with random codes"
    - "computing sum of sources over an arbitrary multiple access channel"

Connected through hyperedge HE-7 (induced by source paper "ring compute and forward over block fading channels"):
  with members:
    - "boosted kz and lll algorithms"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "universal lattice codes for mimo channels"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "lattices over eisenstein integers for compute and forward"
    - "an algebraic approach to physical layer network coding"

Connected through hyperedge HE-8 (induced by source paper "strong interference alignment"):
  with members:
    - "channel aided interference alignment"
    - "opportunistic interference alignment for mimo interfering multiple access channels"
    - "ergodic fading interference channels sum capacity and separability"
    - "ergodic interference alignment"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "capacity of symmetric k user gaussian very strong interference channels"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

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)