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: "latent capacity region a case study on symmetric broadcast with common messages"
  Abstract: We consider the problem of broadcast with common messages, and focus on the case that the common message rate RA, i.e., the rate of the message intended for all the receivers in the set A, is the same for all the set A of the same cardinality. Instead of attempting to characterize the capacity region of general broadcast channels, we only consider the structure of the capacity region that any broadcast channel should bear. The concept of latent capacity region is useful in capturing these underlying constraints, and we provide a complete characterization of the latent capacity region for the symmetric broadcast problem. The converse proof of this tight characterization relies on a deterministic broadcast channel model. The achievability proof generalizes the familiar rate transfer argument to include more involved erasure correction coding among messages, thus revealing an inherent connection between broadcast with common message and erasure correction codes.

Connected through hyperedge HE-1 (induced by source paper "an achievable rate region for two groupcast messages over the k user broadcast channel and capacity results for the combination network"):
  with members:
    - "noisy broadcast networks with receiver caching"
    - "capacity results for multicasting nested message sets over combination networks"
    - "is non unique decoding necessary"
    - "generalized cut set bounds for broadcast networks"
    - "fundamental constraints on multicast capacity regions"

Connected through hyperedge HE-2 (induced by source paper "the k user dm broadcast channel with two groupcast messages achievable rate regions and the combination network as a case study"):
  with members:
    - "noisy broadcast networks with receiver caching"
    - "capacity results for multicasting nested message sets over combination networks"
    - "is non unique decoding necessary"
    - "generalized cut set bounds for broadcast networks"
    - "fundamental constraints on multicast capacity regions"

Connected through hyperedge HE-3 (induced by source paper "symmetry outer bounds and code constructions a computer aided investigation on the fundamental limits of caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching for a large number of users"
    - "caching and delivery via interference elimination"
    - "improved approximation of storage rate tradeoff for caching with multiple demands"
    - "on caching with more users than files"
    - "critical database size for effective caching"
    - "a note on the rate region of exact repair regenerating codes"
    - "order optimal rate of caching and coded multicasting with random demands"

Connected through hyperedge HE-4 (induced by source paper "generalized cut set bounds for broadcast networks"):
  with members:
    - "the single source two terminal network with network coding"
    - "mission impossible computing the network coding capacity region"
    - "fundamental constraints on multicast capacity regions"

Connected through hyperedge HE-5 (induced by source paper "an achievable region for a general multi terminal network and the corresponding chain graph representation"):
  with members:
    - "interference networks with general message sets a random coding scheme"
    - "the capacity of the semi deterministic cognitive interference channel and its application to constant gap results for the gaussian channel"
    - "on the capacity of the interference channel with a cognitive relay"
    - "lecture notes on network information theory"
    - "compute and forward harnessing interference through structured codes"
    - "fundamental constraints on multicast capacity regions"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-6 (induced by source paper "rate distortion with side information at many decoders"):
  with members:
    - "multiterminal source coding with complementary delivery"
    - "side information scalable source coding"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"

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)