{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WUARJ6TIFOP2GRMKXLJIBOCIRJ","short_pith_number":"pith:WUARJ6TI","schema_version":"1.0","canonical_sha256":"b50114fa682b9fa3458abad280b8488a66cf68c0f0208de44956237399ab26b9","source":{"kind":"arxiv","id":"2411.02268","version":3},"attestation_state":"computed","paper":{"title":"Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Subhajit Sahu","submitted_at":"2024-11-04T16:58:36Z","abstract_excerpt":"Community detection in graphs identifies groups of nodes with denser connections within the groups than between them, and while existing studies often focus on optimizing detection performance, memory constraints become critical when processing large graphs on shared-memory systems. We recently proposed efficient implementations of the Louvain, Leiden, and Label Propagation Algorithms (LPA) for community detection. However, these incur significant memory overhead from the use of collision-free per-thread hashtables. To address this, we introduce memory-efficient alternatives using weighted Mis"},"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.02268","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2024-11-04T16:58:36Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b78801be1d9730e9325e9bcb3fb7b7bc6b5654846d7036692b53e12021e174d7","abstract_canon_sha256":"05f84a0a1bc78ba6fefaeb57c0b1131b27917166b40c2395a71046e4f418ccd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:02.247292Z","signature_b64":"K5xnLiwhA1nhO1+MASwoI4yFmT2bQTLulbpjWTmmPRQLabbNuuqf67ADl+Ai6ku+e5xr9KUIbwavNXEV/N8dCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b50114fa682b9fa3458abad280b8488a66cf68c0f0208de44956237399ab26b9","last_reissued_at":"2026-07-05T10:07:02.246923Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:02.246923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Subhajit Sahu","submitted_at":"2024-11-04T16:58:36Z","abstract_excerpt":"Community detection in graphs identifies groups of nodes with denser connections within the groups than between them, and while existing studies often focus on optimizing detection performance, memory constraints become critical when processing large graphs on shared-memory systems. We recently proposed efficient implementations of the Louvain, Leiden, and Label Propagation Algorithms (LPA) for community detection. However, these incur significant memory overhead from the use of collision-free per-thread hashtables. To address this, we introduce memory-efficient alternatives using weighted Mis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02268","kind":"arxiv","version":3},"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.02268/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.02268","created_at":"2026-07-05T10:07:02.246981+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02268v3","created_at":"2026-07-05T10:07:02.246981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02268","created_at":"2026-07-05T10:07:02.246981+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUARJ6TIFOP2","created_at":"2026-07-05T10:07:02.246981+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUARJ6TIFOP2GRMK","created_at":"2026-07-05T10:07:02.246981+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUARJ6TI","created_at":"2026-07-05T10:07:02.246981+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19901","citing_title":"Memory Efficient GPU-based Label Propagation Algorithm (LPA) for Community Detection on Large Graphs","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ","json":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ.json","graph_json":"https://pith.science/api/pith-number/WUARJ6TIFOP2GRMKXLJIBOCIRJ/graph.json","events_json":"https://pith.science/api/pith-number/WUARJ6TIFOP2GRMKXLJIBOCIRJ/events.json","paper":"https://pith.science/paper/WUARJ6TI"},"agent_actions":{"view_html":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ","download_json":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ.json","view_paper":"https://pith.science/paper/WUARJ6TI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02268&json=true","fetch_graph":"https://pith.science/api/pith-number/WUARJ6TIFOP2GRMKXLJIBOCIRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WUARJ6TIFOP2GRMKXLJIBOCIRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/action/storage_attestation","attest_author":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/action/author_attestation","sign_citation":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/action/citation_signature","submit_replication":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/action/replication_record"}},"created_at":"2026-07-05T10:07:02.246981+00:00","updated_at":"2026-07-05T10:07:02.246981+00:00"}