{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5QFN3XIKTG6VJYMMEPSAWWNGCV","short_pith_number":"pith:5QFN3XIK","schema_version":"1.0","canonical_sha256":"ec0adddd0a99bd54e18c23e40b59a6157674beeda02c8f89865d529702a0b769","source":{"kind":"arxiv","id":"1606.03832","version":1},"attestation_state":"computed","paper":{"title":"Evidential Label Propagation Algorithm for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.AI","authors_text":"Arnaud Martin (DRUID), Kuang Zhou (DRUID), Quan Pan, Zhun-Ga Liu","submitted_at":"2016-06-13T06:58:34Z","abstract_excerpt":"Community detection has attracted considerable attention crossing many areas as it can be used for discovering the structure and features of complex networks. With the increasing size of social networks in real world, community detection approaches should be fast and accurate. The Label Propagation Algorithm (LPA) is known to be one of the near-linear solutions and benefits of easy implementation, thus it forms a good basis for efficient community detection methods. In this paper, we extend the update rule and propagation criterion of LPA in the framework of belief functions. A new community d"},"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":"1606.03832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-13T06:58:34Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"a71d86bd48f4d73c0726286c8b91648375bd81830ad41a9f2970c40e2e714421","abstract_canon_sha256":"10fe139e5f81ec80c1e189cc90dabb57f66ae5d83d72627089fbc4afed8fbc26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:32.939283Z","signature_b64":"gEVIU9Taprh6F+X/Z5i9DUySOmf2oLunZVYkXG0m5ZIthSpX12tJbAkpCIHvjPl1570UY7bB2NZ+rQPG0+iTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec0adddd0a99bd54e18c23e40b59a6157674beeda02c8f89865d529702a0b769","last_reissued_at":"2026-05-18T01:12:32.938878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:32.938878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evidential Label Propagation Algorithm for Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.AI","authors_text":"Arnaud Martin (DRUID), Kuang Zhou (DRUID), Quan Pan, Zhun-Ga Liu","submitted_at":"2016-06-13T06:58:34Z","abstract_excerpt":"Community detection has attracted considerable attention crossing many areas as it can be used for discovering the structure and features of complex networks. With the increasing size of social networks in real world, community detection approaches should be fast and accurate. The Label Propagation Algorithm (LPA) is known to be one of the near-linear solutions and benefits of easy implementation, thus it forms a good basis for efficient community detection methods. In this paper, we extend the update rule and propagation criterion of LPA in the framework of belief functions. A new community d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03832","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":"1606.03832","created_at":"2026-05-18T01:12:32.938955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03832v1","created_at":"2026-05-18T01:12:32.938955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03832","created_at":"2026-05-18T01:12:32.938955+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QFN3XIKTG6V","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QFN3XIKTG6VJYMM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QFN3XIK","created_at":"2026-05-18T12:30:01.593930+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/5QFN3XIKTG6VJYMMEPSAWWNGCV","json":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV.json","graph_json":"https://pith.science/api/pith-number/5QFN3XIKTG6VJYMMEPSAWWNGCV/graph.json","events_json":"https://pith.science/api/pith-number/5QFN3XIKTG6VJYMMEPSAWWNGCV/events.json","paper":"https://pith.science/paper/5QFN3XIK"},"agent_actions":{"view_html":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV","download_json":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV.json","view_paper":"https://pith.science/paper/5QFN3XIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03832&json=true","fetch_graph":"https://pith.science/api/pith-number/5QFN3XIKTG6VJYMMEPSAWWNGCV/graph.json","fetch_events":"https://pith.science/api/pith-number/5QFN3XIKTG6VJYMMEPSAWWNGCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV/action/storage_attestation","attest_author":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV/action/author_attestation","sign_citation":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV/action/citation_signature","submit_replication":"https://pith.science/pith/5QFN3XIKTG6VJYMMEPSAWWNGCV/action/replication_record"}},"created_at":"2026-05-18T01:12:32.938955+00:00","updated_at":"2026-05-18T01:12:32.938955+00:00"}