{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WUARJ6TIFOP2GRMKXLJIBOCIRJ","short_pith_number":"pith:WUARJ6TI","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"},"canonical_sha256":"b50114fa682b9fa3458abad280b8488a66cf68c0f0208de44956237399ab26b9","source":{"kind":"arxiv","id":"2411.02268","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.02268","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"2411.02268v3","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02268","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"WUARJ6TIFOP2","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_16","alias_value":"WUARJ6TIFOP2GRMK","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_8","alias_value":"WUARJ6TI","created_at":"2026-07-05T10:07:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WUARJ6TIFOP2GRMKXLJIBOCIRJ","target":"record","payload":{"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"},"canonical_sha256":"b50114fa682b9fa3458abad280b8488a66cf68c0f0208de44956237399ab26b9","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"},"source_kind":"arxiv","source_id":"2411.02268","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4lCakKGb9DnGShO66vyMlnoU0wj9w1eM4O6sI/0B5yKSe9VNYrbVWrabPi0Hwu/5ERpafmvZUZcIaQxn6FHsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:05:58.615664Z"},"content_sha256":"2922cb92a71327c58e12a35763acfc2221ee2745e429fc92406ac8f5e414c20e","schema_version":"1.0","event_id":"sha256:2922cb92a71327c58e12a35763acfc2221ee2745e429fc92406ac8f5e414c20e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WUARJ6TIFOP2GRMKXLJIBOCIRJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:07:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0umN3r0xRkCfYBdcjheW0LW9Jf0sKkhOPT+YZ1OhbnsR/ux8ey6tN0UJt0EG9I7NHJcQnCdzfuKKnUFkRvQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:05:58.616582Z"},"content_sha256":"36ab5b1f20cf4ce72d6ded975cc9090d11a7b1581b9b3c297d1568507c472baa","schema_version":"1.0","event_id":"sha256:36ab5b1f20cf4ce72d6ded975cc9090d11a7b1581b9b3c297d1568507c472baa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/bundle.json","state_url":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T17:05:58Z","links":{"resolver":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ","bundle":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/bundle.json","state":"https://pith.science/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUARJ6TIFOP2GRMKXLJIBOCIRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WUARJ6TIFOP2GRMKXLJIBOCIRJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"05f84a0a1bc78ba6fefaeb57c0b1131b27917166b40c2395a71046e4f418ccd6","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2024-11-04T16:58:36Z","title_canon_sha256":"b78801be1d9730e9325e9bcb3fb7b7bc6b5654846d7036692b53e12021e174d7"},"schema_version":"1.0","source":{"id":"2411.02268","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.02268","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"arxiv_version","alias_value":"2411.02268v3","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02268","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_12","alias_value":"WUARJ6TIFOP2","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_16","alias_value":"WUARJ6TIFOP2GRMK","created_at":"2026-07-05T10:07:02Z"},{"alias_kind":"pith_short_8","alias_value":"WUARJ6TI","created_at":"2026-07-05T10:07:02Z"}],"graph_snapshots":[{"event_id":"sha256:36ab5b1f20cf4ce72d6ded975cc9090d11a7b1581b9b3c297d1568507c472baa","target":"graph","created_at":"2026-07-05T10:07:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.02268/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Subhajit Sahu","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2024-11-04T16:58:36Z","title":"Memory-Efficient Community Detection on Large Graphs Using Weighted Sketches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02268","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2922cb92a71327c58e12a35763acfc2221ee2745e429fc92406ac8f5e414c20e","target":"record","created_at":"2026-07-05T10:07:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"05f84a0a1bc78ba6fefaeb57c0b1131b27917166b40c2395a71046e4f418ccd6","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2024-11-04T16:58:36Z","title_canon_sha256":"b78801be1d9730e9325e9bcb3fb7b7bc6b5654846d7036692b53e12021e174d7"},"schema_version":"1.0","source":{"id":"2411.02268","kind":"arxiv","version":3}},"canonical_sha256":"b50114fa682b9fa3458abad280b8488a66cf68c0f0208de44956237399ab26b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b50114fa682b9fa3458abad280b8488a66cf68c0f0208de44956237399ab26b9","first_computed_at":"2026-07-05T10:07:02.246923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:07:02.246923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K5xnLiwhA1nhO1+MASwoI4yFmT2bQTLulbpjWTmmPRQLabbNuuqf67ADl+Ai6ku+e5xr9KUIbwavNXEV/N8dCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:07:02.247292Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.02268","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2922cb92a71327c58e12a35763acfc2221ee2745e429fc92406ac8f5e414c20e","sha256:36ab5b1f20cf4ce72d6ded975cc9090d11a7b1581b9b3c297d1568507c472baa"],"state_sha256":"9b04f4048e13200c4fff06bc5aa82e7c1b463131710e893913d3f2aaf998e4ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/A4Zz4KtZmeYulm0TXbv59c/Sc+Rcw80Y02GjTlq071gISrMH6/cQ+4a484seH2PWmjHb5Jks6I8BmfcSjPxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:05:58.623719Z","bundle_sha256":"9529d3938e37e1a401736193e6f6e569aad7cc7834aab024f31dd94eb96c3aeb"}}