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 "on scaling rules for energy of vlsi polar encoders and decoders"):
  Abstract: It is shown that all polar encoding schemes of rate $R>\frac{1}{2}$ of block length $N$ implemented according to the Thompson VLSI model must take energy $E\ge\Omega\left(N^{3/2}\right)$. This lower bound is achievable up to polylogarithmic factors using a mesh network topology defined by Thompson and the encoding algorithm defined by Arikan. A general class of circuits that compute successive cancellation decoding adapted from Arikan's butterfly network algorithm is defined. It is shown that such decoders implemented on a rectangle grid for codes of rate $R>2/3$ must take energy $E\ge\Omega(N^{3/2})$, and this can also be reached up to polylogarithmic factors using a mesh network. Capacity approaching sequences of energy optimal polar encoders and decoders, as a function of reciprocal gap to capacity $\chi = (1-R/C)^{-1}$, have energy that scales as $\Omega\left(\chi^{5.325}\right)\le E \le O\left(\chi^{7.05}\log^{4}\left(\chi\right)\right)$.

Includes members:
  Member "information friction and its implications on minimum energy required for communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "information theory of molecular communication directions and challenges")
  Member "towards approaching total power capacity transmit and decoding power minimization for ldpc codes":
    also connected through other hyperedges:
      (none)
  Member "finite length scaling for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "energy consumption of vlsi decoders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressive sensing based user clustering for downlink noma systems with decoding power")
  Member "a high throughput energy efficient implementation of successive cancellation decoder for polar codes using combinational logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a multi kernel multi code polar decoder architecture")
  Member "polar codes speed of polarization and polynomial gap to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes simplicity random codes durability")
  Member "improved bounds on the finite length scaling of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "hardware architectures for successive cancellation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)