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 for half duplex line networks with two sources"
  Abstract: The focus is on noise-free half-duplex line networks with two sources where the first node and either the second node or the second-last node in the cascade act as sources. In both cases, we establish the capacity region of rates at which both sources can transmit independent information to a common sink. The achievability scheme presented for the first case is constructive while the achievability scheme for the second case is based on a random coding argument.

Connected through hyperedge HE-1 (induced by source paper "capacity of gaussian channels with duty cycle and power constraints"):
  with members:
    - "bits through deterministic relay cascades with half duplex constraint"
    - "virtual full duplex wireless communication via rapid on off division duplex"
    - "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-2 (induced by source paper "energy delay considerations in coded packet flows"):
  with members:
    - "study of throughput and latency in finite buffer coded networks"
    - "on the delay of network coding over line networks"
    - "arq for network coding"
    - "coding schemes for line networks"

Connected through hyperedge HE-3 (induced by source paper "a constrained coding approach to error free half duplex relay networks"):
  with members:
    - "bits through deterministic relay cascades with half duplex constraint"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "virtual full duplex wireless communication via rapid on off division duplex"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "asynchronous cdma systems with random spreading part ii design criteria"
    - "rethinking information theory for mobile ad hoc networks"
    - "coding strategies for noise free relay cascades with half duplex constraint"
    - "neighbor discovery in wireless networks a multiuser detection approach"

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)