{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OJSNNACZSLRPWBTDONMNT2OIFJ","short_pith_number":"pith:OJSNNACZ","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"},"canonical_sha256":"7264d6805992e2fb06637358d9e9c82a63f610d61a9afd4096dc2625c63a646a","source":{"kind":"arxiv","id":"1604.03454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03454","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03454v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03454","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"OJSNNACZSLRP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OJSNNACZSLRPWBTD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OJSNNACZ","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OJSNNACZSLRPWBTDONMNT2OIFJ","target":"record","payload":{"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"},"canonical_sha256":"7264d6805992e2fb06637358d9e9c82a63f610d61a9afd4096dc2625c63a646a","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"},"source_kind":"arxiv","source_id":"1604.03454","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiRDzWz6ZU7IZBkrJm6VttvBeE3GY6bX5XQqoUKOed7a1ZERahkhpAY+C6IUkAEKtQjArfeNLGo8cDhblWOnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:36:40.499573Z"},"content_sha256":"35a9b9c0ba244bdc394581006dff84612e6c0ba9ac3d06e6b5249436bc9dc45b","schema_version":"1.0","event_id":"sha256:35a9b9c0ba244bdc394581006dff84612e6c0ba9ac3d06e6b5249436bc9dc45b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OJSNNACZSLRPWBTDONMNT2OIFJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fP+U8KMsetZMbsAVJas9IIkDhGR+th8gitfubs1D5H5uL55A+ujpjNgWey9+LAewbggvvZIKbZKEChEooMdtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:36:40.500451Z"},"content_sha256":"7c8754ccf37e571be7ffbf559e036baf0d68db5273d4e1046175f2b235a8c10b","schema_version":"1.0","event_id":"sha256:7c8754ccf37e571be7ffbf559e036baf0d68db5273d4e1046175f2b235a8c10b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/bundle.json","state_url":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T12:36:40Z","links":{"resolver":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ","bundle":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/bundle.json","state":"https://pith.science/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJSNNACZSLRPWBTDONMNT2OIFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OJSNNACZSLRPWBTDONMNT2OIFJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c5c41d0583de20ec0d8e883e1ddc3007a10d66c17b59735c9f4384fc3257b245","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-12T15:50:11Z","title_canon_sha256":"a98cb727c84e36090aeb02f3b864398fb7666d413f1c84859d7048b642db7e6d"},"schema_version":"1.0","source":{"id":"1604.03454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03454","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03454v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03454","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"OJSNNACZSLRP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OJSNNACZSLRPWBTD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OJSNNACZ","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:7c8754ccf37e571be7ffbf559e036baf0d68db5273d4e1046175f2b235a8c10b","target":"graph","created_at":"2026-05-18T00:57:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Animesh Mukherjee, Niloy Ganguly, Sanjukta Bhowmick, Suhansanu Kumar, Tanmoy Chakraborty","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-12T15:50:11Z","title":"GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03454","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35a9b9c0ba244bdc394581006dff84612e6c0ba9ac3d06e6b5249436bc9dc45b","target":"record","created_at":"2026-05-18T00:57:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c5c41d0583de20ec0d8e883e1ddc3007a10d66c17b59735c9f4384fc3257b245","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-04-12T15:50:11Z","title_canon_sha256":"a98cb727c84e36090aeb02f3b864398fb7666d413f1c84859d7048b642db7e6d"},"schema_version":"1.0","source":{"id":"1604.03454","kind":"arxiv","version":1}},"canonical_sha256":"7264d6805992e2fb06637358d9e9c82a63f610d61a9afd4096dc2625c63a646a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7264d6805992e2fb06637358d9e9c82a63f610d61a9afd4096dc2625c63a646a","first_computed_at":"2026-05-18T00:57:49.708834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.708834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HG4z9V05Gqo1pB1tp8WuvvditbzHE8NKkY8vbaTiKWkw0RGuuMrWnCTL8sVonqJGq/5KFn/nebmk8IbTYvUOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.709523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35a9b9c0ba244bdc394581006dff84612e6c0ba9ac3d06e6b5249436bc9dc45b","sha256:7c8754ccf37e571be7ffbf559e036baf0d68db5273d4e1046175f2b235a8c10b"],"state_sha256":"247b65142fde0e49977a16c9f2cb547e14ab01f1858d360d6d61c9357d6b1dbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JT6TCI4RiET5loptsyg3qRteVlIJGht5B2+7/ude/Wy0C/NnEHNxiJ4+BWdz6n/fNodhDJw6Ad51MATeRWMLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:36:40.504499Z","bundle_sha256":"98e238b793ba0d9707c4165fb1be5ce0a54817d5a89af6b0d599f36391c06b37"}}