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: "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.

Connected through hyperedge HE-1 (induced by source paper "how to achieve the capacity of asymmetric channels"):
  with members:
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "construction of polar codes with sublinear complexity"
    - "polar codes for broadcast channels"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "achieving marton s region for broadcast channels using polar codes"

Connected through hyperedge HE-2 (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"
    - "construction of slepian wolf source code and broadcast channel code based on hash property"

Connected through hyperedge HE-3 (induced by source paper "universal wyner ziv coding for distortion constrained general side information"):
  with members:
    - "channel coding and lossy source coding using a generator of constrained random numbers"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "achievability proof via output statistics of random binning"
    - "reliability in source coding with side information"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "universal source coding over generalized complementary delivery networks"
    - "efficient on line schemes for encoding individual sequences with side information at the decoder"

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"
    - "construction of slepian wolf source code and broadcast channel code based on hash property"

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

Connected through hyperedge HE-6 (induced by source paper "construction of slepian wolf source code and broadcast channel code based on hash property"):
  with members:
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "lecture notes on network information theory"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices"
    - "disjoint ldpc coding for gaussian broadcast channels"
    - "an outer bound for 2 receiver discrete memoryless broadcast channels"
    - "hash property and fixed rate universal coding theorems"

Connected through hyperedge HE-7 (induced by source paper "construction of codes for wiretap channel and secret key agreement from correlated source outputs by using sparse matrices"):
  with members:
    - "hash property and fixed rate universal coding theorems"
    - "applications of ldpc codes to the wiretap channel"

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)