{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XSP2BL7IJWQLDHJTDVLMMN32WG","short_pith_number":"pith:XSP2BL7I","schema_version":"1.0","canonical_sha256":"bc9fa0afe84da0b19d331d56c6377ab1b0aabb5c2186626bedef5b1dcf3f7755","source":{"kind":"arxiv","id":"1401.5888","version":4},"attestation_state":"computed","paper":{"title":"Efficiently Detecting Overlapping Communities through Seeding and Semi-Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Changxing Shang, Jianping Fan, Shengzhong Feng, Zhongying Zhao","submitted_at":"2014-01-23T07:51:54Z","abstract_excerpt":"Seeding then expanding is a commonly used scheme to discover overlapping communities in a network. Most seeding methods are either too complex to scale to large networks or too simple to select high-quality seeds, and the non-principled functions used by most expanding methods lead to poor performance when applied to diverse networks. This paper proposes a new method that transforms a network into a corpus where each edge is treated as a document, and all nodes of the network are treated as terms of the corpus. An effective seeding method is also proposed that selects seeds as a training set, "},"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":"1401.5888","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-01-23T07:51:54Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"cd120b771c4f3db10a80c2f8e479b8fa35825b5e3acdcebaf2e63c90b4889584","abstract_canon_sha256":"ef920fe3b7949b52764170576e413f8cb650b70a3ad986b3de0708974ab4af14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:10.822877Z","signature_b64":"jC4UX0CGd9xO92MV4c2odX7REgkyY/eIpnbsGDZ5Jcs8vcwDdUQiJUx3DDGA3K6r5E24rpo2eQPP7F6b6HbzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9fa0afe84da0b19d331d56c6377ab1b0aabb5c2186626bedef5b1dcf3f7755","last_reissued_at":"2026-05-18T02:26:10.822211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:10.822211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently Detecting Overlapping Communities through Seeding and Semi-Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Changxing Shang, Jianping Fan, Shengzhong Feng, Zhongying Zhao","submitted_at":"2014-01-23T07:51:54Z","abstract_excerpt":"Seeding then expanding is a commonly used scheme to discover overlapping communities in a network. Most seeding methods are either too complex to scale to large networks or too simple to select high-quality seeds, and the non-principled functions used by most expanding methods lead to poor performance when applied to diverse networks. This paper proposes a new method that transforms a network into a corpus where each edge is treated as a document, and all nodes of the network are treated as terms of the corpus. An effective seeding method is also proposed that selects seeds as a training set, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5888","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":"1401.5888","created_at":"2026-05-18T02:26:10.822311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5888v4","created_at":"2026-05-18T02:26:10.822311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5888","created_at":"2026-05-18T02:26:10.822311+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSP2BL7IJWQL","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSP2BL7IJWQLDHJT","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSP2BL7I","created_at":"2026-05-18T12:28:57.508820+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/XSP2BL7IJWQLDHJTDVLMMN32WG","json":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG.json","graph_json":"https://pith.science/api/pith-number/XSP2BL7IJWQLDHJTDVLMMN32WG/graph.json","events_json":"https://pith.science/api/pith-number/XSP2BL7IJWQLDHJTDVLMMN32WG/events.json","paper":"https://pith.science/paper/XSP2BL7I"},"agent_actions":{"view_html":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG","download_json":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG.json","view_paper":"https://pith.science/paper/XSP2BL7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5888&json=true","fetch_graph":"https://pith.science/api/pith-number/XSP2BL7IJWQLDHJTDVLMMN32WG/graph.json","fetch_events":"https://pith.science/api/pith-number/XSP2BL7IJWQLDHJTDVLMMN32WG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG/action/storage_attestation","attest_author":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG/action/author_attestation","sign_citation":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG/action/citation_signature","submit_replication":"https://pith.science/pith/XSP2BL7IJWQLDHJTDVLMMN32WG/action/replication_record"}},"created_at":"2026-05-18T02:26:10.822311+00:00","updated_at":"2026-05-18T02:26:10.822311+00:00"}