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: "slepian wolf code design via source channel correspondence"
  Abstract: We consider Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes for memoryless source-side information pairs. A density evolution formula, equipped with a concentration theorem, is derived for Slepian- Wolf coding based on LDPC coset codes. As a consequence, an intimate connection between Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, design of binary LDPC coset codes for Slepian-Wolf coding of an arbitrary memoryless source-side information pair reduces to design of binary LDPC codes for binary-input output-symmetric channels without loss of optimality. With this connection, many classic results in channel coding can be easily translated into the Slepian-Wolf setting.

Connected through hyperedge HE-1 (induced by source paper "code design for the noisy slepian wolf problem"):
  with members:
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universality for the noisy slepian wolf problem via spatial coupling"
    - "universal codes for the gaussian mac via spatial coupling"
    - "ldpc code design for transmission of correlated sources across noisy channels without csit"
    - "can iterative decoding for erasure correlated sources be universal"
    - "network information flow with correlated sources"

Connected through hyperedge HE-2 (induced by source paper "universality for the noisy slepian wolf problem via spatial coupling"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "ldpc code design for transmission of correlated sources across noisy channels without csit"
    - "threshold saturation on bms channels via spatial coupling"
    - "can iterative decoding for erasure correlated sources be universal"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"
    - "the generalized area theorem and some of its consequences"
    - "network information flow with correlated sources"

Connected through hyperedge HE-3 (induced by source paper "ldpc code design for transmission of correlated sources across noisy channels without csit"):
  with members:
    - "can iterative decoding for erasure correlated sources be universal"
    - "network information flow with correlated sources"

Connected through hyperedge HE-4 (induced by source paper "distributed source coding in dense sensor networks"):
  with members:
    - "rate region of the quadratic gaussian two encoder source coding problem"

Connected through hyperedge HE-5 (induced by source paper "wireless information theoretic security part ii practical implementation"):
  with members:
    - "on the typicality of the linear code among the ldpc coset code ensemble"
    - "reconciliation of a quantum distributed gaussian key"

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)