On the public citation graph

An Interested-based Architecture for Peer-to-Peer Network Systems

0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
inferredcites →https://doi.org/10.1016/j.comnet.2006.09.014openalex-snapshot
Associative search in peer to peer networks: Harnessing latent semantics
inferredcites →https://doi.org/10.1109/iccnmc.2003.1243052openalex-snapshot
An efficient interest-group based search mechanism in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1109/icdcs.2002.1022239openalex-snapshot
Routing indices for peer-to-peer systems
inferredcites →https://doi.org/10.1109/icon.2001.962351openalex-snapshot
The cost of peer discovery and searching in the Gnutella peer-to-peer file sharing protocol
inferredcites →https://doi.org/10.1109/icon.2003.1266203openalex-snapshot
General clusters in peer-to-peer networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208962openalex-snapshot
Associative search in peer to peer networks: harnessing latent semantics
inferredcites →https://doi.org/10.1109/infcom.2003.1209237openalex-snapshot
Efficient content location using interest-based locality in peer-to-peer systems
inferredcites →https://doi.org/10.1145/2591635.2667182openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/383059.383071openalex-snapshot
Chord
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/511334.511369openalex-snapshot
Search and replication in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/633025.633043openalex-snapshot
Replication strategies in unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1145/964723.383072openalex-snapshot
A scalable content-addressable network

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-01665-3_82openalex-snapshot
Scalable Grouping Based on Neuro-Fuzzy Clustering for P2P Networks
inferred← citeshttps://doi.org/10.1080/02533839.2008.9671475openalex-snapshot
Locality and resource aware peer‐to‐peer overlay networks
inferred← citeshttps://doi.org/10.1109/iciw.2008.93openalex-snapshot
The Effect of Sub Communities in a Community-Based Peer-to-Peer Model Based on Social Networks
inferred← citeshttps://doi.org/10.1109/itsim.2008.4631989openalex-snapshot
A social network Peer-to-Peer model for peer clustering
inferred← citeshttps://doi.org/10.1109/ncm.2008.158openalex-snapshot
How Community-Based Peer-to-Peer Social Networks Can Affect Query Routing?
inferred← citeshttps://doi.org/10.1109/sutc.2008.63openalex-snapshot
Interest-Based Peer Selection in P2P Network
inferred← citeshttps://doi.org/10.29007/lddtopenalex-snapshot
Efficient Secured Public-Key based Data Lookup and Multicast Protocols with Anonymity in RC-Based Two-level Hierarchical Structured P2P Network
inferred← citeshttps://doi.org/10.37394/23205.2021.20.13openalex-snapshot
Efficient Communication Protocols for Non DHT-based Pyramid Tree P2P Architecture
inferred← citeshttps://doi.org/10.3837/tiis.2011.01.009openalex-snapshot
Scalable Search based on Fuzzy Clustering for Interest-based P2P Networks
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.989-994.4815openalex-snapshot
Resource Query Mechanism Research of Structured P2P Network Based on Node Interest Community
inferred← citeshttps://doi.org/10.4108/eai.15-1-2018.154108openalex-snapshot
A Search Algorithm Based on K-Weighted Search Tree
inferred← citeshttps://doi.org/10.5120/9794-4398openalex-snapshot
Reliable Peer Discovery in Content-Aware Overlay Network
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.