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: "capacity bounds for a class of diamond networks"
  Abstract: A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min problem, where the maximization is over a coding distribution and the minimization is over an auxiliary channel. The proof technique generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981), and Kang and Liu for the Gaussian diamond network (2011). The bounds are evaluated for a Gaussian multiple access channel (MAC) and the binary adder MAC, and the capacity is found for interesting ranges of the bit-pipe capacities.

Connected through hyperedge HE-1 (induced by source paper "capacity bounds on the downlink of symmetric multi relay single receiver c ran networks"):
  with members:
    - "on achievability for downlink cloud radio access networks with base station cooperation"
    - "capacity bounds for diamond networks with an orthogonal broadcast channel"
    - "fronthaul constrained cloud radio access networks insights and challenges"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "sparse beamforming and user centric clustering for downlink cloud radio access network"
    - "an information theoretic approach to secret sharing"
    - "is non unique decoding necessary"
    - "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"

Connected through hyperedge HE-2 (induced by source paper "an upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity"):
  with members:
    - "capacity bounds for diamond networks with an orthogonal broadcast channel"
    - "joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "the gaussian multiple access diamond channel"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-3 (induced by source paper "capacity bounds for diamond networks with an orthogonal broadcast channel"):
  with members:
    - "generalization of mrs gerber s lemma"
    - "a new entropy power inequality for integer valued random variables"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "the gaussian multiple access diamond channel"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "entropy power inequality for a family of discrete random variables"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"

Connected through hyperedge HE-4 (induced by source paper "the gaussian multiple access diamond channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "capacity of a class of diamond channels"
    - "the gaussian mac with conferencing encoders"

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)