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 "variable packet error coding"):
  Abstract: We consider a problem in which a source is encoded into N packets, an unknown number of which are subject to adversarial errors en route to the decoder. We seek code designs for which the decoder is guaranteed to be able to reproduce the source subject to a certain distortion constraint when there are no packets errors, subject to a less stringent distortion constraint when there is one error, etc. Focusing on the special case of the erasure distortion measure, we introduce a code design based on the polytope codes of Kosut, Tong, and Tse. The resulting designs are also applied to a separate problem in distributed storage.

Includes members:
  Member "regenerating codes for errors and erasures in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "error resilience in distributed storage via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "erasure multiple descriptions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a note on the sum rate distortion function of some lossy source coding problems involving infinite valued distortion functions")
  Member "byzantine fault tolerance of regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes")
  Member "polytope codes against adversaries in networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "byzantine multiple access")
  Member "network codes resilient to jamming and eavesdropping":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication efficient secret sharing in the presence of malicious adversary")
  Member "security in distributed storage systems by communicating a logarithmic number of bits":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")

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)