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

afffundunlabeled
Isometric Hamming embeddings of weighted graphs
Joseph Berleant, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe
2023· preprint· en· Discrete Applied Mathematics· Social Sciences
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundno abstractunlabeled
Factorization and pseudofactorization of weighted graphs
Kristin Sheridan, Joseph Berleant, Mark Bathe, Anne Condon, Virginia Vassilevska Williams
2023· preprint· en· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
afffundunlabeled
An introduction to the deduction number
Andrea C. Burgess, Danny Dyer, M. Shahrabi Farahani
2025· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Trail Trap: A variant of Partizan Edge Geography
Calum Buchanan, MacKenzie Carr, Alexander Clifton, Stephen G. Hartke, Vesna Iršič Chenoweth, Nicholas Sieger +1 more
2025· article· en· Discrete Applied Mathematics· Social Sciences
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
The interval ordering problem
Christoph Dürr, Maurice Queyranne, Frits Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger
2012· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Ray shooting from convex ranges
Evangelos Kranakis, Danny Kriz̧anc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
2001· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Foreword
Luca Maria Gambardella, Alain Hertz, Frédéric Maffray, Marino Widmer
2009· article· en· Discrete Applied Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
A closed-form solution for the optimal release times for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>F</mml:mi><mml:mn>2</mml:mn><mml:mo>|</mml:mo></mml:math> deteriorating jobs <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mo>|</mml:mo><mml:mo>∑</mml:mo><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math> problem
Édouard Wagneur, T.C.E. Cheng, C.T. Ng
2011· article· lv· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+open_science+research_integrity+insufficient_payloadconsensus · metaepi_narrow+sts+research_integrity+insufficient_payload
0
citations
afffundno abstractunlabeled
Reconstructing trees from digitally convex sets
Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Bruce A. Reed, Siang Wun Song, Jayme L. Szwarcfiter
2003· article· en· Discrete Applied Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundno abstractunlabeled
Infection in hypergraphs
Ryan Bergen, Shaun Fallat, Adam Gorr, Ferdinand Ihringer, Karen Meagher, Alison Purdy +2 more
2017· preprint· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
fundno affno abstractunlabeled
Automorphisms and blocking in simple games
Francesc Carreras
2006· article· en· Discrete Applied Mathematics· Decision Sciences
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface
Roger Labahn, Arthur L. Liestman, Erich Prisner
2003· article· en· Discrete Applied Mathematics
distilled prediction:candidate · insufficient_payloadconsensus · none
0
citations
afffundno abstractunlabeled
Rectilinear path problems in restricted memory setup
Binay Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Optimal odd gossiping
Guillaume Fertin, Joseph G. Peters
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Remembering Leo Khachiyan
Vašek Chvátal
2007· article· en· Discrete Applied Mathematics· Social Sciences
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Almost all regular graphs are normal
Seyed Saeed Changiz Rezaei, Seyyed Aliasghar Hosseini, Bojan Mohar
2017· preprint· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Sequence saturation
Anand, Jesse Geneson, Suchir Kaustav, Shen-Fu Tsai
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
On cop-win dynamic graphs
Gabriel Fortin-Leblanc, Geňa Hahn, Frank Ramamonjisoa
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Preface: CALDAM 2016
Sathish Govindarajan, Anil Maheshwari
2020· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Sub-trees of a random tree
Bogumił Kamiński, Paweł Prałat
2019· preprint· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Preface: CALDAM 2015
Šumit Ganguly, Ramesh Krishnamurti
2017· article· en· Discrete Applied Mathematics· Social Sciences
distilled prediction:candidate · stsconsensus · none
0
citations
afffundno abstractunlabeled
Addressing graph products and distance-regular graphs
Sebastian M. Cioabă, Randall J. Elzinga, Michelle Markiewitz, Kevin N. Vander Meulen, Trevor Vanderwoerd
2017· preprint· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Hamiltonicity of covering graphs of trees
Peter Bradshaw, Zhilin Ge, Ladislav Stacho
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
afffundunlabeled
Firefighting with a distance-based restriction
Andrea C. Burgess, John Marcoux, David A. Pike
2025· article· en· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
Induced forests in some distance-regular graphs
Karen Gunderson, Karen Meagher, Joy Morris, Venkata Raghu Tej Pantangi
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Fun with algorithms
Elena Lodi, Linda Pagli, Nicola Santoro
2004· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
affunlabeled
Metric spaces in which many triangles are degenerate
Vašek Chvátal, Noé de Rancourt, Guillermo Gamboa Quintero, Ida Kantor, Péter G. N. Szabó
2024· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
0
citations
affno abstractunlabeled
Editorial
Karl F. Doerner, Pierre Hansen, Vittorio Maniezzo, Stefan Voß
2013· editorial· es· Discrete Applied Mathematics
distilled prediction:candidate · metaepi_narrow+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity+insufficient_payload
0
citations
affno abstractunlabeled
The even adjacency split problem for graphs
Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J.B. Stehman
2000· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
0
citations
← previousnext →

How this was built: Screen · Findings · About