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 "hash property and coding theorems for sparse matrices and maximum likelihood coding"):
  Abstract: The aim of this paper is to prove the achievability of several coding problems by using sparse matrices (the maximum column weight grows logarithmically in the block length) and maximal-likelihood (ML) coding. These problems are the Slepian-Wolf problem, the Gel'fand-Pinsker problem, the Wyner-Ziv problem, and the One-helps-one problem (source coding with partial side information at the decoder). To this end, the notion of a hash property for an ensemble of functions is introduced and it is proved that an ensemble of $q$-ary sparse matrices satisfies the hash property. Based on this property, it is proved that the rate of codes using sparse matrices and maximal-likelihood (ML) coding can achieve the optimal rate.

Includes members:
  Member "construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "construction of slepian wolf source code and broadcast channel code based on hash property")
  Member "hash property and fixed rate universal coding theorems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "construction of multiple access channel codes based on hash property")
  Member "lower bounds on the rate distortion function of ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on locally decodable source coding")
  Member "lower bounds on the rate distortion function of individual ldgm codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on locally decodable source coding")
  Member "low density codes achieve the rate distortion bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ratq a universal fixed length quantizer for stochastic optimization")
  Member "low density constructions can achieve the wyner ziv and gelfand pinsker bounds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analytical framework of ldgm based iterative quantization with decimation")

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)