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 of a class of diamond channels"
  Abstract: We study a special class of diamond channels which was introduced by Schein in 2001. In this special class, each diamond channel consists of a transmitter, a noisy relay, a noiseless relay and a receiver. We prove the capacity of this class of diamond channels by providing an achievable scheme and a converse. The capacity we show is strictly smaller than the cut-set bound. Our result also shows the optimality of a combination of decode-and-forward (DAF) and compress-and-forward (CAF) at the noisy relay node. This is the first example where a combination of DAF and CAF is shown to be capacity achieving. Finally, we note that there exists a duality between this diamond channel coding problem and the Kaspi-Berger source coding problem.

Connected through hyperedge HE-1 (induced by source paper "generalized compression strategy for the downlink cloud radio access network"):
  with members:
    - "hybrid data sharing and compression strategy for downlink cloud radio access network"
    - "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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "capacity bounds for diamond networks with an orthogonal broadcast channel"):
  with members:
    - "generalization of mrs gerber s lemma"
    - "capacity bounds for a class of diamond networks"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "capacity of a class of state dependent orthogonal relay channels"):
  with members:
    - "cooperative binning for semideterministic channels"
    - "relay channel with orthogonal components and structured interference known at the source"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "message and state cooperation in a relay channel when only the relay knows the state"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "capacity of a class of deterministic relay channels"
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-4 (induced by source paper "degraded broadcast diamond channels with non causal state information at the source"):
  with members:
    - "multiple access channels with states causally known at transmitters"
    - "the gaussian multiple access diamond channel"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-5 (induced by source paper "the approximate capacity of the gaussian n relay diamond network"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on the capacity of the half duplex diamond channel"
    - "the balanced unicast and multicast capacity regions of large wireless networks"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "on capacity scaling in arbitrary wireless networks"
    - "a new achievable rate for the gaussian parallel relay channel"
    - "interference alignment in dense wireless networks"
    - "on the capacity of the diamond half duplex relay channel"

Connected through hyperedge HE-6 (induced by source paper "on the achievable rates of the diamond relay channel with conferencing links"):
  with members:
    - "the approximate capacity of the gaussian n relay diamond network"
    - "on the capacity of the half duplex diamond channel"
    - "lecture notes on network information theory"
    - "compound multiple access channels with partial cooperation"
    - "broadcast channels with cooperating decoders"

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

Connected through hyperedge HE-8 (induced by source paper "on the capacity of the half duplex diamond channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a new achievable rate for the gaussian parallel relay channel"
    - "cooperative strategies for the half duplex gaussian parallel relay channel simultaneous relaying versus successive relaying"
    - "dmt of multi hop cooperative networks part i basic results"
    - "dmt of multi hop cooperative networks part ii half duplex networks with full duplex performance"
    - "on the diversity multiplexing tradeoff in multiple relay network"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

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)