{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:S5F2KUNSVVKCDZK553CNSVD7BF","short_pith_number":"pith:S5F2KUNS","schema_version":"1.0","canonical_sha256":"974ba551b2ad5421e55deec4d9547f09473e28d4ab5d416a2f09ca5213820391","source":{"kind":"arxiv","id":"1304.3218","version":1},"attestation_state":"computed","paper":{"title":"Detecting modules in quantitative bipartite networks: the QuaBiMo algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"q-bio.QM","authors_text":"Carsten F. Dormann, Rouven Strauss","submitted_at":"2013-04-11T07:04:20Z","abstract_excerpt":"Ecological networks are often composed of different sub-communities (often referred to as modules). Identifying such modules has the potential to develop a better understanding of the assembly of ecological communities and to investigate functional overlap or specialisation. The most informative form of networks are quantitative or weighted networks. Here we introduce an algorithm to identify modules in quantitative bipartite (or two-mode) networks. It is based on the hierarchical random graphs concept of Clauset et al. (2008 Nature 453: 98-101) and is extended to include quantitative informat"},"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":"1304.3218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2013-04-11T07:04:20Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"370652cea0815e8fd5c9e8d6a55f3eca00d7ea1446fd19380899612169beef7a","abstract_canon_sha256":"f7626ff36cbf94c76126d0df3bedbfbc3be11344cce72636f5a3c785fa4562ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:32.729142Z","signature_b64":"87aMjO+zTj/Y3zEzPEcyc5vFiVFELMRN7TnSILr8WyObY8fk3+xob9Ze2ZdxSg+1jNq7a0F0JjsA7tOurDFbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974ba551b2ad5421e55deec4d9547f09473e28d4ab5d416a2f09ca5213820391","last_reissued_at":"2026-05-18T02:56:32.728519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:32.728519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting modules in quantitative bipartite networks: the QuaBiMo algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"q-bio.QM","authors_text":"Carsten F. Dormann, Rouven Strauss","submitted_at":"2013-04-11T07:04:20Z","abstract_excerpt":"Ecological networks are often composed of different sub-communities (often referred to as modules). Identifying such modules has the potential to develop a better understanding of the assembly of ecological communities and to investigate functional overlap or specialisation. The most informative form of networks are quantitative or weighted networks. Here we introduce an algorithm to identify modules in quantitative bipartite (or two-mode) networks. It is based on the hierarchical random graphs concept of Clauset et al. (2008 Nature 453: 98-101) and is extended to include quantitative informat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3218","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":"1304.3218","created_at":"2026-05-18T02:56:32.728638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.3218v1","created_at":"2026-05-18T02:56:32.728638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3218","created_at":"2026-05-18T02:56:32.728638+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5F2KUNSVVKC","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5F2KUNSVVKCDZK5","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5F2KUNS","created_at":"2026-05-18T12:27:59.945178+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/S5F2KUNSVVKCDZK553CNSVD7BF","json":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF.json","graph_json":"https://pith.science/api/pith-number/S5F2KUNSVVKCDZK553CNSVD7BF/graph.json","events_json":"https://pith.science/api/pith-number/S5F2KUNSVVKCDZK553CNSVD7BF/events.json","paper":"https://pith.science/paper/S5F2KUNS"},"agent_actions":{"view_html":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF","download_json":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF.json","view_paper":"https://pith.science/paper/S5F2KUNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.3218&json=true","fetch_graph":"https://pith.science/api/pith-number/S5F2KUNSVVKCDZK553CNSVD7BF/graph.json","fetch_events":"https://pith.science/api/pith-number/S5F2KUNSVVKCDZK553CNSVD7BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF/action/storage_attestation","attest_author":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF/action/author_attestation","sign_citation":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF/action/citation_signature","submit_replication":"https://pith.science/pith/S5F2KUNSVVKCDZK553CNSVD7BF/action/replication_record"}},"created_at":"2026-05-18T02:56:32.728638+00:00","updated_at":"2026-05-18T02:56:32.728638+00:00"}