MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Year range
→
Sort
Language
Type
Field
Venue
Theory and Practice of Logic Programming
Topic
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

35 results · 1 filter active ·
Results by year
20012024
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
35 works in the cohort · of 4,299,418page 1 of 1

Labels cover 0 of 35 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 35 of 35 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

fundno affunlabeled
Abstract gringo
2015· article· en· Theory and Practice of Logic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
69
citations
afffundunlabeled
Fifty Years of Prolog and Beyond
2022· article· en· Theory and Practice of Logic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
36
citations
affunlabeled
Coding guidelines for Prolog
2011· article· en· Theory and Practice of Logic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundunlabeled
On Lower Bounding Minimal Model Count
2024· article· en· Theory and Practice of Logic Programming· Computer Science
distilled prediction:candidate · noneconsensus · none
1
citations
affunlabeled
TLP volume 10 issue 4-6 Cover and Front matter
2010· article· en· Theory and Practice of Logic Programming· Economics, Econometrics and Finance
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
TLP volume 10 issue 2 Cover and Front matter
2010· article· en· Theory and Practice of Logic Programming· Economics, Econometrics and Finance
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
TLP volume 10 issue 1 Cover and Front matter
2009· article· en· Theory and Practice of Logic Programming· Economics, Econometrics and Finance
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations

How this was built: Screen · Findings · About