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

affno abstractunlabeled
On bags and bugs
Pierre Hansen, Dragan Stevanović
2007· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
afffundno abstractunlabeled
How many double squares can a string contain?
Antoine Deza, František Franěk, Adrien Thierry
2014· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Balanced vertex-orderings of graphs
Thérèse Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood
2005· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affno abstractunlabeled
Polynomial-time recognition of clique-width ≤3 graphs
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce Reed, Udi Rotics
2011· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
afffundno abstractunlabeled
Quantum fractional revival on graphs
Ada Chan, Gabriel Coutinho, Christino Tamon, Luc Vinet, Hanmeng Zhan
2019· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Limited packings in graphs
Robert Gallant, Georg Günther, Bert L. Hartnell, Douglas F. Rall
2009· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
38
citations
afffundno abstractunlabeled
Safe set problem on graphs
Shinya Fujita, Gary MacGillivray, Tadashi Sakuma
2016· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
On the tiling by translation problem
Srečko Brlek, Xavier Provençal, Jean-Marc Fédou
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
A note on reconfiguring tree linkages: trees can lock
Thérèse Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O’Rourke +4 more
2002· article· en· Discrete Applied Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Efficient algorithms on distributive lattices
Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner
2001· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Polarity of chordal graphs
Tınaz Ekim, Pavol Hell, Juraj Stacho, D. de Werra
2008· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Planar graph bipartization in linear time
Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta
2007· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Locating a minisum circle in the plane
Jack Brimberg, Henrik Juel, Anita Schöbel
2008· article· en· Discrete Applied Mathematics· Business, Management and Accounting
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
On the complexity of constructing Golomb Rulers
Christophe Meyer, Periklis A. Papakonstantinou
2008· article· en· Discrete Applied Mathematics· Engineering
machine prediction:candidate · noneconsensus · none
29
citations
afffundno abstractunlabeled
The simultaneous metric dimension of graph families
Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan A. Rodríguez‐Velázquez
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
afffundno abstractunlabeled
Boundary uniqueness of fusenes
Xiaofeng Guo, Pierre Hansen, Maolin Zheng
2002· article· en· Discrete Applied Mathematics· Mathematics
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Bounds on the average connectivity of a graph
Peter Dankelmann, Ortrud R. Oellermann
2003· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations

How this was built: Screen · Findings · About