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: "errorless codes for over loaded cdma with active user detection"
  Abstract: In this paper we introduce a new class of codes for over-loaded synchronous wireless CDMA systems which increases the number of users for a fixed number of chips without introducing any errors. In addition these codes support active user detection. We derive an upper bound on the number of users with a fixed spreading factor. Also we propose an ML decoder for a subclass of these codes that is computationally implementable. Although for our simulations we consider a scenario that is worse than what occurs in practice, simulation results indicate that this coding/decoding scheme is robust against additive noise. As an example, for 64 chips and 88 users we propose a coding/decoding scheme that can obtain an arbitrary small probability of error which is computationally feasible and can detect active users. Furthermore, we prove that for this to be possible the number of users cannot be beyond 230.

Connected through hyperedge HE-1 (induced by source paper "the enigma of cdma revisited"):
  with members:
    - "applications of lindeberg principle in communications and statistical learning"
    - "new bounds for binary and ternary overloaded cdma"
    - "bounds on the sum capacity of synchronous binary cdma channels"
    - "tight bounds on the capacity of binary input random cdma systems"
    - "a new method for constructing large size wbe codes with low complexity ml decoder"
    - "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula"
    - "randomly spread cdma asymptotics via statistical physics"

Connected through hyperedge HE-2 (induced by source paper "new bounds for binary and ternary overloaded cdma"):
  with members:
    - "a class of errorless codes for over loaded synchronous wireless and optical cdma systems"
    - "multiuser detection in a dynamic environment part i user identification and data detection"

Connected through hyperedge HE-3 (induced by source paper "a class of errorless codes for over loaded synchronous wireless and optical cdma systems"):
  with members:
    - "a new method for constructing large size wbe codes with low complexity ml decoder"

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)