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: "multiply constant weight codes and the reliability of loop physically unclonable functions"
  Abstract: We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response. We extend classical coding methods to construct multiply constant-weight codes from known $q$-ary and constant-weight codes. Analogues of Johnson bounds are derived and are shown to be asymptotically tight to a constant factor under certain conditions. We also examine the rates of the multiply constant-weight codes and interestingly, demonstrate that these rates are the same as those of constant-weight codes of suitable parameters. Asymptotic analysis of our code constructions is provided.

Connected through hyperedge HE-1 (induced by source paper "generalized sphere packing bound for subblock constrained codes"):
  with members:
    - "bounds on the size and asymptotic rate of subblock constrained codes"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "generalized sphere packing bound"

Connected through hyperedge HE-2 (induced by source paper "bounds on the size and asymptotic rate of subblock constrained codes"):
  with members:
    - "new bounds and constructions for multiply constant weight codes"
    - "subblock constrained codes for real time simultaneous energy and information transfer"
    - "generalized sphere packing bound"
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "on bounded weight codes"

Connected through hyperedge HE-3 (induced by source paper "subblock constrained codes for real time simultaneous energy and information transfer"):
  with members:
    - "energy harvesting wireless communications a review of recent advances"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "constrained codes for joint energy and information transfer"
    - "application of smart antenna technologies in simultaneous wireless information and power transfer"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "importance of symbol equity in coded modulation for power line communications"
    - "interactive joint transfer of energy and information"
    - "wireless information and power transfer architecture design and rate energy tradeoff"

Connected through hyperedge HE-4 (induced by source paper "new bounds and constructions for multiply constant weight codes"):
  with members:
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "improved semidefinite programming bound on sizes of codes"

Connected through hyperedge HE-5 (induced by source paper "constructions of optimal and near optimal multiply constant weight codes"):
  with members:
    - "new bounds and constructions for multiply constant weight 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)