{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:5HPJ4VIKPFGL3VIM2WC4J5HZCX","short_pith_number":"pith:5HPJ4VIK","schema_version":"1.0","canonical_sha256":"e9de9e550a794cbdd50cd585c4f4f915c23f6e06f9e3f88b0b3d07365d7cc2de","source":{"kind":"arxiv","id":"0901.2151","version":1},"attestation_state":"computed","paper":{"title":"Improved community structure detection using a modified fine tuning strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS","physics.comp-ph","physics.soc-ph","q-bio.QM"],"primary_cat":"cs.CY","authors_text":"Bogdan Danila, Kevin E. Bassler, Kresimir Josic, Yudong Sun","submitted_at":"2009-01-15T00:40:26Z","abstract_excerpt":"The community structure of a complex network can be determined by finding the partitioning of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work by recursively bisecting the network. We show that this unduely constrains their results, leading to a bias in the size of the communities they find and limiting their effectivness. To solve this problem, we propose adding a step to the existing algorithms that does not increase the order of their computational complexity. We show that, if this step is combined with a commonly used method, the identified constrain"},"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":"0901.2151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CY","submitted_at":"2009-01-15T00:40:26Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DS","physics.comp-ph","physics.soc-ph","q-bio.QM"],"title_canon_sha256":"8fd68506a5697bd3ca220782b17dc513cba195c22c44b7a719c84eb496d24814","abstract_canon_sha256":"8947f715c7db2c2d49174683a076ef60d7bbbdde436dfb9c2a70d630049a845a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:14:57.375638Z","signature_b64":"iuGVof65qzELXDJ6tSZUI3Bsv9JYWh5o3mLvjLNq5UgKParG2/yafJTZVYvYDcxuVpbVaeEhSstckiKwC7gxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9de9e550a794cbdd50cd585c4f4f915c23f6e06f9e3f88b0b3d07365d7cc2de","last_reissued_at":"2026-05-18T02:14:57.374804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:14:57.374804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved community structure detection using a modified fine tuning strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DS","physics.comp-ph","physics.soc-ph","q-bio.QM"],"primary_cat":"cs.CY","authors_text":"Bogdan Danila, Kevin E. Bassler, Kresimir Josic, Yudong Sun","submitted_at":"2009-01-15T00:40:26Z","abstract_excerpt":"The community structure of a complex network can be determined by finding the partitioning of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work by recursively bisecting the network. We show that this unduely constrains their results, leading to a bias in the size of the communities they find and limiting their effectivness. To solve this problem, we propose adding a step to the existing algorithms that does not increase the order of their computational complexity. We show that, if this step is combined with a commonly used method, the identified constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.2151","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":"0901.2151","created_at":"2026-05-18T02:14:57.374950+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.2151v1","created_at":"2026-05-18T02:14:57.374950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.2151","created_at":"2026-05-18T02:14:57.374950+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HPJ4VIKPFGL","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HPJ4VIKPFGL3VIM","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HPJ4VIK","created_at":"2026-05-18T12:25:58.837520+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/5HPJ4VIKPFGL3VIM2WC4J5HZCX","json":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX.json","graph_json":"https://pith.science/api/pith-number/5HPJ4VIKPFGL3VIM2WC4J5HZCX/graph.json","events_json":"https://pith.science/api/pith-number/5HPJ4VIKPFGL3VIM2WC4J5HZCX/events.json","paper":"https://pith.science/paper/5HPJ4VIK"},"agent_actions":{"view_html":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX","download_json":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX.json","view_paper":"https://pith.science/paper/5HPJ4VIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.2151&json=true","fetch_graph":"https://pith.science/api/pith-number/5HPJ4VIKPFGL3VIM2WC4J5HZCX/graph.json","fetch_events":"https://pith.science/api/pith-number/5HPJ4VIKPFGL3VIM2WC4J5HZCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX/action/storage_attestation","attest_author":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX/action/author_attestation","sign_citation":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX/action/citation_signature","submit_replication":"https://pith.science/pith/5HPJ4VIKPFGL3VIM2WC4J5HZCX/action/replication_record"}},"created_at":"2026-05-18T02:14:57.374950+00:00","updated_at":"2026-05-18T02:14:57.374950+00:00"}