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 sphere decoding of polar codes based on optimum path metric"
  Abstract: Sphere decoding (SD) of polar codes is an efficient method to achieve the error performance of maximum likelihood (ML) decoding. But the complexity of the conventional sphere decoder is still high, where the candidates in a target sphere are enumerated and the radius is decreased gradually until no available candidate is in the sphere. In order to reduce the complexity of SD, a stack SD (SSD) algorithm with an efficient enumeration is proposed in this paper. Based on a novel path metric, SSD can effectively narrow the search range when enumerating the candidates within a sphere. The proposed metric follows an exact ML rule and takes the full usage of the whole received sequence. Furthermore, another very simple metric is provided as an approximation of the ML metric in the high signal-to-noise ratio regime. For short polar codes, simulation results over the additive white Gaussian noise channels show that the complexity of SSD based on the proposed metrics is up to 100 times lower than that of the conventional SD.

Connected through hyperedge HE-1 (induced by source paper "sphere constraint based enumeration methods to analyze the minimum weight distribution of polar codes"):
  with members:
    - "does gaussian approximation work well for the long length polar code construction"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "approaching the finite blocklength capacity within 0 025db by short polar codes and crc aided hybrid decoding"):
  with members:
    - "from sequential decoding to channel polarization and back again"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "a low latency list successive cancellation decoding implementation for polar codes"):
  with members:
    - "symbol decision successive cancellation list decoder for polar codes"
    - "on metric sorting for successive cancellation list decoding of polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "low latency list decoding of polar codes with double thresholding"
    - "symbol based successive cancellation list decoder for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "finite length scaling for polar codes"
    - "increasing the speed of polar list decoders"

Connected through hyperedge HE-4 (induced by source paper "symbol decision successive cancellation list decoder for polar codes"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "error performance analysis of the symbol decision sc polar decoder"
    - "symbol based successive cancellation list decoder for polar codes"
    - "a scalable successive cancellation decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "parallel decoders of polar codes"
    - "list decoding of polar codes"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-5 (induced by source paper "a multi mode area efficient scl polar decoder"):
  with members:
    - "a high throughput list decoder architecture for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "llr based successive cancellation list decoding of polar codes"
    - "symbol based successive cancellation list decoder for polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a reduced latency list decoding algorithm for polar codes"
    - "a scalable successive cancellation decoder for polar codes"

Connected through hyperedge HE-6 (induced by source paper "low latency list decoding of polar codes with double thresholding"):
  with members:
    - "llr based successive cancellation list decoding of polar codes"
    - "fast polar decoders algorithm and implementation"
    - "increasing the speed of polar list decoders"
    - "a reduced latency list decoding algorithm for polar codes"
    - "successive cancellation list polar decoder using log likelihood ratios"
    - "a scalable successive cancellation decoder for polar codes"
    - "an efficient list decoder architecture for polar codes"
    - "improved successive cancellation decoding of polar codes"

Connected through hyperedge HE-7 (induced by source paper "error performance analysis of the symbol decision sc polar decoder"):
  with members:
    - "symbol decision successive cancellation list decoder for polar codes"
    - "symbol based successive cancellation list decoder for polar codes"
    - "parallel decoders of polar codes"
    - "list decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

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)