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 "construction of slepian wolf source code and broadcast channel code based on hash property"):
  Abstract: The aim of this paper is to prove theorems for the Slepian-Wolf source coding and the broadcast channel coding (independent messages and no common message) based on the the notion of a stronger version of the hash property for an ensemble of functions. Since an ensemble of sparse matrices has a strong hash property, codes using sparse matrices can realize the achievable rate region. Furthermore, extensions to the multiple source coding and multiple output broadcast channel coding are introduced.

Includes members:
  Member "evaluation of marton s inner bound for the general broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the direction of discrimination an information theoretic analysis of disparate impact in machine learning")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "evaluation of marton s inner bound for the general broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the direction of discrimination an information theoretic analysis of disparate impact in machine learning")
  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-4 (induced by source paper "hash property and coding theorems for sparse matrices and maximum likelihood coding")
  Member "disjoint ldpc coding for gaussian broadcast channels":
    also connected through other hyperedges:
      (none)
  Member "an outer bound for 2 receiver discrete memoryless broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "evaluation of marton s inner bound for the general broadcast channel")
  Member "hash property and fixed rate universal coding theorems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "construction of multiple access channel codes based on hash property")
  Member "hash property and coding theorems for sparse matrices and maximum likelihood coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how to achieve the capacity of asymmetric channels")

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)