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
Discrete Mathematics
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.

687 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.
687 works in the cohort · of 4,299,418page 9 of 14

Labels cover 0 of 687 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 687 of 687 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.

afffundno abstractunlabeled
Existence of 2 SOLS and 2 ISOLS
R. Julian R. Abel, F.E. Bennett
2011· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On a cycle partition problem
Morten H. Nielsen
2008· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Mixing colourings in 2K2-free graphs
Carl Feghali, Owen Merkel
2022· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Brian Alspach and his work
Joy Morris, Mateja Šajna
2005· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Factor d-domatic colorings of graphs
Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Extremal words in morphic subshifts
James D. Currie, Narad Rampersad, Kalle Saari, Luca Q. Zamboni
2014· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Ovals and hyperovals in nets
Charles J. Colbourn, David A. Drake, Wendy Myrvold
2005· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On periodically-cyclic Gale 4-polytopes
Tibor Bisztriczky, Károly J. Böröczky
2001· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Spanning cubic graph designs
Peter D. Adams, Hayri Ardal, Ján Maňuch, Vũ Đình Hòa, Moshe Rosenfeld, Ladislav Stacho
2008· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On i−-ER-critical graphs
E. J. Cockayne, Odile Favaron, Christina M. Mynhardt
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
A class of graphs with depression three
Christina M. Mynhardt, Mark Schurch
2012· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Cops and Robbers ordinals of cop-win trees
Anthony Bonato, Przemysław Gordinowicz, Geňa Hahn
2017· article· en· Discrete Mathematics· Decision Sciences
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On the chromatic index of path decompositions
Peter Danziger, Eric Mendelsohn, Gaetano Quattrocchi
2004· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Power Hadamard matrices
R. Craigen, Roger Woodford
2007· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
4
citations
fundno affno abstractunlabeled
The crossing number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mspace width="0.16667em"/><mml:mi>□</mml:mi><mml:mspace width="0.16667em"/><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>
Marián Klešč, Daniela Kravecová
2011· article· lv· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Cyclic inequivalence of cascaded GMW-sequences
Solomon W. Golomb, Guang Gong, Zong Duo Dai
2000· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Chromatic numbers and products
Dwight Duffus, N. Sauer
2005· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Point determining digraphs, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-matrix partitions, and dualities in full homomorphisms
Pavol Hell, César Hernández‐Cruz
2014· article· lv· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Coarse geometry of the cops and robber game
Jonathan Lee, Eduardo Martínez-Pedroza, Juan Felipe Rodríguez-Quinche
2023· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
The well-covered dimension of random graphs
Jason I. Brown, Richard J. Nowakowski
2006· article· en· Discrete Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Changing upper irredundance by edge addition
E. J. Cockayne, Odile Favaron, Wayne Goddard, P.J.P. Grobler, Christina M. Mynhardt
2003· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Friendship 3-hypergraphs
Ping Li, Glynda Rees, Stela H. Seo, N.M. Singhi
2012· article· en· Discrete Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Retractions onto series-parallel posets
Víctor Dalmau, Andrei Krokhin, Benoît Larose
2007· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
← previousnext →

How this was built: Screen · Findings · About