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: "tree codes and a conjecture on exponential sums"
  Abstract: We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The available numerical evidence is consistent with the conjecture and is sufficient to certify codes for significant-length communications.

Connected through hyperedge HE-1 (induced by source paper "on decoding cohen haeupler schulman tree codes"):
  with members:
    - "linear tree codes and the problem of explicit constructions"

Connected through hyperedge HE-2 (induced by source paper "sending a message with unknown noise"):
  with members:
    - "distributed computing with channel noise"
    - "interactive communication with unknown noise rate"
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-3 (induced by source paper "secure one way interactive communication"):
  with members:
    - "interactive communication with unknown noise rate"
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"

Connected through hyperedge HE-4 (induced by source paper "interactive communication with unknown noise rate"):
  with members:
    - "interactive channel capacity revisited"
    - "breathe before speaking efficient information dissemination despite noisy limited and anonymous communication"
    - "competitive mac under adversarial sinr"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "making evildoers pay resource competitive broadcast in sensor networks"

Connected through hyperedge HE-5 (induced by source paper "maximal noise in interactive communication over erasure channels and channels with feedback"):
  with members:
    - "interactive channel capacity revisited"
    - "adaptive protocols for interactive communication"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

Connected through hyperedge HE-6 (induced by source paper "the adversarial noise threshold for distributed protocols"):
  with members:
    - "sparse sums of positive semidefinite matrices"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "balancing communication for multi party interactive coding"
    - "interactive channel capacity revisited"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"
    - "faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms"
    - "twice ramanujan sparsifiers"

Connected through hyperedge HE-7 (induced by source paper "adaptive protocols for interactive communication"):
  with members:
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "interactive channel capacity revisited"
    - "the adversarial noise threshold for distributed protocols"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency 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.CC(Computational Complexity)