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 deterministic relay channels"
  Abstract: The capacity of a class of deterministic relay channels with the transmitter input X, the receiver output Y, the relay output Y1 = f(X,Y), and a separate communication link from the relay to the receiver with capacity R0, is shown to be C(R0) =max min{I(X;Y) + R0, I(X;Y,Y1)}. p(x) Thus every bit from the relay is worth exactly one bit to the receiver. Two alternative coding schemes are presented that achieve this capacity. The first scheme, "hash-and-forward", is based on a variation of the usual random binning on the relay outputs, while the second scheme uses the usual "compress-and- forward". In fact, these two schemes can be combined to give a class of optimal coding schemes. As a corollary, this relay capacity result confirms a conjecture by Ahlswede and Han on the capacity of a channel with rate-limited state information at the decoder in the special case when the channel state is recoverable from the channel input and output.

Connected through hyperedge HE-1 (induced by source paper "interference mitigation via relaying"):
  with members:
    - "study of gaussian relay channels with correlated noises"
    - "capacity of the gaussian relay channel with correlated noises to within a constant gap"

Connected through hyperedge HE-2 (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 diamond channels"
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-3 (induced by source paper "half duplex relaying for the multiuser channel"):
  with members:
    - "two birds and one stone gaussian interference channel with a shared out of band relay of limited rate"
    - "wireless network information flow a deterministic approach"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "noisy network coding"
    - "lecture notes on network information theory"
    - "multiple multicasts with the help of a relay"

Connected through hyperedge HE-4 (induced by source paper "hash and forward relaying for two way relay channel"):
  with members:
    - "approximate capacity of the two way relay channel a deterministic approach"
    - "physical layer network coding"

Connected through hyperedge HE-5 (induced by source paper "a delay constrained general achievable rate and certain capacity results for uwb relay channel"):
  with members:
    - "study of gaussian relay channels with correlated noises"
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-6 (induced by source paper "study of gaussian relay channels with correlated noises"):
  with members:
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-7 (induced by source paper "interference channel with an out of band relay"):
  with members:
    - "ergodic fading interference channels sum capacity and separability"
    - "the multi way relay channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"
    - "noisy network coding"
    - "the mimo wireless switch relaying can increase the multiplexing gain"
    - "noisy interference sum rate capacity of parallel gaussian interference channels"
    - "multiple multicasts with the help of a relay"

Connected through hyperedge HE-8 (induced by source paper "cooperation with an untrusted relay a secrecy perspective"):
  with members:
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "the role of feedback in two way secure communications"
    - "providing secrecy with lattice codes"
    - "two hop secure communication using an untrusted relay"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "multi antenna gaussian broadcast channels with confidential messages"

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)