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: "bits through relay cascades with half duplex constraint"
  Abstract: Consider a relay cascade, i.e. a network where the source node, the sink node and a certain number of intermediate relay nodes are arranged in a line. We assume that adjacent node pairs are connected by error-free (q+1)-ary pipes. Following communication scenario is treated. The source and a subset of the relays wish to communicate independent information to a common sink under the condition that each relay in the cascade is half-duplex constrained. We introduce a simple channel model for half-duplex constrained links and provide a coding scheme which transfers information by an information-dependent, non-deterministic allocation of the transmission and reception slots of the relays. In case of a relay cascade with a single source, the coding strategy is capacity achieving. Numerical values for the capacity of cascades of various length are provided and it turns out that the capacities are significantly higher than the rates which are achievable with a deterministic time-sharing approach. If the cascade includes a source and a certain number of relays with own information, the strategy achieves the cut-set bound given that the rates of the relay sources fall below individual thresholds. Hence, a partial characterization of the boundary of the capacity region follows. For cascades composed of an infinite number of half-duplex constrained relays and a single source, we derive an explicit capacity expression. Remarkably, the capacity for q=1 is equal to the logarithm of the golden ratio. We finally show that the proposed coding strategy is superior to network coding in case of the wireless, half-duplex constrained butterfly network.

Connected through hyperedge HE-1 (induced by source paper "protocol coding through reordering of user resources part i capacity results"):
  with members:
    - "bits through deterministic relay cascades with half duplex constraint"
    - "coded modulation for power line communications"

Connected through hyperedge HE-2 (induced by source paper "achievable rate regions and outer bounds for a multi pair bi directional relay network"):
  with members:
    - "the multi way relay channel"
    - "capacity of the gaussian two way relay channel to within 1 2 bit"
    - "the mimo wireless switch relaying can increase the multiplexing gain"
    - "capacity region of the deterministic multi pair bi directional relay network"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "to code or not to code in multi hop relay channels"
    - "on the capacity and diversity multiplexing tradeoff of the two way relay channel"
    - "bi directional half duplex protocols with multiple relays"

Connected through hyperedge HE-3 (induced by source paper "capacity for half duplex line networks with two sources"):
  with members:
    - "bits through deterministic relay cascades with half duplex constraint"
    - "coding strategies for noise free relay cascades with half duplex constraint"
    - "capacity of the degraded half duplex relay channel"

Connected through hyperedge HE-4 (induced by source paper "protocol coding through reordering of user resources applications and capacity results"):
  with members:
    - "bits through deterministic relay cascades with half duplex constraint"
    - "coded modulation for power line communications"

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)