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

afffundno abstractunlabeled
On edge-sets of bicliques in graphs
Marina Groshaus, Pavol Hell, Juraj Stacho
2012· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Excluding cycles with a fixed number of chords
Pierre Aboulker, Nicolás Bousquet
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml16" display="inline" overflow="scroll" altimg="si16.gif"><mml:mi>k</mml:mi></mml:math>-broadcast domination and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml17" display="inline" overflow="scroll" altimg="si16.gif"><mml:mi>k</mml:mi></mml:math>-multipacking
Michael A. Henning, Gary MacGillivray, Frank Yang
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+research_integrity
5
citations
affno abstractunlabeled
Diametral broadcast graphs
Hayk Grigoryan, Hovhannes A. Harutyunyan
2014· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Comparing the metric and strong dimensions of graphs
Gaia Moravcik, Ortrud R. Oellermann, Samuel Yusim
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
fundno affno abstractunlabeled
On the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e20" altimg="si30.svg"> <mml:msub> <mml:mrow> <mml:mi>P</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msub> </mml:math> -hull number of Hamming graphs
Boštjan Brešar, Mario Valencia-Pabon
2019· article· lv· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · research_integrity+insufficient_payload
5
citations
affno abstractunlabeled
Efficient broadcast trees for weighted vertices
Hovhannes A. Harutyunyan, Shahin Kamali
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
The resolution complexity of random graph k-colorability
Paul Beame, Joseph Culberson, David G. M. Mitchell, Cristopher Moore
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Distance Laplacian spectra of graphs: A survey
Bilal Ahmad Rather, Mustapha Aouchiche
2024· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On the complexity of the shortest-path broadcast problem
Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina +1 more
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Parameterized algorithms for the Happy Set problem
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
2021· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Global cycle properties of locally isometric graphs
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
2016· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Proximity and remoteness in graphs: A survey
Mustapha Aouchiche, Bilal Ahmad Rather
2024· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Existence of directedwhist tournaments with the three person property <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>3</mml:mn><mml:mtext>PDWh</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
F.E. Bennett, Gennian Ge
2006· article· lv· Discrete Applied Mathematics· Engineering
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communication+research_integrity+insufficient_payloadconsensus · metaepi_narrow+insufficient_payload
4
citations
afffundno abstractunlabeled
Generating functions for inscribed polyominoes
Alain Goupil, Hugo Cloutier, Marie-Eve Pellerin
2012· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · metaepi_narrowconsensus · none
4
citations
afffundno abstractunlabeled
Ferrers dimension of grid intersection graphs
Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Graph clustering with Boltzmann machines
Pierre Miasnikof, Mohammad Bagherbeik, Ali Sheikholeslami
2023· article· en· Discrete Applied Mathematics· Physics and Astronomy
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
A note on 3D orthogonal graph drawing
Thérèse Biedl, Timothy M. Chan
2005· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Tree-width of graphs without a 3×3 grid minor
Étienne Birmelé, J. A. Bondy, Bruce A. Reed
2008· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Algorithmic enumeration of surrounding polygons
Katsuhisa Yamanaka, David Avis, Takashi Horiyama, Yoshio Okamoto, Ryuhei Uehara, Tanami Yamauchi
2020· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
The shape of node reliability
Jason I. Brown, Lucas Mol
2018· article· en· Discrete Applied Mathematics· Mathematics
distilled prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Improved bottleneck domination algorithms
Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
2006· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
Minimal obstructions to 2-polar cographs
Pavol Hell, César Hernández‐Cruz, Cláudia Linhares Sales
2018· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affunlabeled
Hamiltonian cycles in covering graphs of trees
Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho
2020· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On the binary solitaire cone
David Avis, Antoine Deza
2001· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
4
citations
affno abstractunlabeled
On the computational complexity of closest genome problems
Luís Cunha, Pedro Feijão, Vinícius F. dos Santos, Luis Antônio Brasil Kowada, Celina M.H. de Figueiredo
2019· article· en· Discrete Applied Mathematics· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
4
citations
afffundno abstractunlabeled
On the restricted homomorphism problem
Richard C. Brewster, Timothy Graves
2008· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
A note on the connected game coloring number
Peter Bradshaw
2023· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
afffundno abstractunlabeled
Odd gossiping
Guillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu
2016· article· en· Discrete Applied Mathematics· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Edge searching weighted graphs
Öznur Yaşar, Danny Dyer, David A. Pike, Margo Kondratieva
2009· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
A note on the Grundy number and graph products
Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger, Rebecca Milley, Richard J. Nowakowski
2015· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations

How this was built: Screen · Findings · About