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: "blind index coding"
  Abstract: We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classic index coding, in BIC, the sender is uncertain of what side information is available to each user. In particular, the sender only knows the amount of bits in each user's side information but not its content. This problem can arise naturally in caching and wireless networks. In order to blindly exploit side information in the BIC problem, we develop a hybrid coding scheme that XORs uncoded bits of a subset of messages with random combinations of bits from other messages. This scheme allows us to strike the right balance between maximizing the transmission rate to each user and minimizing the interference leakage to others. We also develop a general outer bound, which relies on a strong data processing inequality to effectively capture the senders uncertainty about the users' side information. Additionally, we consider the case where communication takes place over a shared wireless medium, modeled by an erasure broadcast channel, and show that surprisingly, combining repetition coding with hybrid coding improves the achievable rate region and outperforms alternative strategies of coping with channel erasure and while blindly exploiting side information.

Connected through hyperedge HE-1 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors"):
  with members:
    - "index coding with erroneous side information"
    - "an equivalence between secure network and index coding"
    - "a relation between network computation and functional index coding problems"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-2 (induced by source paper "linear codes for broadcasting with noisy side information"):
  with members:
    - "uniprior index coding"
    - "index coding with erroneous side information"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "optimal scalar linear index codes for one sided neighboring side information problems"
    - "error correction for index coding with coded side information"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "local graph coloring and index coding"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-3 (induced by source paper "private information retrieval with side information"):
  with members:
    - "private broadcasting an index coding approach"
    - "pir array codes with optimal virtual server rate"
    - "the capacity of robust private information retrieval with colluding databases"
    - "private information retrieval from coded databases with colluding servers"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "pir with low storage overhead coding instead of replication"
    - "private information retrieval for coded storage"

Connected through hyperedge HE-4 (induced by source paper "index coding with erroneous side information"):
  with members:
    - "error correction for index coding with coded side information"
    - "capacity of coded index modulation"
    - "index codes for the gaussian broadcast channel using quadrature amplitude modulation"
    - "index coding with coded side information"
    - "topological interference management through index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"
    - "error correction for index coding with side information"

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)