{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OJSNNACZSLRPWBTDONMNT2OIFJ","short_pith_number":"pith:OJSNNACZ","schema_version":"1.0","canonical_sha256":"7264d6805992e2fb06637358d9e9c82a63f610d61a9afd4096dc2625c63a646a","source":{"kind":"arxiv","id":"1604.03454","version":1},"attestation_state":"computed","paper":{"title":"GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Animesh Mukherjee, Niloy Ganguly, Sanjukta Bhowmick, Suhansanu Kumar, Tanmoy Chakraborty","submitted_at":"2016-04-12T15:50:11Z","abstract_excerpt":"Detection of non-overlapping and overlapping communities are essentially the same problem. However, current algorithms focus either on finding overlapping or non-overlapping communities. We present a generalized framework that can identify both non-overlapping and overlapping communities, without any prior input about the network or its community distribution. To do so, we introduce a vertex-based metric, GenPerm, that quantifies by how much a vertex belongs to each of its constituent communities. Our community detection algorithm is based on maximizing the GenPerm over all the vertices in the"},"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":"1604.03454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-12T15:50:11Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"a98cb727c84e36090aeb02f3b864398fb7666d413f1c84859d7048b642db7e6d","abstract_canon_sha256":"c5c41d0583de20ec0d8e883e1ddc3007a10d66c17b59735c9f4384fc3257b245"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.709523Z","signature_b64":"HG4z9V05Gqo1pB1tp8WuvvditbzHE8NKkY8vbaTiKWkw0RGuuMrWnCTL8sVonqJGq/5KFn/nebmk8IbTYvUOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7264d6805992e2fb06637358d9e9c82a63f610d61a9afd4096dc2625c63a646a","last_reissued_at":"2026-05-18T00:57:49.708834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.708834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Animesh Mukherjee, Niloy Ganguly, Sanjukta Bhowmick, Suhansanu Kumar, Tanmoy Chakraborty","submitted_at":"2016-04-12T15:50:11Z","abstract_excerpt":"Detection of non-overlapping and overlapping communities are essentially the same problem. However, current algorithms focus either on finding overlapping or non-overlapping communities. We present a generalized framework that can identify both non-overlapping and overlapping communities, without any prior input about the network or its community distribution. To do so, we introduce a vertex-based metric, GenPerm, that quantifies by how much a vertex belongs to each of its constituent communities. Our community detection algorithm is based on maximizing the GenPerm over all the vertices in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03454","kind":"arxiv","version":1},"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":"1604.03454","created_at":"2026-05-18T00:57:49.708930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03454v1","created_at":"2026-05-18T00:57:49.708930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03454","created_at":"2026-05-18T00:57:49.708930+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJSNNACZSLRP","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJSNNACZSLRPWBTD","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJSNNACZ","created_at":"2026-05-18T12:30:36.002864+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/OJSNNACZSLRPWBTDONMNT2OIFJ","json":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ.json","graph_json":"https://pith.science/api/pith-number/OJSNNACZSLRPWBTDONMNT2OIFJ/graph.json","events_json":"https://pith.science/api/pith-number/OJSNNACZSLRPWBTDONMNT2OIFJ/events.json","paper":"https://pith.science/paper/OJSNNACZ"},"agent_actions":{"view_html":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ","download_json":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ.json","view_paper":"https://pith.science/paper/OJSNNACZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03454&json=true","fetch_graph":"https://pith.science/api/pith-number/OJSNNACZSLRPWBTDONMNT2OIFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OJSNNACZSLRPWBTDONMNT2OIFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/action/storage_attestation","attest_author":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/action/author_attestation","sign_citation":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/action/citation_signature","submit_replication":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/action/replication_record"}},"created_at":"2026-05-18T00:57:49.708930+00:00","updated_at":"2026-05-18T00:57:49.708930+00:00"}