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 "ordered reliability bits guessing random additive noise decoding"):
  Abstract: Guessing Random Additive Noise Decoding (GRAND) can, unusually, decode any forward error correction block code. The original algorithm assumed that the decoder received only hard decision demodulated to inform its decoding. As the incorporation of soft information is known to improve decoding precision, here we introduce Ordered Reliability Bits GRAND, that, for binary block code of length $n$, avails of no more than $\lceil \log_2(n)\rceil$ bits of code-book-independent quantized soft detection information per received bit to determine an accurate decoding. ORBGRAND is shown to provide better block error rate performance than CA-SCL, a state of the art CA-Polar decoder, with low complexity. Random Linear Codes of the same rate, decoded with ORBGRAND, are shown to have comparable block-error and complexity performance.

Includes members:
  Member "guessing random additive noise decoding with symbol reliability information srgrand":
    also connected through other hyperedges:
      (none)
  Member "capacity achieving guessing random additive noise decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "soft maximum likelihood decoding using grand")
  Member "guessing random additive noise decoding with soft detection symbol reliability information sgrand":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "5g nr ca polar maximum likelihood decoding by grand")
  Member "fast and flexible software polar list decoders":
    also connected through other hyperedges:
      (none)
  Member "llr based successive cancellation list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")

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)