{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:66WGGRRRGHQFLVFWNJP3FRD2YZ","short_pith_number":"pith:66WGGRRR","schema_version":"1.0","canonical_sha256":"f7ac63463131e055d4b66a5fb2c47ac64cbcd72eacc281ae5e59b528cebdcb5c","source":{"kind":"arxiv","id":"0910.5072","version":1},"attestation_state":"computed","paper":{"title":"Modularity measure of networks with overlapping communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Anna L\\'az\\'ar, D\\'aniel \\'Abel, Tam\\'as Vicsek","submitted_at":"2009-10-27T09:28:54Z","abstract_excerpt":"In this paper we introduce a non-fuzzy measure which has been designed to rank the partitions of a network's nodes into overlapping communities. Such a measure can be useful for both quantifying clusters detected by various methods and during finding the overlapping community-structure by optimization methods. The theoretical problem referring to the separation of overlapping modules is discussed, and an example for possible applications is given as well."},"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":"0910.5072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2009-10-27T09:28:54Z","cross_cats_sorted":[],"title_canon_sha256":"c05e2ef3fb0c7ac753d28ccf6256064248e7420b9ddff38e3da1d3ac17a8d9e3","abstract_canon_sha256":"1357a014467f9b1f5f98b843a6e68f34f401d340939b11d6623017dead552f3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:11:11.010057Z","signature_b64":"0Cdg4yiypTXlDb/VqRFdwmztuwunlbVR4MA9XFE1Pvq47tQiHgTSAvB6p++gjujh7URgNtKPWsj3S7RizucUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7ac63463131e055d4b66a5fb2c47ac64cbcd72eacc281ae5e59b528cebdcb5c","last_reissued_at":"2026-05-18T02:11:11.009361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:11:11.009361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modularity measure of networks with overlapping communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"Anna L\\'az\\'ar, D\\'aniel \\'Abel, Tam\\'as Vicsek","submitted_at":"2009-10-27T09:28:54Z","abstract_excerpt":"In this paper we introduce a non-fuzzy measure which has been designed to rank the partitions of a network's nodes into overlapping communities. Such a measure can be useful for both quantifying clusters detected by various methods and during finding the overlapping community-structure by optimization methods. The theoretical problem referring to the separation of overlapping modules is discussed, and an example for possible applications is given as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5072","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":"0910.5072","created_at":"2026-05-18T02:11:11.009474+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.5072v1","created_at":"2026-05-18T02:11:11.009474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5072","created_at":"2026-05-18T02:11:11.009474+00:00"},{"alias_kind":"pith_short_12","alias_value":"66WGGRRRGHQF","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"66WGGRRRGHQFLVFW","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"66WGGRRR","created_at":"2026-05-18T12:25:58.837520+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/66WGGRRRGHQFLVFWNJP3FRD2YZ","json":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ.json","graph_json":"https://pith.science/api/pith-number/66WGGRRRGHQFLVFWNJP3FRD2YZ/graph.json","events_json":"https://pith.science/api/pith-number/66WGGRRRGHQFLVFWNJP3FRD2YZ/events.json","paper":"https://pith.science/paper/66WGGRRR"},"agent_actions":{"view_html":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ","download_json":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ.json","view_paper":"https://pith.science/paper/66WGGRRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.5072&json=true","fetch_graph":"https://pith.science/api/pith-number/66WGGRRRGHQFLVFWNJP3FRD2YZ/graph.json","fetch_events":"https://pith.science/api/pith-number/66WGGRRRGHQFLVFWNJP3FRD2YZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ/action/storage_attestation","attest_author":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ/action/author_attestation","sign_citation":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ/action/citation_signature","submit_replication":"https://pith.science/pith/66WGGRRRGHQFLVFWNJP3FRD2YZ/action/replication_record"}},"created_at":"2026-05-18T02:11:11.009474+00:00","updated_at":"2026-05-18T02:11:11.009474+00:00"}