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: "low complexity joint channel estimation and list decoding of short codes"
  Abstract: A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step. The final decision of the message is obtained by applying a non-coherent decoding metric to the codewords composing the list. This allows one to use very few pilots, thus reducing the channel estimation overhead. The method is applied to an ordered statistics decoder for communication over a Rayleigh block-fading channel. Gains of up to $1.2$ dB as compared to traditional PAT schemes are demonstrated for short codes with QPSK signaling. The approach can be generalized to other list decoders, e.g., to list decoding of polar codes.

Connected through hyperedge HE-1 (induced by source paper "successive cancellation list decoding of product codes with reed muller component codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "efficient error correcting codes in the short blocklength regime"
    - "soft decision decoding of reed muller codes recursive lists"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "successive cancellation decoding of single parity check product codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "saddlepoint approximations for rayleigh block fading channels"):
  with members:
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "on single antenna rayleigh block fading channels at finite blocklength"
    - "64 apsk constellation and mapping optimization for satellite broadcasting using genetic algorithms"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "on the capacity of large mimo block fading channels"

Connected through hyperedge HE-3 (induced by source paper "efficient error correcting codes in the short blocklength regime"):
  with members:
    - "low latency short packet transmissions fixed length or harq"
    - "design of polar codes in 5g new radio"
    - "joint design of convolutional code and crc under serial list viterbi decoding"
    - "on the error probability of short concatenated polar and cyclic codes with interleaving"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "polar code construction for list decoding"
    - "ultra sparse non binary ldpc codes for probabilistic amplitude shaping"
    - "beta expansion a theoretical framework for fast and recursive construction of polar codes"

Connected through hyperedge HE-4 (induced by source paper "on single antenna rayleigh block fading channels at finite blocklength"):
  with members:
    - "low latency short packet transmissions fixed length or harq"
    - "efficient error correcting codes in the short blocklength regime"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "coherent multiple antenna block fading channels at finite blocklength"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "diversity versus multiplexing at finite blocklength"
    - "optimum power control at finite blocklength"

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)