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: "a unified scheme for two receiver broadcast channels with receiver message side information"
  Abstract: This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side information. We first propose a transmission scheme and derive an inner bound for the two-receiver memoryless broadcast channel. We next prove that this inner bound is tight for the deterministic channel and the more capable channel, thereby establishing their capacity regions.We show that this inner bound is also tight for all classes of two-receiver broadcast channels whose capacity regions were known prior to this work. Our proposed scheme is consequently a unified capacity-achieving scheme for these classes of broadcast channels.

Connected through hyperedge HE-1 (induced by source paper "speeding up future video distribution via channel aware caching aided coded multicast"):
  with members:
    - "joint cache channel coding over erasure broadcast channels"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "an efficient coded multicasting scheme preserving the multiplicative caching gain"
    - "finite length analysis of caching aided coded multicasting"
    - "on the capacity of broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "distortion memory tradeoffs in cache aided wireless video delivery"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "an efficient multiple groupcast coded multicasting scheme for finite fractional caching"

Connected through hyperedge HE-2 (induced by source paper "a unified inner bound for the two receiver memoryless broadcast channel with channel state and message side information"):
  with members:
    - "feedback and partial message side information on the semideterministic broadcast channel"
    - "information networks with in block memory"
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"

Connected through hyperedge HE-3 (induced by source paper "feedback and partial message side information on the semideterministic broadcast channel"):
  with members:
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "coding schemes with rate limited feedback that improve over the nofeedback capacity for a large class of broadcast channels"
    - "semi deterministic broadcast channels with cooperation and a dual source coding problem"
    - "an achievable rate region for the broadcast channel with feedback"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "rate regions for relay broadcast channels"

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)