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 "prefix free code distribution matching for probabilistic constellation shaping"):
  Abstract: In this work, we construct energy-efficient variable-to-fixed length (V2F), fixed-to-variable length (F2V), and variable-to-variable length (V2V) prefix-free codes, which are optimal (or near-optimal) in the sense that no (or few) other codes with the size can achieve a smaller energy per code letter for the same entropy rate. Under stringent constraints of 4096 entries or below per codebook, the constructed codes yield an energy per code letter within a few tenths of a dB of the unconstrained theoretic lower bound, across a wide range of entropy rates with a very fine granularity. We also propose a framing method that allows variable-length codes to be transmitted using a fixed-length frame. The penalty caused by framing is studied using simulations and analysis, showing that the energy per code letter is kept within 0.2 dB of the unconstrained theoretic limit for some tested codes with a large frame length. When framed prefix-free codes are used to implement probabilistic constellation shaping (PCS) for communications in the additive white Gaussian noise channel, simulations show that 1.1 dB and 0.65 dB of shaping gains are achieved relative to uniform 8- and 16-quadrature amplitude modulation (QAM), respectively.

Includes members:
  Member "shell mapping for distribution matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite precision implementation of arithmetic coding based distribution matchers")
  Member "divergence optimal fixed to fixed length distribution matching with shell mapping":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate constrained shaping codes for structured sources")
  Member "divergence scaling of fixed length binary output one to one distribution matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "shaped on off keying using polar codes")
  Member "fixed to variable length resolution coding for target distributions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal quantization for distribution synthesis")
  Member "constellation shaping for bit interleaved ldpc coded apsk":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems")
  Member "matching dyadic distributions to channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rate constrained shaping codes for structured sources")
  Member "prefix codes equiprobable words unequal letter costs":
    also connected through other hyperedges:
      (none)

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)