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

afffundno abstractunlabeled
On 2-limited packings of complete grid graphs
Nancy E. Clarke, Robert Gallant
2016· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
The k-fractal of a simplicial complex
Jason I. Brown, C.A. Hickman, Richard J. Nowakowski
2004· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Edge-disjoint spanners in Cartesian products of graphs
Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2005· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Graph-like spaces: An introduction
R. Bruce Richter
2009· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Extra two-fold Steiner pentagon systems
Charles C. Lindner, Alexander Rosa
2011· article· en· Discrete Mathematics· Engineering
distilled prediction:candidate · noneconsensus · 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
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
Counting independent sets in Riordan graphs
Gi‐Sang Cheon, Ji-Hwan Jung, Bumtle Kang, Hana Kim, Suh-Ryung Kim, Sergey Kitaev +1 more
2020· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
2
citations
affno abstractunlabeled
Corrigendum to “<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:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-total labelling of graphs” [Discrete Math. 308 (2008) 496–513]
Frédéric Havet, Min‐Li Yu
2010· erratum· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
2
citations
afffundno abstractunlabeled
Existence of HSOLSSOMs of type<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>
R. Julian R. Abel, F.E. Bennett, Hantao Zhang
2007· article· lv· Discrete Mathematics· Engineering
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
2
citations
affno abstractunlabeled
The ultimate categorical matching in a graph
Michael Albert, Derek Holton, Richard J. Nowakowski
2001· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Entropy of symmetric graphs
Seyed Saeed Changiz Rezaei, Chris Godsil
2015· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Rainbow Hamilton cycles and lopsidependency
Nicholas C. Harvey, Christopher Liaw
2017· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
How to play Reverse Hex
Ryan Hayward, Bjarne Toft, Philip Henderson
2011· article· en· Discrete Mathematics· Psychology
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
2
citations
affno abstractunlabeled
Vertex arboricity of integer distance graph <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>
Liancui Zuo, Qinglin Yu, Jianliang Wu
2008· article· lv· Discrete Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
2
citations
affno abstractunlabeled
Broadcasting on paths and cycles
Reaz Huq, Paweł Prałat
2022· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Join colourings of chordal graphs
Pavol Hell, Pei-Lan Yen
2015· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
The quasi order of graphs on an ordinal
Péter Komjáth, Jean A. Larson, Norbert Sauer
2011· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Elimination schemes and lattices
Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2014· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Bicircular matroids are 3-colorable
Luis Goddyn, Winfried Hochstättler, Nancy Ann Neudauer
2016· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Serial exchanges in matroids
Sean McGuinness
2021· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
A note on purely imaginary independence roots
Jason I. Brown, Ben Cameron
2020· article· en· Discrete Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrow+insufficient_payloadconsensus · none
2
citations
afffundno abstractunlabeled
More on almost self-complementary graphs
Nevena Francetić, Mateja Šajna
2008· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
2
citations

How this was built: Screen · Findings · About