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
Topic
Advanced Graph Theory Research
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.

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

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

affno abstractunlabeled
Directed Path Partition Problem on Directed Acyclic Graphs
Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir
2024· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundno abstractunlabeled
Excluded minors for the Klein bottle II. Cascades
Bojan Mohar, Petr Škoda
2024· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Mapping planar graphs into the Coxeter graph
Ararat Harutyunyan, Reza Naserasr, Mirko Petruševski, Riste Škrekovski, Qiang Sun
2015· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Three-Dimensional Graph Products with Unbounded Stack-Number
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michał T. Seweryn, David R. Wood
2023· article· en· Discrete & Computational Geometry· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
Binary matroids with no 4-spike minors
Sean McGuinness
2014· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affno abstractunlabeled
Beyond PCSP(1-in-3,NAE)
Alex Brandts, Stanislav Živný
2022· preprint· en· Information and Computation· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Clique‐width: Harnessing the power of atoms
Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná, Daniël Paulusma, Paweł Rzążewski
2023· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundunlabeled
A new graph parameter to measure linearity
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2023· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Reconfiguring Spanning and Induced Subgraphs
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya +2 more
2018· preprint· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+scholarly_communication+open_scienceconsensus · none
2
citations
affunlabeled
Constructing Incremental Sequences in Graphs
Ralf Klasing, Christian Laforest, Joseph G. Peters, Nicolas Thibault
2006· preprint· en· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
The phase transition in random regular exact cover
Cristopher Moore
2016· preprint· en· Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Structure of 4-connected claw-free graphs not containing a subdivision of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>
Roi Krakovski, Diane Stephens
2011· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+research_integrity+insufficient_payloadconsensus · none
2
citations
affno abstractunlabeled
The<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si6.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-extended graft construction
Gary MacGillivray, Jacobus Swarts
2011· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · sts+insufficient_payload
2
citations
venueno affunlabeled
Spanning Eulerian Subgraphs in claw-free graphs
Zhi‐Hong Chen, Hong‐Jian Lai, Weiqi Luo, Yehomg Shao
2006· article· en· Journal of Combinatorial Mathematics and Combinatorial Computing· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
afffundunlabeled
Tree independence number II. Three-path-configurations
Maria Chudnovsky, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl
2025· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
Partial List Colouring of Certain Graphs
Jeannette Janssen, Rogers Mathew, Deepak Rajendraprasad
2015· article· en· The Electronic Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Coloring a set of touching strings
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
2009· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
fundno affunlabeled
Extremal functions for sparse minors
Kevin Hendrey, Sergey Norin, David R. Wood
2022· article· en· Advances in Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affunlabeled
QCSP on Reflexive Tournaments
Benoît Larose, Barnaby Martin, Petar Marković, Daniël Paulusma, Siani Smith, Stanislav Živný
2022· article· en· ACM Transactions on Computational Logic· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
venueno affno abstractunlabeled
Covering finite groups by subset products.
H. V. Chen, A. Y. M. Chin
2017· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
← previousnext →

How this was built: Screen · Findings · About