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 1 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
Approximate Entropy Reducts
Dominik Ślȩzak
2002· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
272
citations
affunlabeled
Game-Theoretic Rough Sets
Joseph P. Herbert, JingTao Yao
2011· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
235
citations
affunlabeled
Self-Indexed Grammar-Based Compression
Francisco Claude, Gonzalo Navarro
2011· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
96
citations
affunlabeled
A Doctrine of Cognitive Informatics (CI)
Yingxu Wang, Witold Kinsner, James A. Anderson, Du Zhang, Yiyu Yao, Phillip C.‐Y. Sheu +6 more
2009· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
95
citations
affunlabeled
Calculi of Approximation Spaces
Andrzej Skowron, Jarosław Stepaniuk, James F. Peters, Roman W. Świniarski
2006· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
59
citations
affunlabeled
Complexity of Searching for a Black Hole
Jurek Czyzowicz, Dariusz R. Kowalski, Ευριπίδης Μάρκου, Andrzej Pelc
2006· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
58
citations
affunlabeled
Towards an Ontology of Approximate Reason
James F. Peters, Andrzej Skowron, Jarosław Stepaniuk, Sheela Ramanna
2002· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affunlabeled
Pairwise Comparisons Based Non-Numerical Ranking
Ryszard Janicki
2009· article· en· Fundamenta Informaticae· Decision Sciences
distilled prediction:candidate · metaepi_narrow+scholarly_communication+insufficient_payloadconsensus · insufficient_payload
23
citations
affunlabeled
A Formal Language Analysis of DNA Hairpin Structures
Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosı́k, G. Thierrin
2006· article· en· Fundamenta Informaticae· Biochemistry, Genetics and Molecular Biology
distilled prediction:candidate · noneconsensus · none
23
citations
affunlabeled
K-Comma Codes and Their Generalizations
Bo Cui, Lila Kari, Shinnosuke Seki
2011· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Transition Complexity of Incomplete DFAs
Yuan Gao, Kai Salomaa, Sheng Yü
2011· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Sensor, Filter, and Fusion Models with Rough Petri Nets
James F. Peters, Sheela Ramanna, Maciej Borkowski, Andrzej Skowron, Zbigniew Suraj
2001· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affunlabeled
Correlating Fuzzy and Rough Clustering
Manish Joshi, Pawan Lingras, C. Raghavendra Rao
2012· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Semi-supervised Rough Cost/Benefit Decisions
Pawan Lingras, Min Chen, Duoqian Miao
2009· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
14
citations
affunlabeled
Discrete Duality for Rough Relation Algebras
Ivo Düntsch, Ewa Orłowska
2013· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
13
citations
affunlabeled
Characterising Concurrent Histories
Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Łukasz Mikulski
2015· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
12
citations
affunlabeled
Preferential Regular Path Queries
Gösta Grahne, Alex Thomo, William W. Wadge
2008· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
12
citations
affunlabeled
Radial View of Continuous Cellular Automata
Paola Flocchini, Vladimir Cezar
2008· article· en· Fundamenta Informaticae· Computer Science
distilled prediction:candidate · noneconsensus · none
11
citations

How this was built: Screen · Findings · About