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 diamond networks with an orthogonal broadcast channel"
  Abstract: A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The lower bound is based on Marton's coding technique and superposition coding. The bounds are evaluated for Gaussian and binary adder multiple access channels (MACs). For Gaussian MACs, both the lower and upper bounds strengthen the Kang-Liu bounds and establish capacity for interesting ranges of bit-pipe capacities. For binary adder MACs, the capacity is established for all ranges of bit-pipe capacities.

Connected through hyperedge HE-1 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul"):
  with members:
    - "integer forcing architectures for uplink cloud radio access networks"
    - "generalized compression strategy for the downlink cloud radio access network"
    - "the capacity of the relay channel solution to cover s problem in the gaussian case"
    - "on the capacity of cloud radio access networks with oblivious relaying"
    - "lossy compression for compute and forward in limited backhaul uplink multicell processing"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "an uplink downlink duality for cloud radio access network"
    - "on achievability for downlink cloud radio access networks with base station cooperation"

Connected through hyperedge HE-2 (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"
    - "fronthaul constrained cloud radio access networks insights and challenges"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "capacity bounds for a class of diamond networks"
    - "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-3 (induced by source paper "the wiretapped diamond relay channel"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "achievability proof via output statistics of random binning"
    - "secrecy degrees of freedom of mimo broadcast channels with delayed csit"

Connected through hyperedge HE-4 (induced by source paper "on achievability for downlink cloud radio access networks with base station cooperation"):
  with members:
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "recent advances in cloud radio access networks system architectures key techniques and open issues"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "distributed decode forward for relay networks"
    - "sparse beamforming and user centric clustering for downlink cloud radio access network"
    - "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"

Connected through hyperedge HE-5 (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 a class of diamond networks"
    - "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-6 (induced by source paper "secure degrees of freedom of the gaussian diamond wiretap channel"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "an upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "achievability proof via output statistics of random binning"
    - "the gaussian multiple access diamond channel"

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)