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: "optimal thresholds for gmd decoding with l 1 over l extended bounded distance decoders"
  Abstract: We investigate threshold-based multi-trial decoding of concatenated codes with an inner Maximum-Likelihood decoder and an outer error/erasure l+1 over l-extended Bounded Distance decoder, i.e. a decoder which corrects e errors and τ erasures if l+1 over le+τ ≤ do−1, where do is the minimum distance of the outer code and l ∈ ℕ\{0}. This is a generalization of Forney's GMD decoding, which was considered only for l = 1, i.e. outer Bounded Minimum Distance decoding. One important example for l+1 over l-extended Bounded Distance decoders is decoding of l-Interleaved Reed-Solomon codes. Our main contribution is a threshold location formula, which allows to optimally erase unreliable inner decoding results, for a given number of decoding trials and parameter l. Thereby, the term optimal means that the residual codeword error probability of the concatenated code is minimized. We give an estimation of this probability for any number of decoding trials.

Connected through hyperedge HE-1 (induced by source paper "optimal threshold based multi trial error erasure decoding with the guruswami sudan algorithm"):
  with members:
    - "on multiple decoding attempts for reed solomon codes a rate distortion approach"
    - "on generalized minimum distance decoding thresholds for the awgn channel"
    - "decoding generalized concatenated codes using interleaved reed solomon codes"

Connected through hyperedge HE-2 (induced by source paper "adaptive single trial error erasure decoding for binary codes"):
  with members:
    - "on generalized minimum distance decoding thresholds for the awgn channel"
    - "decoding generalized concatenated codes using interleaved reed solomon 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)