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: "source coding with side information using list decoding"
  Abstract: The problem of source coding with side information (SCSI) is closely related to channel coding. Therefore, existing literature focuses on using the most successful channel codes namely, LDPC codes, turbo codes, and their variants, to solve this problem assuming classical unique decoding of the underlying channel code. In this paper, in contrast to classical decoding, we have taken the list decoding approach. We show that syndrome source coding using list decoding can achieve the theoretical limit. We argue that, as opposed to channel coding, the correct sequence from the list produced by the list decoder can effectively be recovered in case of SCSI, since we are dealing with a virtual noisy channel rather than a real noisy channel. Finally, we present a guideline for designing constructive SCSI schemes using Reed Solomon code, BCH code, and Reed-Muller code, which are the known list-decodable codes.

Connected through hyperedge HE-1 (induced by source paper "hiding symbols and functions new metrics and constructions for information theoretic security"):
  with members:
    - "an exploration of the role of principal inertia components in information theory"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "rate distortion theory for secrecy systems"
    - "lists that are smaller than their parts a coding approach to tunable secrecy"
    - "universal secure network coding via rank metric codes"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-2 (induced by source paper "lists that are smaller than their parts a coding approach to tunable secrecy"):
  with members:
    - "universal secure network coding via rank metric codes"
    - "secure network coding for wiretap networks of type ii"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-3 (induced by source paper "an algebraic approach to source coding with side information using list decoding"):
  with members:
    - "algebraic codes for slepian wolf code design"
    - "on the list decodability of random linear codes"
    - "new list decoding algorithms for reed solomon and bch codes"

Connected through hyperedge HE-4 (induced by source paper "a parametric approach to list decoding of reed solomon codes using interpolation"):
  with members:
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"
    - "new list decoding algorithms for reed solomon and bch codes"

Connected through hyperedge HE-5 (induced by source paper "algebraic codes for slepian wolf code design"):
  with members:
    - "improved compression of network coding vectors using erasure decoding and list decoding"

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)