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
Author
Year range
→
Sort
Language
Type
Field
Venue
Combinatorics Probability Computing
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.

106 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.
106 works in the cohort · of 4,299,418page 2 of 3

Labels cover 0 of 106 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 106 of 106 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affunlabeled
Reconstructing Odd Necklaces
Luke Pebody
2007· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affunlabeled
On Even-Degree Subgraphs of Linear Hypergraphs
Domingos Dellamonica, Penny Haxell, Tomasz Łuczak, Dhruv Mubayi, Brendan Nagle, Yury Person +3 more
2012· article· en· Combinatorics Probability Computing· Engineering
machine prediction:candidate · noneconsensus · none
7
citations
affunlabeled
The Random Connection Model on the Torus
Luc Devroye, Nicolás Fraiman
2014· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Estimating parameters associated with monotone properties
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni
2020· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
Longest Path Distance in Random Circuits
Nicolas Broutin, Omar Fawzi
2012· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
6
citations
affunlabeled
‘Forcing a sparse minor’ — CORRIGENDUM
Bruce Reed, David R. Wood
2015· erratum· en· Combinatorics Probability Computing· Economics, Econometrics and Finance
machine prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Frank Ramsey
Béla Bollobás, Andrew Thomason
2003· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Measurable Events Indexed by Trees
Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros
2012· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Tight Hamilton cycles with high discrepancy
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia
2025· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Twin-width of sparse random graphs
Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte
2024· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
The Excluded Tree Minor Theorem Revisited
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
2023· article· en· Combinatorics Probability Computing· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Pegging Graphs Yields a Small Diameter
Stefanie Gerke, Angelika Steger, Nicholas Wormald
2010· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
fundno affunlabeled
The full rank condition for sparse random matrices
Amin Coja‐Oghlan, Pu Gao, Max Hahn‐Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien
2024· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
1
citations
affunlabeled
A BK inequality for random matchings
András Mészáros
2022· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
The (7, 4)-Conjecture in Finite Groups
József Solymosi
2015· preprint· en· Combinatorics Probability Computing· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affunlabeled
CPC volume 24 issue 1 Cover and Back matter
A Edam, Yan Jin
2015· paratext· en· Combinatorics Probability Computing· Economics, Econometrics and Finance
machine prediction:candidate · insufficient_payloadconsensus · insufficient_payload
0
citations
affunlabeled
Common pairs of graphs
Natalie Behague, Natasha Morrison, Jonathan A. Noel
2025· article· en· Combinatorics Probability Computing· Mathematics
machine prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About