{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M2VR2WLANIHGG4YA2EIOUXGQTD","short_pith_number":"pith:M2VR2WLA","schema_version":"1.0","canonical_sha256":"66ab1d59606a0e637300d110ea5cd098dc92994769a83c00d0de5b067baaa448","source":{"kind":"arxiv","id":"1412.3432","version":4},"attestation_state":"computed","paper":{"title":"Detecting Overlapping Communities in Networks Using Spectral Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Elizaveta Levina, Ji Zhu, Yuan Zhang","submitted_at":"2014-12-10T20:06:24Z","abstract_excerpt":"Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-corrected stochastic block model. We develop an efficient spectral algorithm for estimating the community memberships, which deals with the overlaps by employing the K-medians algorithm rather than the usual K-means for clustering in the spectral domain. We show that the algorithm "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.3432","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-10T20:06:24Z","cross_cats_sorted":[],"title_canon_sha256":"b5889872d574b27de0e6a5125a34b1bd0b4923964dd5816f6dcaf9f9f7d21253","abstract_canon_sha256":"bc001361b69c83e9c5cf7839ceade0b8080b0e32aa75835e2df39a08724f93e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:58.313791Z","signature_b64":"eCcPGWjBj0gkLtEpzNpp9NsDENup7ZVYgZKTXO0KD7s+tWuHbWpfZDT0I5RyzzGFq28sEX+sBfNx3oRuXqPAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66ab1d59606a0e637300d110ea5cd098dc92994769a83c00d0de5b067baaa448","last_reissued_at":"2026-05-18T02:23:58.313043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:58.313043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Overlapping Communities in Networks Using Spectral Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Elizaveta Levina, Ji Zhu, Yuan Zhang","submitted_at":"2014-12-10T20:06:24Z","abstract_excerpt":"Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-corrected stochastic block model. We develop an efficient spectral algorithm for estimating the community memberships, which deals with the overlaps by employing the K-medians algorithm rather than the usual K-means for clustering in the spectral domain. We show that the algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3432","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.3432","created_at":"2026-05-18T02:23:58.313167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3432v4","created_at":"2026-05-18T02:23:58.313167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3432","created_at":"2026-05-18T02:23:58.313167+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2VR2WLANIHG","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2VR2WLANIHGG4YA","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2VR2WLA","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD","json":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD.json","graph_json":"https://pith.science/api/pith-number/M2VR2WLANIHGG4YA2EIOUXGQTD/graph.json","events_json":"https://pith.science/api/pith-number/M2VR2WLANIHGG4YA2EIOUXGQTD/events.json","paper":"https://pith.science/paper/M2VR2WLA"},"agent_actions":{"view_html":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD","download_json":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD.json","view_paper":"https://pith.science/paper/M2VR2WLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3432&json=true","fetch_graph":"https://pith.science/api/pith-number/M2VR2WLANIHGG4YA2EIOUXGQTD/graph.json","fetch_events":"https://pith.science/api/pith-number/M2VR2WLANIHGG4YA2EIOUXGQTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD/action/storage_attestation","attest_author":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD/action/author_attestation","sign_citation":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD/action/citation_signature","submit_replication":"https://pith.science/pith/M2VR2WLANIHGG4YA2EIOUXGQTD/action/replication_record"}},"created_at":"2026-05-18T02:23:58.313167+00:00","updated_at":"2026-05-18T02:23:58.313167+00:00"}