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 "the three user finite field multi way relay channel with correlated sources"):
  Abstract: This paper studies the three-user finite-field multi-way relay channel, where the users exchange messages via a relay. The messages are arbitrarily correlated, and the finite-field channel is linear and is subject to additive noise of arbitrary distribution. The problem is to determine the minimum achievable source-channel rate, defined as channel uses per source symbol needed for reliable communication. We combine Slepian-Wolf source coding and functional-decode-forward channel coding to obtain the solution for two classes of source and channel combinations. Furthermore, for correlated sources that have their common information equal their mutual information, we propose a new coding scheme to achieve the minimum source-channel rate.

Includes members:
  Member "multi way relay networks orthogonal uplink source channel separation and code design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a multiway relay channel with balanced sources")
  Member "gaussian two way relay channel with private information for the relay":
    also connected through other hyperedges:
      (none)
  Member "on the equal rate capacity of the awgn multiway relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "the capacity region of the restricted two way relay channel with any deterministic uplink":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "the capacity region of multiway relay channels over finite fields with full data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the single uniprior index coding problem the single sender case and the multi sender extension")
  Member "an optimal coding strategy for the binary multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximizing data rate for multiway relay channels with pairwise transmission strategy")
  Member "capacity theorems for the awgn multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "three way channels with multiple unicast sessions capacity approximation via network transformation")
  Member "when is a function securely computable":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "interactive secure function computation")

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)