{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LQTC2ZNTC4ZB5QWVVXDFVFGRGY","short_pith_number":"pith:LQTC2ZNT","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"},"canonical_sha256":"5c262d65b317321ec2d5adc65a94d13602b4a004ca646e67e1a0598535fca6d8","source":{"kind":"arxiv","id":"1503.01322","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01322","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01322v2","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01322","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"LQTC2ZNTC4ZB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQTC2ZNTC4ZB5QWV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQTC2ZNT","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LQTC2ZNTC4ZB5QWVVXDFVFGRGY","target":"record","payload":{"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"},"canonical_sha256":"5c262d65b317321ec2d5adc65a94d13602b4a004ca646e67e1a0598535fca6d8","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"},"source_kind":"arxiv","source_id":"1503.01322","source_version":2,"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-05-18T01:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PGnWLITMFJG7LI6AiUguk5BDs8p8eULIAb7rGNRvpblk2SxslCximwhZ8Or61XNMKKyVjY4vzbAdJkRW2SoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:12:49.654740Z"},"content_sha256":"e5b2b87922ba7f21a40587ae44d1c05555cc5eff2964a221898730ab2a4d2a24","schema_version":"1.0","event_id":"sha256:e5b2b87922ba7f21a40587ae44d1c05555cc5eff2964a221898730ab2a4d2a24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LQTC2ZNTC4ZB5QWVVXDFVFGRGY","target":"graph","payload":{"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"},"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-05-18T01:33:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iiR9F/4xSntLpJ3U/6Xrb3xeYpC/M1GBHw9ttXAIndBLnGAZQaRfkQYAGG/Yqhh/Vs2YUINhaw7QFPKR5zUsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:12:49.655308Z"},"content_sha256":"7b519da6ee034690f1b10b7d27a565b28c47a6ccf555abe75bcf80016383d310","schema_version":"1.0","event_id":"sha256:7b519da6ee034690f1b10b7d27a565b28c47a6ccf555abe75bcf80016383d310"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/bundle.json","state_url":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/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-07-04T18:12:49Z","links":{"resolver":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY","bundle":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/bundle.json","state":"https://pith.science/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQTC2ZNTC4ZB5QWVVXDFVFGRGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LQTC2ZNTC4ZB5QWVVXDFVFGRGY","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":"7a76b4cbc83f0b8c37baaf36f182c6975ec40da6b5ba02ab92f5c0e6d4b2de94","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-04T14:50:22Z","title_canon_sha256":"d5c9ab25f028806bd55ab92cc87f32a4dfe0272c5583107414d7cfc1e1960900"},"schema_version":"1.0","source":{"id":"1503.01322","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01322","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01322v2","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01322","created_at":"2026-05-18T01:33:35Z"},{"alias_kind":"pith_short_12","alias_value":"LQTC2ZNTC4ZB","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQTC2ZNTC4ZB5QWV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQTC2ZNT","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:7b519da6ee034690f1b10b7d27a565b28c47a6ccf555abe75bcf80016383d310","target":"graph","created_at":"2026-05-18T01:33:35Z","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"},"paper":{"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","authors_text":"V.A. Traag","cross_cats":["cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-04T14:50:22Z","title":"Faster unfolding of communities: speeding up the Louvain algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01322","kind":"arxiv","version":2},"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:e5b2b87922ba7f21a40587ae44d1c05555cc5eff2964a221898730ab2a4d2a24","target":"record","created_at":"2026-05-18T01:33:35Z","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":"7a76b4cbc83f0b8c37baaf36f182c6975ec40da6b5ba02ab92f5c0e6d4b2de94","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-03-04T14:50:22Z","title_canon_sha256":"d5c9ab25f028806bd55ab92cc87f32a4dfe0272c5583107414d7cfc1e1960900"},"schema_version":"1.0","source":{"id":"1503.01322","kind":"arxiv","version":2}},"canonical_sha256":"5c262d65b317321ec2d5adc65a94d13602b4a004ca646e67e1a0598535fca6d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c262d65b317321ec2d5adc65a94d13602b4a004ca646e67e1a0598535fca6d8","first_computed_at":"2026-05-18T01:33:35.057412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:35.057412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LhhMfMYK6lOT7PA7Mqii9orhdONfbwLHVJXeMY2qgji731HnPSu1hka6LtleEkE+n9nZQXemOGYDzoOcBwbUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:35.058312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01322","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5b2b87922ba7f21a40587ae44d1c05555cc5eff2964a221898730ab2a4d2a24","sha256:7b519da6ee034690f1b10b7d27a565b28c47a6ccf555abe75bcf80016383d310"],"state_sha256":"96e32c151f8e8e92d8b59eaf2279ad647e52b84b8b1aae10b94b8c3b3f5f4f4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgyk4nWB0a3HyXOnSP0FWgoF26RvA7N58Rd0rAnk1jWhckKV+mx+VU4hOpIiCSpDWyMZneHp0khjD858Ir4HDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:12:49.658235Z","bundle_sha256":"988eafcbc8007eda22be4a4a32ed6d76c2b5b6eaaaa4a6d778e0ab93c35d00d3"}}