{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YEWM6UYUINUN7K2HF5DZFW7Z66","short_pith_number":"pith:YEWM6UYU","canonical_record":{"source":{"id":"1103.5946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-03-30T14:43:59Z","cross_cats_sorted":["cs.SI","stat.AP"],"title_canon_sha256":"9923bf62c4f6865f81340413eef06976f7578a40e362a34ef597a4a0de87cfd7","abstract_canon_sha256":"525c68699019f2215fbfd0fa1f091165eb56cd575209e4263003071cbf2f48a3"},"schema_version":"1.0"},"canonical_sha256":"c12ccf53144368dfab472f4792dbf9f78ef8bc43b2f9096966dd7d1b28898e24","source":{"kind":"arxiv","id":"1103.5946","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5946","created_at":"2026-05-18T02:02:42Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5946v1","created_at":"2026-05-18T02:02:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5946","created_at":"2026-05-18T02:02:42Z"},{"alias_kind":"pith_short_12","alias_value":"YEWM6UYUINUN","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YEWM6UYUINUN7K2H","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YEWM6UYU","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YEWM6UYUINUN7K2HF5DZFW7Z66","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-03-30T14:43:59Z","cross_cats_sorted":["cs.SI","stat.AP"],"title_canon_sha256":"9923bf62c4f6865f81340413eef06976f7578a40e362a34ef597a4a0de87cfd7","abstract_canon_sha256":"525c68699019f2215fbfd0fa1f091165eb56cd575209e4263003071cbf2f48a3"},"schema_version":"1.0"},"canonical_sha256":"c12ccf53144368dfab472f4792dbf9f78ef8bc43b2f9096966dd7d1b28898e24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:02:42.719727Z","signature_b64":"kWc/41zIdQZnOPmWU3xz37XSI8/DfhsTt4DE0iLeU5n8G72JNJixX+10YULCUAGxR+lcES6KAfPhda9by5MKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12ccf53144368dfab472f4792dbf9f78ef8bc43b2f9096966dd7d1b28898e24","last_reissued_at":"2026-05-18T02:02:42.719052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:02:42.719052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5946","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-18T02:02:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUfKCQHV4G6v932sHtMy3Q/BH2GejgxEkdIbanvZj5uNTP26mqWhrE/KtLH7AaKBMu7BKSgIQVvDY6uF6udsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:15:46.343774Z"},"content_sha256":"0a3d1f7879ba5b526c4649b0b568754867ebdd6ea42bb7c060816a96e34f47e5","schema_version":"1.0","event_id":"sha256:0a3d1f7879ba5b526c4649b0b568754867ebdd6ea42bb7c060816a96e34f47e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YEWM6UYUINUN7K2HF5DZFW7Z66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting the optimal number of communities in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.AP"],"primary_cat":"physics.soc-ph","authors_text":"Beishan Xu, Yanqing Hu, Ying Fan, Zengru Di, Zhifang Li","submitted_at":"2011-03-30T14:43:59Z","abstract_excerpt":"To obtain the optimal number of communities is an important problem in detecting community structure. In this paper, we extend the measurement of community detecting algorithms to find the optimal community number. Based on the normalized mutual information index, which has been used as a measure for similarity of communities, a statistic $\\Omega(c)$ is proposed to detect the optimal number of communities. In general, when $\\Omega(c)$ reaches its local maximum, especially the first one, the corresponding number of communities \\emph{c} is likely to be optimal in community detection. Moreover, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5946","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-18T02:02:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiJdVFPbU5kXCTnZbuLKgfhOZ2yOmK/zAl7rWlz6G8aqTvSNijLXBzSdyiEIq7Rut1Q7GlirI1oGoftK5qfrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:15:46.344120Z"},"content_sha256":"35f20c534889548e51a5c296e59174034c3d79aaefd683a6f1060d66c9e9ff5d","schema_version":"1.0","event_id":"sha256:35f20c534889548e51a5c296e59174034c3d79aaefd683a6f1060d66c9e9ff5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEWM6UYUINUN7K2HF5DZFW7Z66/bundle.json","state_url":"https://pith.science/pith/YEWM6UYUINUN7K2HF5DZFW7Z66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEWM6UYUINUN7K2HF5DZFW7Z66/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-27T04:15:46Z","links":{"resolver":"https://pith.science/pith/YEWM6UYUINUN7K2HF5DZFW7Z66","bundle":"https://pith.science/pith/YEWM6UYUINUN7K2HF5DZFW7Z66/bundle.json","state":"https://pith.science/pith/YEWM6UYUINUN7K2HF5DZFW7Z66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEWM6UYUINUN7K2HF5DZFW7Z66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YEWM6UYUINUN7K2HF5DZFW7Z66","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":"525c68699019f2215fbfd0fa1f091165eb56cd575209e4263003071cbf2f48a3","cross_cats_sorted":["cs.SI","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-03-30T14:43:59Z","title_canon_sha256":"9923bf62c4f6865f81340413eef06976f7578a40e362a34ef597a4a0de87cfd7"},"schema_version":"1.0","source":{"id":"1103.5946","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5946","created_at":"2026-05-18T02:02:42Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5946v1","created_at":"2026-05-18T02:02:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5946","created_at":"2026-05-18T02:02:42Z"},{"alias_kind":"pith_short_12","alias_value":"YEWM6UYUINUN","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YEWM6UYUINUN7K2H","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YEWM6UYU","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:35f20c534889548e51a5c296e59174034c3d79aaefd683a6f1060d66c9e9ff5d","target":"graph","created_at":"2026-05-18T02:02:42Z","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":"To obtain the optimal number of communities is an important problem in detecting community structure. In this paper, we extend the measurement of community detecting algorithms to find the optimal community number. Based on the normalized mutual information index, which has been used as a measure for similarity of communities, a statistic $\\Omega(c)$ is proposed to detect the optimal number of communities. In general, when $\\Omega(c)$ reaches its local maximum, especially the first one, the corresponding number of communities \\emph{c} is likely to be optimal in community detection. Moreover, t","authors_text":"Beishan Xu, Yanqing Hu, Ying Fan, Zengru Di, Zhifang Li","cross_cats":["cs.SI","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-03-30T14:43:59Z","title":"Detecting the optimal number of communities in complex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5946","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:0a3d1f7879ba5b526c4649b0b568754867ebdd6ea42bb7c060816a96e34f47e5","target":"record","created_at":"2026-05-18T02:02:42Z","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":"525c68699019f2215fbfd0fa1f091165eb56cd575209e4263003071cbf2f48a3","cross_cats_sorted":["cs.SI","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-03-30T14:43:59Z","title_canon_sha256":"9923bf62c4f6865f81340413eef06976f7578a40e362a34ef597a4a0de87cfd7"},"schema_version":"1.0","source":{"id":"1103.5946","kind":"arxiv","version":1}},"canonical_sha256":"c12ccf53144368dfab472f4792dbf9f78ef8bc43b2f9096966dd7d1b28898e24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c12ccf53144368dfab472f4792dbf9f78ef8bc43b2f9096966dd7d1b28898e24","first_computed_at":"2026-05-18T02:02:42.719052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:02:42.719052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWc/41zIdQZnOPmWU3xz37XSI8/DfhsTt4DE0iLeU5n8G72JNJixX+10YULCUAGxR+lcES6KAfPhda9by5MKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:02:42.719727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5946","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a3d1f7879ba5b526c4649b0b568754867ebdd6ea42bb7c060816a96e34f47e5","sha256:35f20c534889548e51a5c296e59174034c3d79aaefd683a6f1060d66c9e9ff5d"],"state_sha256":"aa3ac726b618e5a3a126c640c6468677580e40045b7f8cd0721a01babeadf94a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LKWLMQ+qbrRbYIFFxU32zQA+dKUoo9vO8bY3JaVyRNOa8qskM9diew+0ZmgFPRbkVqlQ6fdIjVoeHIOZNaedBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:15:46.346029Z","bundle_sha256":"a310569bd86ca2353d013852989e6f66dea614a08c328c3839e35fe18c523a12"}}