human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "ergodic layered erasure one sided interference channels"
  Abstract: The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for the following sub-classes: i) weak, ii) strong (mix of strong but not very strong (SnVS) and very strong (VS)), iii) ergodic very strong (mix of strong and weak), and (iv) a sub-class of mixed interference (mix of SnVS and weak). Each sub-class is uniquely defined by the fading statistics.

Connected through hyperedge HE-1 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit"):
  with members:
    - "cooperation for interference management a gdof perspective"
    - "capacity bounds for a class of interference relay channels"
    - "capacity results for binary fading interference channels with delayed csit"
    - "ergodic interference alignment with delayed feedback"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "wireless network information flow a deterministic approach"
    - "ergodic fading interference channels sum capacity and separability"

Connected through hyperedge HE-2 (induced by source paper "binary fading interference channel with no csit"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "interference channels with rate limited feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "wireless network coding with local network views coded layer scheduling"):
  with members:
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "wireless network information flow a deterministic approach"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "on the capacity of multi hop wireless networks with partial network knowledge"

Connected through hyperedge HE-4 (induced by source paper "ergodic fading one sided interference channels without state information at transmitters"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "ergodic fading interference channels sum capacity and separability"
    - "interference channels with destination cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"
    - "approximate capacity of the two way relay channel a deterministic approach"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-5 (induced by source paper "capacity region of layered erasure one sided interference channels without csit"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "fading broadcast channels with state information at the receivers"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

Question: Please tell me which class the center node 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)