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
Journal of Discrete Algorithms
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.

97 results · 1 filter active ·
Results by year
20032018
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.
97 works in the cohort · of 4,299,418page 2 of 2

Labels cover 1 of 97 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 97 of 97 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.

afffundno abstractunlabeled
Exploring the median of permutations problem
Robin Milosz, Sylvie Hamel
2018· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Optimizing a constrained convex polygonal annulus
Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich
2004· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Sigma-local graphs
Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel Smid
2008· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
On the structure of run-maximal strings
Andrew Baker, Antoine Deza, František Franěk
2011· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
String covering with optimal covers
Neerja Mhaskar, W.F. Smyth
2018· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Chains-into-bins processes
Tuğkan Batu, Petra Berenbrink, Colin Cooper
2011· article· en· Journal of Discrete Algorithms· Engineering
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Efficient chaining of seeds in ordered trees
Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard
2011· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Packing two disks into a polygonal environment
Prosenjit Bose, Pat Morin, Antoine Vigneron
2004· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
On a lemma of Crochemore and Rytter
Haoyue Bai, Antoine Deza, František Franěk
2015· article· de· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
afffundno abstractunlabeled
Two-pattern strings I—A recognition algorithm
František Franěk, Weilin Lu, W.F. Smyth
2003· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
A prefix array for parameterized strings
Richard Beal, Donald Adjeroh, W.F. Smyth
2016· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
Folding a paper strip to minimize thickness
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara +1 more
2015· article· en· Journal of Discrete Algorithms· Engineering
machine prediction:candidate · noneconsensus · none
2
citations
afffundno abstractunlabeled
String shuffle: Circuits and graphs
Neerja Mhaskar, Michael Soltys
2015· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
On the Ehrenfeucht–Mycielski sequence
Grzegorz Herman, Michael Soltys
2009· article· pl· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Editorial
Rakesh Bharati, W.F. Smyth
2015· editorial· es· Journal of Discrete Algorithms
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Editorial
Costas S. Iliopoulos, W.F. Smyth
2012· editorial· es· Journal of Discrete Algorithms
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Editorial
Costas S. Iliopoulos, W.F. Smyth
2012· editorial· es· Journal of Discrete Algorithms
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Editorial
Raffaele Giancarlo, David Sankoff
2004· editorial· es· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Ordered interval routing schemes
Mustaq Ahmed
2009· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Editorial
Jacqueline W. Daykin, Bill Smyth, Lynette van Zijl
2011· editorial· es· Journal of Discrete Algorithms
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Perspectives
Bill Smyth
2015· article· en· Journal of Discrete Algorithms
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Monomer-dimer tatami tilings of square regions
Alejandro Erickson, Mark Schurch
2012· preprint· en· Journal of Discrete Algorithms· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
afffundno abstractunlabeled
On the generalized Berge sorting conjecture
Antoine Deza, Feng Xie
2009· article· en· Journal of Discrete Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Editorial
Ljiljana Branković, Joe Ryan, W.F. Smyth
2018· editorial· es· Journal of Discrete Algorithms
machine prediction:candidate · insufficient_payloadconsensus · none
0
citations
affno abstractunlabeled
Editorial
S. Arumugam, W.F. Smyth
2013· editorial· es· Journal of Discrete Algorithms
machine prediction:candidate · noneconsensus · none
0
citations
← previous

How this was built: Screen · Findings · About