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
Information Processing Letters
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.

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

Labels cover 0 of 82 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 82 of 82 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Cuckoo hashing: Further analysis
Luc Devroye, Pat Morin
2003· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
89
citations
afffundno abstractunlabeled
Stream VByte : Faster byte-oriented integer compression
Daniel Lemire, Nathan Kurz, Christoph Rupp
2017· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · scholarly_communicationconsensus · scholarly_communication
48
citations
affno abstractunlabeled
The state complexity of and
Narad Rampersad
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
How many oblivious robots can explore a line
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
2011· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Block-wise 2D kernel PCA/LDA for face recognition
Armin Eftekhari, Mohamad Forouzanfar, Hamid Abrishami Moghaddam, Javad Alirezaie
2010· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
A note on the Consecutive Ones Submatrix problem
Mohammad Taghi Hajiaghayi, Yashar Ganjali
2002· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
A note on the Markoff condition and central words
Amy Glen, Aaron Lauve, Franco Saliola
2007· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
29
citations
affno abstractunlabeled
A new tree inclusion algorithm
Yangjun Chen
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
23
citations
affno abstractunlabeled
Honeycomb toroidal graphs are Cayley graphs
Brian Alspach, Matthew Dean
2009· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
22
citations
afffundno abstractunlabeled
On the longest increasing subsequence of a circular list
Michael Albert, M. D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Palindromic rich words and run-length encodings
Chuan Guo, Jeffrey Shallit, Arseny M. Shur
2016· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
A flaw in the electronic commerce protocol SET
Srečko Brlek, Sardaouna Hamadou, John Mullins
2005· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Signature files and signature trees
Yangjun Chen
2002· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Dynamic Shannon coding
Travis Gagie
2006· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
Pattern expressions and pattern automata
Cezar Câmpeanu, Sheng Yü
2004· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affno abstractunlabeled
On planar path transformation
Selim G. Akl, Md. Kamrul Islam, Henk Meijer
2007· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
An algorithm for computing simple k-factors
Henk Meijer, Yurai Núñez-Rodríguez, David Rappaport
2009· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Polynomial time quantum computation with advice
Harumichi Nishimura, Tomoyuki Yamakami
2004· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Upper signed k-domination in a general graph
Dejan Delić, Changping Wang
2010· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
On enumeration of catastrophic fault patterns
Soumen Maity, Bimal Roy, Amiya Nayak
2002· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Developing fault-tolerant distributed loops
Abdel Aziz Farrag
2010· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
affno abstractunlabeled
Flying over a polyhedral terrain
Hamid Zarrabi-Zadeh
2007· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
afffundno abstractunlabeled
Optimal circle search despite the presence of faulty robots
Konstantinos Georgiou, Evangelos Kranakis, Nikos Leonardos, Aris Pagourtzis, Ioannis Papaioannou
2023· article· en· Information Processing Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
5
citations
next →

How this was built: Screen · Findings · About