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 "divergence scaling of fixed length binary output one to one distribution matching"):
  Abstract: Distribution matching is the process of mapping a uniformly distributed input sequence onto sequences that approximate the output of a desired discrete memoryless source and the original input sequence can be recovered. The special case of a binary output alphabet and one-to-one mapping is studied. A fixed-length distribution matcher is proposed that is optimal in the sense of minimizing the unnormalized divergence between its output distribution and a binary memoryless target distribution. Upper and lower bounds on the unnormalized divergence are computed that increase logarithmically in the output block length $n$. It follows that a recently proposed constant composition distribution matcher performs within a constant gap of the minimal achievable informational divergence.

Includes members:
  Member "optimal quantization for distribution synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a note on reverse pinsker inequalities")
  Member "constant composition distribution matching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate constrained shaping codes for structured sources")
  Member "arithmetic distribution matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate constrained shaping codes for structured sources")
  Member "how to achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "fixed to variable length distribution matching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rate constrained shaping codes for structured sources")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "operating ldpc codes with zero shaping gap":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "variable to fixed length homophonic coding suitable for asymmetric channel coding")
  Member "matching dyadic distributions to channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "rate constrained shaping codes for structured sources")

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)