{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QMZLQOLMMETTPUE7FJ7IV6Z4BM","short_pith_number":"pith:QMZLQOLM","schema_version":"1.0","canonical_sha256":"8332b8396c612737d09f2a7e8afb3c0b0996fc1f28fbee2a7e296e7c84377138","source":{"kind":"arxiv","id":"1004.5283","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial approach to Modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Andrea Lancichinetti, Filippo Radicchi, Jos\\'e J. Ramasco","submitted_at":"2010-04-29T13:39:13Z","abstract_excerpt":"Communities are clusters of nodes with a higher than average density of internal connections. Their detection is of great relevance to better understand the structure and hierarchies present in a network. Modularity has become a standard tool in the area of community detection, providing at the same time a way to evaluate partitions and, by maximizing it, a method to find communities. In this work, we study the modularity from a combinatorial point of view. Our analysis (as the modularity definition) relies on the use of the configurational model, a technique that given a graph produces a seri"},"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":"1004.5283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2010-04-29T13:39:13Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"dc53e0b4dbb3f8c22e6b0a7964ad1553d0b7a9d9a7d3ea182cfdc7bd9df6fa70","abstract_canon_sha256":"ab2a7f3b12e20032393bc4e369808cff2e6104a26326e07ad884765ba02ce142"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:15.079402Z","signature_b64":"UNUj3h7Y12PQsnpCbarWhWZSye9Jww3DqxTVEZejNkJv4HdlLLlS7lhyfaC/hlHzGjsIOqmLUIp5eG459N2GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8332b8396c612737d09f2a7e8afb3c0b0996fc1f28fbee2a7e296e7c84377138","last_reissued_at":"2026-05-18T02:24:15.078839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:15.078839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial approach to Modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"physics.soc-ph","authors_text":"Andrea Lancichinetti, Filippo Radicchi, Jos\\'e J. Ramasco","submitted_at":"2010-04-29T13:39:13Z","abstract_excerpt":"Communities are clusters of nodes with a higher than average density of internal connections. Their detection is of great relevance to better understand the structure and hierarchies present in a network. Modularity has become a standard tool in the area of community detection, providing at the same time a way to evaluate partitions and, by maximizing it, a method to find communities. In this work, we study the modularity from a combinatorial point of view. Our analysis (as the modularity definition) relies on the use of the configurational model, a technique that given a graph produces a seri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.5283","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":"1004.5283","created_at":"2026-05-18T02:24:15.078931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.5283v2","created_at":"2026-05-18T02:24:15.078931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.5283","created_at":"2026-05-18T02:24:15.078931+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMZLQOLMMETT","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMZLQOLMMETTPUE7","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMZLQOLM","created_at":"2026-05-18T12:26:12.377268+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/QMZLQOLMMETTPUE7FJ7IV6Z4BM","json":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM.json","graph_json":"https://pith.science/api/pith-number/QMZLQOLMMETTPUE7FJ7IV6Z4BM/graph.json","events_json":"https://pith.science/api/pith-number/QMZLQOLMMETTPUE7FJ7IV6Z4BM/events.json","paper":"https://pith.science/paper/QMZLQOLM"},"agent_actions":{"view_html":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM","download_json":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM.json","view_paper":"https://pith.science/paper/QMZLQOLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.5283&json=true","fetch_graph":"https://pith.science/api/pith-number/QMZLQOLMMETTPUE7FJ7IV6Z4BM/graph.json","fetch_events":"https://pith.science/api/pith-number/QMZLQOLMMETTPUE7FJ7IV6Z4BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM/action/storage_attestation","attest_author":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM/action/author_attestation","sign_citation":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM/action/citation_signature","submit_replication":"https://pith.science/pith/QMZLQOLMMETTPUE7FJ7IV6Z4BM/action/replication_record"}},"created_at":"2026-05-18T02:24:15.078931+00:00","updated_at":"2026-05-18T02:24:15.078931+00:00"}