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
Topic
Constraint Satisfaction and Optimization
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.

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

Labels cover 0 of 698 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 698 of 698 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.

affunlabeled
Using Alternative Suboptimality Bounds in Heuristic Search
Richard Valenzano, Shahab Jabbari Arfaee, Jordan Thayer, Roni Stern, Nathan Sturtevant
2013· article· en· Proceedings of the International Conference on Automated Planning and Scheduling· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affno abstractunlabeled
Managing dynamic CSPs with preferences
Malek Mouhoub, Amrudee Sukpan
2012· article· en· Applied Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
fundvenueno affunlabeled
Range Categories I: General Theory
J.R.B. Cockett, Xiuzhan Guo, Pieter Hofstra
2012· article· en· Theory and applications of categories· Computer Science
machine prediction:candidate · noneconsensus · none
21
citations
affunlabeled
Algorithms for the Satisfiability Problem
Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah
2018· book· en· Experimental Dermatology· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affunlabeled
Nogood processing in csps
George Katsirelos
2008· dissertation· en· TSpace· Computer Science
machine prediction:candidate · noneconsensus · none
20
citations
affno abstractunlabeled
Parallel Discrepancy-Based Search
Thierry Moisan, Jonathan Gaudreault, Claude-Guy Quimper
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
New Approaches to Constraint Acquisition
Christian Bessière, Abderrazak Daoudi, Emmanuel Hébrard, George Katsirelos, Nadjib Lazaar, Younes Mechqrane +3 more
2016· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Weak Contact Structures
Ivo Düntsch, Michael Winter
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
18
citations
afffundunlabeled
Predicting Satisfiability at the Phase Transition
Lin Xu, Holger H. Hoos, Kevin Leyton‐Brown
2021· article· en· Proceedings of the AAAI Conference on Artificial Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
17
citations
affunlabeled
Graphs of relational structures
Andreĭ A. Bulatov
2016· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affunlabeled
The Local Lemma is Tight for SAT
Heidi Gebauer, Tibor Szabó, Gábor Tardos
2011· preprint· en· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
A Hybrid Schema for Systematic Local Search
William S. Havens, Bistra Dilkina
2004· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Conditional and composite temporal CSPs
Malek Mouhoub, Amrudee Sukpan
2010· article· en· Applied Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
15
citations
← previousnext →

How this was built: Screen · Findings · About