{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FU5MOXRIVGY4WSQ5AJMIDZVRY2","short_pith_number":"pith:FU5MOXRI","canonical_record":{"source":{"id":"1102.0969","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-04T16:56:58Z","cross_cats_sorted":["cs.CC","cs.DM","cs.SI"],"title_canon_sha256":"c276c6401687f71b06c4cbefa731e8e2bb8348e9718f228fd899e0b0a4cdac4c","abstract_canon_sha256":"56b047ea8587e7db1b85a59062be825780dd4f3029b96fec379d0c12892f67fe"},"schema_version":"1.0"},"canonical_sha256":"2d3ac75e28a9b1cb4a1d025881e6b1c684a0620a1e3d6bacdd03dc3ab97e05cd","source":{"kind":"arxiv","id":"1102.0969","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0969","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0969v2","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0969","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"FU5MOXRIVGY4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FU5MOXRIVGY4WSQ5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FU5MOXRI","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FU5MOXRIVGY4WSQ5AJMIDZVRY2","target":"record","payload":{"canonical_record":{"source":{"id":"1102.0969","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-04T16:56:58Z","cross_cats_sorted":["cs.CC","cs.DM","cs.SI"],"title_canon_sha256":"c276c6401687f71b06c4cbefa731e8e2bb8348e9718f228fd899e0b0a4cdac4c","abstract_canon_sha256":"56b047ea8587e7db1b85a59062be825780dd4f3029b96fec379d0c12892f67fe"},"schema_version":"1.0"},"canonical_sha256":"2d3ac75e28a9b1cb4a1d025881e6b1c684a0620a1e3d6bacdd03dc3ab97e05cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:56.026073Z","signature_b64":"vgyoLmhjyYy6aJLvM/VzI5Vdd2Jhw1PlgwyuQhrwEA73oPkzOCpqzHJMNz7XDZHvD2qBdTNbJRCCDbgNR48hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d3ac75e28a9b1cb4a1d025881e6b1c684a0620a1e3d6bacdd03dc3ab97e05cd","last_reissued_at":"2026-05-18T00:07:56.025398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:56.025398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.0969","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-18T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ri5B28ec5R5AXnUVwOuxzZYLJIg5CzijMEdpR9oJgcxYFP9fAFwV+3xNdUg45TKdcUUB0C2X+s6pOljS07YSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:01:27.996989Z"},"content_sha256":"f60abecb6fbf6c474b9700d9d0cb81a3b147c2a00052d8b4bbb0afca53cc0a7b","schema_version":"1.0","event_id":"sha256:f60abecb6fbf6c474b9700d9d0cb81a3b147c2a00052d8b4bbb0afca53cc0a7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FU5MOXRIVGY4WSQ5AJMIDZVRY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Newman's Community Finding Approach for Biological and Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Bhaskar DasGupta, Devendra Desai","submitted_at":"2011-02-04T16:56:58Z","abstract_excerpt":"Given a graph of interactions, a module (also called a community or cluster) is a subset of nodes whose fitness is a function of the statistical significance of the pairwise interactions of nodes in the module. The topic of this paper is a model-based community finding approach, commonly referred to as modularity clustering, that was originally proposed by Newman and has subsequently been extremely popular in practice. Various heuristic methods are currently employed for finding the optimal solution. However, the exact computational complexity of this approach is still largely unknown.\n  To th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0969","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-18T00:07:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQBJynAY/T35Q8VJMvtTidqfNof3W+R4/YwZ4RMM2NudTUZ+wHuRZwyjZny5bOF+DplEpDQr7ac+DolkLZzrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:01:27.997359Z"},"content_sha256":"ec0f555717a16a4f5c76c447171259267ba926e7ceef7bf6fb419ed3c4dc8d3a","schema_version":"1.0","event_id":"sha256:ec0f555717a16a4f5c76c447171259267ba926e7ceef7bf6fb419ed3c4dc8d3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2/bundle.json","state_url":"https://pith.science/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2/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-28T15:01:27Z","links":{"resolver":"https://pith.science/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2","bundle":"https://pith.science/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2/bundle.json","state":"https://pith.science/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FU5MOXRIVGY4WSQ5AJMIDZVRY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FU5MOXRIVGY4WSQ5AJMIDZVRY2","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":"56b047ea8587e7db1b85a59062be825780dd4f3029b96fec379d0c12892f67fe","cross_cats_sorted":["cs.CC","cs.DM","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-04T16:56:58Z","title_canon_sha256":"c276c6401687f71b06c4cbefa731e8e2bb8348e9718f228fd899e0b0a4cdac4c"},"schema_version":"1.0","source":{"id":"1102.0969","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0969","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0969v2","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0969","created_at":"2026-05-18T00:07:56Z"},{"alias_kind":"pith_short_12","alias_value":"FU5MOXRIVGY4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FU5MOXRIVGY4WSQ5","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FU5MOXRI","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:ec0f555717a16a4f5c76c447171259267ba926e7ceef7bf6fb419ed3c4dc8d3a","target":"graph","created_at":"2026-05-18T00:07:56Z","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":"Given a graph of interactions, a module (also called a community or cluster) is a subset of nodes whose fitness is a function of the statistical significance of the pairwise interactions of nodes in the module. The topic of this paper is a model-based community finding approach, commonly referred to as modularity clustering, that was originally proposed by Newman and has subsequently been extremely popular in practice. Various heuristic methods are currently employed for finding the optimal solution. However, the exact computational complexity of this approach is still largely unknown.\n  To th","authors_text":"Bhaskar DasGupta, Devendra Desai","cross_cats":["cs.CC","cs.DM","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-04T16:56:58Z","title":"On the Complexity of Newman's Community Finding Approach for Biological and Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0969","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:f60abecb6fbf6c474b9700d9d0cb81a3b147c2a00052d8b4bbb0afca53cc0a7b","target":"record","created_at":"2026-05-18T00:07:56Z","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":"56b047ea8587e7db1b85a59062be825780dd4f3029b96fec379d0c12892f67fe","cross_cats_sorted":["cs.CC","cs.DM","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-04T16:56:58Z","title_canon_sha256":"c276c6401687f71b06c4cbefa731e8e2bb8348e9718f228fd899e0b0a4cdac4c"},"schema_version":"1.0","source":{"id":"1102.0969","kind":"arxiv","version":2}},"canonical_sha256":"2d3ac75e28a9b1cb4a1d025881e6b1c684a0620a1e3d6bacdd03dc3ab97e05cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d3ac75e28a9b1cb4a1d025881e6b1c684a0620a1e3d6bacdd03dc3ab97e05cd","first_computed_at":"2026-05-18T00:07:56.025398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:56.025398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vgyoLmhjyYy6aJLvM/VzI5Vdd2Jhw1PlgwyuQhrwEA73oPkzOCpqzHJMNz7XDZHvD2qBdTNbJRCCDbgNR48hDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:56.026073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0969","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f60abecb6fbf6c474b9700d9d0cb81a3b147c2a00052d8b4bbb0afca53cc0a7b","sha256:ec0f555717a16a4f5c76c447171259267ba926e7ceef7bf6fb419ed3c4dc8d3a"],"state_sha256":"ab8135a1b9013c449d3fa57f80b4100ffab26f9014da17696137560be0240c33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmWflk6M1vccvzc+Ug39FdxkvglOdXKwu7KhC/vJs6kd+YKnSms2a4tR3f4mRMdfSIEiaogH9kpB2zsN+yQqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:01:27.999482Z","bundle_sha256":"92e6d8bf769fd62eece0936add309b244ac430a4d54677d77cf8d57cc225bb55"}}