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: "one shot capacity of discrete channels"
  Abstract: Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length $n$ such that the error probability goes to zero as $n$ goes to infinity. In this definition, it is implicit that the block length, which can be viewed as the number of available channel uses, is unlimited. This is not the case when the transmission power must be concentrated on a single transmission, most notably in military scenarios with adversarial conditions or delay-tolerant networks with random short encounters. A natural question arises: how much information can we transmit in a single use of the channel? We give a precise characterization of the one-shot capacity of discrete channels, defined as the maximum number of bits that can be transmitted in a single use of a channel with an error probability that does not exceed a prescribed value. This capacity definition is shown to be useful and significantly different from the zero-error problem statement.

Connected through hyperedge HE-1 (induced by source paper "finite blocklength analysis of multiple access channels with without cooperation"):
  with members:
    - "ultra reliable short packet communications half duplex or full duplex relaying"
    - "finite blocklength bounds for wiretap channels"
    - "relay assisted multiple access with full duplex multi packet reception"
    - "the third order term in the normal approximation for the awgn channel"
    - "finite block length analysis of the incremental redundancy harq"
    - "quasi static multiple antenna fading channels at finite blocklength"

Connected through hyperedge HE-2 (induced by source paper "towards massive ultra reliable and low latency wireless the art of sending short packets"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "finite length scaling for polar codes"
    - "diversity versus multiplexing at finite blocklength"
    - "optimum power control at finite blocklength"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-3 (induced by source paper "towards massive ultra reliable and low latency wireless communication with short packets"):
  with members:
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "finite length scaling for polar codes"
    - "ultra reliable communication in 5g wireless systems"
    - "feedback communication systems with limitations on incremental redundancy"

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)