{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LQTC2ZNTC4ZB5QWVVXDFVFGRGY","short_pith_number":"pith:LQTC2ZNT","schema_version":"1.0","canonical_sha256":"5c262d65b317321ec2d5adc65a94d13602b4a004ca646e67e1a0598535fca6d8","source":{"kind":"arxiv","id":"1503.01322","version":2},"attestation_state":"computed","paper":{"title":"Faster unfolding of communities: speeding up the Louvain algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"V.A. Traag","submitted_at":"2015-03-04T14:50:22Z","abstract_excerpt":"Many complex networks exhibit a modular structure of densely connected groups of nodes. Usually, such a modular structure is uncovered by the optimization of some quality function. Although flawed, modularity remains one of the most popular quality functions. The Louvain algorithm was originally developed for optimizing modularity, but has been applied to a variety of methods. As such, speeding up the Louvain algorithm, enables the analysis of larger graphs in a shorter time for various methods. We here suggest to consider moving nodes to a random neighbor community, instead of the best neighb"},"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":"1503.01322","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-04T14:50:22Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"d5c9ab25f028806bd55ab92cc87f32a4dfe0272c5583107414d7cfc1e1960900","abstract_canon_sha256":"7a76b4cbc83f0b8c37baaf36f182c6975ec40da6b5ba02ab92f5c0e6d4b2de94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:35.058312Z","signature_b64":"LhhMfMYK6lOT7PA7Mqii9orhdONfbwLHVJXeMY2qgji731HnPSu1hka6LtleEkE+n9nZQXemOGYDzoOcBwbUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c262d65b317321ec2d5adc65a94d13602b4a004ca646e67e1a0598535fca6d8","last_reissued_at":"2026-05-18T01:33:35.057412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:35.057412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster unfolding of communities: speeding up the Louvain algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"V.A. Traag","submitted_at":"2015-03-04T14:50:22Z","abstract_excerpt":"Many complex networks exhibit a modular structure of densely connected groups of nodes. Usually, such a modular structure is uncovered by the optimization of some quality function. Although flawed, modularity remains one of the most popular quality functions. The Louvain algorithm was originally developed for optimizing modularity, but has been applied to a variety of methods. As such, speeding up the Louvain algorithm, enables the analysis of larger graphs in a shorter time for various methods. We here suggest to consider moving nodes to a random neighbor community, instead of the best neighb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01322","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":""},"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":"1503.01322","created_at":"2026-05-18T01:33:35.057574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01322v2","created_at":"2026-05-18T01:33:35.057574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01322","created_at":"2026-05-18T01:33:35.057574+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQTC2ZNTC4ZB","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQTC2ZNTC4ZB5QWV","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQTC2ZNT","created_at":"2026-05-18T12:29:29.992203+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/LQTC2ZNTC4ZB5QWVVXDFVFGRGY","json":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY.json","graph_json":"https://pith.science/api/pith-number/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/graph.json","events_json":"https://pith.science/api/pith-number/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/events.json","paper":"https://pith.science/paper/LQTC2ZNT"},"agent_actions":{"view_html":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY","download_json":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY.json","view_paper":"https://pith.science/paper/LQTC2ZNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01322&json=true","fetch_graph":"https://pith.science/api/pith-number/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/graph.json","fetch_events":"https://pith.science/api/pith-number/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/action/storage_attestation","attest_author":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/action/author_attestation","sign_citation":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/action/citation_signature","submit_replication":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/action/replication_record"}},"created_at":"2026-05-18T01:33:35.057574+00:00","updated_at":"2026-05-18T01:33:35.057574+00:00"}