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: "tightened upper bounds on the ml decoding error probability of binary linear block codes"
  Abstract: The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes over the AWGN channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds.

Connected through hyperedge HE-1 (induced by source paper "bp led decoding algorithm for ldpc codes over awgn channels"):
  with members:
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"
    - "weight distributions of regular low density parity check codes over finite fields"
    - "tree structure expectation propagation for decoding ldpc codes over binary erasure channels"
    - "lowering the error floor of ldpc codes using cyclic liftings"

Connected through hyperedge HE-2 (induced by source paper "on the renyi divergence joint range of relative entropies and a channel coding theorem"):
  with members:
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "bounds among f divergences"
    - "upper bounds on the relative entropy and r enyi divergence as a function of total variation distance for finite alphabets"
    - "tight bounds for symmetric divergence measures and a refined bound for lossless source coding"
    - "information theoretic applications of the logarithmic probability comparison bound"
    - "renyi divergence and kullback leibler divergence"
    - "multiple source adaptation and the renyi divergence"
    - "on pinsker s and vajda s type inequalities for csiszar s f divergences"

Connected through hyperedge HE-3 (induced by source paper "on the r e nyi divergence and the joint range of relative entropies"):
  with members:
    - "tight bounds for symmetric divergence measures and a refined bound for lossless source coding"
    - "information theoretic applications of the logarithmic probability comparison bound"
    - "minimization problems based on a parametric family of relative entropies ii reverse projection"
    - "on pairs of f divergences and their joint range"
    - "a note on a characterization of renyi measures and its relation to composite hypothesis testing"
    - "guessing under source uncertainty"

Connected through hyperedge HE-4 (induced by source paper "bounds on the ml decoding error probability of rs coded modulation over awgn channels"):
  with members:
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"
    - "iterative soft input soft output decoding of reed solomon codes by adapting the parity check matrix"
    - "maximum likelihood decoding of reed solomon codes is np hard"

Connected through hyperedge HE-5 (induced by source paper "upper bounds on the ml decoding error probability of general codes over awgn channels"):
  with members:
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"

Connected through hyperedge HE-6 (induced by source paper "non random coding error exponent for lattices"):
  with members:
    - "finite dimensional infinite constellations"
    - "communication over individual channels"

Connected through hyperedge HE-7 (induced by source paper "exhausting error prone patterns in ldpc codes"):
  with members:
    - "code annealing and the suppressing effect of the cyclically lifted ldpc code ensemble"
    - "instanton analysis of low density parity check codes in the error floor regime"
    - "on the stopping distance and the stopping redundancy of codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "density evolution for asymmetric memoryless channels"
    - "on the complexity of finding stopping distance in tanner graphs"

Connected through hyperedge HE-8 (induced by source paper "on the error exponents of some improved tangential sphere bounds"):
  with members:
    - "critical point for maximum likelihood decoding of linear block codes"

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)