{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KXWVAM3WX6S4D3CTEFLZJY4RWZ","short_pith_number":"pith:KXWVAM3W","schema_version":"1.0","canonical_sha256":"55ed503376bfa5c1ec53215794e391b647212d93caafaeab8b5db431d490f59e","source":{"kind":"arxiv","id":"2411.11468","version":2},"attestation_state":"computed","paper":{"title":"$\\nu$-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection","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-11-18T11:09:14Z","abstract_excerpt":"Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions are critical in a number of applications. This report presents an optimized implementation of the Label Propagation Algorithm (LPA) for community detection, featuring an asynchronous LPA with a Pick-Less (PL) method every 4 iterations to handle community swaps, ideal for SIMT hardware like GPUs. It also introduces a novel per-vertex hashtable with hybrid quadratic-double probing for collision resolution. On an NVIDIA A100 GPU, our implementation, $\\nu$-L"},"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":"2411.11468","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2024-11-18T11:09:14Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"427ea0e91d21c88448367de7fd5adcd00ee9d66e52b1250576fb70fa54d01306","abstract_canon_sha256":"ac96a5a8e68f415bedf03277b50cd80aba6a42caac8e27cdbd23e96fd23b438e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:24.025669Z","signature_b64":"eWPL8bWGTZnOG22P8pkLcdSI/ugzRU9WKWwlatg3BbUeHqJ92KI3Qqsd3KN8DD1P36NLOPtqVhog8sCHTSPpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55ed503376bfa5c1ec53215794e391b647212d93caafaeab8b5db431d490f59e","last_reissued_at":"2026-07-05T09:57:24.025178Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:24.025178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\nu$-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection","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-11-18T11:09:14Z","abstract_excerpt":"Community detection is the problem of identifying natural divisions in networks. Efficient parallel algorithms for identifying such divisions are critical in a number of applications. This report presents an optimized implementation of the Label Propagation Algorithm (LPA) for community detection, featuring an asynchronous LPA with a Pick-Less (PL) method every 4 iterations to handle community swaps, ideal for SIMT hardware like GPUs. It also introduces a novel per-vertex hashtable with hybrid quadratic-double probing for collision resolution. On an NVIDIA A100 GPU, our implementation, $\\nu$-L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11468","kind":"arxiv","version":2},"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/2411.11468/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":"2411.11468","created_at":"2026-07-05T09:57:24.025238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.11468v2","created_at":"2026-07-05T09:57:24.025238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11468","created_at":"2026-07-05T09:57:24.025238+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXWVAM3WX6S4","created_at":"2026-07-05T09:57:24.025238+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXWVAM3WX6S4D3CT","created_at":"2026-07-05T09:57:24.025238+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXWVAM3W","created_at":"2026-07-05T09:57:24.025238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.19004","citing_title":"CPU vs. GPU for Community Detection: Performance Insights from GVE-Louvain and $\\nu$-Louvain","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ","json":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ.json","graph_json":"https://pith.science/api/pith-number/KXWVAM3WX6S4D3CTEFLZJY4RWZ/graph.json","events_json":"https://pith.science/api/pith-number/KXWVAM3WX6S4D3CTEFLZJY4RWZ/events.json","paper":"https://pith.science/paper/KXWVAM3W"},"agent_actions":{"view_html":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ","download_json":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ.json","view_paper":"https://pith.science/paper/KXWVAM3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.11468&json=true","fetch_graph":"https://pith.science/api/pith-number/KXWVAM3WX6S4D3CTEFLZJY4RWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KXWVAM3WX6S4D3CTEFLZJY4RWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ/action/storage_attestation","attest_author":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ/action/author_attestation","sign_citation":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ/action/citation_signature","submit_replication":"https://pith.science/pith/KXWVAM3WX6S4D3CTEFLZJY4RWZ/action/replication_record"}},"created_at":"2026-07-05T09:57:24.025238+00:00","updated_at":"2026-07-05T09:57:24.025238+00:00"}