human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured p2p networks"):
  Abstract: Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally employed to overcome this problem. In this paper, a new reputation based scheme called probabilistic resource allocation is proposed. This strategy probabilistically decide whether to provide the resource to requesting peer or not. Aforesaid method gives selection preference to higher reputation peers and at the same time provides some finite probability of interaction between those peers who don’t have good reputation about each other. This avoids disconnection between the aforesaid peers. The proposed scheme also introduces a new mechanism for resource distribution which not only allocates resources based on peers’ reputation but simultaneously maximizes network utility also. Algorithm for formation of interest groups based upon both similarity of interests and reputation between peers is also presented.

Includes members:
  Member "trust estimation in peer to peer network using blue":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource allocation in peer to peer networks a control theoretical perspective")
  Member "avoiding whitewashing in unstructured peer to peer resource sharing network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "evolutionary stability of reputation management system in peer to peer networks")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)