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 "robust gaussian joint source channel coding with a staircase distortion noise profile"):
  Abstract: Minimum energy required to achieve a distortion-noise profile, i.e., a function indicating the maximum allowed distortion value for each channel noise level. In this paper, the minimum energy required to achieve a distortion noise profile is studied for Gaussian sources which are transmitted robustly over Gaussian channels. We provide upper bound for the minimum energy behavior of the staircase profile using our proposed coding scheme. Conversely, utilizing a family of lower bounds originally derived for broadcast channels with power constraints, the minimum required energy is lower bounded for staircase profile.

Includes members:
  Member "robust gaussian joint source channel coding under the near zero bandwidth regime":
    also connected through other hyperedges:
      (none)
  Member "minimum energy for gaussian joint source channel coding with a square law distortion noise profile":
    also connected through other hyperedges:
      (none)
  Member "the porosity of additive noise sequences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum energy analysis for robust gaussian joint source channel coding with a square law profile")
  Member "communication over individual channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimum energy analysis for robust gaussian joint source channel coding with a square law profile")
  Member "interference channels with arbitrarily correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structured mappings and conferencing common information for multiple access channels")

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)