MétaCan
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.

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 8 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 teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Elementary proof that <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msubsup><mml:mrow><mml:mi mathvariant="double-struck">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msubsup></mml:math> is a DCI-group
Joy Morris
2015· article· lv· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
6
citations
afffundno abstractunlabeled
Geometric thickness in a grid
David R. Wood
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Exponents of vertex-transitive digraphs
Jian Shen, David A. Gregory
2000· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
A result in asymmetric Euclidean Ramsey theory
Andrii Arman, Sergei Tsaturian
2017· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
Splitting systems and separating systems
Alan C. H. Ling, P.C. Li, Glynda Rees
2004· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Hamming distance for conjugates
Jeffrey Shallit
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Embedding trees into graphs of large girth
Penny Haxell, Tomasz Łuczak
2000· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
aboutno affno abstractunlabeled
Quarter-regular biembeddings of Latin squares
Diane Donovan, Aleš Drápal, M. J. Grannell, Terry S. Griggs, James Lefevre
2009· article· es· Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
5
citations
affno abstractunlabeled
The upper domination Ramsey number u(3,3,3)
Michael A. Henning, Ortrud R. Oellermann
2002· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
afffundno abstractunlabeled
On Hilbert bases of cuts
Luis Goddyn, Tony Huynh, Tanmay Deshpande
2015· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Hamiltonian cycles in <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>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-circulant digraphs
Dave Witte Morris, Joy Morris, Kerri Webb
2009· article· lv· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
5
citations
afffundno abstractunlabeled
Colouring even cycle systems
Andrea C. Burgess, David A. Pike
2007· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Mobility of vertex-transitive graphs
Primož Potočnik, Mateja Šajna, Gabriel Verret
2006· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Constructions and bounds for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si50.gif" overflow="scroll"><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>-splitting systems
Dong Deng, Douglas R. Stinson, P. C. Li, Glynda Rees, Ruizhong Wei
2006· article· lv· Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow
4
citations
afffundno abstractunlabeled
Nonincident points and blocks in designs
Douglas R. Stinson
2012· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Open irredundance and maximum degree in graphs
E. J. Cockayne, Odile Favaron, Stephen Finbow, Christina M. Mynhardt
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
A permutation group determined by an ordered set
Anders Claesson, Chris Godsil, David G. Wagner
2003· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Matching divisible designs with block size four
Peter J. Dukes, Tao Feng, Alan C. H. Ling
2015· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Obstructions to partitions of chordal graphs
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
2012· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Edge-disjoint spanners in tori
Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Zero-sum flows for triple systems
Saieed Akbari, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn
2016· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
4
citations

How this was built: Screen · Findings · About