{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IDP6INI3GGZOOXCCUMJXRFECFU","short_pith_number":"pith:IDP6INI3","schema_version":"1.0","canonical_sha256":"40dfe4351b31b2e75c42a3137894822d1259c12cf1e7ac479a9578858e45ee3c","source":{"kind":"arxiv","id":"1106.5524","version":1},"attestation_state":"computed","paper":{"title":"Robust network community detection using balanced propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Lovro \\v{S}ubelj, Marko Bajec","submitted_at":"2011-06-27T21:20:44Z","abstract_excerpt":"Label propagation has proven to be an extremely fast method for detecting communities in large complex networks. Furthermore, due to its simplicity, it is also currently one of the most commonly adopted algorithms in the literature. Despite various subsequent advances, an important issue of the algorithm has not yet been properly addressed. Random (node) update orders within the algorithm severely hamper its robustness, and consequently also the stability of the identified community structure. We note that an update order can be seen as increasing propagation preferences from certain nodes, an"},"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":"1106.5524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-06-27T21:20:44Z","cross_cats_sorted":["cs.SI","physics.data-an"],"title_canon_sha256":"653fe830623f2f1b7ba22f6ad9704ddcdce31689ef273c100e94cb57c227b939","abstract_canon_sha256":"9ef85dd467d87a261f0f8c6a1dd28aaea4fb4a33d6c17785c7e23ee939bf39bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.994186Z","signature_b64":"RD0Ek36hP3rkjgTCUbR5BRHsLS4qKPWcRS8vhtqdeCfDEvnoqAzr47LVkOyTWE26UHRh/gTUDIl6SNSjJyImCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40dfe4351b31b2e75c42a3137894822d1259c12cf1e7ac479a9578858e45ee3c","last_reissued_at":"2026-05-18T04:19:12.993693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.993693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust network community detection using balanced propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.data-an"],"primary_cat":"physics.soc-ph","authors_text":"Lovro \\v{S}ubelj, Marko Bajec","submitted_at":"2011-06-27T21:20:44Z","abstract_excerpt":"Label propagation has proven to be an extremely fast method for detecting communities in large complex networks. Furthermore, due to its simplicity, it is also currently one of the most commonly adopted algorithms in the literature. Despite various subsequent advances, an important issue of the algorithm has not yet been properly addressed. Random (node) update orders within the algorithm severely hamper its robustness, and consequently also the stability of the identified community structure. We note that an update order can be seen as increasing propagation preferences from certain nodes, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5524","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":"1106.5524","created_at":"2026-05-18T04:19:12.993767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5524v1","created_at":"2026-05-18T04:19:12.993767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5524","created_at":"2026-05-18T04:19:12.993767+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDP6INI3GGZO","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDP6INI3GGZOOXCC","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDP6INI3","created_at":"2026-05-18T12:26:30.835961+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/IDP6INI3GGZOOXCCUMJXRFECFU","json":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU.json","graph_json":"https://pith.science/api/pith-number/IDP6INI3GGZOOXCCUMJXRFECFU/graph.json","events_json":"https://pith.science/api/pith-number/IDP6INI3GGZOOXCCUMJXRFECFU/events.json","paper":"https://pith.science/paper/IDP6INI3"},"agent_actions":{"view_html":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU","download_json":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU.json","view_paper":"https://pith.science/paper/IDP6INI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5524&json=true","fetch_graph":"https://pith.science/api/pith-number/IDP6INI3GGZOOXCCUMJXRFECFU/graph.json","fetch_events":"https://pith.science/api/pith-number/IDP6INI3GGZOOXCCUMJXRFECFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU/action/storage_attestation","attest_author":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU/action/author_attestation","sign_citation":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU/action/citation_signature","submit_replication":"https://pith.science/pith/IDP6INI3GGZOOXCCUMJXRFECFU/action/replication_record"}},"created_at":"2026-05-18T04:19:12.993767+00:00","updated_at":"2026-05-18T04:19:12.993767+00:00"}