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

520 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.
520 works in the cohort · of 4,299,418page 5 of 11

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

afffundno abstractunlabeled
Some bounds on global alliances in trees
Ararat Harutyunyan
2011· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Contraction obstructions for connected graph searching
Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
The iterated local transitivity model for hypergraphs
Natalie Behague, Anthony Bonato, Melissa A. Huggan, Rehan Malik, Trent G. Marbach
2023· article· en· Discrete Applied Mathematics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
Analysing local algorithms in location-aware quasi-unit-disk graphs
Marja Hassinen, Joel Kaasinen, Evangelos Kranakis, Valentin Polishchuk, Jukka Suomela, Andreas Wiese
2011· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
10
citations
afffundno abstractunlabeled
About the minimum mean cycle-canceling algorithm
Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On simplicial and co-simplicial vertices in graphs
Chı́nh T. Hoàng, Stefan Hougardy, Frédéric Maffray, N. V. R. Mahadev
2003· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On the orthogonal designs of order 24
W. H. Holzmann, Hadi Kharaghani
2000· article· en· Discrete Applied Mathematics· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
9
citations
afffundno abstractunlabeled
Brushing without capacity restrictions
Darryn Bryant, Nevena Francetić, Przemysław Gordinowicz, David A. Pike, Paweł Prałat
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
New classes of facets of the cut polytope and tightness of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si17.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">mm</mml:mi><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:math> Bell inequalities
David Avis, Tsuyoshi Ito
2007· article· lv· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+research_integrity+insufficient_payloadconsensus · none
9
citations
afffundno abstractunlabeled
Three-fast-searchable graphs
Dariusz Dereniowski, Öznur Yaşar Diner, Danny Dyer
2013· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affno abstractunlabeled
On the number of generators for transeunt triangles
Jon T. Butler, Gerhard W. Dueck, Svetlana Yanushkevich, Vlad P. Shmerko
2001· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
On uniform k-partition problems
Paolo Dell’Olmo, Pierre Hansen, Stefano Pallottino, Giovanni Storchi
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
8
citations
affno abstractunlabeled
On polyhedra induced by point sets in space
Pankaj K. Agarwal, Ferrán Hurtado, Godfried T. Toussaint, Joan Trias
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
fundno affno abstractunlabeled
Graphs with integer matching polynomial zeros
Saieed Akbari, Péter Csíkvári, Ali Selk Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi
2017· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
8
citations
affno abstractunlabeled
Vertex-critical <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e185" altimg="si23.svg"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, co-gem)-free graphs
Tala Abuadas, Ben Cameron, Chı́nh T. Hoàng, Joe Sawada
2023· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaresearch+metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+open_science+research_integrity+insufficient_payload
8
citations
affno abstractunlabeled
Stable skew partition problem
Simone Dantas, Celina M.H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
On the complexity of unfrozen problems
Adam Beacham, Joseph Culberson
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
End-vertices of LBFS of (AT-free) bigraphs
Jan Gorzny, Jing Huang
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
afffundno abstractunlabeled
On well-covered triangulations: Part III
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2010· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
A new construction of broadcast graphs
Hovhannes A. Harutyunyan, Zhiyuan Li
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Matrix partitions of split graphs
Tomás Feder, Pavol Hell, Oren Shklarsky
2013· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
The Capacitated Orienteering Problem
Adrian Bock, Laura Sanità
2014· article· en· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
7
citations
← previousnext →

How this was built: Screen · Findings · About