MétaCan
Menu
Back to cohort
Record W6929809364 · doi:10.5061/dryad.69p8cz956

Data for: Loss of the world's smallest forests

2022· dataset· en· W6929809364 on OpenAlexafffund

Bibliographic record

VenueOpen MIND · 2022
Typedataset
Languageen
FieldComputer Science
TopicCryptographic Implementations and Security
Canadian institutionsCarleton University
FundersMitacs
KeywordsBiodiversityDeforestation (computer science)HabitatGlobal biodiversityHabitat destructionIntact forest landscapeMeasurement of biodiversity

Abstract

fetched live from OpenAlex

A large number of small forests typically harbor higher biodiversity than a small number of large forests totaling the same area, suggesting that small patches are disproportionately valuable for biodiversity conservation. However, policies often favor protection of large forest patches. Here we demonstrate a global trend of higher deforestation in small than large forest patches: the likelihood that a randomly-selected forest plot disappeared between 1992 and 2020 increased with decreasing size of the forest patch containing that plot. Our results imply a disproportionate impact of forest loss on biodiversity relative to the total forest area removed. Achieving recent commitments of the post-2020 Global Biodiversity Framework will require revision of current policies and increased societal awareness of the importance of small habitat patches for biodiversity protection.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Dataset · Consensus signal: Dataset
Teacher disagreement score0.052
Threshold uncertainty score0.173

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.008
Meta-epidemiology (narrow)0.0020.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.004
Science and technology studies0.0010.000
Scholarly communication0.0020.001
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0520.062

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.

Opus teacher head0.116
GPT teacher head0.388
Teacher spread0.272 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreDataset

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".

Quick stats

Citations0
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueOpen MINDSame topicCryptographic Implementations and SecurityFrench-language works237,207