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 "second order region for gray wyner network"):
  Abstract: The coding problem over the Gray–Wyner network is studied from the second-order coding rates perspective. A tilted information density for this network is introduced in the spirit of Kostina–Verdu, and, under a certain regularity condition, the second-order region is characterized in terms of the variance of this tilted information density and the tangent vector of the first-order region. The second-order region is proved by the type method: the achievability part is proved by the type-covering argument, and the converse part is proved by a refinement of the perturbation approach that was used by Gu–Effros to show the strong converse of the Gray–Wyner network. This is the first instance that the second-order region is characterized for a multi-terminal problem, where the characterization of the first-order region involves an auxiliary random variable.

Includes members:
  Member "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential strong converse for successive refinement with causal decoder side information")
  Member "interactive communication for data exchange":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal multiparty data exchange and secret key agreement")
  Member "second order asymptotics for the gaussian mac with degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "second order and moderate deviation asymptotics for successive refinement")
  Member "strong successive refinability and rate distortion complexity tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exponential strong converse for successive refinement with causal decoder side information")
  Member "asymptotic estimates in information theory with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of image registration")
  Member "information complexity density and simulation of protocols":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "strong converse and second order asymptotics of channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication for generating correlation a unifying survey")
  Member "channels with cost constraints strong converse and dispersion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite sample analysis of image registration")

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)