{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K3PC26V7HIKCCCDJYL32AYVC5O","short_pith_number":"pith:K3PC26V7","schema_version":"1.0","canonical_sha256":"56de2d7abf3a14210869c2f7a062a2eb93f8beb46feaed8395cb29032dfea203","source":{"kind":"arxiv","id":"1501.01780","version":1},"attestation_state":"computed","paper":{"title":"Evidential Communities for Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Arnaud Martin (IRISA), Kuang Zhou (IRISA), Quan Pan","submitted_at":"2015-01-08T09:49:10Z","abstract_excerpt":"Community detection is of great importance for understand-ing graph structure in social networks. The communities in real-world networks are often overlapped, i.e. some nodes may be a member of multiple clusters. How to uncover the overlapping communities/clusters in a complex network is a general problem in data mining of network data sets. In this paper, a novel algorithm to identify overlapping communi-ties in complex networks by a combination of an evidential modularity function, a spectral mapping method and evidential c-means clustering is devised. Experimental results indicate that this"},"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":"1501.01780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-01-08T09:49:10Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"3bf856b62e74ad19716726af85d8f1b0875ec2629934a5682c68c7ce2147bc60","abstract_canon_sha256":"95f47301eb716bb8094ef4344a5bc22e43d532ae558c5084cd6fb0042cf71bb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:46.394164Z","signature_b64":"bqBJbLdHsuzRUXz+UUArBXtBDepuOFwIGizARJgddEN5E6S+R6jIASGIZ7j7xdqRaffCp2aZEyUuadD6zUTLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56de2d7abf3a14210869c2f7a062a2eb93f8beb46feaed8395cb29032dfea203","last_reissued_at":"2026-05-18T02:29:46.393781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:46.393781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evidential Communities for Complex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Arnaud Martin (IRISA), Kuang Zhou (IRISA), Quan Pan","submitted_at":"2015-01-08T09:49:10Z","abstract_excerpt":"Community detection is of great importance for understand-ing graph structure in social networks. The communities in real-world networks are often overlapped, i.e. some nodes may be a member of multiple clusters. How to uncover the overlapping communities/clusters in a complex network is a general problem in data mining of network data sets. In this paper, a novel algorithm to identify overlapping communi-ties in complex networks by a combination of an evidential modularity function, a spectral mapping method and evidential c-means clustering is devised. Experimental results indicate that this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01780","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":"1501.01780","created_at":"2026-05-18T02:29:46.393839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01780v1","created_at":"2026-05-18T02:29:46.393839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01780","created_at":"2026-05-18T02:29:46.393839+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3PC26V7HIKC","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3PC26V7HIKCCCDJ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3PC26V7","created_at":"2026-05-18T12:29:27.538025+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/K3PC26V7HIKCCCDJYL32AYVC5O","json":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O.json","graph_json":"https://pith.science/api/pith-number/K3PC26V7HIKCCCDJYL32AYVC5O/graph.json","events_json":"https://pith.science/api/pith-number/K3PC26V7HIKCCCDJYL32AYVC5O/events.json","paper":"https://pith.science/paper/K3PC26V7"},"agent_actions":{"view_html":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O","download_json":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O.json","view_paper":"https://pith.science/paper/K3PC26V7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01780&json=true","fetch_graph":"https://pith.science/api/pith-number/K3PC26V7HIKCCCDJYL32AYVC5O/graph.json","fetch_events":"https://pith.science/api/pith-number/K3PC26V7HIKCCCDJYL32AYVC5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O/action/storage_attestation","attest_author":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O/action/author_attestation","sign_citation":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O/action/citation_signature","submit_replication":"https://pith.science/pith/K3PC26V7HIKCCCDJYL32AYVC5O/action/replication_record"}},"created_at":"2026-05-18T02:29:46.393839+00:00","updated_at":"2026-05-18T02:29:46.393839+00:00"}