{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E4JURMROKM7QD4SHYCVVV2PNJD","short_pith_number":"pith:E4JURMRO","schema_version":"1.0","canonical_sha256":"271348b22e533f01f247c0ab5ae9ed48da081b1a6dadbdd50fa50a5e2d813b4c","source":{"kind":"arxiv","id":"1406.2518","version":1},"attestation_state":"computed","paper":{"title":"A Generalized and Adaptive Method for Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.AP"],"primary_cat":"cs.SI","authors_text":"Jean-Loup Guillaume, Patricia Conde C\\'espedes, Romain Campigotto","submitted_at":"2014-06-10T12:06:42Z","abstract_excerpt":"Complex networks represent interactions between entities. They appear in various contexts such as sociology, biology, etc., and they generally contain highly connected subgroups called communities. Community detection is a well-studied problem and most of the algorithms aim to maximize the Newman-Girvan modularity function, the most popular being the Louvain method (it is well-suited on very large graphs). However, the classical modularity has many drawbacks: we can find partitions of high quality in graphs without community structure, e.g., on random graphs; it promotes large communities. The"},"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":"1406.2518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-06-10T12:06:42Z","cross_cats_sorted":["physics.soc-ph","stat.AP"],"title_canon_sha256":"d28f6784c330dd9fbb28e84a8644640dc93eef65b37e4d2694d11ea06cd00d6c","abstract_canon_sha256":"22ae6418ac467d7db28dea92b7d96512ec661ddedfb9c891ea518344ae681002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.552655Z","signature_b64":"EIsBQcD52GZczH2ehPH7jucnsniOPj7z7f8QCr9PfEBc3W+Z7cyKgQKz96o0QRu4bOVr01A609vPCy7Bd2+VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271348b22e533f01f247c0ab5ae9ed48da081b1a6dadbdd50fa50a5e2d813b4c","last_reissued_at":"2026-05-18T02:50:01.552196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.552196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized and Adaptive Method for Community Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.AP"],"primary_cat":"cs.SI","authors_text":"Jean-Loup Guillaume, Patricia Conde C\\'espedes, Romain Campigotto","submitted_at":"2014-06-10T12:06:42Z","abstract_excerpt":"Complex networks represent interactions between entities. They appear in various contexts such as sociology, biology, etc., and they generally contain highly connected subgroups called communities. Community detection is a well-studied problem and most of the algorithms aim to maximize the Newman-Girvan modularity function, the most popular being the Louvain method (it is well-suited on very large graphs). However, the classical modularity has many drawbacks: we can find partitions of high quality in graphs without community structure, e.g., on random graphs; it promotes large communities. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2518","kind":"arxiv","version":1},"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":"1406.2518","created_at":"2026-05-18T02:50:01.552256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2518v1","created_at":"2026-05-18T02:50:01.552256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2518","created_at":"2026-05-18T02:50:01.552256+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4JURMROKM7Q","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4JURMROKM7QD4SH","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4JURMRO","created_at":"2026-05-18T12:28:25.294606+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/E4JURMROKM7QD4SHYCVVV2PNJD","json":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD.json","graph_json":"https://pith.science/api/pith-number/E4JURMROKM7QD4SHYCVVV2PNJD/graph.json","events_json":"https://pith.science/api/pith-number/E4JURMROKM7QD4SHYCVVV2PNJD/events.json","paper":"https://pith.science/paper/E4JURMRO"},"agent_actions":{"view_html":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD","download_json":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD.json","view_paper":"https://pith.science/paper/E4JURMRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2518&json=true","fetch_graph":"https://pith.science/api/pith-number/E4JURMROKM7QD4SHYCVVV2PNJD/graph.json","fetch_events":"https://pith.science/api/pith-number/E4JURMROKM7QD4SHYCVVV2PNJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD/action/storage_attestation","attest_author":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD/action/author_attestation","sign_citation":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD/action/citation_signature","submit_replication":"https://pith.science/pith/E4JURMROKM7QD4SHYCVVV2PNJD/action/replication_record"}},"created_at":"2026-05-18T02:50:01.552256+00:00","updated_at":"2026-05-18T02:50:01.552256+00:00"}