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

25
citations
affno abstractunlabeled
Homomorphisms of conjunctive normal forms
Stefan Szeider
2003· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Biconvex graphs: ordering and algorithms
Nesrine Abbas, Lorna Stewart
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
23
citations
afffundno abstractunlabeled
Linear codes for high payload steganography
Mahdad Khatirinejad, Petr Lisoněk
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Parallel cleaning of a network with brushes
Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
afffundno abstractunlabeled
Fixed topology alignment with recombination
Lusheng Wang, Bin Ma, Ming Li
2000· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Embeddings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si88.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected graphs of pathwidth <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si89.gif" overflow="scroll"><mml:mi>k</mml:mi></mml:math>
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
On probe permutation graphs
David B. Chandler, Maw‐Shang Chang, Ton Kloks, Jiping Liu, Sheng‐Lung Peng
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
afffundno abstractunlabeled
The colourful feasibility problem
Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky
2008· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
Fun-Sort—or the chaos of unordered binary search
Thérèse Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James King +1 more
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
afffundno abstractunlabeled
The average reliability of a graph
Jason I. Brown, Danielle Cox, Richard Ehrenborg
2014· article· en· Discrete Applied Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Finding clubs in graph classes
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey
2014· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Affine equivalence in the AES round function
Amr Youssef, S.E. Tavares
2005· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
affno abstractunlabeled
A note on tolerance graph recognition
Ryan Hayward, Ron Shamir
2004· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
afffundno abstractunlabeled
Vertex covers and eternal dominating sets
William F. Klostermeyer, Christina M. Mynhardt
2011· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations

How this was built: Screen · Findings · About