{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WGXX3H5PFSHJ4MAFGXMERDI4SG","short_pith_number":"pith:WGXX3H5P","schema_version":"1.0","canonical_sha256":"b1af7d9faf2c8e9e300535d8488d1c919a96f137980786cd6a0de2eb8bc9932c","source":{"kind":"arxiv","id":"1801.03673","version":2},"attestation_state":"computed","paper":{"title":"Ecologically Sustainable Partitioning of a Metapopulations Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.DS","authors_text":"Dinesh Kumar, Jatin Gupta, Soumyendu Raha","submitted_at":"2018-01-11T09:01:43Z","abstract_excerpt":"A stable population network is hard to interrupt without any ecological consequences. A communication blockage between patches may destabilize the populations in the ecological network. This work deals with the construction of a safe cut passing through metapopulations habitat such that populations remain stable. We combine the dynamical system stability analysis with graph partitioning algorithms in our approach to the problem. It finds such a safe construction, when one exists, provided the algebraic connectivity of the graph components is stronger than all the spatially local instabilities "},"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":"1801.03673","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-01-11T09:01:43Z","cross_cats_sorted":["q-bio.PE"],"title_canon_sha256":"673e39a2ebdf4d01ce0dc315a7ab7a56bad7f24f0b0b975f4acc4eecefd87c4d","abstract_canon_sha256":"5f21f6004e69d1e3e42a5c813ec7f288cd1f30f91adf02a2c9c0ff93b31b7b42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:41.229076Z","signature_b64":"IyeqMx6wUBb5a3guSIB3jnSORDGiM/kolrlEg57rfxWscuAnOCouexhQNtLZ6rHvnRjNp2t9MSkB3R2caJ3iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1af7d9faf2c8e9e300535d8488d1c919a96f137980786cd6a0de2eb8bc9932c","last_reissued_at":"2026-05-18T00:17:41.228415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:41.228415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ecologically Sustainable Partitioning of a Metapopulations Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.PE"],"primary_cat":"math.DS","authors_text":"Dinesh Kumar, Jatin Gupta, Soumyendu Raha","submitted_at":"2018-01-11T09:01:43Z","abstract_excerpt":"A stable population network is hard to interrupt without any ecological consequences. A communication blockage between patches may destabilize the populations in the ecological network. This work deals with the construction of a safe cut passing through metapopulations habitat such that populations remain stable. We combine the dynamical system stability analysis with graph partitioning algorithms in our approach to the problem. It finds such a safe construction, when one exists, provided the algebraic connectivity of the graph components is stronger than all the spatially local instabilities "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03673","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":"1801.03673","created_at":"2026-05-18T00:17:41.228518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03673v2","created_at":"2026-05-18T00:17:41.228518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03673","created_at":"2026-05-18T00:17:41.228518+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGXX3H5PFSHJ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGXX3H5PFSHJ4MAF","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGXX3H5P","created_at":"2026-05-18T12:32:59.047623+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/WGXX3H5PFSHJ4MAFGXMERDI4SG","json":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG.json","graph_json":"https://pith.science/api/pith-number/WGXX3H5PFSHJ4MAFGXMERDI4SG/graph.json","events_json":"https://pith.science/api/pith-number/WGXX3H5PFSHJ4MAFGXMERDI4SG/events.json","paper":"https://pith.science/paper/WGXX3H5P"},"agent_actions":{"view_html":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG","download_json":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG.json","view_paper":"https://pith.science/paper/WGXX3H5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03673&json=true","fetch_graph":"https://pith.science/api/pith-number/WGXX3H5PFSHJ4MAFGXMERDI4SG/graph.json","fetch_events":"https://pith.science/api/pith-number/WGXX3H5PFSHJ4MAFGXMERDI4SG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG/action/storage_attestation","attest_author":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG/action/author_attestation","sign_citation":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG/action/citation_signature","submit_replication":"https://pith.science/pith/WGXX3H5PFSHJ4MAFGXMERDI4SG/action/replication_record"}},"created_at":"2026-05-18T00:17:41.228518+00:00","updated_at":"2026-05-18T00:17:41.228518+00:00"}