human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "guessing random additive noise decoding with soft detection symbol reliability information sgrand"):
  Abstract: In computer communications, discrete data are channel coded to add robustness to noise and then modulated into continuous signals for transmission and reception. In a hard detection setting, received signals are demodulated into discrete data that are provided to a decoder for inference of the transmitted code-word. If additional soft detection information on the quality of the received signal is provided to the decoder, it is known that its use can improve decoding accuracy. Incorporating that information, however, typically comes at the expense of increased algorithmic complexity of the decoder. #R##N#Here we introduce and analyse a mechanism by which soft detection information can be used within Guessing Random Additive Noise Decoding (GRAND) framework in such a way that decoding accuracy is increased, but computational complexity is decreased. The principle envisages an enhanced code-book-independent quantization of soft detection information where demodulated symbols are indicated to be confidently reliable or are labeled as being unreliable. We introduce two algorithms that incorporate this symbol reliability information, one of which identifies a Maximum Likelihood (ML) decoding and the other either reports an ML decoding or an error. We prove that both are capacity-achieving when used with random code-books, and determine both error exponents and asymptotic complexity. These decoding algorithms are suitable for use with any block-code and have complexities that can only reduce as code-book rates increase. With respect to their hard detection counterparts, they are capable of achieving higher rates with lower error probabilities, and have reduced algorithmic complexity.

Includes members:
  Member "capacity achieving guessing random additive noise decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ordered reliability bits guessing random additive noise decoding")
  Member "a characterization of guesswork on swiftly tilting curves":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fair resource allocation in federated learning")
  Member "on the origin of polar coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding")
  Member "guesswork large deviations and shannon entropy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mismatched guesswork")
  Member "guessing a password over a wireless channel on the effect of noise non uniformity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity achieving guessing random additive noise decoding")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reed muller codes theory and algorithms")
  Member "guessing based on length functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving guessing random additive noise decoding")
  Member "iterative algebraic soft decision list decoding of reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "guessing random additive noise decoding with symbol reliability information srgrand")

Question: Please tell me which class the source paper 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)