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
Topic
Optimization and Search Problems
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.

892 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.
892 works in the cohort · of 4,299,418page 3 of 18

Labels cover 0 of 892 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 892 of 892 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 the relative dominance of paging algorithms
Reza Dorrigiv, Alejandro López-Ortíz, J. Ian Munro
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Emergency path restoration problems
Igor Averbakh
2012· article· en· Discrete Optimization· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
afffundno abstractunlabeled
Distributed exploration of dynamic rings
Giuseppe Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro
2018· article· en· Distributed Computing· Computer Science
machine prediction:candidate · noneconsensus · none
34
citations
affno abstractunlabeled
DINS, a MIP Improvement Heuristic
Shubhashis Ghosh
2007· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affunlabeled
Search on a Line with Faulty Robots
Jurek Czyzowicz, Evangelos Kranakis, Danny Kriz̧anc, Lata Narayanan, Jaroslav Opatrný
2016· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
33
citations
affno abstractunlabeled
Real-Time Decision Making for Large POMDPs
Sébastien Paquet, Ludovic Tobin, Brahim Chaib-draa
2005· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affno abstractunlabeled
Competitive algorithms for unbounded one-way trading
Francis Y. L. Chin, Bin Fu, Jiu-ling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang +5 more
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
aboutno affno abstractunlabeled
The Covering Canadian Traveller Problem
Chung-Shou Liao, Yamming Huang
2014· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
affno abstractunlabeled
Exploring an unknown dangerous graph using tokens
Stefan Dobrev, Paola Flocchini, Rastislav Kráľovič, Nicola Santoro
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
29
citations
affunlabeled
Live Exploration of Dynamic Rings
Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini, Nicola Santoro
2016· article· en· IRIS Research product catalog (Sapienza University of Rome)· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Efficient topological exploration
Ioannis Rekleitis, Vida Dujmović, Gregory Dudek
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affno abstractunlabeled
Secretary Problems via Linear Programming
Niv Buchbinder, Kamal Jain, Mohit Singh
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Synchronous Rendezvous for Location-Aware Agents
Andrew Collins, Jurek Czyzowicz, Leszek Gąsieniec, Adrian Kosowski, Russell Martin
2011· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Graph Exploration by a Finite Automaton
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations
affno abstractunlabeled
Deterministic M2M multicast in radio networks
Leszek Gąsieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Line recovery by programmable particles
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta
2018· article· en· CINECA IRIS Institutial research information system (University of Pisa)· Computer Science
machine prediction:candidate · noneconsensus · none
25
citations
aboutno affno abstractunlabeled
Complexity of Canadian traveler problem variants
Dror Fried, Solomon Eyal Shimony, Amit Benbassat, Cenny Wenner
2013· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Tree Exploration with an Oracle
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
On learning in agent-centered search
Nathan Sturtevant, Vadim Bulitko, Yngvi Björnsson
2010· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations
affunlabeled
Paging for multi-core shared caches
Alejandro López-Ortíz, Alejandro Salinger
2012· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
24
citations

How this was built: Screen · Findings · About