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: "miscorrection free decoding of staircase codes"
  Abstract: We propose a novel decoding algorithm for staircase codes which reduces the effect of undetected component code miscorrections. The algorithm significantly improves performance, while retaining a low-complexity implementation suitable for high-speed optical transport networks.

Connected through hyperedge HE-1 (induced by source paper "on product codes with probabilistic amplitude shaping for high throughput fiber optic systems"):
  with members:
    - "binary message passing decoding of product codes based on generalized minimum distance decoding"
    - "binary message passing decoding of product like codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "on low complexity decoding of product codes for high throughput fiber optic systems"
    - "energy efficient soft assisted product decoders"
    - "increasing achievable information rates via geometric shaping"
    - "achievable rates for probabilistic shaping"
    - "probabilistic amplitude shaping with hard decision decoding and staircase codes"

Connected through hyperedge HE-2 (induced by source paper "improving hd fec decoding via bit marking"):
  with members:
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-3 (induced by source paper "approaching miscorrection free performance of product and generalized product codes"):
  with members:
    - "a 9 52 db ncg fec scheme and 162 b cycle low complexity product decoder architecture"
    - "stall pattern avoidance in polynomial product codes"
    - "irregular product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "on the asymptotic performance of iterative decoders for product codes"

Connected through hyperedge HE-4 (induced by source paper "improved decoding and error floor analysis of staircase codes"):
  with members:
    - "approaching miscorrection free performance of product and generalized product codes"
    - "stall pattern avoidance in polynomial product codes"
    - "staircase codes fec for 100 gb s otn"

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)