{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2TJIL3AMEL3TPHBQPCISPC5FRR","short_pith_number":"pith:2TJIL3AM","schema_version":"1.0","canonical_sha256":"d4d285ec0c22f7379c307891278ba58c4f7f6a2630f3500a792e235a6c1cf922","source":{"kind":"arxiv","id":"1503.07439","version":2},"attestation_state":"computed","paper":{"title":"Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Inderjit S. Dhillon, Joyce Jiyoung Whang","submitted_at":"2015-03-25T16:10:03Z","abstract_excerpt":"Community detection is an important task in network analysis. A community (also referred to as a cluster) is a set of cohesive vertices that have more connections inside the set than outside. In many social and information networks, these communities naturally overlap. For instance, in a social network, each vertex in a graph corresponds to an individual who usually participates in multiple communities. In this paper, we propose an efficient overlapping community detection algorithm using a seed expansion approach. The key idea of our algorithm is to find good seeds, and then greedily expand t"},"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":"1503.07439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-03-25T16:10:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"ce0fe071a6992649411f200b28e5f342e225f956af675751dd9bf9390746919d","abstract_canon_sha256":"070847b83a9bec1d31d560b2ed82794d055da8675614b54f5a6dd35430c9d60e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:42.191927Z","signature_b64":"athsmJqM3ln7XPolDjt8aX/ivWQisWbaUN2QEX9/Owp5Z1NwIX/InEG5RYEGKC4v8njDAIpgxJzawcwzRPe7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d285ec0c22f7379c307891278ba58c4f7f6a2630f3500a792e235a6c1cf922","last_reissued_at":"2026-05-18T02:19:42.191513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:42.191513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Inderjit S. Dhillon, Joyce Jiyoung Whang","submitted_at":"2015-03-25T16:10:03Z","abstract_excerpt":"Community detection is an important task in network analysis. A community (also referred to as a cluster) is a set of cohesive vertices that have more connections inside the set than outside. In many social and information networks, these communities naturally overlap. For instance, in a social network, each vertex in a graph corresponds to an individual who usually participates in multiple communities. In this paper, we propose an efficient overlapping community detection algorithm using a seed expansion approach. The key idea of our algorithm is to find good seeds, and then greedily expand t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07439","kind":"arxiv","version":2},"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":"1503.07439","created_at":"2026-05-18T02:19:42.191569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07439v2","created_at":"2026-05-18T02:19:42.191569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07439","created_at":"2026-05-18T02:19:42.191569+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TJIL3AMEL3T","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TJIL3AMEL3TPHBQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TJIL3AM","created_at":"2026-05-18T12:29:02.477457+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/2TJIL3AMEL3TPHBQPCISPC5FRR","json":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR.json","graph_json":"https://pith.science/api/pith-number/2TJIL3AMEL3TPHBQPCISPC5FRR/graph.json","events_json":"https://pith.science/api/pith-number/2TJIL3AMEL3TPHBQPCISPC5FRR/events.json","paper":"https://pith.science/paper/2TJIL3AM"},"agent_actions":{"view_html":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR","download_json":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR.json","view_paper":"https://pith.science/paper/2TJIL3AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07439&json=true","fetch_graph":"https://pith.science/api/pith-number/2TJIL3AMEL3TPHBQPCISPC5FRR/graph.json","fetch_events":"https://pith.science/api/pith-number/2TJIL3AMEL3TPHBQPCISPC5FRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR/action/storage_attestation","attest_author":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR/action/author_attestation","sign_citation":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR/action/citation_signature","submit_replication":"https://pith.science/pith/2TJIL3AMEL3TPHBQPCISPC5FRR/action/replication_record"}},"created_at":"2026-05-18T02:19:42.191569+00:00","updated_at":"2026-05-18T02:19:42.191569+00:00"}