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
Fundamenta Informaticae
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.

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

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

affunlabeled
Optimization in Discovery of Compound Granules
Andrzej Jankowski, James F. Peters, Andrzej Skowron, Jarosław Stepaniuk
2008· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations
affunlabeled
Fuzzification of Rational and Recognizable Sets
Stavros Konstantinidis, Nicolae Sântean, Sheng Yü
2007· article· en· Fundamenta Informaticae· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · none
11
citations
affunlabeled
Trajectory-Based Embedding Relations
Michael Domaratzki
2004· article· en· Fundamenta Informaticae· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
9
citations
affunlabeled
Rough Relation Algebras Revisited
Ivo Düntsch, Michael Winter
2006· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
9
citations
affunlabeled
Intercode Regular Languages
Yo-Sub Han, Kai Salomaa, Derick Wood
2007· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
8
citations
affunlabeled
Optimization in Discovery of Compound Granules
Andrzej Jankowski, James F. Peters, Andrzej Skowron, Jarosław Stepaniuk
2008· article· en· Fundamenta Informaticae· Chemistry
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Interpreted Trajectories
Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa
2006· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
afffundunlabeled
String Covering: A Survey
Neerja Mhaskar, W.F. Smyth
2023· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affunlabeled
Results on Transforming NFA into DFCA
Cezar Câmpeanu, Lila Kari, Andrei Păun
2004· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affunlabeled
One-Visit Caterpillar Tree Automata
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
2002· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
5
citations
affunlabeled
Toward a General Framework for Polyphonic Comparison
Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos, Matthias Robine
2009· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Gathering over Meeting Nodes in Infinite Grid*
Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya
2022· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
4
citations
affunlabeled
Efficacy Analysis of Ratios from Pairwise Comparisons
William C. Wedley, Eng Ung Choo, Diederik J. D. Wijnmalen
2016· article· en· Fundamenta Informaticae· Decision Sciences
distilled prediction:candidate · insufficient_payloadconsensus · insufficient_payload
3
citations
affunlabeled
Anatomy of the Chase
Gösta Grahne, Adrian Onet
2018· preprint· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
3
citations
affunlabeled
Towards a Pragmatic Mereology
Ryszard Janicki, Dai Le
2007· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
3
citations
affunlabeled
Insertions Yielding Equivalent Double Occurrence Words
Daniel A. Cruz, Margherita Maria Ferrari, Nataša Jonoska, Lukas Nabergall, Masahico Saito
2019· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
2
citations

How this was built: Screen · Findings · About