Toward Best Practices for Developing Regional Connectivity Maps
Bibliographic record
Abstract
To conserve ecological connectivity (the ability to support animal movement, gene flow, range shifts, and other ecological and evolutionary processes that require large areas), conservation professionals need coarse-grained maps to serve as decision-support tools or vision statements and fine-grained maps to prescribe site-specific interventions. To date, research has focused primarily on fine-grained maps (linkage designs) covering small areas. In contrast, we devised 7 steps to coarsely map dozens to hundreds of linkages over a large area, such as a nation, province, or ecoregion. We provide recommendations on how to perform each step on the basis of our experiences with 6 projects: California Missing Linkages (2001), Arizona Wildlife Linkage Assessment (2006), California Essential Habitat Connectivity (2010), Two Countries, One Forest (northeastern United States and southeastern Canada) (2010), Washington State Connected Landscapes (2010), and the Bhutan Biological Corridor Complex (2010). The 2 most difficult steps are mapping natural landscape blocks (areas whose conservation value derives from the species and ecological processes within them) and determining which pairs of blocks can feasibly be connected in a way that promotes conservation. Decision rules for mapping natural landscape blocks and determining which pairs of blocks to connect must reflect not only technical criteria, but also the values and priorities of stakeholders. We recommend blocks be mapped on the basis of a combination of naturalness, protection status, linear barriers, and habitat quality for selected species. We describe manual and automated procedures to identify currently functioning or restorable linkages. Once pairs of blocks have been identified, linkage polygons can be mapped by least-cost modeling, other approaches from graph theory, or individual-based movement models. The approaches we outline make assumptions explicit, have outputs that can be improved as underlying data are improved, and help implementers focus strictly on ecological connectivity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.074 | 0.221 |
| Meta-epidemiology (narrow) | 0.005 | 0.005 |
| Meta-epidemiology (broad) | 0.002 | 0.004 |
| Bibliometrics | 0.025 | 0.023 |
| Science and technology studies | 0.004 | 0.003 |
| Scholarly communication | 0.019 | 0.020 |
| Open science | 0.016 | 0.010 |
| Research integrity | 0.005 | 0.007 |
| Insufficient payload (model declined to judge) | 0.020 | 0.015 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".