{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HRRJMB5CUDSMTYUS3DHFVHF4EV","short_pith_number":"pith:HRRJMB5C","schema_version":"1.0","canonical_sha256":"3c629607a2a0e4c9e292d8ce5a9cbc2562306191f74e89fbabfbd89e43befdeb","source":{"kind":"arxiv","id":"2405.11658","version":4},"attestation_state":"computed","paper":{"title":"A Starting Point for Dynamic Community Detection with Leiden Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DC","authors_text":"Subhajit Sahu","submitted_at":"2024-05-19T20:10:55Z","abstract_excerpt":"Real-world graphs often evolve over time, making community or cluster detection a crucial task. In this technical report, we extend three dynamic approaches - Naive-dynamic (ND), Delta-screening (DS), and Dynamic Frontier (DF) - to our multicore implementation of the Leiden algorithm, known for its high-quality community detection. Our experiments, conducted on a server with a 64-core AMD EPYC-7742 processor, show that ND, DS, and DF Leiden achieve average speedups of 1.37x, 1.47x, and 1.98x on large graphs with random batch updates, compared to the Static Leiden algorithm - while scaling at a"},"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":"2405.11658","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-05-19T20:10:55Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"dafa27c4b25e42cddace7a0af2b8c0201500c491ed0ce3d3b76a5d0ac34098db","abstract_canon_sha256":"be582a1121db291f27698bb6d6252e6be686f976c17d976ba65dcf21c2cbd741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:26.747904Z","signature_b64":"WGkcW9JpS1D0J1sGLwfbtltvyxQ7pb9wPvK/ow4um3F6c8PFzUbL11Xm4NIbGq5qmxyv1GkNCDQSUJ6HgoMwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c629607a2a0e4c9e292d8ce5a9cbc2562306191f74e89fbabfbd89e43befdeb","last_reissued_at":"2026-07-05T09:54:26.747387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:26.747387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Starting Point for Dynamic Community Detection with Leiden Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DC","authors_text":"Subhajit Sahu","submitted_at":"2024-05-19T20:10:55Z","abstract_excerpt":"Real-world graphs often evolve over time, making community or cluster detection a crucial task. In this technical report, we extend three dynamic approaches - Naive-dynamic (ND), Delta-screening (DS), and Dynamic Frontier (DF) - to our multicore implementation of the Leiden algorithm, known for its high-quality community detection. Our experiments, conducted on a server with a 64-core AMD EPYC-7742 processor, show that ND, DS, and DF Leiden achieve average speedups of 1.37x, 1.47x, and 1.98x on large graphs with random batch updates, compared to the Static Leiden algorithm - while scaling at a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11658","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.11658/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.11658","created_at":"2026-07-05T09:54:26.747460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11658v4","created_at":"2026-07-05T09:54:26.747460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11658","created_at":"2026-07-05T09:54:26.747460+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRRJMB5CUDSM","created_at":"2026-07-05T09:54:26.747460+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRRJMB5CUDSMTYUS","created_at":"2026-07-05T09:54:26.747460+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRRJMB5C","created_at":"2026-07-05T09:54:26.747460+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/HRRJMB5CUDSMTYUS3DHFVHF4EV","json":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV.json","graph_json":"https://pith.science/api/pith-number/HRRJMB5CUDSMTYUS3DHFVHF4EV/graph.json","events_json":"https://pith.science/api/pith-number/HRRJMB5CUDSMTYUS3DHFVHF4EV/events.json","paper":"https://pith.science/paper/HRRJMB5C"},"agent_actions":{"view_html":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV","download_json":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV.json","view_paper":"https://pith.science/paper/HRRJMB5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11658&json=true","fetch_graph":"https://pith.science/api/pith-number/HRRJMB5CUDSMTYUS3DHFVHF4EV/graph.json","fetch_events":"https://pith.science/api/pith-number/HRRJMB5CUDSMTYUS3DHFVHF4EV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV/action/storage_attestation","attest_author":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV/action/author_attestation","sign_citation":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV/action/citation_signature","submit_replication":"https://pith.science/pith/HRRJMB5CUDSMTYUS3DHFVHF4EV/action/replication_record"}},"created_at":"2026-07-05T09:54:26.747460+00:00","updated_at":"2026-07-05T09:54:26.747460+00:00"}