{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ELWC7PKKZH5AQ4T4C5MCTEFJHB","short_pith_number":"pith:ELWC7PKK","schema_version":"1.0","canonical_sha256":"22ec2fbd4ac9fa08727c17582990a938528277f1a84cf7deb15144c5947252cb","source":{"kind":"arxiv","id":"1612.04679","version":2},"attestation_state":"computed","paper":{"title":"IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SI","authors_text":"Hadi Zare, Hossein Bobarshad, Mahdi Hajiabadi","submitted_at":"2016-12-14T15:14:45Z","abstract_excerpt":"Community detection is a task of fundamental importance in social network analysis that can be used in a variety of knowledge-based domains. While there exist many works on community detection based on connectivity structures, they suffer from either considering the overlapping or non-overlapping communities. In this work, we propose a novel approach for general community detection through an integrated framework to extract the overlapping and non-overlapping community structures without assuming prior structural connectivity on networks. Our general framework is based on a primary node based "},"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":"1612.04679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-12-14T15:14:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5ec5a56640a61abb478a833720bf577da915a11e9f595bae4b153b78c0bc9e13","abstract_canon_sha256":"f5ca495460a05d2f4dbc5e0570aab89f030a4a3dc609febfdad242487ae5c42e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:56.224990Z","signature_b64":"WAB++uadFmBalHwpVkV9g46mU1OtPZMJe6dQn6pwrGhFsiYw0XOXcdlcSZpViTP+Ea377Iho19KP8z7SWa86Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22ec2fbd4ac9fa08727c17582990a938528277f1a84cf7deb15144c5947252cb","last_reissued_at":"2026-05-18T00:50:56.224461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:56.224461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.SI","authors_text":"Hadi Zare, Hossein Bobarshad, Mahdi Hajiabadi","submitted_at":"2016-12-14T15:14:45Z","abstract_excerpt":"Community detection is a task of fundamental importance in social network analysis that can be used in a variety of knowledge-based domains. While there exist many works on community detection based on connectivity structures, they suffer from either considering the overlapping or non-overlapping communities. In this work, we propose a novel approach for general community detection through an integrated framework to extract the overlapping and non-overlapping community structures without assuming prior structural connectivity on networks. Our general framework is based on a primary node based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04679","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":"1612.04679","created_at":"2026-05-18T00:50:56.224543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04679v2","created_at":"2026-05-18T00:50:56.224543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04679","created_at":"2026-05-18T00:50:56.224543+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELWC7PKKZH5A","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELWC7PKKZH5AQ4T4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELWC7PKK","created_at":"2026-05-18T12:30:12.583610+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/ELWC7PKKZH5AQ4T4C5MCTEFJHB","json":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB.json","graph_json":"https://pith.science/api/pith-number/ELWC7PKKZH5AQ4T4C5MCTEFJHB/graph.json","events_json":"https://pith.science/api/pith-number/ELWC7PKKZH5AQ4T4C5MCTEFJHB/events.json","paper":"https://pith.science/paper/ELWC7PKK"},"agent_actions":{"view_html":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB","download_json":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB.json","view_paper":"https://pith.science/paper/ELWC7PKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04679&json=true","fetch_graph":"https://pith.science/api/pith-number/ELWC7PKKZH5AQ4T4C5MCTEFJHB/graph.json","fetch_events":"https://pith.science/api/pith-number/ELWC7PKKZH5AQ4T4C5MCTEFJHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB/action/storage_attestation","attest_author":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB/action/author_attestation","sign_citation":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB/action/citation_signature","submit_replication":"https://pith.science/pith/ELWC7PKKZH5AQ4T4C5MCTEFJHB/action/replication_record"}},"created_at":"2026-05-18T00:50:56.224543+00:00","updated_at":"2026-05-18T00:50:56.224543+00:00"}