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 "a case where interference does not affect the channel dispersion"):
  Abstract: In 1975, Carleial presented a special case of an interference channel in which the interference does not reduce the capacity of the constituent point-to-point Gaussian channels. In this work, we show that if the inequalities in the conditions that Carleial stated are strict, the dispersions are similarly unaffected. More precisely, in this work, we characterize the second-order coding rates of the Gaussian interference channel in the strictly very strong interference regime. In other words, we characterize the speed of convergence of rates of optimal block codes towards a boundary point of the (rectangular) capacity region. These second-order rates are expressed in terms of the average probability of error and variances of some modified information densities which coincide with the dispersion of the (single-user) Gaussian channel. We thus conclude that the dispersions are unaffected by interference in this channel model.

Includes members:
  Member "second order asymptotics for the gaussian mac with degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "second order region for gray wyner network")
  Member "the third order term in the normal approximation for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "second order coding rates for channels with state":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "second order and moderate deviation analysis of a block fading channel with deterministic and energy harvesting power constraints")
  Member "on the dispersions of three network information theory problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of image registration")
  Member "second order rate region of constant composition codes for the multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "non asymptotic and second order achievability bounds for coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "second order asymptotics for the gaussian mac with degraded message sets")
  Member "a finite blocklength perspective on gaussian multi access channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a proof of the strong converse theorem for gaussian 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)