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
Theoretical Computer Science
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.

797 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.
797 works in the cohort · of 4,299,418page 1 of 16

Labels cover 0 of 797 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 797 of 797 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
Data exchange: semantics and query answering
Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
1,203
citations
affno abstractunlabeled
Extended capabilities for visual cryptography
Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
436
citations
affno abstractunlabeled
Power consumption in packet radio networks
Lefteris M. Kirousis, Evangelos Kranakis, Danny Kriz̧anc, Andrzej Pelc
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
424
citations
affno abstractunlabeled
Metrics for labelled Markov processes
Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
309
citations
affno abstractunlabeled
On the complexity of reconfiguration problems
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara +1 more
2010· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
258
citations
affno abstractunlabeled
The ring of k-regular sequences, II
Jean‐Paul Allouche, Jeffrey Shallit
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
227
citations
affno abstractunlabeled
The complexity of partition functions
Andreĭ A. Bulatov, Martin Grohe
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
188
citations
affno abstractunlabeled
Graph exploration by a finite automaton
Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
176
citations
affno abstractunlabeled
Asynchronous deterministic rendezvous in graphs
Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Kriz̧anc, Andrzej Pelc, Ugo Vaccaro
2006· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
162
citations
afffundno abstractunlabeled
Autonomous mobile robots with lights
Shantanu Das, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Masafumi Yamashita
2015· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
145
citations
affno abstractunlabeled
Scalar aggregation in inconsistent databases
Marcelo Arenas, Leopoldo Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy Spinrad
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
144
citations
affno abstractunlabeled
Gathering few fat mobile robots in the plane
Jurek Czyzowicz, Leszek Gąsieniec, Andrzej Pelc
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
141
citations
affno abstractunlabeled
On the similarity metric and the distance metric
Shihyen Chen, Bin Ma, Kaizhong Zhang
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
126
citations
affno abstractunlabeled
Parallelizing quantum circuits
Anne Broadbent, Elham Kashefi
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
118
citations
affno abstractunlabeled
Frozen development in graph coloring
Joseph Culberson, Ian P. Gent
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
117
citations
fundno affno abstractunlabeled
Palindrome complexity
Jean‐Paul Allouche, Michael Baake, Julien Cassaigne, David Damanik
2003· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
116
citations
affno abstractunlabeled
Quantum computing without entanglement
Eli Biham, Gilles Brassard, Dan Kenigsberg, Tal Mor
2004· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
109
citations
affno abstractunlabeled
Scheduling in the dark
Jeff Edmonds
2000· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
104
citations
afffundno abstractunlabeled
Strand design for biomolecular computation
Arwen Brenneman, Anne Condon
2002· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
101
citations
affno abstractunlabeled
Classifying RNA pseudoknotted structures
Anne Condon, B. Davy, Baharak Rastegari, Shelly Zhao, Finbarr Tarrant
2004· article· en· Theoretical Computer Science· Biochemistry, Genetics and Molecular Biology
machine prediction:candidate · noneconsensus · none
90
citations
affno abstractunlabeled
State complexity of combined operations
Arto Salomaa, Kai Salomaa, Sheng Yü
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
88
citations
affno abstractunlabeled
Self-deployment of mobile sensors on a ring
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2008· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
88
citations
affno abstractunlabeled
Map construction of unknown graphs by multiple agents
Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, Nicola Santoro
2007· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
affno abstractunlabeled
Rigorous results for random (2+p)-SAT
Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Kriz̧anc
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
83
citations
affno abstractunlabeled
H-Coloring dichotomy revisited
Andreĭ A. Bulatov
2005· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
82
citations
affno abstractunlabeled
On the exploration of time-varying networks
Paola Flocchini, Bernard Mans, Nicola Santoro
2012· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
77
citations
afffundno abstractunlabeled
Minimal cover-automata for finite languages
Cezar Câmpeanu, Nicolae Sântean, S. Yu
2001· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
76
citations

How this was built: Screen · Findings · About