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: "probabilistic amplitude shaping with hard decision decoding and staircase codes"
  Abstract: We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the literature, we consider probabilistic shaping with hard decision decoding (HDD). In particular, we apply the PAS recently introduced by Bocherer et al. to a coded modulation (CM) scheme with bit-wise HDD that uses a staircase code as the forward error correction code. We show that the CM scheme with PAS and staircase codes yields significant gains in spectral efficiency with respect to the baseline scheme using a staircase code and a standard constellation with uniformly distributed signal points. Using a single staircase code, the proposed scheme achieves performance within 0.57–1.44 dB of the corresponding achievable information rate for a wide range of spectral efficiencies.

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"
    - "miscorrection free decoding of staircase codes"

Connected through hyperedge HE-2 (induced by source paper "binary message passing decoding of product like codes"):
  with members:
    - "binary message passing decoding of product codes based on generalized minimum distance decoding"
    - "low complexity concatenated ldpc staircase 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"
    - "achievable information rates for coded modulation with hard decision decoding for coherent fiber optic systems"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-3 (induced by source paper "on low complexity decoding of product codes for high throughput fiber optic systems"):
  with members:
    - "low complexity concatenated ldpc staircase codes"
    - "iterative bounded distance decoding of product codes with scaled reliability"
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "staircase codes fec for 100 gb s otn"
    - "analysis and design of binary message passing decoders"

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)