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 "computation over gaussian networks with orthogonal components"):
  Abstract: Function computation of arbitrarily correlated discrete sources over Gaussian networks with orthogonal components is studied. Two classes of functions are considered: the arithmetic sum function and the type function. The arithmetic sum function in this paper is defined as a set of multiple weighted arithmetic sums, which includes averaging of the sources and estimating each of the sources as special cases. The type or frequency histogram function counts the number of occurrences of each argument, which yields many important statistics such as mean, variance, maximum, minimum, median, and so on. The proposed computation coding first abstracts Gaussian networks into the corresponding modulo sum multiple-access channels via nested lattice codes and linear network coding and then computes the desired function by using linear Slepian-Wolf source coding. For orthogonal Gaussian networks (with no broadcast and multiple-access components), the computation capacity is characterized for a class of networks. For Gaussian networks with multiple-access components (but no broadcast), an approximate computation capacity is characterized for a class of networks.

Includes members:
  Member "computation in multicast networks function alignment and converse theorems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way function computation")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "nested lattice codes for gaussian relay networks with interference":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized compute compress and forward")
  Member "computing linear functions by linear coding over networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how to distribute computation in networks")
  Member "network coding for computing cut set bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "expand and randomize an algebraic approach to secure computation")
  Member "optimal function computation in directed and undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "how to distribute computation in networks")
  Member "linear codes target function classes and network computing capacity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "cascade multiterminal source coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hypothesis testing over the two hop relay network")

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)