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: "refinement of the random coding bound"
  Abstract: An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $\epsilon >0$ a pre-factor of $O(N^{-\frac{1}{2}\left( 1 - \epsilon + \bar{\rho}^\ast_R \right)})$ (resp. $O(N^{-\frac{1}{2}})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $\bar{\rho}^\ast_R$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent refinement of the sphere-packing bound, as well as the pre-factor for the random coding bound below the critical rate, is discussed.

Connected through hyperedge HE-1 (induced by source paper "second order asymptotics of sequential hypothesis testing"):
  with members:
    - "reliability of sequential hypothesis testing can be achieved by an almost fixed length test"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "refinement of the sphere packing bound asymmetric channels"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-2 (induced by source paper "saddlepoint approximations for short packet wireless communications"):
  with members:
    - "secure short packet communications for mission critical iot applications"
    - "efficient error correcting codes in the short blocklength regime"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "joint sum rate and error probability optimization finite blocklength analysis"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "on single antenna rayleigh block fading channels at finite blocklength"

Connected through hyperedge HE-3 (induced by source paper "on exact asymptotics of the error probability in channel coding symmetric channels"):
  with members:
    - "a new method for employing feedback to improve coding performance"
    - "the sphere packing bound for dspcs with feedback a la augustin"
    - "exact asymptotics for the random coding error probability"
    - "the saddlepoint approximation unified random coding asymptotics for fixed and varying rates"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "a derivation of the asymptotic random coding prefactor"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"

Connected through hyperedge HE-4 (induced by source paper "almost exact analysis of soft covering lemma via large deviation"):
  with members:
    - "exact soft covering exponent"
    - "a correlation measure based on vector valued l_p norms"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "distributed channel synthesis"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "an operational approach to information leakage"):
  with members:
    - "estimation efficiency under privacy constraints"
    - "technical privacy metrics a systematic survey"
    - "measuring secrecy by the probability of a successful guess"
    - "principal inertia components and applications"
    - "privacy utility tradeoffs under constrained data release mechanisms"
    - "hypothesis testing under maximal leakage privacy constraints"
    - "a large deviations approach to secure lossy compression"
    - "mitigating timing side channel in shared schedulers"

Connected through hyperedge HE-6 (induced by source paper "the sphere packing bound for memoryless channels"):
  with members:
    - "on exact asymptotics of the error probability in channel coding symmetric channels"
    - "a simple derivation of the refined spb for the constant composition codes"
    - "the renyi capacity and center"
    - "saddlepoint approximations for short packet wireless communications"
    - "the augustin capacity and center"
    - "the augustin center and the sphere packing bound for memoryless channels"
    - "the capacity of gaussian mimo channels under total and per antenna power constraints"
    - "the sphere packing bound via augustin s method"

Connected through hyperedge HE-7 (induced by source paper "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"):
  with members:
    - "second order region for gray wyner network"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "second order coding region for the discrete lossy gray wyner source coding problem"
    - "the lossy common information of correlated sources"
    - "second order coding rates for channels with state"
    - "a technique for deriving one shot achievability results in network information theory"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-8 (induced by source paper "the sphere packing bound via augustin s method"):
  with members:
    - "the renyi capacity and center"
    - "the sphere packing bound for memoryless channels"
    - "the sphere packing bound for dspcs with feedback a la augustin"
    - "the augustin capacity and center"
    - "the augustin center and the sphere packing bound for memoryless channels"
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "f divergence inequalities"
    - "exact asymptotics for the random coding error probability"

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)