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

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

Labels cover 0 of 32 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 32 of 32 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
Compressed Representations of Graphs
J. Ian Munro, Patrick K. Nicholson
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Edit Distance Under Block Operations
Süleyman Cenk Şahinalp
2008· article· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Fully Dynamic Transitive Closure
Valerie King
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
4
citations
affno abstractunlabeled
Fully Dynamic Transitive Closure
Valerie King
2008· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Geometric Spanners
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
3
citations
affno abstractunlabeled
Applications of Geometric Spanner Networks
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Closest String and Substring Problems
Lusheng Wang, Ming Li, Bin Ma
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Nearest Neighbor Interchange and Related Distances
Bhaskar DasGupta, Xin He, Ming Li, John Tromp, Louxin Zhang
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
2
citations
affno abstractunlabeled
Regular Expression Matching
Lucian Ilie
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Transactional Memory
Nir Shavit, Alexander Matveev
2015· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Quantum Analogues of Markov Chains
Ashwin Nayak, Peter C. Richter, Márió Szegedy
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Intersections of Inverted Lists
Andrew W. Kane, Alejandro López-Ortíz
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
1
citations
affno abstractunlabeled
Substring Parsimony
Mathieu Blanchette
2008· book-chapter· en· Encyclopedia of Algorithms· Agricultural and Biological Sciences
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Broadcasting in Geometric Radio Networks
Andrzej Pelc
2015· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Planar Geometric Spanners
Joachim Gudmundsson, Giri Narasimhan, Michiel Smid
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Inductive Inference
Sandra Zilles
2008· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Peptide De Novo Sequencing with MS/MS
Bin Ma
2016· book-chapter· en· Encyclopedia of Algorithms· Chemistry
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Closest String and Substring Problems
Lusheng Wang, Ming Li, Bin Ma
2016· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Intersections of Inverted Lists
Andrew W. Kane, Alejandro López-Ortíz
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Circuit Placement
Andrew Kennings, Igor L. Markov
2008· book-chapter· en· Encyclopedia of Algorithms· Engineering
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Compressed Representations of Graphs
J. Ian Munro, Patrick K. Nicholson
2014· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Fully Dynamic Connectivity
Valerie King
2015· book-chapter· en· Encyclopedia of Algorithms· Physics and Astronomy
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Snapshots in Shared Memory
Eric Ruppert
2008· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations
affno abstractunlabeled
Teleportation of Quantum States
Rahul Jain
2008· book-chapter· en· Encyclopedia of Algorithms· Computer Science
machine prediction:candidate · noneconsensus · none
0
citations

How this was built: Screen · Findings · About