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
Topic
Computability, Logic, AI Algorithms
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.

805 results · 1 filter active ·
Results by year
20002025
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.
805 works in the cohort · of 4,299,418page 6 of 17

Labels cover 0 of 805 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 805 of 805 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affunlabeled
Black-White Pebbling is PSPACE-Complete
2007· article· en· Electronic colloquium on computational complexity· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
3
citations
affno abstractunlabeled
Indistinguishability
2014· book-chapter· en· Synthesis lectures on distributed computing theory· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · metaepi_narrow
3
citations
affunlabeled
Beyond the building blocks model
2011· article· en· Behavioral and Brain Sciences· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Acquired knowledge as a stochastic process
2017· article· en· DOAJ (DOAJ: Directory of Open Access Journals)· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_science+insufficient_payloadconsensus · open_science
3
citations
affno abstractunlabeled
Shaw and Artificial Intelligence
2024· book-chapter· en· Bernard Shaw and his contemporaries· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
affno abstractunlabeled
Generic Complexity of Undecidable Problems
2007· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+open_scienceconsensus · none
3
citations
affno abstractunlabeled
The inducibility of oriented stars
2024· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
fundno affno abstractunlabeled
Algorithms and Discrete Applied Mathematics
2023· book· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communicationconsensus · none
3
citations
fundno affunlabeled
An Algorithmic Approach to Emergence
2022· article· en· arXiv (Cornell University)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
fundno affunlabeled
Ten Problems in Experimental Mathematics
2004· article· en· University of North Texas Digital Library (University of North Texas)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Finite Mathematics
2000· book-chapter· en· MAA spectrum· Computer Science
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · insufficient_payload
2
citations
affunlabeled
On the Complexity of Zero Gap MIP*
2020· article· en· DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affunlabeled
On $L^p$-improving measures
2016· article· es· Revista Matemática Iberoamericana· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Mastering Algorithms with C
2000· article· en· Linux journal· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Structures of Some Strong Reducibilities
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
2
citations
affno abstractunlabeled
Fundamentals of Discrete Math for Computer Science
2012· book· en· Undergraduate topics in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_scienceconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About