Reference health

A Unified Graph Clustering Framework for Complex Systems Modeling

https://doi.org/10.2139/ssrn.4766265
CiteStamped reference-health badge
15/15 checkable references clean · checked 2026-08-05

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

9 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 15 checked references that resolve
resolves10.1007/s10791-008-9066-8
A comparison of extrinsic clustering evaluation metrics based on formal constraints
resolves10.1088/1742-5468/2008/10/P10008
Fast unfolding of communities in large networks
resolves10.1145/3091106
Metrics for Community Analysis
resolves10.1038/s41567-022-01716-7
20 years of network community detection
resolves10.1371/journal.pone.0290090
Starling: Introducing a mesoscopic scale with Confluence for Graph Clustering
resolves10.7551/mitpress/4643.001.0001
The Minimum Description Length Principle
resolves10.1103/PhysRevE.78.046110
Benchmark graphs for testing community detection algorithms
resolves10.1007/s11222-007-9033-z
A tutorial on spectral clustering
resolves10.1016/j.csl.2004.05.001
Lexical knowledge and human disagreement on a WSD task
resolves10.1137/S003614450342480
The Structure and Function of Complex Networks
resolves10.1080/01621459.1971.10482356
Objective Criteria for the Evaluation of Clustering Methods
resolves10.1073/pnas.0706851105
Maps of random walks on complex networks reveal community structure
resolves10.1038/35065725
Exploring complex networks
resolves10.1016/j.tcs.2006.06.015
The worst-case time complexity for generating all maximal cliques and computational experiments
resolves10.1038/30918
Collective dynamics of ‘small-world’ networks
The 9 references without a DOI — listed, not checked
no DOI — not checkedref3
no DOI — not checkedref5
no DOI — not checkedResolution limit in community detection
no DOI — not checkedBuilding real-world complex networks by wandering on random graphs
no DOI — not checkedref11
no DOI — not checkedref15
no DOI — not checkedFinding and evaluating community structure in networks
no DOI — not checkedDefining and evaluating network communities based on ground-truth
no DOI — not checkedLocal higher-order graph clustering
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-05 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.2139/ssrn.4766265"><img src="https://citestamp.com/citestamped/10.2139/ssrn.4766265/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.2139/ssrn.4766265/badge.svg)](https://citestamp.com/citestamped/10.2139/ssrn.4766265)