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 "lecture notes on network information theory"):
  Abstract: These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at this http URL The previous (and obsolete) version of the lecture notes can be found at this http URL

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 "random access an information theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interference prediction in wireless networks stochastic geometry meets recursive filtering")
  Member "an information inequality for the bssc channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "evaluation of marton s inner bound for the general broadcast channel")
  Member "evaluation of marton s inner bound for the general broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the direction of discrimination an information theoretic analysis of disparate impact in machine learning")

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)