{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YOTEX7K5XINTXGFMN5ZT3JYZOR","short_pith_number":"pith:YOTEX7K5","schema_version":"1.0","canonical_sha256":"c3a64bfd5dba1b3b98ac6f733da7197478c1d69da340d096c72609f483eddcf1","source":{"kind":"arxiv","id":"1403.5787","version":3},"attestation_state":"computed","paper":{"title":"Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","stat.ML"],"primary_cat":"physics.soc-ph","authors_text":"Cristopher Moore, Pan Zhang","submitted_at":"2014-03-23T18:41:32Z","abstract_excerpt":"Modularity is a popular measure of community structure. However, maximizing the modularity can lead to many competing partitions, with almost the same modularity, that are poorly correlated with each other. It can also produce illusory \"communities\" in random graphs where none exist. We address this problem by using the modularity as a Hamiltonian at finite temperature, and using an efficient Belief Propagation algorithm to obtain the consensus of many partitions with high modularity, rather than looking for a single partition that maximizes it. We show analytically and numerically that the pr"},"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":"1403.5787","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-03-23T18:41:32Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI","stat.ML"],"title_canon_sha256":"5346649a6768853ab813c6a249201f406c422d3b68da52e47b79b60b91e49706","abstract_canon_sha256":"09c4a9aff2bfcb8b08e383459b8c4793370473fb6fbab108f46bd94634913860"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.132726Z","signature_b64":"jm4gQHekJsrjgiaY6+E/Ai4uB5rNEGqpC+PbI285RH+1dAPKnu/Xox8kTi8qmaC/TF+Q+4wjtz9L438zrITKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a64bfd5dba1b3b98ac6f733da7197478c1d69da340d096c72609f483eddcf1","last_reissued_at":"2026-05-18T02:30:32.132124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.132124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI","stat.ML"],"primary_cat":"physics.soc-ph","authors_text":"Cristopher Moore, Pan Zhang","submitted_at":"2014-03-23T18:41:32Z","abstract_excerpt":"Modularity is a popular measure of community structure. However, maximizing the modularity can lead to many competing partitions, with almost the same modularity, that are poorly correlated with each other. It can also produce illusory \"communities\" in random graphs where none exist. We address this problem by using the modularity as a Hamiltonian at finite temperature, and using an efficient Belief Propagation algorithm to obtain the consensus of many partitions with high modularity, rather than looking for a single partition that maximizes it. We show analytically and numerically that the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5787","kind":"arxiv","version":3},"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":"1403.5787","created_at":"2026-05-18T02:30:32.132198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5787v3","created_at":"2026-05-18T02:30:32.132198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5787","created_at":"2026-05-18T02:30:32.132198+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOTEX7K5XINT","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOTEX7K5XINTXGFM","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOTEX7K5","created_at":"2026-05-18T12:28:57.508820+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/YOTEX7K5XINTXGFMN5ZT3JYZOR","json":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR.json","graph_json":"https://pith.science/api/pith-number/YOTEX7K5XINTXGFMN5ZT3JYZOR/graph.json","events_json":"https://pith.science/api/pith-number/YOTEX7K5XINTXGFMN5ZT3JYZOR/events.json","paper":"https://pith.science/paper/YOTEX7K5"},"agent_actions":{"view_html":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR","download_json":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR.json","view_paper":"https://pith.science/paper/YOTEX7K5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5787&json=true","fetch_graph":"https://pith.science/api/pith-number/YOTEX7K5XINTXGFMN5ZT3JYZOR/graph.json","fetch_events":"https://pith.science/api/pith-number/YOTEX7K5XINTXGFMN5ZT3JYZOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR/action/storage_attestation","attest_author":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR/action/author_attestation","sign_citation":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR/action/citation_signature","submit_replication":"https://pith.science/pith/YOTEX7K5XINTXGFMN5ZT3JYZOR/action/replication_record"}},"created_at":"2026-05-18T02:30:32.132198+00:00","updated_at":"2026-05-18T02:30:32.132198+00:00"}