{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W3Q6B664WCLO7M7TVACLDAMO6A","short_pith_number":"pith:W3Q6B664","schema_version":"1.0","canonical_sha256":"b6e1e0fbdcb096efb3f3a804b1818ef0020d52e1a7baaaaa80d9cad2c953dd3f","source":{"kind":"arxiv","id":"2404.19634","version":4},"attestation_state":"computed","paper":{"title":"DF Louvain: Fast Incrementally Expanding Approach for Community Detection on Dynamic Graphs","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-04-30T15:35:25Z","abstract_excerpt":"Community detection is the problem of recognizing natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly evolving graphs. In this report we present our Parallel Dynamic Frontier (DF) Louvain algorithm, which given a batch update of edge deletions and insertions, incrementally identifies and processes an approximate set of affected vertices in the graph with minimal overhead, while using a novel approach of incrementally updating weighted-degrees of vertices and total edge weights of communities. We also present our parallel implementations of Naiv"},"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":"2404.19634","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-04-30T15:35:25Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"4711c62d88897ae82c6fb0d2947a5e040776a4422a14ff0d5bdaf1a5c28e8ee0","abstract_canon_sha256":"72e2edb6b57268bb4b1223f4e9ffcf34f8453a79328963f36ced0d304e445628"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:09.617955Z","signature_b64":"bmwXl6qLo0v6kGmUY4fMxaWCXl+B5YdE0EnRM5o58rM9L82Oj4MxA6ysZ6HOn9K9BDW9zZKi6/S+nG3daAnmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6e1e0fbdcb096efb3f3a804b1818ef0020d52e1a7baaaaa80d9cad2c953dd3f","last_reissued_at":"2026-07-05T09:04:09.617514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:09.617514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DF Louvain: Fast Incrementally Expanding Approach for Community Detection on Dynamic Graphs","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-04-30T15:35:25Z","abstract_excerpt":"Community detection is the problem of recognizing natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly evolving graphs. In this report we present our Parallel Dynamic Frontier (DF) Louvain algorithm, which given a batch update of edge deletions and insertions, incrementally identifies and processes an approximate set of affected vertices in the graph with minimal overhead, while using a novel approach of incrementally updating weighted-degrees of vertices and total edge weights of communities. We also present our parallel implementations of Naiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19634","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/2404.19634/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":"2404.19634","created_at":"2026-07-05T09:04:09.617569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.19634v4","created_at":"2026-07-05T09:04:09.617569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19634","created_at":"2026-07-05T09:04:09.617569+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3Q6B664WCLO","created_at":"2026-07-05T09:04:09.617569+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3Q6B664WCLO7M7T","created_at":"2026-07-05T09:04:09.617569+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3Q6B664","created_at":"2026-07-05T09:04:09.617569+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/W3Q6B664WCLO7M7TVACLDAMO6A","json":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A.json","graph_json":"https://pith.science/api/pith-number/W3Q6B664WCLO7M7TVACLDAMO6A/graph.json","events_json":"https://pith.science/api/pith-number/W3Q6B664WCLO7M7TVACLDAMO6A/events.json","paper":"https://pith.science/paper/W3Q6B664"},"agent_actions":{"view_html":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A","download_json":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A.json","view_paper":"https://pith.science/paper/W3Q6B664","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.19634&json=true","fetch_graph":"https://pith.science/api/pith-number/W3Q6B664WCLO7M7TVACLDAMO6A/graph.json","fetch_events":"https://pith.science/api/pith-number/W3Q6B664WCLO7M7TVACLDAMO6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A/action/storage_attestation","attest_author":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A/action/author_attestation","sign_citation":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A/action/citation_signature","submit_replication":"https://pith.science/pith/W3Q6B664WCLO7M7TVACLDAMO6A/action/replication_record"}},"created_at":"2026-07-05T09:04:09.617569+00:00","updated_at":"2026-07-05T09:04:09.617569+00:00"}