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 deterministic relay cascades with half duplex constraint"
  Abstract: Consider a relay cascade, i.e., a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q + 1)-ary pipes. Suppose the source and a subset of the relays wish to communicate independent information to the sink under the condition that each relay in the cascade is half-duplex constrained. A coding scheme is developed which transfers information by an information-dependent allocation of the transmission and reception slots of the relays. The coding scheme requires synchronization on the symbol level through a shared clock. The coding strategy achieves capacity for a single source. Numerical values for the capacity of cascades of various lengths are provided, and the capacities are significantly higher than the rates which are achievable with a predetermined time-sharing approach. If the cascade includes a source and a certain number of relays with their own information, the strategy achieves the cut-set bound when the rates of the relay sources fall below certain thresholds. 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 in bits/use for q = 1 is equal to the logarithm of the golden ratio, and the capacity for q = 2 is 1 bit/use.

Connected through hyperedge HE-1 (induced by source paper "capacity of the two hop half duplex relay channel"):
  with members:
    - "on the gaussian half duplex relay channel"
    - "capacity of gaussian channels with duty cycle and power constraints"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-2 (induced by source paper "capacity of gaussian channels with duty cycle and power constraints"):
  with members:
    - "virtual full duplex wireless communication via rapid on off division duplex"
    - "capacity for half duplex line networks with two sources"
    - "virtual full duplex wireless broadcasting via compressed sensing"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"

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

Connected through hyperedge HE-4 (induced by source paper "a constrained coding approach to error free half duplex relay networks"):
  with members:
    - "energy delay considerations in coded packet flows"
    - "virtual full duplex wireless communication via rapid on off division duplex"
    - "neighbor discovery for wireless networks via compressed sensing"
    - "capacity for half duplex line networks with two sources"

Connected through hyperedge HE-5 (induced by source paper "capacity for half duplex line networks with two sources"):
  with members:
    - "bits through 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-6 (induced by source paper "protocol coding through reordering of user resources applications and capacity results"):
  with members:
    - "coded modulation for power line communications"
    - "bits through relay cascades with half duplex constraint"

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)