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: "source coding for a simple network with receiver side information"
  Abstract: We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources to two receivers using three noiseless channels: a public channel which connects the transmitter to both receivers, and two private channels which connect the transmitter directly to each receiver. We extend Gray and Wyner's original problem by permitting side information to be present at each receiver. We derive inner and outer bounds for the achievable rate region and, for three special cases, we show that the outer bound is tight.

Connected through hyperedge HE-1 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement"):
  with members:
    - "secure broadcasting using independent secret keys"
    - "finite state markov wiretap channel with delayed feedback"
    - "multiple access relay wiretap channel"
    - "wiretap channel with causal state information and secure rate limited feedback"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy rate region of the broadcast channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "rate distortion region of a gray wyner model with side information"):
  with members:
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "source coding problems with conditionally less noisy side information"
    - "rate distortion with side information at many decoders"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-3 (induced by source paper "information theoretic caching sequential coding for computing"):
  with members:
    - "wireless device to device caching networks basic principles and system performance"
    - "a new converse bound for coded caching"
    - "a rate distortion approach to caching"
    - "content caching and delivery over heterogeneous wireless networks"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of caching with secure delivery"
    - "rate distortion function for a heegard berger problem with two sources and degraded reconstruction sets"
    - "coded caching for delay sensitive content"

Connected through hyperedge HE-4 (induced by source paper "a rate distortion approach to index coding"):
  with members:
    - "vector gaussian rate distortion with variable side information"
    - "graph theory versus minimum rank for index coding"
    - "on the capacity region for index coding"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "local graph coloring and index coding"
    - "fundamental limits of caching"
    - "source coding problems with conditionally less noisy side information"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-5 (induced by source paper "source coding problems with conditionally less noisy side information"):
  with members:
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

Connected through hyperedge HE-6 (induced by source paper "minimum communication cost for joint distributed source coding and dispersive information routing"):
  with members:
    - "minimum cost distributed source coding over a network"

Connected through hyperedge HE-7 (induced by source paper "on the capacity of the discrete memoryless broadcast channel with feedback"):
  with members:
    - "an achievable rate region for the broadcast channel with feedback"
    - "capacity of 1 to k broadcast packet erasure channels with channel output feedback"
    - "lecture notes on network information theory"
    - "side information scalable source coding"

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)