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 "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels"):
  Abstract: The Han-Kobayashi (HK) scheme achieves the best known achievable rate region for the K user interference channel (IC). Simple HK schemes are HK schemes with Gaussian signaling, no time sharing, and no private-common power splitting. The class of simple HK schemes includes the treating interference as noise (TIN) scheme and schemes that involve various levels of interference decoding and cancellation at each receiver. We derive conditions under which simple HK schemes achieve sum capacity for general K user Gaussian ICs. These results generalize existing sum capacity results for the TIN scheme to the class of simple HK schemes.

Includes members:
  Member "on the sum capacity of many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      (none)
  Member "on the gaussian many to one x channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "uplink non orthogonal multiple access with finite alphabet inputs")
  Member "capacity bounds for the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity scaling of massive mimo in strong spatial correlation regimes")
  Member "on the sum capacity of k user cascade gaussian z interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cognitive wyner networks with clustered decoding")
  Member "k user interference channels general outer bound and sum capacity for certain gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the sum capacity of many to one and one to many gaussian interference channels")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "new outer bounds on the capacity region of gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the sum capacity of many to one and one to many gaussian interference channels")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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.IT(Information Theory)