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: "content type coding"
  Abstract: This paper is motivated by the observation that, in many cases, we do not need to serve specific messages, but rather, any message within a content-type. Content-type traffic pervades a host of applications today, ranging from search engines and recommender networks to newsfeeds and advertisement networks. The paper asks a novel question: if there are benefits in designing network and channel codes specifically tailored to content-type requests. It provides three examples of content-type formulations to argue that, indeed in some cases we can have significant such benefits.

Connected through hyperedge HE-1 (induced by source paper "private pliable index coding"):
  with members:
    - "on pliable index coding"
    - "tight information theoretic converse results for some pliable index coding problems"
    - "private broadcasting an index coding approach"
    - "a polynomial time algorithm for pliable index coding"
    - "the capacity of private information retrieval"
    - "topological interference management through index coding"
    - "on the security of index coding with side information"

Connected through hyperedge HE-2 (induced by source paper "a pliable index coding approach to data shuffling"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "near optimal coded data shuffling for distributed learning"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"
    - "information theoretic limits of data shuffling for distributed learning"
    - "the minrank of random graphs"
    - "a polynomial time algorithm for pliable index coding"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "private broadcasting an index coding approach"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "the oblivious transfer capacity of the wiretapped binary erasure channel"
    - "on the security of index coding with side information"

Connected through hyperedge HE-4 (induced by source paper "a polynomial time algorithm for pliable index coding"):
  with members:
    - "the minrank of random graphs"
    - "on the capacity region for index coding"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"
    - "on linear index coding for random graphs"
    - "on the security of index coding with side information"
    - "index coding via linear programming"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-5 (induced by source paper "multi version coding an information theoretic perspective of consistent distributed storage"):
  with members:
    - "a layered architecture for erasure coded consistent distributed storage"
    - "radon repairable atomic data object in networks"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "compressed differential erasure codes for efficient archival of versioned data"
    - "synchronizing edits in distributed storage networks"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"

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)