human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "multi terminal codes using constrained random number generators"):
  with members:
    - "on the error probability of stochastic decision and stochastic decoding"
    - "construction of a channel code from an arbitrary source code with decoder side information"
    - "channel coding and lossy source coding using a generator of constrained random numbers"

Connected through hyperedge HE-2 (induced by source paper "construction of a channel code from an arbitrary source code with decoder side information"):
  with members:
    - "on the error probability of stochastic decision and stochastic decoding"
    - "channel coding and lossy source coding using a generator of constrained random numbers"
    - "achievability proof via output statistics of random binning"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-3 (induced by source paper "channel coding and lossy source coding using a generator of constrained random numbers"):
  with members:
    - "achievability proof via output statistics of random binning"
    - "construction of multiple access channel codes based on hash property"
    - "hash property and coding theorems for sparse matrices and maximum likelihood coding"

Connected through hyperedge HE-4 (induced by source paper "achievability proof via output statistics of random binning"):
  with members:
    - "when is it possible to simulate a dmc channel from another"
    - "distributed channel synthesis"
    - "hybrid coding an interface for joint source channel coding and network communication"
    - "channel simulation via interactive communications"
    - "coordination via a relay"
    - "strongly secure communications over the two way wiretap channel"
    - "strong secrecy from channel resolvability"
    - "lecture notes on network information theory"

Connected through hyperedge HE-5 (induced by source paper "construction of multiple access channel codes based on hash property"):
  with members:
    - "lecture notes on network information theory"
    - "hash property and fixed rate universal coding theorems"
    - "hash property and coding theorems for sparse matrices and maximum likelihood coding"

Question: Please tell me which class the center node 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)