{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HDPS6Y3NXN3PNIVXEMV3ZBLF3O","short_pith_number":"pith:HDPS6Y3N","canonical_record":{"source":{"id":"1108.1502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-08-06T18:27:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4a6dcbd8093cbc1d69a91238b89143bba0467ebf84c220afa8f77e23a1aca3e2","abstract_canon_sha256":"975c2593e93d7feee2d55f5fc6d2c12d4e36ee989c9538f108152630c5065e90"},"schema_version":"1.0"},"canonical_sha256":"38df2f636dbb76f6a2b7232bbc8565db8b1691533df0145937259fda5c9fbb46","source":{"kind":"arxiv","id":"1108.1502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1502","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1502v2","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1502","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"HDPS6Y3NXN3P","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDPS6Y3NXN3PNIVX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDPS6Y3N","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HDPS6Y3NXN3PNIVXEMV3ZBLF3O","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-08-06T18:27:47Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"4a6dcbd8093cbc1d69a91238b89143bba0467ebf84c220afa8f77e23a1aca3e2","abstract_canon_sha256":"975c2593e93d7feee2d55f5fc6d2c12d4e36ee989c9538f108152630c5065e90"},"schema_version":"1.0"},"canonical_sha256":"38df2f636dbb76f6a2b7232bbc8565db8b1691533df0145937259fda5c9fbb46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:37.445113Z","signature_b64":"R9dLl0fDyXd/LnUsRWNbyMxEESorEMg3emvrmPN4Tqf0N+Rh2rrS2HrzdnbS6EkXH1Kwov+Mdpm0lHDjlveFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38df2f636dbb76f6a2b7232bbc8565db8b1691533df0145937259fda5c9fbb46","last_reissued_at":"2026-05-18T04:02:37.444422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:37.444422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1502","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-18T04:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lozRp0bVZr3xytjWqTgLre2jOco/oWZs3zvFwkFWIu8QoL0LW3X+OLnEpSlszvf3R6RDDztvaB/SiaKDBHD5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:12:39.368368Z"},"content_sha256":"d8266f935231248698c472d997229982624ba255f85bba1eba5724450d4ed4d3","schema_version":"1.0","event_id":"sha256:d8266f935231248698c472d997229982624ba255f85bba1eba5724450d4ed4d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HDPS6Y3NXN3PNIVXEMV3ZBLF3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Louvain Method for Community Detection in Large Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alessandro Provetti, Emilio Ferrara, Giacomo Fiumara, Pasquale De Meo","submitted_at":"2011-08-06T18:27:47Z","abstract_excerpt":"In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the k-paths. This technique allows to efficiently compute a edge ranking in large networks in near linear time. Once the centrality ranking is calculated, the algorithm computes the pairwise proximity between nodes of the network. Finally, it discovers the community structure adopting a strategy inspired by the well-known state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1502","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-18T04:02:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vne1i8c7AnZjUurM7BX8tKr22eMTvbtMDQ+0NmIwtvf9MNr4M7F8KZEDZ1EFZoODsh1SnwbJhGOMlK1lHYgsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:12:39.368829Z"},"content_sha256":"784c76f5c39d7b23fcd0b02ea3131e9794d221237794d9f375bf620c11e25741","schema_version":"1.0","event_id":"sha256:784c76f5c39d7b23fcd0b02ea3131e9794d221237794d9f375bf620c11e25741"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O/bundle.json","state_url":"https://pith.science/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O/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-05-25T20:12:39Z","links":{"resolver":"https://pith.science/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O","bundle":"https://pith.science/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O/bundle.json","state":"https://pith.science/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDPS6Y3NXN3PNIVXEMV3ZBLF3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HDPS6Y3NXN3PNIVXEMV3ZBLF3O","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":"975c2593e93d7feee2d55f5fc6d2c12d4e36ee989c9538f108152630c5065e90","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-08-06T18:27:47Z","title_canon_sha256":"4a6dcbd8093cbc1d69a91238b89143bba0467ebf84c220afa8f77e23a1aca3e2"},"schema_version":"1.0","source":{"id":"1108.1502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1502","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1502v2","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1502","created_at":"2026-05-18T04:02:37Z"},{"alias_kind":"pith_short_12","alias_value":"HDPS6Y3NXN3P","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HDPS6Y3NXN3PNIVX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HDPS6Y3N","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:784c76f5c39d7b23fcd0b02ea3131e9794d221237794d9f375bf620c11e25741","target":"graph","created_at":"2026-05-18T04:02:37Z","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":"In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the k-paths. This technique allows to efficiently compute a edge ranking in large networks in near linear time. Once the centrality ranking is calculated, the algorithm computes the pairwise proximity between nodes of the network. Finally, it discovers the community structure adopting a strategy inspired by the well-known state","authors_text":"Alessandro Provetti, Emilio Ferrara, Giacomo Fiumara, Pasquale De Meo","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-08-06T18:27:47Z","title":"Generalized Louvain Method for Community Detection in Large Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1502","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:d8266f935231248698c472d997229982624ba255f85bba1eba5724450d4ed4d3","target":"record","created_at":"2026-05-18T04:02:37Z","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":"975c2593e93d7feee2d55f5fc6d2c12d4e36ee989c9538f108152630c5065e90","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-08-06T18:27:47Z","title_canon_sha256":"4a6dcbd8093cbc1d69a91238b89143bba0467ebf84c220afa8f77e23a1aca3e2"},"schema_version":"1.0","source":{"id":"1108.1502","kind":"arxiv","version":2}},"canonical_sha256":"38df2f636dbb76f6a2b7232bbc8565db8b1691533df0145937259fda5c9fbb46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38df2f636dbb76f6a2b7232bbc8565db8b1691533df0145937259fda5c9fbb46","first_computed_at":"2026-05-18T04:02:37.444422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:37.444422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R9dLl0fDyXd/LnUsRWNbyMxEESorEMg3emvrmPN4Tqf0N+Rh2rrS2HrzdnbS6EkXH1Kwov+Mdpm0lHDjlveFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:37.445113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8266f935231248698c472d997229982624ba255f85bba1eba5724450d4ed4d3","sha256:784c76f5c39d7b23fcd0b02ea3131e9794d221237794d9f375bf620c11e25741"],"state_sha256":"06a515ae7336fb5c0dd8fc30b22786a9b4877c3ad1f043984efc87223b3a2477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irjj6kP7ThEmfqdOVE+QP4DxfauahM7AS6CeR0n5ypZIqrt/9FalnjvS0IctZbfNI3jHkMPtHDCNqdot2w6JDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:12:39.371129Z","bundle_sha256":"861d1aae46e72052b486e45d2ecf4be7b418af62fc40eef84e43784abed25a22"}}