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 "computing and communicating functions in disorganized wireless networks"):
  Abstract: For future wireless networks, enormous numbers of interconnections are required, creating a disorganized topology and leading to a great challenge in data aggregation. Instead of collecting data individually, a more efficient technique, computation over multi-access channels (CoMAC), has emerged to compute functions by exploiting the signal-superposition property of wireless channels. However, the implementation of CoMAC in disorganized networks with multiple relays (hops) is still an open problem. In this paper, we combine CoMAC and orthogonal communication in the disorganized network to attain the computation of functions at the fusion center. First, to make the disorganized network more tractable, we reorganize the disorganized network into a hierarchical network with multiple layers that consists of subgroups and groups. In the hierarchical network, we propose multi-layer function computation where CoMAC is applied to each subgroup and orthogonal communication is adopted within each group. By computing and communicating subgroup and group functions over layers, the desired functions are reconstructed at the fusion center. The general computation rate is derived and the performance is further improved through time allocation and power control. The closed-form solutions to optimization are obtained, which suggest that existing CoMAC and orthogonal communication schemes can be generalized.

Includes members:
  Member "over the air function computation in sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "one bit over the air aggregation for communication efficient federated edge learning design and convergence analysis")
  Member "upper bound on function computation in directed acyclic networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zero error function computation on a directed acyclic network")
  Member "nomographic functions efficient computation in clustered gaussian sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed approximation of functions over fast fading channels with applications to distributed learning and the max consensus problem")
  Member "computation over gaussian networks with orthogonal components":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph codes for distributed instant message collection in an arbitrary noisy broadcast network")
  Member "computing linear functions by linear coding over networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "how to distribute computation in networks")
  Member "duty cycle aware minimum energy multicasting in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the fast heuristic algorithms and post processing techniques to design large and low cost communication networks")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval over gaussian mac")

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)